About the Execution of LTSMin+red for Murphy-PT-D2N050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15885.876 | 2927527.00 | 11633000.00 | 1009.20 | FFFTFFFFTTTFFTFT | 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.r521-tall-167987246500337.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 ltsminxred
Input is Murphy-PT-D2N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246500337
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.2K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 12K 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 Murphy-PT-D2N050-CTLCardinality-00
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-01
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-02
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-03
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-04
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-05
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-06
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-07
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-08
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-09
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-10
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-11
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-12
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-13
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-14
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1680902965792
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=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D2N050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 21:29:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 21:29:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 21:29:27] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-04-07 21:29:27] [INFO ] Transformed 18 places.
[2023-04-07 21:29:27] [INFO ] Transformed 21 transitions.
[2023-04-07 21:29:27] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 95 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 10 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 21:29:27] [INFO ] Computed 4 invariants in 7 ms
[2023-04-07 21:29:27] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
[2023-04-07 21:29:27] [INFO ] Invariant cache hit.
[2023-04-07 21:29:27] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-04-07 21:29:27] [INFO ] Invariant cache hit.
[2023-04-07 21:29:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:29:28] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-04-07 21:29:28] [INFO ] Invariant cache hit.
[2023-04-07 21:29:28] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 21:29:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-07 21:29:28] [INFO ] Flatten gal took : 15 ms
FORMULA Murphy-PT-D2N050-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 21:29:28] [INFO ] Flatten gal took : 5 ms
[2023-04-07 21:29:28] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10011 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 74) seen :47
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) 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 27) seen :0
Running SMT prover for 27 properties.
[2023-04-07 21:29:28] [INFO ] Invariant cache hit.
[2023-04-07 21:29:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 21:29:29] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 4 ms returned sat
[2023-04-07 21:29:29] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-04-07 21:29:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 21:29:29] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 13 ms returned sat
[2023-04-07 21:29:29] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :26
[2023-04-07 21:29:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:29:29] [INFO ] After 174ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :1 sat :26
[2023-04-07 21:29:29] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 9 ms to minimize.
[2023-04-07 21:29:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-04-07 21:29:29] [INFO ] After 331ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :26
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-04-07 21:29:30] [INFO ] After 959ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :26
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 167 ms.
Support contains 17 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 4 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:30] [INFO ] Invariant cache hit.
[2023-04-07 21:29:30] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10035 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 260409 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 260409 steps, saw 167689 distinct states, run finished after 3002 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 24 properties.
[2023-04-07 21:29:33] [INFO ] Invariant cache hit.
[2023-04-07 21:29:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 21:29:33] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-04-07 21:29:33] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-07 21:29:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 21:29:33] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-04-07 21:29:33] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-07 21:29:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:29:33] [INFO ] After 63ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-07 21:29:34] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-04-07 21:29:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-07 21:29:34] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-04-07 21:29:34] [INFO ] After 484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 112 ms.
Support contains 16 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10032 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=557 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 291619 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 291619 steps, saw 187841 distinct states, run finished after 3003 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 24 properties.
[2023-04-07 21:29:37] [INFO ] Invariant cache hit.
[2023-04-07 21:29:37] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 21:29:37] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-04-07 21:29:37] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-07 21:29:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 21:29:37] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 21:29:37] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-07 21:29:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:29:37] [INFO ] After 53ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-07 21:29:37] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-04-07 21:29:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-04-07 21:29:37] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-04-07 21:29:37] [INFO ] After 374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 137 ms.
Support contains 16 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:37] [INFO ] Invariant cache hit.
[2023-04-07 21:29:37] [INFO ] Implicit Places using invariants in 21 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 17/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38 ms. Remains : 17/18 places, 21/21 transitions.
Incomplete random walk after 10036 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 221073 steps, run timeout after 3005 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 221073 steps, saw 142815 distinct states, run finished after 3008 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 21 rows 17 cols
[2023-04-07 21:29:41] [INFO ] Computed 3 invariants in 1 ms
[2023-04-07 21:29:41] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 21:29:41] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 21:29:41] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-07 21:29:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 21:29:41] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-04-07 21:29:41] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-07 21:29:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:29:41] [INFO ] After 44ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-07 21:29:41] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-04-07 21:29:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-04-07 21:29:41] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2023-04-07 21:29:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-07 21:29:41] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2023-04-07 21:29:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2023-04-07 21:29:41] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2023-04-07 21:29:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-07 21:29:41] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2023-04-07 21:29:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-07 21:29:41] [INFO ] After 279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-04-07 21:29:41] [INFO ] After 455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 166 ms.
Support contains 16 out of 17 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 17/17 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:41] [INFO ] Invariant cache hit.
[2023-04-07 21:29:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-04-07 21:29:41] [INFO ] Invariant cache hit.
[2023-04-07 21:29:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:29:41] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-04-07 21:29:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 21:29:41] [INFO ] Invariant cache hit.
[2023-04-07 21:29:41] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 24 properties.
[2023-04-07 21:29:41] [INFO ] Invariant cache hit.
[2023-04-07 21:29:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 21:29:42] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 21:29:42] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-07 21:29:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 21:29:42] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 21:29:42] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-07 21:29:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:29:42] [INFO ] After 63ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-07 21:29:42] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 0 ms to minimize.
[2023-04-07 21:29:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-04-07 21:29:42] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
[2023-04-07 21:29:42] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-04-07 21:29:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2023-04-07 21:29:42] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2023-04-07 21:29:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-07 21:29:42] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-04-07 21:29:42] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-04-07 21:29:42] [INFO ] Flatten gal took : 3 ms
[2023-04-07 21:29:42] [INFO ] Flatten gal took : 3 ms
[2023-04-07 21:29:42] [INFO ] Input system was already deterministic with 21 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 21:29:42] [INFO ] Computed 4 invariants in 1 ms
[2023-04-07 21:29:42] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:42] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:42] [INFO ] Flatten gal took : 13 ms
[2023-04-07 21:29:42] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:42] [INFO ] Invariant cache hit.
[2023-04-07 21:29:42] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:42] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:42] [INFO ] Flatten gal took : 3 ms
[2023-04-07 21:29:42] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:42] [INFO ] Invariant cache hit.
[2023-04-07 21:29:43] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:43] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:43] [INFO ] Invariant cache hit.
[2023-04-07 21:29:43] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 3 ms
[2023-04-07 21:29:43] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:43] [INFO ] Invariant cache hit.
[2023-04-07 21:29:43] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 6 ms
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:29:43] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:43] [INFO ] Invariant cache hit.
[2023-04-07 21:29:43] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:43] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:43] [INFO ] Invariant cache hit.
[2023-04-07 21:29:43] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:43] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:43] [INFO ] Invariant cache hit.
[2023-04-07 21:29:43] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 13 ms
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:43] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:43] [INFO ] Invariant cache hit.
[2023-04-07 21:29:43] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:43] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:43] [INFO ] Invariant cache hit.
[2023-04-07 21:29:43] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:43] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:43] [INFO ] Invariant cache hit.
[2023-04-07 21:29:43] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:43] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:43] [INFO ] Invariant cache hit.
[2023-04-07 21:29:43] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 6 ms
[2023-04-07 21:29:43] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:43] [INFO ] Invariant cache hit.
[2023-04-07 21:29:43] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 3 ms
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:43] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:43] [INFO ] Invariant cache hit.
[2023-04-07 21:29:43] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 12 ms
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:29:43] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:43] [INFO ] Invariant cache hit.
[2023-04-07 21:29:43] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:29:43] [INFO ] Input system was already deterministic with 21 transitions.
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:29:43] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:43] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-07 21:29:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 0 ms.
Total runtime 15969 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/618/ctl_0_ --ctl=/tmp/618/ctl_1_ --ctl=/tmp/618/ctl_2_ --ctl=/tmp/618/ctl_3_ --ctl=/tmp/618/ctl_4_ --ctl=/tmp/618/ctl_5_ --ctl=/tmp/618/ctl_6_ --ctl=/tmp/618/ctl_7_ --ctl=/tmp/618/ctl_8_ --ctl=/tmp/618/ctl_9_ --ctl=/tmp/618/ctl_10_ --ctl=/tmp/618/ctl_11_ --ctl=/tmp/618/ctl_12_ --ctl=/tmp/618/ctl_13_ --ctl=/tmp/618/ctl_14_ --mu-par --mu-opt
FORMULA Murphy-PT-D2N050-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1680905893319
--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name Murphy-PT-D2N050-CTLCardinality-00
ctl formula formula --ctl=/tmp/618/ctl_0_
ctl formula name Murphy-PT-D2N050-CTLCardinality-01
ctl formula formula --ctl=/tmp/618/ctl_1_
ctl formula name Murphy-PT-D2N050-CTLCardinality-02
ctl formula formula --ctl=/tmp/618/ctl_2_
ctl formula name Murphy-PT-D2N050-CTLCardinality-04
ctl formula formula --ctl=/tmp/618/ctl_3_
ctl formula name Murphy-PT-D2N050-CTLCardinality-05
ctl formula formula --ctl=/tmp/618/ctl_4_
ctl formula name Murphy-PT-D2N050-CTLCardinality-06
ctl formula formula --ctl=/tmp/618/ctl_5_
ctl formula name Murphy-PT-D2N050-CTLCardinality-07
ctl formula formula --ctl=/tmp/618/ctl_6_
ctl formula name Murphy-PT-D2N050-CTLCardinality-08
ctl formula formula --ctl=/tmp/618/ctl_7_
ctl formula name Murphy-PT-D2N050-CTLCardinality-09
ctl formula formula --ctl=/tmp/618/ctl_8_
ctl formula name Murphy-PT-D2N050-CTLCardinality-10
ctl formula formula --ctl=/tmp/618/ctl_9_
ctl formula name Murphy-PT-D2N050-CTLCardinality-11
ctl formula formula --ctl=/tmp/618/ctl_10_
ctl formula name Murphy-PT-D2N050-CTLCardinality-12
ctl formula formula --ctl=/tmp/618/ctl_11_
ctl formula name Murphy-PT-D2N050-CTLCardinality-13
ctl formula formula --ctl=/tmp/618/ctl_12_
ctl formula name Murphy-PT-D2N050-CTLCardinality-14
ctl formula formula --ctl=/tmp/618/ctl_13_
ctl formula name Murphy-PT-D2N050-CTLCardinality-15
ctl formula formula --ctl=/tmp/618/ctl_14_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 18 places, 21 transitions and 81 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 21->9 groups
pnml2lts-sym: Regrouping took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 18; there are 9 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 37587 group checks and 0 next state calls
pnml2lts-sym: reachability took 1330.710 real 4881.380 user 432.050 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.080 real 0.340 user 0.000 sys
pnml2lts-sym: state space has 41538421296 states, 199733 nodes
pnml2lts-sym: Formula /tmp/618/ctl_0_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/618/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/618/ctl_4_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/618/ctl_14_ holds for the initial state
pnml2lts-sym: Formula /tmp/618/ctl_13_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/618/ctl_12_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/618/ctl_5_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/618/ctl_11_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/618/ctl_2_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/618/ctl_6_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/618/ctl_8_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/618/ctl_9_ holds for the initial state
pnml2lts-sym: Formula /tmp/618/ctl_7_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/618/ctl_10_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/618/ctl_3_ does not hold for the initial state
pnml2lts-sym: group_next: 981332 nodes total
pnml2lts-sym: group_explored: 528499 nodes, 18081738 short vectors total
pnml2lts-sym: max token count: 151
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="Murphy-PT-D2N050"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Murphy-PT-D2N050, 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 r521-tall-167987246500337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D2N050.tgz
mv Murphy-PT-D2N050 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 '
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 ;