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

About the Execution of LoLa+red for ShieldIIPt-PT-003B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9851.100 19245.00 3674778.00 147.50 TTTFTTTFFTTFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903715000222.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldIIPt-PT-003B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715000222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 16:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:59 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.8K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 17:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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 50K 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 ShieldIIPt-PT-003B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679269986804

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-003B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:53:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 23:53:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:53:10] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-19 23:53:10] [INFO ] Transformed 213 places.
[2023-03-19 23:53:10] [INFO ] Transformed 198 transitions.
[2023-03-19 23:53:10] [INFO ] Found NUPN structural information;
[2023-03-19 23:53:10] [INFO ] Parsed PT model containing 213 places and 198 transitions and 492 arcs in 341 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 11) seen :6
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :1
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :1
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 198 rows 213 cols
[2023-03-19 23:53:11] [INFO ] Computed 28 place invariants in 6 ms
[2023-03-19 23:53:11] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:53:11] [INFO ] [Nat]Absence check using 28 positive place invariants in 115 ms returned sat
[2023-03-19 23:53:12] [INFO ] After 505ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-19 23:53:13] [INFO ] Deduced a trap composed of 20 places in 703 ms of which 7 ms to minimize.
[2023-03-19 23:53:14] [INFO ] Deduced a trap composed of 18 places in 931 ms of which 2 ms to minimize.
[2023-03-19 23:53:14] [INFO ] Deduced a trap composed of 22 places in 667 ms of which 25 ms to minimize.
[2023-03-19 23:53:15] [INFO ] Deduced a trap composed of 29 places in 572 ms of which 1 ms to minimize.
[2023-03-19 23:53:15] [INFO ] Deduced a trap composed of 21 places in 330 ms of which 40 ms to minimize.
[2023-03-19 23:53:16] [INFO ] Deduced a trap composed of 19 places in 285 ms of which 1 ms to minimize.
[2023-03-19 23:53:16] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 2 ms to minimize.
[2023-03-19 23:53:16] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 13 ms to minimize.
[2023-03-19 23:53:16] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2023-03-19 23:53:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4165 ms
[2023-03-19 23:53:16] [INFO ] After 4685ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-19 23:53:16] [INFO ] After 5042ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 198/198 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 213 transition count 147
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 104 place count 162 transition count 145
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 107 place count 161 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 159 transition count 143
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 109 place count 159 transition count 130
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 135 place count 146 transition count 130
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 156 place count 125 transition count 109
Iterating global reduction 4 with 21 rules applied. Total rules applied 177 place count 125 transition count 109
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 177 place count 125 transition count 100
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 195 place count 116 transition count 100
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 291 place count 68 transition count 52
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 307 place count 60 transition count 57
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 308 place count 60 transition count 56
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 310 place count 60 transition count 56
Applied a total of 310 rules in 81 ms. Remains 60 /213 variables (removed 153) and now considering 56/198 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 60/213 places, 56/198 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 1470365 steps, run timeout after 3001 ms. (steps per millisecond=489 ) properties seen :{}
Probabilistic random walk after 1470365 steps, saw 913649 distinct states, run finished after 3002 ms. (steps per millisecond=489 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 56 rows 60 cols
[2023-03-19 23:53:19] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-19 23:53:19] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:53:19] [INFO ] [Nat]Absence check using 28 positive place invariants in 18 ms returned sat
[2023-03-19 23:53:19] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:53:19] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-19 23:53:19] [INFO ] After 32ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 23:53:20] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-19 23:53:20] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 60/60 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2023-03-19 23:53:20] [INFO ] Invariant cache hit.
[2023-03-19 23:53:20] [INFO ] Implicit Places using invariants in 393 ms returned [52, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 407 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 58/60 places, 56/56 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 58 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 55
Applied a total of 2 rules in 8 ms. Remains 57 /58 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 57 cols
[2023-03-19 23:53:20] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-19 23:53:20] [INFO ] Implicit Places using invariants in 140 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 144 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 56/60 places, 55/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 55 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 55 transition count 54
Applied a total of 2 rules in 4 ms. Remains 55 /56 variables (removed 1) and now considering 54/55 (removed 1) transitions.
// Phase 1: matrix 54 rows 55 cols
[2023-03-19 23:53:20] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-19 23:53:20] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-19 23:53:20] [INFO ] Invariant cache hit.
[2023-03-19 23:53:20] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-19 23:53:20] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 55/60 places, 54/56 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 848 ms. Remains : 55/60 places, 54/56 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1859093 steps, run timeout after 3001 ms. (steps per millisecond=619 ) properties seen :{}
Probabilistic random walk after 1859093 steps, saw 1119158 distinct states, run finished after 3001 ms. (steps per millisecond=619 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:53:23] [INFO ] Invariant cache hit.
[2023-03-19 23:53:24] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:53:24] [INFO ] [Nat]Absence check using 25 positive place invariants in 6 ms returned sat
[2023-03-19 23:53:24] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:53:24] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-19 23:53:24] [INFO ] After 18ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 23:53:24] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-19 23:53:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-19 23:53:24] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-19 23:53:24] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 54/54 transitions.
Applied a total of 0 rules in 12 ms. Remains 55 /55 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 55/55 places, 54/54 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 54/54 transitions.
Applied a total of 0 rules in 5 ms. Remains 55 /55 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2023-03-19 23:53:24] [INFO ] Invariant cache hit.
[2023-03-19 23:53:24] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-19 23:53:24] [INFO ] Invariant cache hit.
[2023-03-19 23:53:24] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-19 23:53:24] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-19 23:53:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 23:53:24] [INFO ] Invariant cache hit.
[2023-03-19 23:53:25] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 812 ms. Remains : 55/55 places, 54/54 transitions.
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 55 transition count 54
Applied a total of 13 rules in 4 ms. Remains 55 /55 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 54 rows 55 cols
[2023-03-19 23:53:25] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-19 23:53:25] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:53:25] [INFO ] [Nat]Absence check using 25 positive place invariants in 5 ms returned sat
[2023-03-19 23:53:25] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:53:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-19 23:53:25] [INFO ] After 13ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 23:53:25] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-19 23:53:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-19 23:53:25] [INFO ] After 95ms 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-19 23:53:25] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-19 23:53:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 28 ms.
[2023-03-19 23:53:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 55 places, 54 transitions and 267 arcs took 1 ms.
[2023-03-19 23:53:25] [INFO ] Flatten gal took : 25 ms
Total runtime 15633 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-003B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
ReachabilityCardinality

FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679270006049
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6298380 kB
After kill :
MemTotal: 16393220 kB
MemFree: 6296096 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -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/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 8 (type EXCL) for 0 ShieldIIPt-PT-003B-ReachabilityCardinality-02
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 ShieldIIPt-PT-003B-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 ShieldIIPt-PT-003B-ReachabilityCardinality-02
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type SRCH) for 0 ShieldIIPt-PT-003B-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type SRCH) for ShieldIIPt-PT-003B-ReachabilityCardinality-02
lola: result : false
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 4 (type FNDP) for ShieldIIPt-PT-003B-ReachabilityCardinality-02 (obsolete)
lola: CANCELED task # 5 (type EQUN) for ShieldIIPt-PT-003B-ReachabilityCardinality-02 (obsolete)
lola: CANCELED task # 8 (type EXCL) for ShieldIIPt-PT-003B-ReachabilityCardinality-02 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-003B-ReachabilityCardinality-02: AG true tandem / insertion


Time elapsed: 1 secs. Pages in use: 2
sara: try reading problem file /home/mcc/execution/377/ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 726)

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="ShieldIIPt-PT-003B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldIIPt-PT-003B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715000222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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