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.r103-tall-167814478300471.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DES-PT-40b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478300471
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 115K Mar 5 18:22 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 DES-PT-40b-ReachabilityFireability-00
FORMULA_NAME DES-PT-40b-ReachabilityFireability-01
FORMULA_NAME DES-PT-40b-ReachabilityFireability-02
FORMULA_NAME DES-PT-40b-ReachabilityFireability-03
FORMULA_NAME DES-PT-40b-ReachabilityFireability-04
FORMULA_NAME DES-PT-40b-ReachabilityFireability-05
FORMULA_NAME DES-PT-40b-ReachabilityFireability-06
FORMULA_NAME DES-PT-40b-ReachabilityFireability-07
FORMULA_NAME DES-PT-40b-ReachabilityFireability-08
FORMULA_NAME DES-PT-40b-ReachabilityFireability-09
FORMULA_NAME DES-PT-40b-ReachabilityFireability-10
FORMULA_NAME DES-PT-40b-ReachabilityFireability-11
FORMULA_NAME DES-PT-40b-ReachabilityFireability-12
FORMULA_NAME DES-PT-40b-ReachabilityFireability-13
FORMULA_NAME DES-PT-40b-ReachabilityFireability-14
FORMULA_NAME DES-PT-40b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678253587932

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:33:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 05:33:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:33:09] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-08 05:33:09] [INFO ] Transformed 439 places.
[2023-03-08 05:33:09] [INFO ] Transformed 390 transitions.
[2023-03-08 05:33:09] [INFO ] Found NUPN structural information;
[2023-03-08 05:33:09] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 88 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 16) seen :8
FORMULA DES-PT-40b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 390 rows 439 cols
[2023-03-08 05:33:10] [INFO ] Computed 65 place invariants in 28 ms
[2023-03-08 05:33:10] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 05:33:10] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-08 05:33:10] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 28 ms returned sat
[2023-03-08 05:33:15] [INFO ] After 2510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 05:33:15] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 3 ms to minimize.
[2023-03-08 05:33:15] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 1 ms to minimize.
[2023-03-08 05:33:15] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2023-03-08 05:33:16] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2023-03-08 05:33:16] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2023-03-08 05:33:16] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 0 ms to minimize.
[2023-03-08 05:33:16] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 1 ms to minimize.
[2023-03-08 05:33:17] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2023-03-08 05:33:17] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2023-03-08 05:33:17] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 0 ms to minimize.
[2023-03-08 05:33:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2240 ms
[2023-03-08 05:33:18] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2023-03-08 05:33:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 146 ms
[2023-03-08 05:33:18] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 0 ms to minimize.
[2023-03-08 05:33:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-08 05:33:19] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2023-03-08 05:33:19] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2023-03-08 05:33:19] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2023-03-08 05:33:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 733 ms
[2023-03-08 05:33:20] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2023-03-08 05:33:20] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 0 ms to minimize.
[2023-03-08 05:33:20] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-03-08 05:33:20] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2023-03-08 05:33:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 627 ms
[2023-03-08 05:33:21] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 0 ms to minimize.
[2023-03-08 05:33:21] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2023-03-08 05:33:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2023-03-08 05:33:21] [INFO ] After 8674ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 2334 ms.
[2023-03-08 05:33:23] [INFO ] After 13249ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA DES-PT-40b-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 955 ms.
Support contains 74 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 390/390 transitions.
Graph (complete) has 978 edges and 439 vertex of which 428 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 428 transition count 372
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 417 transition count 369
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 31 place count 414 transition count 369
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 31 place count 414 transition count 360
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 49 place count 405 transition count 360
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 65 place count 389 transition count 344
Iterating global reduction 3 with 16 rules applied. Total rules applied 81 place count 389 transition count 344
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 91 place count 379 transition count 334
Iterating global reduction 3 with 10 rules applied. Total rules applied 101 place count 379 transition count 334
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 110 place count 379 transition count 325
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 110 place count 379 transition count 324
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 112 place count 378 transition count 324
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 202 place count 333 transition count 279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 204 place count 332 transition count 279
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 210 place count 332 transition count 273
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 216 place count 326 transition count 273
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 217 place count 326 transition count 272
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 218 place count 326 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 219 place count 325 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 220 place count 324 transition count 270
Applied a total of 220 rules in 195 ms. Remains 324 /439 variables (removed 115) and now considering 270/390 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 324/439 places, 270/390 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 695621 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 695621 steps, saw 110542 distinct states, run finished after 3002 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 270 rows 324 cols
[2023-03-08 05:33:28] [INFO ] Computed 61 place invariants in 8 ms
[2023-03-08 05:33:28] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 05:33:28] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2023-03-08 05:33:28] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 05:33:29] [INFO ] After 705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 05:33:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 05:33:30] [INFO ] After 714ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-08 05:33:30] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2023-03-08 05:33:30] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2023-03-08 05:33:30] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2023-03-08 05:33:30] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2023-03-08 05:33:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 347 ms
[2023-03-08 05:33:30] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2023-03-08 05:33:31] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2023-03-08 05:33:31] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2023-03-08 05:33:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 253 ms
[2023-03-08 05:33:31] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2023-03-08 05:33:31] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2023-03-08 05:33:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2023-03-08 05:33:31] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2023-03-08 05:33:31] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2023-03-08 05:33:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2023-03-08 05:33:31] [INFO ] After 2308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1303 ms.
[2023-03-08 05:33:33] [INFO ] After 4565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 423 ms.
Support contains 74 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 270/270 transitions.
Applied a total of 0 rules in 9 ms. Remains 324 /324 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 324/324 places, 270/270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 270/270 transitions.
Applied a total of 0 rules in 9 ms. Remains 324 /324 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-08 05:33:33] [INFO ] Invariant cache hit.
[2023-03-08 05:33:33] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-08 05:33:33] [INFO ] Invariant cache hit.
[2023-03-08 05:33:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 05:33:34] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-08 05:33:34] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 05:33:34] [INFO ] Invariant cache hit.
[2023-03-08 05:33:34] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 622 ms. Remains : 324/324 places, 270/270 transitions.
Graph (complete) has 911 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 323 /324 variables (removed 1) and now considering 270/270 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 270 rows 323 cols
[2023-03-08 05:33:34] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 05:33:34] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 05:33:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 05:33:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 78 ms returned sat
[2023-03-08 05:33:35] [INFO ] After 619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 05:33:35] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2023-03-08 05:33:35] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2023-03-08 05:33:35] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2023-03-08 05:33:35] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2023-03-08 05:33:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 336 ms
[2023-03-08 05:33:35] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2023-03-08 05:33:35] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2023-03-08 05:33:35] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2023-03-08 05:33:35] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2023-03-08 05:33:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 235 ms
[2023-03-08 05:33:36] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2023-03-08 05:33:36] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2023-03-08 05:33:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 279 ms
[2023-03-08 05:33:36] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2023-03-08 05:33:36] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2023-03-08 05:33:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2023-03-08 05:33:36] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2023-03-08 05:33:37] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-08 05:33:37] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2023-03-08 05:33:37] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2023-03-08 05:33:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 268 ms
[2023-03-08 05:33:37] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2023-03-08 05:33:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-08 05:33:37] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2023-03-08 05:33:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-08 05:33:37] [INFO ] After 2680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 540 ms.
[2023-03-08 05:33:37] [INFO ] After 3478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-08 05:33:37] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-08 05:33:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 324 places, 270 transitions and 1152 arcs took 2 ms.
[2023-03-08 05:33:38] [INFO ] Flatten gal took : 51 ms
Total runtime 28875 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-40b
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
ReachabilityFireability

FORMULA DES-PT-40b-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678253619789

--------------------
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 ReachabilityFireability -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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
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 # 32 (type EXCL) for 0 DES-PT-40b-ReachabilityFireability-00
lola: time limit : 600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 24 (type FNDP) for 9 DES-PT-40b-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type EQUN) for 9 DES-PT-40b-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 27 (type SRCH) for 9 DES-PT-40b-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
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:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/375/ReachabilityFireability-25.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 32 (type EXCL) for DES-PT-40b-ReachabilityFireability-00
lola: result : true
lola: markings : 3819
lola: fired transitions : 4286
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 42 (type EXCL) for 15 DES-PT-40b-ReachabilityFireability-11
lola: time limit : 600 sec
lola: memory limit: 32 pages
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 42 (type EXCL) for DES-PT-40b-ReachabilityFireability-11
lola: result : true
lola: markings : 14460
lola: fired transitions : 16119
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 55 (type EXCL) for 3 DES-PT-40b-ReachabilityFireability-04
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: FINISHED task # 27 (type SRCH) for DES-PT-40b-ReachabilityFireability-07
lola: result : false
lola: markings : 54633
lola: fired transitions : 85672
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 24 (type FNDP) for DES-PT-40b-ReachabilityFireability-07 (obsolete)
lola: CANCELED task # 25 (type EQUN) for DES-PT-40b-ReachabilityFireability-07 (obsolete)
lola: LAUNCH task # 57 (type FNDP) for 6 DES-PT-40b-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 58 (type EQUN) for 6 DES-PT-40b-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 63 (type SRCH) for 6 DES-PT-40b-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 25 (type EQUN) for DES-PT-40b-ReachabilityFireability-07
lola: result : unknown
lola: FINISHED task # 24 (type FNDP) for DES-PT-40b-ReachabilityFireability-07
lola: result : unknown
lola: fired transitions : 223279
lola: tried executions : 9731
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 63 (type SRCH) for DES-PT-40b-ReachabilityFireability-05
lola: result : true
lola: markings : 34
lola: fired transitions : 33
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 57 (type FNDP) for DES-PT-40b-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 58 (type EQUN) for DES-PT-40b-ReachabilityFireability-05 (obsolete)
lola: LAUNCH task # 35 (type FNDP) for 12 DES-PT-40b-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type EQUN) for 12 DES-PT-40b-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 59 (type SRCH) for 12 DES-PT-40b-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 57 (type FNDP) for DES-PT-40b-ReachabilityFireability-05
lola: result : true
lola: fired transitions : 32
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 55 (type EXCL) for DES-PT-40b-ReachabilityFireability-04
lola: result : true
lola: markings : 15833
lola: fired transitions : 17422
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 49 (type EXCL) for 18 DES-PT-40b-ReachabilityFireability-14
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 49 (type EXCL) for DES-PT-40b-ReachabilityFireability-14
lola: result : true
lola: markings : 3878
lola: fired transitions : 4277
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 60 (type EXCL) for 12 DES-PT-40b-ReachabilityFireability-08
lola: time limit : 3600 sec
lola: memory limit: 32 pages
sara: try reading problem file /home/mcc/execution/375/ReachabilityFireability-36.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 60 (type EXCL) for DES-PT-40b-ReachabilityFireability-08
lola: result : true
lola: markings : 11949
lola: fired transitions : 13114
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 35 (type FNDP) for DES-PT-40b-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 36 (type EQUN) for DES-PT-40b-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 59 (type SRCH) for DES-PT-40b-ReachabilityFireability-08 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40b-ReachabilityFireability-00: AG false tandem / relaxed
DES-PT-40b-ReachabilityFireability-04: EF true tandem / relaxed
DES-PT-40b-ReachabilityFireability-05: EF true tandem / insertion
DES-PT-40b-ReachabilityFireability-07: EF false tandem / insertion
DES-PT-40b-ReachabilityFireability-08: AG false tandem / relaxed
DES-PT-40b-ReachabilityFireability-11: EF true tandem / relaxed
DES-PT-40b-ReachabilityFireability-14: AG false tandem / relaxed


Time elapsed: 0 secs. Pages in use: 2

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="DES-PT-40b"
export BK_EXAMINATION="ReachabilityFireability"
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 DES-PT-40b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r103-tall-167814478300471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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