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

About the Execution of Marcie+red for PolyORBLF-COL-S02J06T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6182.195 3600000.00 3656284.00 7945.80 ?F?F?TFTFF??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.r298-tall-167873951600385.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 PolyORBLF-COL-S02J06T10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951600385
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.0K Feb 26 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 13:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 13:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K Mar 5 18:23 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 PolyORBLF-COL-S02J06T10-CTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679529043975

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 23:50:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 23:50:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 23:50:45] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 23:50:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 23:50:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 711 ms
[2023-03-22 23:50:46] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
[2023-03-22 23:50:46] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2023-03-22 23:50:46] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 4 resets, run finished after 509 ms. (steps per millisecond=19 ) properties (out of 76) seen :16
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 60) seen :0
Running SMT prover for 60 properties.
[2023-03-22 23:50:47] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-22 23:50:47] [INFO ] Computed 26 place invariants in 12 ms
[2023-03-22 23:50:48] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 23:50:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 23:50:48] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:59
[2023-03-22 23:50:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 23:50:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:50:48] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :57 sat :3
[2023-03-22 23:50:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:50:48] [INFO ] After 31ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :57 sat :3
[2023-03-22 23:50:48] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 3 ms to minimize.
[2023-03-22 23:50:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 23:50:48] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :58 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-22 23:50:48] [INFO ] After 438ms SMT Verify possible using all constraints in natural domain returned unsat :58 sat :2
Fused 60 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 41 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
[2023-03-22 23:50:48] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2023-03-22 23:50:48] [INFO ] Computed 25 place invariants in 5 ms
[2023-03-22 23:50:48] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 2 transitions.
Found 2 dead transitions using SMT.
Drop transitions removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/81 places, 43/65 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 39
Applied a total of 4 rules in 5 ms. Remains 56 /60 variables (removed 4) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 104 ms. Remains : 56/81 places, 39/65 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21737 steps, run visited all 2 properties in 74 ms. (steps per millisecond=293 )
Probabilistic random walk after 21737 steps, saw 10721 distinct states, run finished after 74 ms. (steps per millisecond=293 ) properties seen :2
Successfully simplified 58 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 23:50:48] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2023-03-22 23:50:48] [INFO ] Flatten gal took : 29 ms
[2023-03-22 23:50:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 23:50:48] [INFO ] Flatten gal took : 8 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2023-03-22 23:50:49] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 32 ms.
[2023-03-22 23:50:49] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 245 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Applied a total of 2 rules in 45 ms. Remains 842 /844 variables (removed 2) and now considering 1652/1652 (removed 0) transitions.
[2023-03-22 23:50:49] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 842 cols
[2023-03-22 23:50:49] [INFO ] Computed 56 place invariants in 82 ms
[2023-03-22 23:50:49] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
[2023-03-22 23:50:49] [INFO ] Flow matrix only has 1522 transitions (discarded 20 similar events)
// Phase 1: matrix 1522 rows 842 cols
[2023-03-22 23:50:49] [INFO ] Computed 56 place invariants in 39 ms
[2023-03-22 23:50:50] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-22 23:50:50] [INFO ] Flow matrix only has 1522 transitions (discarded 20 similar events)
[2023-03-22 23:50:50] [INFO ] Invariant cache hit.
[2023-03-22 23:50:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 23:50:52] [INFO ] Implicit Places using invariants and state equation in 2513 ms returned []
Implicit Place search using SMT with State Equation took 2980 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 842/844 places, 1542/1652 transitions.
Reduce places removed 0 places and 20 transitions.
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 10 places and 20 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 832 transition count 1502
Deduced a syphon composed of 12 places in 3 ms
Applied a total of 10 rules in 43 ms. Remains 832 /842 variables (removed 10) and now considering 1502/1542 (removed 40) transitions.
[2023-03-22 23:50:52] [INFO ] Flow matrix only has 1482 transitions (discarded 20 similar events)
// Phase 1: matrix 1482 rows 832 cols
[2023-03-22 23:50:52] [INFO ] Computed 68 place invariants in 42 ms
[2023-03-22 23:50:53] [INFO ] Implicit Places using invariants in 454 ms returned []
[2023-03-22 23:50:53] [INFO ] Flow matrix only has 1482 transitions (discarded 20 similar events)
[2023-03-22 23:50:53] [INFO ] Invariant cache hit.
[2023-03-22 23:50:53] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 23:50:56] [INFO ] Implicit Places using invariants and state equation in 2867 ms returned []
Implicit Place search using SMT with State Equation took 3328 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 832/844 places, 1502/1652 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7171 ms. Remains : 832/844 places, 1502/1652 transitions.
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Support contains 223 out of 820 places after structural reductions.
[2023-03-22 23:50:56] [INFO ] Flatten gal took : 116 ms
[2023-03-22 23:50:56] [INFO ] Flatten gal took : 95 ms
[2023-03-22 23:50:56] [INFO ] Input system was already deterministic with 1502 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 520 ms. (steps per millisecond=19 ) properties (out of 26) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-22 23:50:57] [INFO ] Flow matrix only has 1482 transitions (discarded 20 similar events)
// Phase 1: matrix 1482 rows 820 cols
[2023-03-22 23:50:57] [INFO ] Computed 56 place invariants in 20 ms
[2023-03-22 23:50:57] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 23:50:58] [INFO ] [Real]Absence check using 12 positive and 44 generalized place invariants in 35 ms returned sat
[2023-03-22 23:50:58] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:19
[2023-03-22 23:50:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-22 23:50:58] [INFO ] [Nat]Absence check using 12 positive and 44 generalized place invariants in 31 ms returned sat
[2023-03-22 23:51:01] [INFO ] After 3323ms SMT Verify possible using state equation in natural domain returned unsat :17 sat :3
[2023-03-22 23:51:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 23:51:06] [INFO ] After 4276ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :17 sat :3
[2023-03-22 23:51:06] [INFO ] Deduced a trap composed of 475 places in 316 ms of which 1 ms to minimize.
[2023-03-22 23:51:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 619 ms
[2023-03-22 23:51:08] [INFO ] Deduced a trap composed of 72 places in 363 ms of which 1 ms to minimize.
[2023-03-22 23:51:08] [INFO ] Deduced a trap composed of 169 places in 321 ms of which 1 ms to minimize.
[2023-03-22 23:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1199 ms
[2023-03-22 23:51:11] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 1 ms to minimize.
[2023-03-22 23:51:11] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 1 ms to minimize.
[2023-03-22 23:51:11] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 1 ms to minimize.
[2023-03-22 23:51:11] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2023-03-22 23:51:13] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 0 ms to minimize.
[2023-03-22 23:51:13] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 0 ms to minimize.
[2023-03-22 23:51:15] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 0 ms to minimize.
[2023-03-22 23:51:15] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 0 ms to minimize.
[2023-03-22 23:51:15] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 0 ms to minimize.
[2023-03-22 23:51:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4937 ms
[2023-03-22 23:51:15] [INFO ] After 14163ms SMT Verify possible using trap constraints in natural domain returned unsat :18 sat :2
Attempting to minimize the solution found.
Minimization took 1885 ms.
[2023-03-22 23:51:17] [INFO ] After 19777ms SMT Verify possible using all constraints in natural domain returned unsat :18 sat :2
Fused 20 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 31 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 820 transition count 1412
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 730 transition count 1412
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 180 place count 730 transition count 1312
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 380 place count 630 transition count 1312
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 520 place count 560 transition count 1242
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 540 place count 560 transition count 1222
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 560 place count 540 transition count 1222
Applied a total of 560 rules in 167 ms. Remains 540 /820 variables (removed 280) and now considering 1222/1502 (removed 280) transitions.
[2023-03-22 23:51:17] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 540 cols
[2023-03-22 23:51:18] [INFO ] Computed 56 place invariants in 22 ms
[2023-03-22 23:51:18] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 713 ms. Remains : 540/820 places, 1222/1502 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 184926 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 184926 steps, saw 115033 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 23:51:21] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-22 23:51:21] [INFO ] Invariant cache hit.
[2023-03-22 23:51:21] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 23:51:21] [INFO ] [Real]Absence check using 14 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-22 23:51:23] [INFO ] After 1594ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 23:51:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-22 23:51:23] [INFO ] [Nat]Absence check using 14 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-22 23:51:25] [INFO ] After 2066ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 23:51:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 23:51:26] [INFO ] After 1341ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 23:51:27] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2023-03-22 23:51:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-03-22 23:51:27] [INFO ] After 1902ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 473 ms.
[2023-03-22 23:51:27] [INFO ] After 4573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 30 ms.
Support contains 31 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1222/1222 transitions.
Applied a total of 0 rules in 25 ms. Remains 540 /540 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 540/540 places, 1222/1222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1222/1222 transitions.
Applied a total of 0 rules in 29 ms. Remains 540 /540 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2023-03-22 23:51:28] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-22 23:51:28] [INFO ] Invariant cache hit.
[2023-03-22 23:51:28] [INFO ] Implicit Places using invariants in 457 ms returned []
[2023-03-22 23:51:28] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-22 23:51:28] [INFO ] Invariant cache hit.
[2023-03-22 23:51:28] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 23:51:36] [INFO ] Implicit Places using invariants and state equation in 7741 ms returned []
Implicit Place search using SMT with State Equation took 8200 ms to find 0 implicit places.
[2023-03-22 23:51:36] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-22 23:51:36] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-22 23:51:36] [INFO ] Invariant cache hit.
[2023-03-22 23:51:36] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8776 ms. Remains : 540/540 places, 1222/1222 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 540 transition count 1202
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 530 transition count 1242
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 1 with 40 rules applied. Total rules applied 80 place count 530 transition count 1202
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 90 place count 530 transition count 1192
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 100 place count 520 transition count 1192
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 2 with 22 rules applied. Total rules applied 122 place count 520 transition count 1170
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 144 place count 498 transition count 1170
Applied a total of 144 rules in 104 ms. Remains 498 /540 variables (removed 42) and now considering 1170/1222 (removed 52) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1170 rows 498 cols
[2023-03-22 23:51:36] [INFO ] Computed 56 place invariants in 29 ms
[2023-03-22 23:51:37] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-22 23:51:37] [INFO ] [Real]Absence check using 16 positive and 40 generalized place invariants in 19 ms returned sat
[2023-03-22 23:51:37] [INFO ] After 1035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 23:51:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-22 23:51:38] [INFO ] [Nat]Absence check using 16 positive and 40 generalized place invariants in 21 ms returned sat
[2023-03-22 23:51:39] [INFO ] After 1828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 23:51:40] [INFO ] Deduced a trap composed of 184 places in 198 ms of which 0 ms to minimize.
[2023-03-22 23:51:41] [INFO ] Deduced a trap composed of 222 places in 204 ms of which 0 ms to minimize.
[2023-03-22 23:51:41] [INFO ] Deduced a trap composed of 194 places in 211 ms of which 0 ms to minimize.
[2023-03-22 23:51:41] [INFO ] Deduced a trap composed of 204 places in 187 ms of which 0 ms to minimize.
[2023-03-22 23:51:41] [INFO ] Deduced a trap composed of 187 places in 193 ms of which 1 ms to minimize.
[2023-03-22 23:51:42] [INFO ] Deduced a trap composed of 228 places in 185 ms of which 0 ms to minimize.
[2023-03-22 23:51:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1602 ms
[2023-03-22 23:51:43] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2023-03-22 23:51:43] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2023-03-22 23:51:43] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2023-03-22 23:51:43] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
[2023-03-22 23:51:43] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2023-03-22 23:51:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 487 ms
[2023-03-22 23:51:43] [INFO ] After 5335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1420 ms.
[2023-03-22 23:51:44] [INFO ] After 6881ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 18 atomic propositions for a total of 6 simplifications.
[2023-03-22 23:51:44] [INFO ] Flatten gal took : 89 ms
[2023-03-22 23:51:45] [INFO ] Flatten gal took : 87 ms
[2023-03-22 23:51:45] [INFO ] Input system was already deterministic with 1502 transitions.
Support contains 95 out of 820 places (down from 106) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 820 transition count 1462
Reduce places removed 40 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 50 rules applied. Total rules applied 90 place count 780 transition count 1452
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 100 place count 770 transition count 1452
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 100 place count 770 transition count 1352
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 300 place count 670 transition count 1352
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 420 place count 610 transition count 1292
Applied a total of 420 rules in 100 ms. Remains 610 /820 variables (removed 210) and now considering 1292/1502 (removed 210) transitions.
[2023-03-22 23:51:45] [INFO ] Flow matrix only has 1272 transitions (discarded 20 similar events)
// Phase 1: matrix 1272 rows 610 cols
[2023-03-22 23:51:45] [INFO ] Computed 56 place invariants in 15 ms
[2023-03-22 23:51:46] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 755 ms. Remains : 610/820 places, 1292/1502 transitions.
[2023-03-22 23:51:46] [INFO ] Flatten gal took : 43 ms
[2023-03-22 23:51:46] [INFO ] Flatten gal took : 63 ms
[2023-03-22 23:51:46] [INFO ] Input system was already deterministic with 1292 transitions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 810 transition count 1492
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 810 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 800 transition count 1482
Applied a total of 40 rules in 71 ms. Remains 800 /820 variables (removed 20) and now considering 1482/1502 (removed 20) transitions.
[2023-03-22 23:51:46] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
// Phase 1: matrix 1462 rows 800 cols
[2023-03-22 23:51:46] [INFO ] Computed 56 place invariants in 21 ms
[2023-03-22 23:51:46] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 677 ms. Remains : 800/820 places, 1482/1502 transitions.
[2023-03-22 23:51:47] [INFO ] Flatten gal took : 46 ms
[2023-03-22 23:51:47] [INFO ] Flatten gal took : 49 ms
[2023-03-22 23:51:47] [INFO ] Input system was already deterministic with 1482 transitions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 810 transition count 1492
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 810 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 800 transition count 1482
Applied a total of 40 rules in 81 ms. Remains 800 /820 variables (removed 20) and now considering 1482/1502 (removed 20) transitions.
[2023-03-22 23:51:47] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 23:51:47] [INFO ] Invariant cache hit.
[2023-03-22 23:51:47] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 705 ms. Remains : 800/820 places, 1482/1502 transitions.
[2023-03-22 23:51:47] [INFO ] Flatten gal took : 49 ms
[2023-03-22 23:51:47] [INFO ] Flatten gal took : 51 ms
[2023-03-22 23:51:48] [INFO ] Input system was already deterministic with 1482 transitions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 810 transition count 1492
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 810 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 800 transition count 1482
Applied a total of 40 rules in 40 ms. Remains 800 /820 variables (removed 20) and now considering 1482/1502 (removed 20) transitions.
[2023-03-22 23:51:48] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 23:51:48] [INFO ] Invariant cache hit.
[2023-03-22 23:51:48] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 662 ms. Remains : 800/820 places, 1482/1502 transitions.
[2023-03-22 23:51:48] [INFO ] Flatten gal took : 54 ms
[2023-03-22 23:51:48] [INFO ] Flatten gal took : 57 ms
[2023-03-22 23:51:48] [INFO ] Input system was already deterministic with 1482 transitions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 810 transition count 1492
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 810 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 800 transition count 1482
Applied a total of 40 rules in 46 ms. Remains 800 /820 variables (removed 20) and now considering 1482/1502 (removed 20) transitions.
[2023-03-22 23:51:49] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 23:51:49] [INFO ] Invariant cache hit.
[2023-03-22 23:51:49] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 668 ms. Remains : 800/820 places, 1482/1502 transitions.
[2023-03-22 23:51:49] [INFO ] Flatten gal took : 43 ms
[2023-03-22 23:51:49] [INFO ] Flatten gal took : 47 ms
[2023-03-22 23:51:49] [INFO ] Input system was already deterministic with 1482 transitions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 810 transition count 1492
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 810 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 800 transition count 1482
Applied a total of 40 rules in 31 ms. Remains 800 /820 variables (removed 20) and now considering 1482/1502 (removed 20) transitions.
[2023-03-22 23:51:49] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 23:51:49] [INFO ] Invariant cache hit.
[2023-03-22 23:51:50] [INFO ] Dead Transitions using invariants and state equation in 1060 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1094 ms. Remains : 800/820 places, 1482/1502 transitions.
[2023-03-22 23:51:51] [INFO ] Flatten gal took : 40 ms
[2023-03-22 23:51:51] [INFO ] Flatten gal took : 43 ms
[2023-03-22 23:51:51] [INFO ] Input system was already deterministic with 1482 transitions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 810 transition count 1492
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 810 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 800 transition count 1482
Applied a total of 40 rules in 26 ms. Remains 800 /820 variables (removed 20) and now considering 1482/1502 (removed 20) transitions.
[2023-03-22 23:51:51] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 23:51:51] [INFO ] Invariant cache hit.
[2023-03-22 23:51:51] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 642 ms. Remains : 800/820 places, 1482/1502 transitions.
[2023-03-22 23:51:51] [INFO ] Flatten gal took : 43 ms
[2023-03-22 23:51:51] [INFO ] Flatten gal took : 54 ms
[2023-03-22 23:51:51] [INFO ] Input system was already deterministic with 1482 transitions.
[2023-03-22 23:51:52] [INFO ] Flatten gal took : 45 ms
[2023-03-22 23:51:52] [INFO ] Flatten gal took : 44 ms
[2023-03-22 23:51:52] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-22 23:51:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 820 places, 1502 transitions and 6390 arcs took 10 ms.
Total runtime 66715 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 820 NrTr: 1502 NrArc: 6390)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.107sec

net check time: 0m 0.003sec

init dd package: 0m 2.711sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9963152 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16094380 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 CTLCardinality -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 0.009sec

54123 127580 173773 212839 305029 508280 668596 726948 743101 777608 946785 1070103 1369052 1490420 1506464 1547288

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="PolyORBLF-COL-S02J06T10"
export BK_EXAMINATION="CTLCardinality"
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 PolyORBLF-COL-S02J06T10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tall-167873951600385"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T10.tgz
mv PolyORBLF-COL-S02J06T10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;