Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978000282.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVt-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978000282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 23:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 23:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 23:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 239K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679306437703

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 10:00:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 10:00:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:00:39] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-20 10:00:39] [INFO ] Transformed 1003 places.
[2023-03-20 10:00:39] [INFO ] Transformed 1003 transitions.
[2023-03-20 10:00:39] [INFO ] Found NUPN structural information;
[2023-03-20 10:00:39] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 89 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Discarding 204 places :
Symmetric choice reduction at 0 with 204 rule applications. Total rules 204 place count 799 transition count 799
Iterating global reduction 0 with 204 rules applied. Total rules applied 408 place count 799 transition count 799
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 409 place count 798 transition count 798
Iterating global reduction 0 with 1 rules applied. Total rules applied 410 place count 798 transition count 798
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 411 place count 797 transition count 797
Iterating global reduction 0 with 1 rules applied. Total rules applied 412 place count 797 transition count 797
Applied a total of 412 rules in 201 ms. Remains 797 /1003 variables (removed 206) and now considering 797/1003 (removed 206) transitions.
// Phase 1: matrix 797 rows 797 cols
[2023-03-20 10:00:39] [INFO ] Computed 81 place invariants in 23 ms
[2023-03-20 10:00:40] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-20 10:00:40] [INFO ] Invariant cache hit.
[2023-03-20 10:00:40] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
[2023-03-20 10:00:40] [INFO ] Invariant cache hit.
[2023-03-20 10:00:40] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 797/1003 places, 797/1003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1447 ms. Remains : 797/1003 places, 797/1003 transitions.
Support contains 89 out of 797 places after structural reductions.
[2023-03-20 10:00:41] [INFO ] Flatten gal took : 73 ms
[2023-03-20 10:00:41] [INFO ] Flatten gal took : 36 ms
[2023-03-20 10:00:41] [INFO ] Input system was already deterministic with 797 transitions.
Support contains 82 out of 797 places (down from 89) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 59) seen :45
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) 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 14) 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 14) seen :0
Running SMT prover for 14 properties.
[2023-03-20 10:00:42] [INFO ] Invariant cache hit.
[2023-03-20 10:00:42] [INFO ] [Real]Absence check using 81 positive place invariants in 29 ms returned sat
[2023-03-20 10:00:42] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 10:00:42] [INFO ] [Nat]Absence check using 81 positive place invariants in 22 ms returned sat
[2023-03-20 10:00:43] [INFO ] After 851ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 10:00:44] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 7 ms to minimize.
[2023-03-20 10:00:44] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 1 ms to minimize.
[2023-03-20 10:00:44] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 1 ms to minimize.
[2023-03-20 10:00:44] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 2 ms to minimize.
[2023-03-20 10:00:44] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
[2023-03-20 10:00:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1013 ms
[2023-03-20 10:00:45] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2023-03-20 10:00:45] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2023-03-20 10:00:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
[2023-03-20 10:00:45] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 1 ms to minimize.
[2023-03-20 10:00:45] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 0 ms to minimize.
[2023-03-20 10:00:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2023-03-20 10:00:46] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 1 ms to minimize.
[2023-03-20 10:00:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-20 10:00:46] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 0 ms to minimize.
[2023-03-20 10:00:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-20 10:00:46] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2023-03-20 10:00:46] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 0 ms to minimize.
[2023-03-20 10:00:46] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2023-03-20 10:00:47] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 0 ms to minimize.
[2023-03-20 10:00:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 538 ms
[2023-03-20 10:00:47] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
[2023-03-20 10:00:47] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 0 ms to minimize.
[2023-03-20 10:00:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 406 ms
[2023-03-20 10:00:47] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 1 ms to minimize.
[2023-03-20 10:00:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-20 10:00:47] [INFO ] After 4834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 624 ms.
[2023-03-20 10:00:48] [INFO ] After 5875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 1 properties in 228 ms.
Support contains 26 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 797/797 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 797 transition count 591
Reduce places removed 206 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 210 rules applied. Total rules applied 416 place count 591 transition count 587
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 420 place count 587 transition count 587
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 146 Pre rules applied. Total rules applied 420 place count 587 transition count 441
Deduced a syphon composed of 146 places in 2 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 712 place count 441 transition count 441
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 719 place count 434 transition count 434
Iterating global reduction 3 with 7 rules applied. Total rules applied 726 place count 434 transition count 434
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 726 place count 434 transition count 429
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 736 place count 429 transition count 429
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 1 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 3 with 348 rules applied. Total rules applied 1084 place count 255 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1085 place count 255 transition count 254
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1087 place count 254 transition count 253
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1185 place count 205 transition count 291
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1186 place count 205 transition count 290
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1188 place count 205 transition count 288
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1190 place count 203 transition count 288
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1191 place count 203 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1192 place count 202 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1193 place count 201 transition count 286
Applied a total of 1193 rules in 189 ms. Remains 201 /797 variables (removed 596) and now considering 286/797 (removed 511) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 201/797 places, 286/797 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 13) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 286 rows 201 cols
[2023-03-20 10:00:49] [INFO ] Computed 80 place invariants in 5 ms
[2023-03-20 10:00:49] [INFO ] [Real]Absence check using 80 positive place invariants in 13 ms returned sat
[2023-03-20 10:00:50] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 10:00:50] [INFO ] [Nat]Absence check using 80 positive place invariants in 9 ms returned sat
[2023-03-20 10:00:50] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 10:00:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-20 10:00:50] [INFO ] After 296ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 10:00:50] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2023-03-20 10:00:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-20 10:00:50] [INFO ] After 538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-20 10:00:51] [INFO ] After 960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 122 ms.
Support contains 19 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 286/286 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 201 transition count 283
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 198 transition count 283
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 198 transition count 280
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 195 transition count 280
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 193 transition count 278
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 190 transition count 284
Applied a total of 22 rules in 27 ms. Remains 190 /201 variables (removed 11) and now considering 284/286 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 190/201 places, 284/286 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 350465 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 8=1}
Probabilistic random walk after 350465 steps, saw 201864 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :6
Running SMT prover for 3 properties.
// Phase 1: matrix 284 rows 190 cols
[2023-03-20 10:00:54] [INFO ] Computed 80 place invariants in 5 ms
[2023-03-20 10:00:54] [INFO ] [Real]Absence check using 80 positive place invariants in 10 ms returned sat
[2023-03-20 10:00:54] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 10:00:54] [INFO ] [Nat]Absence check using 80 positive place invariants in 9 ms returned sat
[2023-03-20 10:00:55] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 10:00:55] [INFO ] State equation strengthened by 128 read => feed constraints.
[2023-03-20 10:00:55] [INFO ] After 231ms SMT Verify possible using 128 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 10:00:55] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2023-03-20 10:00:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-20 10:00:55] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2023-03-20 10:00:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-20 10:00:55] [INFO ] After 437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-20 10:00:55] [INFO ] After 673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 38 ms.
Support contains 12 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 284/284 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 190 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 188 transition count 282
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 188 transition count 278
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 184 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 183 transition count 277
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 180 transition count 283
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 180 transition count 282
Applied a total of 21 rules in 23 ms. Remains 180 /190 variables (removed 10) and now considering 282/284 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 180/190 places, 282/284 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 499725 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 499725 steps, saw 141999 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 282 rows 180 cols
[2023-03-20 10:00:58] [INFO ] Computed 80 place invariants in 3 ms
[2023-03-20 10:00:58] [INFO ] [Real]Absence check using 80 positive place invariants in 10 ms returned sat
[2023-03-20 10:00:59] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 10:00:59] [INFO ] [Nat]Absence check using 80 positive place invariants in 8 ms returned sat
[2023-03-20 10:00:59] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 10:00:59] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-20 10:00:59] [INFO ] After 183ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 10:00:59] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2023-03-20 10:00:59] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2023-03-20 10:00:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2023-03-20 10:00:59] [INFO ] After 477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-20 10:00:59] [INFO ] After 732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 12 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 282/282 transitions.
Applied a total of 0 rules in 11 ms. Remains 180 /180 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 180/180 places, 282/282 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 282/282 transitions.
Applied a total of 0 rules in 7 ms. Remains 180 /180 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-20 10:00:59] [INFO ] Invariant cache hit.
[2023-03-20 10:00:59] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-20 10:00:59] [INFO ] Invariant cache hit.
[2023-03-20 10:01:00] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-20 10:01:00] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2023-03-20 10:01:00] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-20 10:01:00] [INFO ] Invariant cache hit.
[2023-03-20 10:01:00] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 702 ms. Remains : 180/180 places, 282/282 transitions.
Graph (trivial) has 70 edges and 180 vertex of which 4 / 180 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 637 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 67 edges and 174 vertex of which 2 / 174 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 173 transition count 273
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 66 edges and 172 vertex of which 2 / 172 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 171 transition count 268
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 65 edges and 170 vertex of which 2 / 170 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 20 place count 169 transition count 265
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 25 place count 168 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 25 place count 168 transition count 260
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 27 place count 167 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 30 place count 165 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 34 place count 165 transition count 255
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 39 place count 165 transition count 250
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 53 place count 165 transition count 250
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 66 place count 165 transition count 237
Applied a total of 66 rules in 53 ms. Remains 165 /180 variables (removed 15) and now considering 237/282 (removed 45) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 237 rows 165 cols
[2023-03-20 10:01:00] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-20 10:01:00] [INFO ] [Real]Absence check using 73 positive place invariants in 8 ms returned sat
[2023-03-20 10:01:00] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 10:01:00] [INFO ] [Nat]Absence check using 73 positive place invariants in 8 ms returned sat
[2023-03-20 10:01:00] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 10:01:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 10:01:00] [INFO ] After 26ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 10:01:00] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2023-03-20 10:01:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-20 10:01:00] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-20 10:01:00] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-20 10:01:00] [INFO ] Flatten gal took : 28 ms
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 27 ms
[2023-03-20 10:01:01] [INFO ] Input system was already deterministic with 797 transitions.
Computed a total of 242 stabilizing places and 242 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 222 place count 796 transition count 574
Reduce places removed 222 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 223 rules applied. Total rules applied 445 place count 574 transition count 573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 446 place count 573 transition count 573
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 446 place count 573 transition count 423
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 746 place count 423 transition count 423
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 755 place count 414 transition count 414
Iterating global reduction 3 with 9 rules applied. Total rules applied 764 place count 414 transition count 414
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 764 place count 414 transition count 407
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 778 place count 407 transition count 407
Performed 161 Post agglomeration using F-continuation condition.Transition count delta: 161
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 3 with 322 rules applied. Total rules applied 1100 place count 246 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1101 place count 246 transition count 245
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1103 place count 245 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1105 place count 243 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1106 place count 242 transition count 242
Applied a total of 1106 rules in 62 ms. Remains 242 /797 variables (removed 555) and now considering 242/797 (removed 555) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 242/797 places, 242/797 transitions.
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 10 ms
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 9 ms
[2023-03-20 10:01:01] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 785 transition count 785
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 785 transition count 785
Applied a total of 24 rules in 33 ms. Remains 785 /797 variables (removed 12) and now considering 785/797 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 785/797 places, 785/797 transitions.
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 21 ms
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 21 ms
[2023-03-20 10:01:01] [INFO ] Input system was already deterministic with 785 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 781 transition count 781
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 781 transition count 781
Applied a total of 32 rules in 30 ms. Remains 781 /797 variables (removed 16) and now considering 781/797 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 781/797 places, 781/797 transitions.
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 18 ms
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 19 ms
[2023-03-20 10:01:01] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 784 transition count 784
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 784 transition count 784
Applied a total of 26 rules in 30 ms. Remains 784 /797 variables (removed 13) and now considering 784/797 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 784/797 places, 784/797 transitions.
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 17 ms
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 18 ms
[2023-03-20 10:01:01] [INFO ] Input system was already deterministic with 784 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 781 transition count 781
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 781 transition count 781
Applied a total of 32 rules in 36 ms. Remains 781 /797 variables (removed 16) and now considering 781/797 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 781/797 places, 781/797 transitions.
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 16 ms
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 16 ms
[2023-03-20 10:01:01] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 781 transition count 781
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 781 transition count 781
Applied a total of 32 rules in 31 ms. Remains 781 /797 variables (removed 16) and now considering 781/797 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 781/797 places, 781/797 transitions.
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 16 ms
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 15 ms
[2023-03-20 10:01:01] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 225 rules applied. Total rules applied 225 place count 796 transition count 571
Reduce places removed 225 places and 0 transitions.
Iterating post reduction 1 with 225 rules applied. Total rules applied 450 place count 571 transition count 571
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 148 Pre rules applied. Total rules applied 450 place count 571 transition count 423
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 746 place count 423 transition count 423
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 756 place count 413 transition count 413
Iterating global reduction 2 with 10 rules applied. Total rules applied 766 place count 413 transition count 413
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 766 place count 413 transition count 405
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 782 place count 405 transition count 405
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 1102 place count 245 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1103 place count 245 transition count 244
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1105 place count 244 transition count 243
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1107 place count 242 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1108 place count 241 transition count 241
Applied a total of 1108 rules in 45 ms. Remains 241 /797 variables (removed 556) and now considering 241/797 (removed 556) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 241/797 places, 241/797 transitions.
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 6 ms
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 7 ms
[2023-03-20 10:01:01] [INFO ] Input system was already deterministic with 241 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
FORMULA ShieldRVt-PT-020B-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 783 transition count 783
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 783 transition count 783
Applied a total of 28 rules in 36 ms. Remains 783 /797 variables (removed 14) and now considering 783/797 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 783/797 places, 783/797 transitions.
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 15 ms
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 15 ms
[2023-03-20 10:01:01] [INFO ] Input system was already deterministic with 783 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 783 transition count 783
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 783 transition count 783
Applied a total of 28 rules in 30 ms. Remains 783 /797 variables (removed 14) and now considering 783/797 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 783/797 places, 783/797 transitions.
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 15 ms
[2023-03-20 10:01:01] [INFO ] Flatten gal took : 14 ms
[2023-03-20 10:01:02] [INFO ] Input system was already deterministic with 783 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 782 transition count 782
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 782 transition count 782
Applied a total of 30 rules in 31 ms. Remains 782 /797 variables (removed 15) and now considering 782/797 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 782/797 places, 782/797 transitions.
[2023-03-20 10:01:02] [INFO ] Flatten gal took : 15 ms
[2023-03-20 10:01:02] [INFO ] Flatten gal took : 16 ms
[2023-03-20 10:01:02] [INFO ] Input system was already deterministic with 782 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 783 transition count 783
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 783 transition count 783
Applied a total of 28 rules in 31 ms. Remains 783 /797 variables (removed 14) and now considering 783/797 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 783/797 places, 783/797 transitions.
[2023-03-20 10:01:02] [INFO ] Flatten gal took : 15 ms
[2023-03-20 10:01:02] [INFO ] Flatten gal took : 15 ms
[2023-03-20 10:01:02] [INFO ] Input system was already deterministic with 783 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 781 transition count 781
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 781 transition count 781
Applied a total of 32 rules in 30 ms. Remains 781 /797 variables (removed 16) and now considering 781/797 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 781/797 places, 781/797 transitions.
[2023-03-20 10:01:02] [INFO ] Flatten gal took : 15 ms
[2023-03-20 10:01:02] [INFO ] Flatten gal took : 15 ms
[2023-03-20 10:01:02] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 781 transition count 781
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 781 transition count 781
Applied a total of 32 rules in 31 ms. Remains 781 /797 variables (removed 16) and now considering 781/797 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 781/797 places, 781/797 transitions.
[2023-03-20 10:01:02] [INFO ] Flatten gal took : 14 ms
[2023-03-20 10:01:02] [INFO ] Flatten gal took : 21 ms
[2023-03-20 10:01:02] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 781 transition count 781
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 781 transition count 781
Applied a total of 32 rules in 31 ms. Remains 781 /797 variables (removed 16) and now considering 781/797 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 781/797 places, 781/797 transitions.
[2023-03-20 10:01:02] [INFO ] Flatten gal took : 15 ms
[2023-03-20 10:01:02] [INFO ] Flatten gal took : 15 ms
[2023-03-20 10:01:02] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 226 place count 796 transition count 570
Reduce places removed 226 places and 0 transitions.
Iterating post reduction 1 with 226 rules applied. Total rules applied 452 place count 570 transition count 570
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 452 place count 570 transition count 421
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 750 place count 421 transition count 421
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 759 place count 412 transition count 412
Iterating global reduction 2 with 9 rules applied. Total rules applied 768 place count 412 transition count 412
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 768 place count 412 transition count 405
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 782 place count 405 transition count 405
Performed 161 Post agglomeration using F-continuation condition.Transition count delta: 161
Deduced a syphon composed of 161 places in 1 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 1104 place count 244 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1105 place count 244 transition count 243
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1107 place count 243 transition count 242
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1109 place count 241 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1110 place count 240 transition count 240
Applied a total of 1110 rules in 42 ms. Remains 240 /797 variables (removed 557) and now considering 240/797 (removed 557) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 240/797 places, 240/797 transitions.
[2023-03-20 10:01:02] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:01:02] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:01:02] [INFO ] Input system was already deterministic with 240 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 908006 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :{}
Probabilistic random walk after 908006 steps, saw 774158 distinct states, run finished after 3001 ms. (steps per millisecond=302 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 240 rows 240 cols
[2023-03-20 10:01:05] [INFO ] Computed 80 place invariants in 7 ms
[2023-03-20 10:01:05] [INFO ] [Real]Absence check using 80 positive place invariants in 13 ms returned sat
[2023-03-20 10:01:05] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 10:01:05] [INFO ] [Nat]Absence check using 80 positive place invariants in 11 ms returned sat
[2023-03-20 10:01:05] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 10:01:05] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-20 10:01:05] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 96 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
FORMULA ShieldRVt-PT-020B-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 781 transition count 781
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 781 transition count 781
Applied a total of 32 rules in 37 ms. Remains 781 /797 variables (removed 16) and now considering 781/797 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 781/797 places, 781/797 transitions.
[2023-03-20 10:01:06] [INFO ] Flatten gal took : 15 ms
[2023-03-20 10:01:06] [INFO ] Flatten gal took : 15 ms
[2023-03-20 10:01:06] [INFO ] Input system was already deterministic with 781 transitions.
[2023-03-20 10:01:06] [INFO ] Flatten gal took : 15 ms
[2023-03-20 10:01:06] [INFO ] Flatten gal took : 15 ms
[2023-03-20 10:01:06] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-20 10:01:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 797 places, 797 transitions and 1954 arcs took 4 ms.
Total runtime 26964 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/609/ctl_0_ --ctl=/tmp/609/ctl_1_ --ctl=/tmp/609/ctl_2_ --ctl=/tmp/609/ctl_3_ --ctl=/tmp/609/ctl_4_ --ctl=/tmp/609/ctl_5_ --ctl=/tmp/609/ctl_6_ --ctl=/tmp/609/ctl_7_ --ctl=/tmp/609/ctl_8_ --ctl=/tmp/609/ctl_9_ --ctl=/tmp/609/ctl_10_ --ctl=/tmp/609/ctl_11_ --ctl=/tmp/609/ctl_12_ --ctl=/tmp/609/ctl_13_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393356 kB
MemFree: 281688 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16097072 kB
FORMULA ShieldRVt-PT-020B-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-01
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-02
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-03
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-04
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-05
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-07
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-08
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-09
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-10
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-11
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-12
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-13
Could not compute solution for formula : ShieldRVt-PT-020B-CTLFireability-15

BK_STOP 1679310037602

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name ShieldRVt-PT-020B-CTLFireability-00
ctl formula formula --ctl=/tmp/609/ctl_0_
ctl formula name ShieldRVt-PT-020B-CTLFireability-01
ctl formula formula --ctl=/tmp/609/ctl_1_
ctl formula name ShieldRVt-PT-020B-CTLFireability-02
ctl formula formula --ctl=/tmp/609/ctl_2_
ctl formula name ShieldRVt-PT-020B-CTLFireability-03
ctl formula formula --ctl=/tmp/609/ctl_3_
ctl formula name ShieldRVt-PT-020B-CTLFireability-04
ctl formula formula --ctl=/tmp/609/ctl_4_
ctl formula name ShieldRVt-PT-020B-CTLFireability-05
ctl formula formula --ctl=/tmp/609/ctl_5_
ctl formula name ShieldRVt-PT-020B-CTLFireability-07
ctl formula formula --ctl=/tmp/609/ctl_6_
ctl formula name ShieldRVt-PT-020B-CTLFireability-08
ctl formula formula --ctl=/tmp/609/ctl_7_
ctl formula name ShieldRVt-PT-020B-CTLFireability-09
ctl formula formula --ctl=/tmp/609/ctl_8_
ctl formula name ShieldRVt-PT-020B-CTLFireability-10
ctl formula formula --ctl=/tmp/609/ctl_9_
ctl formula name ShieldRVt-PT-020B-CTLFireability-11
ctl formula formula --ctl=/tmp/609/ctl_10_
ctl formula name ShieldRVt-PT-020B-CTLFireability-12
ctl formula formula --ctl=/tmp/609/ctl_11_
ctl formula name ShieldRVt-PT-020B-CTLFireability-13
ctl formula formula --ctl=/tmp/609/ctl_12_
ctl formula name ShieldRVt-PT-020B-CTLFireability-15
ctl formula formula --ctl=/tmp/609/ctl_13_
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 797 places, 797 transitions and 1954 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 user 0.010 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: 797->797 groups
pnml2lts-sym: Regrouping took 0.160 real 0.170 user 0.000 sys
pnml2lts-sym: state vector length is 797; there are 797 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 1462614 group checks and 0 next state calls
pnml2lts-sym: reachability took 8.220 real 32.740 user 0.120 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.020 real 0.080 user 0.000 sys
pnml2lts-sym: state space has 5.62574038224935e+71 states, 37502 nodes
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: Formula /tmp/609/ctl_0_ 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: 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: 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: 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: 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
Killing (15) : 615
Killing (9) : 615

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="ShieldRVt-PT-020B"
export BK_EXAMINATION="CTLFireability"
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 ShieldRVt-PT-020B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905978000282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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