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.r517-tall-167987243600267.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 itstools
Input is EisenbergMcGuire-PT-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243600267
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 2.3M Mar 31 16:48 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 EisenbergMcGuire-PT-09-LTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-09-LTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-09-LTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-09-LTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-09-LTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-09-LTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-09-LTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-09-LTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-09-LTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-09-LTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-09-LTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-09-LTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-09-LTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-09-LTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-09-LTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680834857693

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2023-04-07 02:34:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-07 02:34:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 02:34:19] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2023-04-07 02:34:19] [INFO ] Transformed 891 places.
[2023-04-07 02:34:19] [INFO ] Transformed 3888 transitions.
[2023-04-07 02:34:19] [INFO ] Found NUPN structural information;
[2023-04-07 02:34:19] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA EisenbergMcGuire-PT-09-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-09-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-09-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-09-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-09-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-09-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-09-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-09-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 820 transition count 3249
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 820 transition count 3249
Applied a total of 142 rules in 157 ms. Remains 820 /891 variables (removed 71) and now considering 3249/3888 (removed 639) transitions.
[2023-04-07 02:34:20] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2023-04-07 02:34:20] [INFO ] Computed 28 invariants in 36 ms
[2023-04-07 02:34:20] [INFO ] Implicit Places using invariants in 794 ms returned []
[2023-04-07 02:34:20] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-07 02:34:20] [INFO ] Invariant cache hit.
[2023-04-07 02:34:21] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:34:25] [INFO ] Implicit Places using invariants and state equation in 5052 ms returned []
Implicit Place search using SMT with State Equation took 5875 ms to find 0 implicit places.
[2023-04-07 02:34:25] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-07 02:34:25] [INFO ] Invariant cache hit.
[2023-04-07 02:34:26] [INFO ] Dead Transitions using invariants and state equation in 1015 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 820/891 places, 3249/3888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7051 ms. Remains : 820/891 places, 3249/3888 transitions.
Support contains 20 out of 820 places after structural reductions.
[2023-04-07 02:34:28] [INFO ] Flatten gal took : 1352 ms
[2023-04-07 02:34:28] [INFO ] Flatten gal took : 127 ms
[2023-04-07 02:34:28] [INFO ] Input system was already deterministic with 3249 transitions.
Support contains 18 out of 820 places (down from 20) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-04-07 02:34:29] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-07 02:34:29] [INFO ] Invariant cache hit.
[2023-04-07 02:34:29] [INFO ] [Real]Absence check using 19 positive place invariants in 28 ms returned sat
[2023-04-07 02:34:29] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-07 02:34:29] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 02:34:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 24 ms returned sat
[2023-04-07 02:34:29] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-07 02:34:30] [INFO ] After 453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 02:34:30] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:34:30] [INFO ] After 286ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 02:34:30] [INFO ] Deduced a trap composed of 3 places in 270 ms of which 4 ms to minimize.
[2023-04-07 02:34:31] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 1 ms to minimize.
[2023-04-07 02:34:31] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 1 ms to minimize.
[2023-04-07 02:34:31] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 1 ms to minimize.
[2023-04-07 02:34:32] [INFO ] Deduced a trap composed of 54 places in 236 ms of which 1 ms to minimize.
[2023-04-07 02:34:32] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 1 ms to minimize.
[2023-04-07 02:34:32] [INFO ] Deduced a trap composed of 43 places in 242 ms of which 0 ms to minimize.
[2023-04-07 02:34:32] [INFO ] Deduced a trap composed of 51 places in 234 ms of which 1 ms to minimize.
[2023-04-07 02:34:33] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 1 ms to minimize.
[2023-04-07 02:34:33] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 0 ms to minimize.
[2023-04-07 02:34:33] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 0 ms to minimize.
[2023-04-07 02:34:34] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 0 ms to minimize.
[2023-04-07 02:34:34] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 1 ms to minimize.
[2023-04-07 02:34:34] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 0 ms to minimize.
[2023-04-07 02:34:34] [INFO ] Deduced a trap composed of 38 places in 273 ms of which 0 ms to minimize.
[2023-04-07 02:34:35] [INFO ] Deduced a trap composed of 29 places in 273 ms of which 0 ms to minimize.
[2023-04-07 02:34:35] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 0 ms to minimize.
[2023-04-07 02:34:35] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 0 ms to minimize.
[2023-04-07 02:34:35] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 0 ms to minimize.
[2023-04-07 02:34:35] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5117 ms
[2023-04-07 02:34:35] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2023-04-07 02:34:36] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 0 ms to minimize.
[2023-04-07 02:34:36] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 0 ms to minimize.
[2023-04-07 02:34:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 630 ms
[2023-04-07 02:34:36] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-04-07 02:34:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-04-07 02:34:36] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 0 ms to minimize.
[2023-04-07 02:34:37] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 1 ms to minimize.
[2023-04-07 02:34:37] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2023-04-07 02:34:37] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2023-04-07 02:34:37] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2023-04-07 02:34:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 861 ms
[2023-04-07 02:34:37] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2023-04-07 02:34:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-04-07 02:34:37] [INFO ] After 7470ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 292 ms.
[2023-04-07 02:34:38] [INFO ] After 8526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 131 ms.
Support contains 8 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 3249/3249 transitions.
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 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 18 place count 811 transition count 2991
Deduced a syphon composed of 249 places in 3 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 516 place count 562 transition count 2991
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 660 place count 490 transition count 2919
Applied a total of 660 rules in 276 ms. Remains 490 /820 variables (removed 330) and now considering 2919/3249 (removed 330) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 490/820 places, 2919/3249 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 318440 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{0=1, 2=1, 4=1}
Probabilistic random walk after 318440 steps, saw 202475 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :3
Running SMT prover for 2 properties.
[2023-04-07 02:34:41] [INFO ] Flow matrix only has 840 transitions (discarded 2079 similar events)
// Phase 1: matrix 840 rows 490 cols
[2023-04-07 02:34:41] [INFO ] Computed 28 invariants in 11 ms
[2023-04-07 02:34:41] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:34:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 02:34:41] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 02:34:42] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 02:34:42] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:34:42] [INFO ] After 114ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 02:34:42] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-04-07 02:34:42] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2023-04-07 02:34:42] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-04-07 02:34:42] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2023-04-07 02:34:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 458 ms
[2023-04-07 02:34:42] [INFO ] After 651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-04-07 02:34:42] [INFO ] After 1052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 2919/2919 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 490 transition count 2916
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 487 transition count 2916
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 486 transition count 2907
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 486 transition count 2907
Applied a total of 8 rules in 132 ms. Remains 486 /490 variables (removed 4) and now considering 2907/2919 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 486/490 places, 2907/2919 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 263910 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 263910 steps, saw 168367 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-07 02:34:46] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 02:34:46] [INFO ] Computed 28 invariants in 7 ms
[2023-04-07 02:34:46] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:34:46] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 02:34:46] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 02:34:46] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 02:34:46] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:34:46] [INFO ] After 118ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 02:34:46] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2023-04-07 02:34:46] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2023-04-07 02:34:47] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 0 ms to minimize.
[2023-04-07 02:34:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 423 ms
[2023-04-07 02:34:47] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 0 ms to minimize.
[2023-04-07 02:34:47] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2023-04-07 02:34:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2023-04-07 02:34:47] [INFO ] After 830ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-04-07 02:34:47] [INFO ] After 1210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 104 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 90 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-07 02:34:47] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:34:47] [INFO ] Invariant cache hit.
[2023-04-07 02:34:48] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-04-07 02:34:48] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:34:48] [INFO ] Invariant cache hit.
[2023-04-07 02:34:48] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:34:50] [INFO ] Implicit Places using invariants and state equation in 2510 ms returned []
Implicit Place search using SMT with State Equation took 3006 ms to find 0 implicit places.
[2023-04-07 02:34:50] [INFO ] Redundant transitions in 171 ms returned []
[2023-04-07 02:34:50] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:34:50] [INFO ] Invariant cache hit.
[2023-04-07 02:34:51] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4100 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2675 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 4 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 414 transition count 516
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 318 transition count 516
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 193 place count 318 transition count 497
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 240 place count 290 transition count 497
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 522 place count 149 transition count 356
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 2 with 69 rules applied. Total rules applied 591 place count 149 transition count 287
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 609 place count 140 transition count 287
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 618 place count 140 transition count 278
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 628 place count 140 transition count 268
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 702 place count 140 transition count 194
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 776 place count 66 transition count 194
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 785 place count 66 transition count 194
Applied a total of 785 rules in 49 ms. Remains 66 /486 variables (removed 420) and now considering 194/2907 (removed 2713) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 194 rows 66 cols
[2023-04-07 02:34:51] [INFO ] Computed 19 invariants in 1 ms
[2023-04-07 02:34:51] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:34:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-07 02:34:51] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 02:34:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-07 02:34:51] [INFO ] After 10ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 02:34:51] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-07 02:34:51] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA EisenbergMcGuire-PT-09-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
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 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 811 transition count 2989
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 560 transition count 2989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 521 place count 559 transition count 2980
Iterating global reduction 2 with 1 rules applied. Total rules applied 522 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 5 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 666 place count 487 transition count 2908
Applied a total of 666 rules in 226 ms. Remains 487 /820 variables (removed 333) and now considering 2908/3249 (removed 341) transitions.
[2023-04-07 02:34:52] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2023-04-07 02:34:52] [INFO ] Computed 28 invariants in 7 ms
[2023-04-07 02:34:52] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-04-07 02:34:52] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 02:34:52] [INFO ] Invariant cache hit.
[2023-04-07 02:34:53] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:34:55] [INFO ] Implicit Places using invariants and state equation in 2536 ms returned []
Implicit Place search using SMT with State Equation took 2989 ms to find 0 implicit places.
[2023-04-07 02:34:55] [INFO ] Redundant transitions in 77 ms returned []
[2023-04-07 02:34:55] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 02:34:55] [INFO ] Invariant cache hit.
[2023-04-07 02:34:56] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/820 places, 2908/3249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4122 ms. Remains : 487/820 places, 2908/3249 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s387 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 325 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLCardinality-01 finished in 4675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 819 transition count 3240
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 819 transition count 3240
Applied a total of 2 rules in 35 ms. Remains 819 /820 variables (removed 1) and now considering 3240/3249 (removed 9) transitions.
[2023-04-07 02:34:57] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2023-04-07 02:34:57] [INFO ] Computed 28 invariants in 14 ms
[2023-04-07 02:34:57] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-04-07 02:34:57] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:34:57] [INFO ] Invariant cache hit.
[2023-04-07 02:34:58] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:35:02] [INFO ] Implicit Places using invariants and state equation in 5111 ms returned []
Implicit Place search using SMT with State Equation took 5621 ms to find 0 implicit places.
[2023-04-07 02:35:02] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:35:02] [INFO ] Invariant cache hit.
[2023-04-07 02:35:03] [INFO ] Dead Transitions using invariants and state equation in 983 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 819/820 places, 3240/3249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6641 ms. Remains : 819/820 places, 3240/3249 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s571 0) (EQ s572 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 859 ms.
Product exploration explored 100000 steps with 50000 reset in 815 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-09-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-09-LTLCardinality-02 finished in 8721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 819 transition count 3240
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 819 transition count 3240
Applied a total of 2 rules in 44 ms. Remains 819 /820 variables (removed 1) and now considering 3240/3249 (removed 9) transitions.
[2023-04-07 02:35:05] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:35:05] [INFO ] Invariant cache hit.
[2023-04-07 02:35:06] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-04-07 02:35:06] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:35:06] [INFO ] Invariant cache hit.
[2023-04-07 02:35:06] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:35:10] [INFO ] Implicit Places using invariants and state equation in 4669 ms returned []
Implicit Place search using SMT with State Equation took 5222 ms to find 0 implicit places.
[2023-04-07 02:35:10] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:35:10] [INFO ] Invariant cache hit.
[2023-04-07 02:35:11] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 819/820 places, 3240/3249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6253 ms. Remains : 819/820 places, 3240/3249 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s10 0) (EQ s197 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-09-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLCardinality-03 finished in 6372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 819 transition count 3240
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 819 transition count 3240
Applied a total of 2 rules in 40 ms. Remains 819 /820 variables (removed 1) and now considering 3240/3249 (removed 9) transitions.
[2023-04-07 02:35:12] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:35:12] [INFO ] Invariant cache hit.
[2023-04-07 02:35:12] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-04-07 02:35:12] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:35:12] [INFO ] Invariant cache hit.
[2023-04-07 02:35:12] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:35:16] [INFO ] Implicit Places using invariants and state equation in 4375 ms returned []
Implicit Place search using SMT with State Equation took 4862 ms to find 0 implicit places.
[2023-04-07 02:35:16] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:35:16] [INFO ] Invariant cache hit.
[2023-04-07 02:35:17] [INFO ] Dead Transitions using invariants and state equation in 967 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 819/820 places, 3240/3249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5871 ms. Remains : 819/820 places, 3240/3249 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s42 0) (EQ s568 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLCardinality-05 finished in 5991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
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 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 811 transition count 2989
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 560 transition count 2989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 521 place count 559 transition count 2980
Iterating global reduction 2 with 1 rules applied. Total rules applied 522 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 666 place count 487 transition count 2908
Applied a total of 666 rules in 181 ms. Remains 487 /820 variables (removed 333) and now considering 2908/3249 (removed 341) transitions.
[2023-04-07 02:35:18] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2023-04-07 02:35:18] [INFO ] Computed 28 invariants in 10 ms
[2023-04-07 02:35:18] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-04-07 02:35:18] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 02:35:18] [INFO ] Invariant cache hit.
[2023-04-07 02:35:18] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:35:20] [INFO ] Implicit Places using invariants and state equation in 2362 ms returned []
Implicit Place search using SMT with State Equation took 2798 ms to find 0 implicit places.
[2023-04-07 02:35:21] [INFO ] Redundant transitions in 107 ms returned []
[2023-04-07 02:35:21] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 02:35:21] [INFO ] Invariant cache hit.
[2023-04-07 02:35:21] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/820 places, 2908/3249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3897 ms. Remains : 487/820 places, 2908/3249 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s215 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 107 reset in 217 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLCardinality-06 finished in 4245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
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 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 18 place count 811 transition count 2991
Deduced a syphon composed of 249 places in 2 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 516 place count 562 transition count 2991
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 517 place count 561 transition count 2982
Iterating global reduction 2 with 1 rules applied. Total rules applied 518 place count 561 transition count 2982
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 660 place count 490 transition count 2911
Applied a total of 660 rules in 164 ms. Remains 490 /820 variables (removed 330) and now considering 2911/3249 (removed 338) transitions.
[2023-04-07 02:35:22] [INFO ] Flow matrix only has 832 transitions (discarded 2079 similar events)
// Phase 1: matrix 832 rows 490 cols
[2023-04-07 02:35:22] [INFO ] Computed 28 invariants in 10 ms
[2023-04-07 02:35:22] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-04-07 02:35:22] [INFO ] Flow matrix only has 832 transitions (discarded 2079 similar events)
[2023-04-07 02:35:22] [INFO ] Invariant cache hit.
[2023-04-07 02:35:23] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:35:25] [INFO ] Implicit Places using invariants and state equation in 2371 ms returned []
Implicit Place search using SMT with State Equation took 2830 ms to find 0 implicit places.
[2023-04-07 02:35:25] [INFO ] Redundant transitions in 110 ms returned []
[2023-04-07 02:35:25] [INFO ] Flow matrix only has 832 transitions (discarded 2079 similar events)
[2023-04-07 02:35:25] [INFO ] Invariant cache hit.
[2023-04-07 02:35:26] [INFO ] Dead Transitions using invariants and state equation in 779 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 490/820 places, 2911/3249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3896 ms. Remains : 490/820 places, 2911/3249 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s135 0) (EQ s387 1) (AND (NEQ s136 0) (NEQ s204 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 81 reset in 226 ms.
Stack based approach found an accepted trace after 2647 steps with 1 reset with depth 1389 and stack size 1201 in 8 ms.
FORMULA EisenbergMcGuire-PT-09-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLCardinality-09 finished in 4214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 3 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
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 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 811 transition count 2989
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 560 transition count 2989
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 664 place count 488 transition count 2917
Applied a total of 664 rules in 149 ms. Remains 488 /820 variables (removed 332) and now considering 2917/3249 (removed 332) transitions.
[2023-04-07 02:35:26] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-07 02:35:26] [INFO ] Computed 28 invariants in 9 ms
[2023-04-07 02:35:27] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-04-07 02:35:27] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:35:27] [INFO ] Invariant cache hit.
[2023-04-07 02:35:27] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:35:29] [INFO ] Implicit Places using invariants and state equation in 2402 ms returned []
Implicit Place search using SMT with State Equation took 2860 ms to find 0 implicit places.
[2023-04-07 02:35:29] [INFO ] Redundant transitions in 109 ms returned []
[2023-04-07 02:35:29] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:35:29] [INFO ] Invariant cache hit.
[2023-04-07 02:35:30] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/820 places, 2917/3249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3956 ms. Remains : 488/820 places, 2917/3249 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s408 1), p1:(AND (NEQ s198 0) (NEQ s135 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 276 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA EisenbergMcGuire-PT-09-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLCardinality-10 finished in 4345 ms.
All properties solved by simple procedures.
Total runtime 71403 ms.

BK_STOP 1680834936847

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="EisenbergMcGuire-PT-09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is EisenbergMcGuire-PT-09, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r517-tall-167987243600267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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