About the Execution of LoLa+red for SieveSingleMsgMbox-PT-d2m64
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
481.516 | 15867.00 | 23810.00 | 70.50 | TFTFTTFTFFTFTTTT | normal |
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.r423-tajo-167905976800481.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 lolaxred
Input is SieveSingleMsgMbox-PT-d2m64, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976800481
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 10:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 10:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 SieveSingleMsgMbox-PT-d2m64-CTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679248969791
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=lolaxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m64
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 18:02:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 18:02:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 18:02:51] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-19 18:02:51] [INFO ] Transformed 2398 places.
[2023-03-19 18:02:51] [INFO ] Transformed 1954 transitions.
[2023-03-19 18:02:51] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Deduced a syphon composed of 1984 places in 14 ms
Reduce places removed 1984 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 116 places :
Symmetric choice reduction at 1 with 116 rule applications. Total rules 969 place count 273 transition count 382
Iterating global reduction 1 with 116 rules applied. Total rules applied 1085 place count 273 transition count 382
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1095 place count 273 transition count 372
Discarding 87 places :
Symmetric choice reduction at 2 with 87 rule applications. Total rules 1182 place count 186 transition count 285
Iterating global reduction 2 with 87 rules applied. Total rules applied 1269 place count 186 transition count 285
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 1307 place count 186 transition count 247
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1343 place count 150 transition count 197
Iterating global reduction 3 with 36 rules applied. Total rules applied 1379 place count 150 transition count 197
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 1400 place count 150 transition count 176
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1409 place count 141 transition count 163
Iterating global reduction 4 with 9 rules applied. Total rules applied 1418 place count 141 transition count 163
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1427 place count 132 transition count 154
Iterating global reduction 4 with 9 rules applied. Total rules applied 1436 place count 132 transition count 154
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1441 place count 127 transition count 148
Iterating global reduction 4 with 5 rules applied. Total rules applied 1446 place count 127 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1448 place count 127 transition count 146
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1452 place count 123 transition count 142
Iterating global reduction 5 with 4 rules applied. Total rules applied 1456 place count 123 transition count 142
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1458 place count 121 transition count 140
Iterating global reduction 5 with 2 rules applied. Total rules applied 1460 place count 121 transition count 140
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1461 place count 120 transition count 139
Iterating global reduction 5 with 1 rules applied. Total rules applied 1462 place count 120 transition count 139
Applied a total of 1462 rules in 76 ms. Remains 120 /414 variables (removed 294) and now considering 139/1954 (removed 1815) transitions.
// Phase 1: matrix 139 rows 120 cols
[2023-03-19 18:02:51] [INFO ] Computed 5 place invariants in 11 ms
[2023-03-19 18:02:52] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-19 18:02:52] [INFO ] Invariant cache hit.
[2023-03-19 18:02:52] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-19 18:02:52] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-03-19 18:02:52] [INFO ] Invariant cache hit.
[2023-03-19 18:02:52] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/414 places, 139/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 645 ms. Remains : 120/414 places, 139/1954 transitions.
Support contains 7 out of 120 places after structural reductions.
[2023-03-19 18:02:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-19 18:02:52] [INFO ] Flatten gal took : 31 ms
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 18:02:52] [INFO ] Flatten gal took : 14 ms
[2023-03-19 18:02:52] [INFO ] Input system was already deterministic with 139 transitions.
Support contains 5 out of 120 places (down from 7) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2245 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 1031 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 1064 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 954 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 1007 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 1031 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 455006 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 455006 steps, saw 214926 distinct states, run finished after 3002 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-19 18:02:56] [INFO ] Invariant cache hit.
[2023-03-19 18:02:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:02:56] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 18:02:56] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-19 18:02:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:02:56] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 18:02:56] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2023-03-19 18:02:56] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-19 18:02:56] [INFO ] After 11ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :4 sat :1
[2023-03-19 18:02:56] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 2 ms to minimize.
[2023-03-19 18:02:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-19 18:02:56] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-19 18:02:56] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 139/139 transitions.
Graph (complete) has 346 edges and 120 vertex of which 119 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 119 transition count 137
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 114 transition count 131
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 114 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 114 transition count 130
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 111 transition count 127
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 111 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 111 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 109 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 109 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 27 place count 109 transition count 121
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 28 place count 108 transition count 120
Iterating global reduction 4 with 1 rules applied. Total rules applied 29 place count 108 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 107 transition count 119
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 107 transition count 119
Applied a total of 31 rules in 25 ms. Remains 107 /120 variables (removed 13) and now considering 119/139 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 107/120 places, 119/139 transitions.
Incomplete random walk after 10000 steps, including 2181 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1046 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2530093 steps, run timeout after 3001 ms. (steps per millisecond=843 ) properties seen :{}
Probabilistic random walk after 2530093 steps, saw 1175703 distinct states, run finished after 3004 ms. (steps per millisecond=842 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 119 rows 107 cols
[2023-03-19 18:02:59] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-19 18:02:59] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:02:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 18:02:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 18:02:59] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:02:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:02:59] [INFO ] After 11ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:02:59] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2023-03-19 18:02:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-19 18:02:59] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-19 18:02:59] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 8 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 107/107 places, 119/119 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 9 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-19 18:02:59] [INFO ] Invariant cache hit.
[2023-03-19 18:02:59] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-19 18:02:59] [INFO ] Invariant cache hit.
[2023-03-19 18:02:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:02:59] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-19 18:02:59] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 18:02:59] [INFO ] Invariant cache hit.
[2023-03-19 18:03:00] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 107/107 places, 119/119 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 107 transition count 111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 101 transition count 111
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 14 place count 101 transition count 91
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 54 place count 81 transition count 91
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 62 place count 77 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 76 transition count 95
Applied a total of 64 rules in 18 ms. Remains 76 /107 variables (removed 31) and now considering 95/119 (removed 24) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 95 rows 76 cols
[2023-03-19 18:03:00] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-19 18:03:00] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:03:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-19 18:03:00] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:03:00] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:03:00] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2023-03-19 18:03:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-19 18:03:00] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-19 18:03:00] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 18:03:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-19 18:03:00] [INFO ] Flatten gal took : 13 ms
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 18:03:00] [INFO ] Flatten gal took : 11 ms
[2023-03-19 18:03:00] [INFO ] Input system was already deterministic with 139 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 38 stabilizing places and 49 stable transitions
Graph (complete) has 385 edges and 120 vertex of which 119 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 139/139 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 114 transition count 132
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 114 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 114 transition count 131
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 110 transition count 127
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 110 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 110 transition count 125
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 26 place count 107 transition count 120
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 107 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 107 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 105 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 105 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 103 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 103 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 102 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 102 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 101 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 101 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 100 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 100 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 99 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 99 transition count 108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 98 transition count 107
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 98 transition count 107
Applied a total of 49 rules in 18 ms. Remains 98 /120 variables (removed 22) and now considering 107/139 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 98/120 places, 107/139 transitions.
[2023-03-19 18:03:00] [INFO ] Flatten gal took : 7 ms
[2023-03-19 18:03:00] [INFO ] Flatten gal took : 8 ms
[2023-03-19 18:03:00] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 139/139 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 114 transition count 132
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 114 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 114 transition count 131
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 110 transition count 127
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 110 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 110 transition count 125
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 26 place count 107 transition count 120
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 107 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 107 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 105 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 105 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 103 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 103 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 102 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 102 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 101 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 101 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 100 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 100 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 99 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 99 transition count 108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 98 transition count 107
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 98 transition count 107
Applied a total of 49 rules in 18 ms. Remains 98 /120 variables (removed 22) and now considering 107/139 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 98/120 places, 107/139 transitions.
[2023-03-19 18:03:00] [INFO ] Flatten gal took : 7 ms
[2023-03-19 18:03:00] [INFO ] Flatten gal took : 8 ms
[2023-03-19 18:03:00] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 139/139 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 114 transition count 132
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 114 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 114 transition count 131
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 110 transition count 127
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 110 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 110 transition count 125
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 26 place count 107 transition count 120
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 107 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 107 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 105 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 105 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 103 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 103 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 102 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 102 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 101 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 101 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 100 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 100 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 99 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 99 transition count 108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 98 transition count 107
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 98 transition count 107
Applied a total of 49 rules in 16 ms. Remains 98 /120 variables (removed 22) and now considering 107/139 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 98/120 places, 107/139 transitions.
[2023-03-19 18:03:00] [INFO ] Flatten gal took : 7 ms
[2023-03-19 18:03:00] [INFO ] Flatten gal took : 7 ms
[2023-03-19 18:03:00] [INFO ] Input system was already deterministic with 107 transitions.
[2023-03-19 18:03:00] [INFO ] Flatten gal took : 10 ms
[2023-03-19 18:03:00] [INFO ] Flatten gal took : 10 ms
[2023-03-19 18:03:00] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-19 18:03:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 120 places, 139 transitions and 553 arcs took 1 ms.
Total runtime 9085 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SieveSingleMsgMbox-PT-d2m64
BK_EXAMINATION: CTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679248985658
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/CTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:129
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:138
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:129
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH INITIAL
lola: LAUNCH task # 1 (type CNST) for 0 SieveSingleMsgMbox-PT-d2m64-CTLCardinality-00
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: FINISHED task # 1 (type CNST) for SieveSingleMsgMbox-PT-d2m64-CTLCardinality-00
lola: result : true
lola: LAUNCH INITIAL
lola: LAUNCH task # 4 (type CNST) for 3 SieveSingleMsgMbox-PT-d2m64-CTLCardinality-11
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: FINISHED task # 4 (type CNST) for SieveSingleMsgMbox-PT-d2m64-CTLCardinality-11
lola: result : false
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m64-CTLCardinality-00: INITIAL true preprocessing
SieveSingleMsgMbox-PT-d2m64-CTLCardinality-11: INITIAL false preprocessing
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m64-CTLCardinality-14: INITIAL 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 5 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 3
lola: LAUNCH INITIAL
lola: LAUNCH task # 7 (type CNST) for 6 SieveSingleMsgMbox-PT-d2m64-CTLCardinality-14
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: FINISHED task # 7 (type CNST) for SieveSingleMsgMbox-PT-d2m64-CTLCardinality-14
lola: result : true
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m64-CTLCardinality-00: INITIAL true preprocessing
SieveSingleMsgMbox-PT-d2m64-CTLCardinality-11: INITIAL false preprocessing
SieveSingleMsgMbox-PT-d2m64-CTLCardinality-14: INITIAL true preprocessing
Time elapsed: 5 secs. Pages in use: 0
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="SieveSingleMsgMbox-PT-d2m64"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is SieveSingleMsgMbox-PT-d2m64, 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 r423-tajo-167905976800481"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m64.tgz
mv SieveSingleMsgMbox-PT-d2m64 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 ;