fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r234-tall-167856420400538
Last Updated
May 14, 2023

About the Execution of Marcie+red for LeafsetExtension-PT-S64C4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9538.096 3600000.00 3690348.00 8830.30 ?F??T??????????? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r234-tall-167856420400538.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is LeafsetExtension-PT-S64C4, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420400538
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Feb 25 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 25 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679529324986

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C4
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 23:55:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 23:55:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 23:55:27] [INFO ] Load time of PNML (sax parser for PT used): 464 ms
[2023-03-22 23:55:27] [INFO ] Transformed 21462 places.
[2023-03-22 23:55:27] [INFO ] Transformed 21129 transitions.
[2023-03-22 23:55:27] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 641 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Support contains 155 out of 21462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Reduce places removed 4229 places and 0 transitions.
Iterating post reduction 0 with 4229 rules applied. Total rules applied 4229 place count 17233 transition count 21129
Applied a total of 4229 rules in 293 ms. Remains 17233 /21462 variables (removed 4229) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2023-03-22 23:55:29] [INFO ] Computed 198 place invariants in 1831 ms
[2023-03-22 23:55:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 23:55:31] [INFO ] Implicit Places using invariants in 3848 ms returned []
Implicit Place search using SMT only with invariants took 3874 ms to find 0 implicit places.
[2023-03-22 23:55:31] [INFO ] Invariant cache hit.
[2023-03-22 23:55:33] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 23:55:33] [INFO ] Dead Transitions using invariants and state equation in 1702 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17233/21462 places, 21129/21129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5880 ms. Remains : 17233/21462 places, 21129/21129 transitions.
Support contains 155 out of 17233 places after structural reductions.
[2023-03-22 23:55:34] [INFO ] Flatten gal took : 1067 ms
[2023-03-22 23:55:35] [INFO ] Flatten gal took : 573 ms
[2023-03-22 23:55:36] [INFO ] Input system was already deterministic with 21129 transitions.
Incomplete random walk after 10000 steps, including 301 resets, run finished after 871 ms. (steps per millisecond=11 ) properties (out of 91) seen :39
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 49) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 48) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 46) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Running SMT prover for 40 properties.
[2023-03-22 23:55:37] [INFO ] Invariant cache hit.
[2023-03-22 23:55:48] [INFO ] [Real]Absence check using 0 positive and 198 generalized place invariants in 419 ms returned sat
[2023-03-22 23:56:02] [INFO ] After 25015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-22 23:56:12] [INFO ] [Nat]Absence check using 0 positive and 198 generalized place invariants in 381 ms returned sat
[2023-03-22 23:56:27] [INFO ] After 7759ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :39
[2023-03-22 23:56:27] [INFO ] After 7790ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :39
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 23:56:27] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :39
Fused 40 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 64 out of 17233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 38156 edges and 17233 vertex of which 2402 are kept as prefixes of interest. Removing 14831 places using SCC suffix rule.33 ms
Discarding 14831 places :
Also discarding 10985 output transitions
Drop transitions removed 10985 transitions
Drop transitions removed 3740 transitions
Reduce isomorphic transitions removed 3740 transitions.
Drop transitions removed 742 transitions
Trivial Post-agglo rules discarded 742 transitions
Performed 742 trivial Post agglomeration. Transition count delta: 742
Iterating post reduction 0 with 4482 rules applied. Total rules applied 4483 place count 2402 transition count 5662
Reduce places removed 744 places and 0 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 760 rules applied. Total rules applied 5243 place count 1658 transition count 5646
Reduce places removed 16 places and 0 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Iterating post reduction 2 with 63 rules applied. Total rules applied 5306 place count 1642 transition count 5599
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 3 with 47 rules applied. Total rules applied 5353 place count 1595 transition count 5599
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 5353 place count 1595 transition count 5575
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 5401 place count 1571 transition count 5575
Discarding 432 places :
Symmetric choice reduction at 4 with 432 rule applications. Total rules 5833 place count 1139 transition count 5143
Iterating global reduction 4 with 432 rules applied. Total rules applied 6265 place count 1139 transition count 5143
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 6273 place count 1139 transition count 5135
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 6281 place count 1131 transition count 5135
Partial Free-agglomeration rule applied 435 times.
Drop transitions removed 435 transitions
Iterating global reduction 5 with 435 rules applied. Total rules applied 6716 place count 1131 transition count 5135
Applied a total of 6716 rules in 1439 ms. Remains 1131 /17233 variables (removed 16102) and now considering 5135/21129 (removed 15994) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1440 ms. Remains : 1131/17233 places, 5135/21129 transitions.
Incomplete random walk after 10000 steps, including 742 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 40) seen :31
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-22 23:56:29] [INFO ] Flow matrix only has 1862 transitions (discarded 3273 similar events)
// Phase 1: matrix 1862 rows 1131 cols
[2023-03-22 23:56:29] [INFO ] Computed 14 place invariants in 16 ms
[2023-03-22 23:56:29] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 5 ms returned sat
[2023-03-22 23:56:31] [INFO ] After 916ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:1
[2023-03-22 23:56:31] [INFO ] After 1706ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :7 real:1
Attempting to minimize the solution found.
Minimization took 410 ms.
[2023-03-22 23:56:32] [INFO ] After 2481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :6 real:2
[2023-03-22 23:56:32] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-22 23:56:33] [INFO ] After 983ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 23:56:34] [INFO ] After 1869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 447 ms.
[2023-03-22 23:56:34] [INFO ] After 2738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 26 ms.
Support contains 26 out of 1131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1131/1131 places, 5135/5135 transitions.
Graph (complete) has 4336 edges and 1131 vertex of which 565 are kept as prefixes of interest. Removing 566 places using SCC suffix rule.1 ms
Discarding 566 places :
Also discarding 59 output transitions
Drop transitions removed 59 transitions
Drop transitions removed 491 transitions
Reduce isomorphic transitions removed 491 transitions.
Iterating post reduction 0 with 491 rules applied. Total rules applied 492 place count 565 transition count 4585
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 523 place count 534 transition count 4554
Iterating global reduction 1 with 31 rules applied. Total rules applied 554 place count 534 transition count 4554
Applied a total of 554 rules in 114 ms. Remains 534 /1131 variables (removed 597) and now considering 4554/5135 (removed 581) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 534/1131 places, 4554/5135 transitions.
Incomplete random walk after 10000 steps, including 740 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 23:56:35] [INFO ] Flow matrix only has 759 transitions (discarded 3795 similar events)
// Phase 1: matrix 759 rows 534 cols
[2023-03-22 23:56:35] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-22 23:56:35] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-22 23:56:36] [INFO ] After 359ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:1
[2023-03-22 23:56:36] [INFO ] After 605ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :5 real:1
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-22 23:56:36] [INFO ] After 941ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :5 real:1
[2023-03-22 23:56:36] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-22 23:56:36] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 23:56:37] [INFO ] After 584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-22 23:56:37] [INFO ] After 892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 10 ms.
Support contains 20 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 4554/4554 transitions.
Graph (complete) has 1895 edges and 534 vertex of which 462 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.0 ms
Discarding 72 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 462 transition count 4483
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 458 transition count 4479
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 458 transition count 4479
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 458 transition count 4479
Applied a total of 76 rules in 101 ms. Remains 458 /534 variables (removed 76) and now considering 4479/4554 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 458/534 places, 4479/4554 transitions.
Incomplete random walk after 10000 steps, including 744 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 71684 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71684 steps, saw 16038 distinct states, run finished after 3005 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-22 23:56:40] [INFO ] Flow matrix only has 616 transitions (discarded 3863 similar events)
// Phase 1: matrix 616 rows 458 cols
[2023-03-22 23:56:40] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-22 23:56:40] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-22 23:56:41] [INFO ] After 163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-22 23:56:41] [INFO ] After 201ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-22 23:56:41] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:5
[2023-03-22 23:56:41] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-22 23:56:41] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 23:56:41] [INFO ] After 472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-22 23:56:42] [INFO ] After 785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 6 ms.
Support contains 20 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 4479/4479 transitions.
Applied a total of 0 rules in 37 ms. Remains 458 /458 variables (removed 0) and now considering 4479/4479 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 458/458 places, 4479/4479 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 4479/4479 transitions.
Applied a total of 0 rules in 36 ms. Remains 458 /458 variables (removed 0) and now considering 4479/4479 (removed 0) transitions.
[2023-03-22 23:56:42] [INFO ] Flow matrix only has 616 transitions (discarded 3863 similar events)
[2023-03-22 23:56:42] [INFO ] Invariant cache hit.
[2023-03-22 23:56:42] [INFO ] Implicit Places using invariants in 396 ms returned [284]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 401 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 457/458 places, 4479/4479 transitions.
Applied a total of 0 rules in 37 ms. Remains 457 /457 variables (removed 0) and now considering 4479/4479 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 476 ms. Remains : 457/458 places, 4479/4479 transitions.
Incomplete random walk after 10000 steps, including 757 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 23:56:42] [INFO ] Flow matrix only has 616 transitions (discarded 3863 similar events)
// Phase 1: matrix 616 rows 457 cols
[2023-03-22 23:56:42] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-22 23:56:42] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-22 23:56:43] [INFO ] After 218ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-22 23:56:43] [INFO ] After 371ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-22 23:56:43] [INFO ] After 562ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 6 ms.
Support contains 14 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 4479/4479 transitions.
Graph (complete) has 1565 edges and 457 vertex of which 384 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.0 ms
Discarding 73 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 127 rules applied. Total rules applied 128 place count 383 transition count 4345
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 160 place count 382 transition count 4314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 381 transition count 4314
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 163 place count 379 transition count 4312
Iterating global reduction 3 with 2 rules applied. Total rules applied 165 place count 379 transition count 4312
Drop transitions removed 94 transitions
Redundant transition composition rules discarded 94 transitions
Iterating global reduction 3 with 94 rules applied. Total rules applied 259 place count 379 transition count 4218
Free-agglomeration rule applied 33 times.
Iterating global reduction 3 with 33 rules applied. Total rules applied 292 place count 379 transition count 4185
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 325 place count 346 transition count 4185
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 326 place count 346 transition count 4184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 327 place count 345 transition count 4184
Applied a total of 327 rules in 302 ms. Remains 345 /457 variables (removed 112) and now considering 4184/4479 (removed 295) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 345/457 places, 4184/4479 transitions.
Incomplete random walk after 10000 steps, including 860 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 23:56:43] [INFO ] Flow matrix only has 443 transitions (discarded 3741 similar events)
// Phase 1: matrix 443 rows 345 cols
[2023-03-22 23:56:43] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-22 23:56:43] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-22 23:56:44] [INFO ] After 128ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-22 23:56:44] [INFO ] After 196ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-22 23:56:44] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 4184/4184 transitions.
Graph (complete) has 1068 edges and 345 vertex of which 181 are kept as prefixes of interest. Removing 164 places using SCC suffix rule.1 ms
Discarding 164 places :
Also discarding 825 output transitions
Drop transitions removed 825 transitions
Drop transitions removed 2066 transitions
Reduce isomorphic transitions removed 2066 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2067 rules applied. Total rules applied 2068 place count 180 transition count 1293
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 2141 place count 176 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2142 place count 175 transition count 1223
Iterating global reduction 2 with 1 rules applied. Total rules applied 2143 place count 175 transition count 1223
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 2144 place count 175 transition count 1222
Free-agglomeration rule applied 65 times.
Iterating global reduction 2 with 65 rules applied. Total rules applied 2209 place count 175 transition count 1157
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 66 rules applied. Total rules applied 2275 place count 110 transition count 1156
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2276 place count 110 transition count 1155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2277 place count 109 transition count 1155
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2278 place count 109 transition count 1155
Applied a total of 2278 rules in 59 ms. Remains 109 /345 variables (removed 236) and now considering 1155/4184 (removed 3029) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 109/345 places, 1155/4184 transitions.
Incomplete random walk after 10000 steps, including 768 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :1
Finished Best-First random walk after 7202 steps, including 34 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1200 )
[2023-03-22 23:56:44] [INFO ] Flatten gal took : 455 ms
[2023-03-22 23:56:45] [INFO ] Flatten gal took : 497 ms
[2023-03-22 23:56:46] [INFO ] Input system was already deterministic with 21129 transitions.
Computed a total of 17233 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17233 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 3 formulas.
FORMULA LeafsetExtension-PT-S64C4-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C4-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 71 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 23:56:46] [INFO ] Flatten gal took : 437 ms
[2023-03-22 23:56:47] [INFO ] Flatten gal took : 491 ms
[2023-03-22 23:56:48] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.44 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8222 transitions
Trivial Post-agglo rules discarded 8222 transitions
Performed 8222 trivial Post agglomeration. Transition count delta: 8222
Iterating post reduction 0 with 8222 rules applied. Total rules applied 8223 place count 17231 transition count 12905
Reduce places removed 8222 places and 0 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 1 with 8318 rules applied. Total rules applied 16541 place count 9009 transition count 12809
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 16637 place count 8913 transition count 12809
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16637 place count 8913 transition count 12680
Deduced a syphon composed of 129 places in 3 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16895 place count 8784 transition count 12680
Discarding 4028 places :
Symmetric choice reduction at 3 with 4028 rule applications. Total rules 20923 place count 4756 transition count 8652
Iterating global reduction 3 with 4028 rules applied. Total rules applied 24951 place count 4756 transition count 8652
Applied a total of 24951 rules in 2850 ms. Remains 4756 /17233 variables (removed 12477) and now considering 8652/21129 (removed 12477) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2852 ms. Remains : 4756/17233 places, 8652/21129 transitions.
[2023-03-22 23:56:51] [INFO ] Flatten gal took : 196 ms
[2023-03-22 23:56:51] [INFO ] Flatten gal took : 222 ms
[2023-03-22 23:56:52] [INFO ] Input system was already deterministic with 8652 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8255 transitions
Trivial Post-agglo rules discarded 8255 transitions
Performed 8255 trivial Post agglomeration. Transition count delta: 8255
Iterating post reduction 0 with 8255 rules applied. Total rules applied 8256 place count 17231 transition count 12872
Reduce places removed 8255 places and 0 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16575 place count 8976 transition count 12808
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 16639 place count 8912 transition count 12808
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 16639 place count 8912 transition count 12678
Deduced a syphon composed of 130 places in 3 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 16899 place count 8782 transition count 12678
Discarding 4029 places :
Symmetric choice reduction at 3 with 4029 rule applications. Total rules 20928 place count 4753 transition count 8649
Iterating global reduction 3 with 4029 rules applied. Total rules applied 24957 place count 4753 transition count 8649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24957 place count 4753 transition count 8648
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24959 place count 4752 transition count 8648
Applied a total of 24959 rules in 2413 ms. Remains 4752 /17233 variables (removed 12481) and now considering 8648/21129 (removed 12481) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2416 ms. Remains : 4752/17233 places, 8648/21129 transitions.
[2023-03-22 23:56:54] [INFO ] Flatten gal took : 195 ms
[2023-03-22 23:56:54] [INFO ] Flatten gal took : 221 ms
[2023-03-22 23:56:55] [INFO ] Input system was already deterministic with 8648 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8319 transitions
Trivial Post-agglo rules discarded 8319 transitions
Performed 8319 trivial Post agglomeration. Transition count delta: 8319
Iterating post reduction 0 with 8319 rules applied. Total rules applied 8320 place count 17231 transition count 12808
Reduce places removed 8319 places and 0 transitions.
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16639 place count 8912 transition count 12808
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 16639 place count 8912 transition count 12678
Deduced a syphon composed of 130 places in 4 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 16899 place count 8782 transition count 12678
Discarding 4029 places :
Symmetric choice reduction at 2 with 4029 rule applications. Total rules 20928 place count 4753 transition count 8649
Iterating global reduction 2 with 4029 rules applied. Total rules applied 24957 place count 4753 transition count 8649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24957 place count 4753 transition count 8648
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24959 place count 4752 transition count 8648
Applied a total of 24959 rules in 2343 ms. Remains 4752 /17233 variables (removed 12481) and now considering 8648/21129 (removed 12481) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2346 ms. Remains : 4752/17233 places, 8648/21129 transitions.
[2023-03-22 23:56:57] [INFO ] Flatten gal took : 193 ms
[2023-03-22 23:56:58] [INFO ] Flatten gal took : 220 ms
[2023-03-22 23:56:58] [INFO ] Input system was already deterministic with 8648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 68 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 23:56:59] [INFO ] Flatten gal took : 445 ms
[2023-03-22 23:56:59] [INFO ] Flatten gal took : 496 ms
[2023-03-22 23:57:00] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 66 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 23:57:01] [INFO ] Flatten gal took : 474 ms
[2023-03-22 23:57:01] [INFO ] Flatten gal took : 483 ms
[2023-03-22 23:57:02] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 68 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 23:57:03] [INFO ] Flatten gal took : 440 ms
[2023-03-22 23:57:03] [INFO ] Flatten gal took : 484 ms
[2023-03-22 23:57:04] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 65 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 23:57:04] [INFO ] Flatten gal took : 432 ms
[2023-03-22 23:57:05] [INFO ] Flatten gal took : 482 ms
[2023-03-22 23:57:06] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 67 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 23:57:06] [INFO ] Flatten gal took : 438 ms
[2023-03-22 23:57:07] [INFO ] Flatten gal took : 484 ms
[2023-03-22 23:57:08] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8256 transitions
Trivial Post-agglo rules discarded 8256 transitions
Performed 8256 trivial Post agglomeration. Transition count delta: 8256
Iterating post reduction 0 with 8256 rules applied. Total rules applied 8257 place count 17231 transition count 12871
Reduce places removed 8256 places and 0 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 1 with 8320 rules applied. Total rules applied 16577 place count 8975 transition count 12807
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 16641 place count 8911 transition count 12807
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 16641 place count 8911 transition count 12677
Deduced a syphon composed of 130 places in 3 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 16901 place count 8781 transition count 12677
Discarding 4030 places :
Symmetric choice reduction at 3 with 4030 rule applications. Total rules 20931 place count 4751 transition count 8647
Iterating global reduction 3 with 4030 rules applied. Total rules applied 24961 place count 4751 transition count 8647
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 24961 place count 4751 transition count 8645
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24965 place count 4749 transition count 8645
Applied a total of 24965 rules in 2517 ms. Remains 4749 /17233 variables (removed 12484) and now considering 8645/21129 (removed 12484) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2520 ms. Remains : 4749/17233 places, 8645/21129 transitions.
[2023-03-22 23:57:10] [INFO ] Flatten gal took : 198 ms
[2023-03-22 23:57:11] [INFO ] Flatten gal took : 223 ms
[2023-03-22 23:57:11] [INFO ] Input system was already deterministic with 8645 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 66 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 23:57:12] [INFO ] Flatten gal took : 438 ms
[2023-03-22 23:57:12] [INFO ] Flatten gal took : 490 ms
[2023-03-22 23:57:13] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8187 transitions
Trivial Post-agglo rules discarded 8187 transitions
Performed 8187 trivial Post agglomeration. Transition count delta: 8187
Iterating post reduction 0 with 8187 rules applied. Total rules applied 8188 place count 17231 transition count 12940
Reduce places removed 8187 places and 0 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 1 with 8315 rules applied. Total rules applied 16503 place count 9044 transition count 12812
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 16631 place count 8916 transition count 12812
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16631 place count 8916 transition count 12683
Deduced a syphon composed of 129 places in 4 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16889 place count 8787 transition count 12683
Discarding 4028 places :
Symmetric choice reduction at 3 with 4028 rule applications. Total rules 20917 place count 4759 transition count 8655
Iterating global reduction 3 with 4028 rules applied. Total rules applied 24945 place count 4759 transition count 8655
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24945 place count 4759 transition count 8654
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24947 place count 4758 transition count 8654
Applied a total of 24947 rules in 2514 ms. Remains 4758 /17233 variables (removed 12475) and now considering 8654/21129 (removed 12475) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2515 ms. Remains : 4758/17233 places, 8654/21129 transitions.
[2023-03-22 23:57:16] [INFO ] Flatten gal took : 286 ms
[2023-03-22 23:57:16] [INFO ] Flatten gal took : 213 ms
[2023-03-22 23:57:16] [INFO ] Input system was already deterministic with 8654 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 65 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 23:57:17] [INFO ] Flatten gal took : 439 ms
[2023-03-22 23:57:17] [INFO ] Flatten gal took : 486 ms
[2023-03-22 23:57:19] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 65 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 23:57:19] [INFO ] Flatten gal took : 432 ms
[2023-03-22 23:57:20] [INFO ] Flatten gal took : 487 ms
[2023-03-22 23:57:20] [INFO ] Input system was already deterministic with 21129 transitions.
[2023-03-22 23:57:21] [INFO ] Flatten gal took : 473 ms
[2023-03-22 23:57:21] [INFO ] Flatten gal took : 487 ms
[2023-03-22 23:57:22] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-22 23:57:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 17233 places, 21129 transitions and 63509 arcs took 75 ms.
Total runtime 115604 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 17233 NrTr: 21129 NrArc: 63509)

parse formulas
formulas created successfully
place and transition orderings generation:0m39.868sec

net check time: 0m 0.012sec

init dd package: 0m 2.592sec


before gc: list nodes free: 1669991

after gc: idd nodes used:11314, unused:63988686; list nodes free:257870408

before gc: list nodes free: 1639696

after gc: idd nodes used:15999, unused:63984001; list nodes free:257837571
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6579404 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16065604 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 1.199sec

875252 1060968

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S64C4"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is LeafsetExtension-PT-S64C4, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420400538"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S64C4.tgz
mv LeafsetExtension-PT-S64C4 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;