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

About the Execution of LoLa+red for Peterson-PT-4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1980.611 96989.00 265523.00 625.80 FFTFTTFTFTFFTFFF 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.r263-smll-167863538500622.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 Peterson-PT-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538500622
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 68K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 323K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 71K Feb 25 22:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 340K Feb 25 22:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 138K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 255K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 225K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 298K 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 Peterson-PT-4-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678860423233

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=Peterson-PT-4
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 06:07:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 06:07:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 06:07:07] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2023-03-15 06:07:07] [INFO ] Transformed 480 places.
[2023-03-15 06:07:07] [INFO ] Transformed 690 transitions.
[2023-03-15 06:07:07] [INFO ] Found NUPN structural information;
[2023-03-15 06:07:07] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2023-03-15 06:07:07] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 161 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-4-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1084 ms. (steps per millisecond=9 ) properties (out of 15) seen :2
FORMULA Peterson-PT-4-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 13) seen :1
FORMULA Peterson-PT-4-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 12 properties.
[2023-03-15 06:07:11] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-15 06:07:11] [INFO ] Computed 19 place invariants in 33 ms
[2023-03-15 06:07:13] [INFO ] After 728ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:8
[2023-03-15 06:07:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-15 06:07:14] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-15 06:07:14] [INFO ] After 603ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :4
[2023-03-15 06:07:14] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:07:15] [INFO ] After 353ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :8 sat :4
[2023-03-15 06:07:15] [INFO ] Deduced a trap composed of 10 places in 566 ms of which 13 ms to minimize.
[2023-03-15 06:07:16] [INFO ] Deduced a trap composed of 13 places in 450 ms of which 2 ms to minimize.
[2023-03-15 06:07:16] [INFO ] Deduced a trap composed of 25 places in 458 ms of which 2 ms to minimize.
[2023-03-15 06:07:17] [INFO ] Deduced a trap composed of 10 places in 455 ms of which 2 ms to minimize.
[2023-03-15 06:07:17] [INFO ] Deduced a trap composed of 12 places in 413 ms of which 2 ms to minimize.
[2023-03-15 06:07:18] [INFO ] Deduced a trap composed of 18 places in 452 ms of which 1 ms to minimize.
[2023-03-15 06:07:18] [INFO ] Deduced a trap composed of 32 places in 429 ms of which 1 ms to minimize.
[2023-03-15 06:07:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3616 ms
[2023-03-15 06:07:19] [INFO ] Deduced a trap composed of 43 places in 450 ms of which 6 ms to minimize.
[2023-03-15 06:07:19] [INFO ] Deduced a trap composed of 87 places in 277 ms of which 1 ms to minimize.
[2023-03-15 06:07:20] [INFO ] Deduced a trap composed of 66 places in 320 ms of which 3 ms to minimize.
[2023-03-15 06:07:20] [INFO ] Deduced a trap composed of 88 places in 257 ms of which 1 ms to minimize.
[2023-03-15 06:07:20] [INFO ] Deduced a trap composed of 54 places in 340 ms of which 1 ms to minimize.
[2023-03-15 06:07:21] [INFO ] Deduced a trap composed of 69 places in 319 ms of which 0 ms to minimize.
[2023-03-15 06:07:21] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 0 ms to minimize.
[2023-03-15 06:07:21] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 0 ms to minimize.
[2023-03-15 06:07:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2643 ms
[2023-03-15 06:07:22] [INFO ] Deduced a trap composed of 45 places in 277 ms of which 1 ms to minimize.
[2023-03-15 06:07:22] [INFO ] Deduced a trap composed of 76 places in 282 ms of which 0 ms to minimize.
[2023-03-15 06:07:22] [INFO ] Deduced a trap composed of 54 places in 202 ms of which 1 ms to minimize.
[2023-03-15 06:07:22] [INFO ] Deduced a trap composed of 81 places in 148 ms of which 0 ms to minimize.
[2023-03-15 06:07:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1147 ms
[2023-03-15 06:07:23] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 1 ms to minimize.
[2023-03-15 06:07:23] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 1 ms to minimize.
[2023-03-15 06:07:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 556 ms
[2023-03-15 06:07:23] [INFO ] After 8609ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :4
Attempting to minimize the solution found.
Minimization took 314 ms.
[2023-03-15 06:07:23] [INFO ] After 10191ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :4
FORMULA Peterson-PT-4-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 52 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 480 transition count 553
Reduce places removed 137 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 158 rules applied. Total rules applied 295 place count 343 transition count 532
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 316 place count 322 transition count 532
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 316 place count 322 transition count 452
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 476 place count 242 transition count 452
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 510 place count 225 transition count 435
Applied a total of 510 rules in 136 ms. Remains 225 /480 variables (removed 255) and now considering 435/690 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 225/480 places, 435/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 377508 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 377508 steps, saw 63814 distinct states, run finished after 3003 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-15 06:07:27] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
// Phase 1: matrix 375 rows 225 cols
[2023-03-15 06:07:27] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-15 06:07:27] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 06:07:27] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-15 06:07:27] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2023-03-15 06:07:28] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 06:07:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:07:28] [INFO ] After 205ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 06:07:28] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 0 ms to minimize.
[2023-03-15 06:07:29] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 1 ms to minimize.
[2023-03-15 06:07:29] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 0 ms to minimize.
[2023-03-15 06:07:29] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 1 ms to minimize.
[2023-03-15 06:07:29] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 0 ms to minimize.
[2023-03-15 06:07:29] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 0 ms to minimize.
[2023-03-15 06:07:30] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 1 ms to minimize.
[2023-03-15 06:07:30] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 1 ms to minimize.
[2023-03-15 06:07:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1813 ms
[2023-03-15 06:07:30] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 1 ms to minimize.
[2023-03-15 06:07:30] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 1 ms to minimize.
[2023-03-15 06:07:31] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 1 ms to minimize.
[2023-03-15 06:07:31] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 1 ms to minimize.
[2023-03-15 06:07:31] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2023-03-15 06:07:31] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2023-03-15 06:07:31] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2023-03-15 06:07:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1149 ms
[2023-03-15 06:07:31] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 1 ms to minimize.
[2023-03-15 06:07:31] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 1 ms to minimize.
[2023-03-15 06:07:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 360 ms
[2023-03-15 06:07:32] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 2 ms to minimize.
[2023-03-15 06:07:32] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 1 ms to minimize.
[2023-03-15 06:07:32] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 1 ms to minimize.
[2023-03-15 06:07:32] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 1 ms to minimize.
[2023-03-15 06:07:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 746 ms
[2023-03-15 06:07:32] [INFO ] After 4460ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 292 ms.
[2023-03-15 06:07:33] [INFO ] After 5263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 32 ms.
Support contains 52 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 435/435 transitions.
Applied a total of 0 rules in 41 ms. Remains 225 /225 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 225/225 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 435/435 transitions.
Applied a total of 0 rules in 26 ms. Remains 225 /225 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2023-03-15 06:07:33] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
[2023-03-15 06:07:33] [INFO ] Invariant cache hit.
[2023-03-15 06:07:33] [INFO ] Implicit Places using invariants in 344 ms returned [215, 216, 217, 218, 219]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 355 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 220/225 places, 435/435 transitions.
Applied a total of 0 rules in 26 ms. Remains 220 /220 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 409 ms. Remains : 220/225 places, 435/435 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 434778 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 434778 steps, saw 73303 distinct states, run finished after 3005 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-15 06:07:37] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
// Phase 1: matrix 375 rows 220 cols
[2023-03-15 06:07:37] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-15 06:07:37] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 06:07:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-15 06:07:37] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 06:07:37] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:07:38] [INFO ] After 194ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 06:07:38] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 2 ms to minimize.
[2023-03-15 06:07:38] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 1 ms to minimize.
[2023-03-15 06:07:38] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 1 ms to minimize.
[2023-03-15 06:07:38] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 1 ms to minimize.
[2023-03-15 06:07:39] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2023-03-15 06:07:39] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 1 ms to minimize.
[2023-03-15 06:07:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1283 ms
[2023-03-15 06:07:39] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 2 ms to minimize.
[2023-03-15 06:07:39] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2023-03-15 06:07:39] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 2 ms to minimize.
[2023-03-15 06:07:40] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 1 ms to minimize.
[2023-03-15 06:07:40] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2023-03-15 06:07:40] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 0 ms to minimize.
[2023-03-15 06:07:40] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 5 ms to minimize.
[2023-03-15 06:07:40] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 1 ms to minimize.
[2023-03-15 06:07:40] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 1 ms to minimize.
[2023-03-15 06:07:41] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 1 ms to minimize.
[2023-03-15 06:07:41] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2023-03-15 06:07:41] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 1 ms to minimize.
[2023-03-15 06:07:41] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 0 ms to minimize.
[2023-03-15 06:07:41] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2168 ms
[2023-03-15 06:07:41] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 6 ms to minimize.
[2023-03-15 06:07:41] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 1 ms to minimize.
[2023-03-15 06:07:42] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 4 ms to minimize.
[2023-03-15 06:07:42] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 0 ms to minimize.
[2023-03-15 06:07:42] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 3 ms to minimize.
[2023-03-15 06:07:42] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 1 ms to minimize.
[2023-03-15 06:07:42] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 2 ms to minimize.
[2023-03-15 06:07:43] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2023-03-15 06:07:43] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 1 ms to minimize.
[2023-03-15 06:07:43] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 0 ms to minimize.
[2023-03-15 06:07:43] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 1 ms to minimize.
[2023-03-15 06:07:43] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 1 ms to minimize.
[2023-03-15 06:07:43] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 1 ms to minimize.
[2023-03-15 06:07:43] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2023-03-15 06:07:44] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2373 ms
[2023-03-15 06:07:44] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2023-03-15 06:07:44] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 1 ms to minimize.
[2023-03-15 06:07:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 392 ms
[2023-03-15 06:07:44] [INFO ] After 6627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 186 ms.
[2023-03-15 06:07:44] [INFO ] After 7289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 21 ms.
Support contains 52 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 435/435 transitions.
Applied a total of 0 rules in 31 ms. Remains 220 /220 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 220/220 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 435/435 transitions.
Applied a total of 0 rules in 26 ms. Remains 220 /220 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2023-03-15 06:07:44] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
[2023-03-15 06:07:44] [INFO ] Invariant cache hit.
[2023-03-15 06:07:45] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-15 06:07:45] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
[2023-03-15 06:07:45] [INFO ] Invariant cache hit.
[2023-03-15 06:07:45] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:07:45] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2023-03-15 06:07:45] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-15 06:07:45] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
[2023-03-15 06:07:45] [INFO ] Invariant cache hit.
[2023-03-15 06:07:46] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1425 ms. Remains : 220/220 places, 435/435 transitions.
Graph (trivial) has 230 edges and 220 vertex of which 31 / 220 are part of one of the 13 SCC in 8 ms
Free SCC test removed 18 places
Drop transitions removed 36 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 97 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 202 transition count 337
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 201 transition count 337
Performed 41 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 85 place count 160 transition count 282
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 94 place count 160 transition count 273
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 33 rules applied. Total rules applied 127 place count 142 transition count 327
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 50 edges and 142 vertex of which 6 / 142 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 138 place count 137 transition count 317
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 145 place count 137 transition count 310
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 135 transition count 308
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 179 place count 135 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 180 place count 135 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 181 place count 134 transition count 277
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 190 place count 134 transition count 268
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 199 place count 125 transition count 268
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 211 place count 125 transition count 268
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 218 place count 125 transition count 261
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 219 place count 125 transition count 261
Applied a total of 219 rules in 129 ms. Remains 125 /220 variables (removed 95) and now considering 261/435 (removed 174) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 261 rows 125 cols
[2023-03-15 06:07:46] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-15 06:07:46] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 06:07:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-15 06:07:46] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 06:07:46] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-15 06:07:46] [INFO ] After 439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-15 06:07:46] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-15 06:07:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 220 places, 435 transitions and 1600 arcs took 6 ms.
[2023-03-15 06:07:47] [INFO ] Flatten gal took : 136 ms
Total runtime 40593 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Peterson-PT-4
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityCardinality

FORMULA Peterson-PT-4-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-4-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-4-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-4-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678860520222

--------------------
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 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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/ReachabilityCardinality.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: 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: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 # 21 (type EXCL) for 0 Peterson-PT-4-ReachabilityCardinality-08
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 0 Peterson-PT-4-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 0 Peterson-PT-4-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type SRCH) for 0 Peterson-PT-4-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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: FINISHED task # 20 (type SRCH) for Peterson-PT-4-ReachabilityCardinality-08
lola: result : true
lola: markings : 7
lola: fired transitions : 6
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for Peterson-PT-4-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 14 (type EQUN) for Peterson-PT-4-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 21 (type EXCL) for Peterson-PT-4-ReachabilityCardinality-08 (obsolete)
lola: LAUNCH task # 23 (type EXCL) for 3 Peterson-PT-4-ReachabilityCardinality-11
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 16 (type FNDP) for 3 Peterson-PT-4-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 3 Peterson-PT-4-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type SRCH) for 3 Peterson-PT-4-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 13 (type FNDP) for Peterson-PT-4-ReachabilityCardinality-08
lola: result : true
lola: fired transitions : 5
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
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: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
sara: try reading problem file /home/mcc/execution/374/ReachabilityCardinality-14.sara.
sara: try reading problem file /home/mcc/execution/374/ReachabilityCardinality-17.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 14 (type EQUN) for Peterson-PT-4-ReachabilityCardinality-08
lola: result : true
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-ReachabilityCardinality-08: AG false tandem / insertion

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-ReachabilityCardinality-11: AG 0 1 4 0 1 0 0 0
Peterson-PT-4-ReachabilityCardinality-13: AG 0 5 0 0 1 0 0 0
Peterson-PT-4-ReachabilityCardinality-15: AG 0 5 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 EF FNDP 5/900 0/5 Peterson-PT-4-ReachabilityCardinality-11 419006 t fired, 1 attempts, .
17 EF STEQ 5/900 0/5 Peterson-PT-4-ReachabilityCardinality-11 sara is running.
22 EF SRCH 5/900 2/5 Peterson-PT-4-ReachabilityCardinality-11 256670 m, 51334 m/sec, 936598 t fired, .
23 EF EXCL 5/1200 1/32 Peterson-PT-4-ReachabilityCardinality-11 109039 m, 21807 m/sec, 366368 t fired, .

Time elapsed: 5 secs. Pages in use: 3
# running tasks: 4 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-ReachabilityCardinality-08: AG false tandem / insertion

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-ReachabilityCardinality-11: AG 0 1 4 0 1 0 0 0
Peterson-PT-4-ReachabilityCardinality-13: AG 0 5 0 0 1 0 0 0
Peterson-PT-4-ReachabilityCardinality-15: AG 0 5 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 EF FNDP 10/895 0/5 Peterson-PT-4-ReachabilityCardinality-11 864878 t fired, 1 attempts, .
17 EF STEQ 10/895 0/5 Peterson-PT-4-ReachabilityCardinality-11 sara is running.
22 EF SRCH 10/895 3/5 Peterson-PT-4-ReachabilityCardinality-11 513166 m, 51299 m/sec, 1863790 t fired, .
23 EF EXCL 10/1200 2/32 Peterson-PT-4-ReachabilityCardinality-11 223099 m, 22812 m/sec, 769683 t fired, .

Time elapsed: 10 secs. Pages in use: 5
# running tasks: 4 of 4 Visible: 4
sara: warning, failure of lp_solve (at job 3430)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-ReachabilityCardinality-08: AG false tandem / insertion

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-ReachabilityCardinality-11: AG 0 1 4 0 1 0 0 0
Peterson-PT-4-ReachabilityCardinality-13: AG 0 5 0 0 1 0 0 0
Peterson-PT-4-ReachabilityCardinality-15: AG 0 5 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 EF FNDP 15/890 0/5 Peterson-PT-4-ReachabilityCardinality-11 1312472 t fired, 2 attempts, .
17 EF STEQ 15/890 0/5 Peterson-PT-4-ReachabilityCardinality-11 sara is running.
22 EF SRCH 15/890 4/5 Peterson-PT-4-ReachabilityCardinality-11 758183 m, 49003 m/sec, 2787665 t fired, .
23 EF EXCL 15/1200 2/32 Peterson-PT-4-ReachabilityCardinality-11 315185 m, 18417 m/sec, 1058736 t fired, .

Time elapsed: 15 secs. Pages in use: 6
# running tasks: 4 of 4 Visible: 4
lola: FINISHED task # 22 (type SRCH) for Peterson-PT-4-ReachabilityCardinality-11
lola: result : true
lola: markings : 836437
lola: fired transitions : 3075414
lola: time used : 17.000000
lola: memory pages used : 4
lola: CANCELED task # 16 (type FNDP) for Peterson-PT-4-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 17 (type EQUN) for Peterson-PT-4-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 23 (type EXCL) for Peterson-PT-4-ReachabilityCardinality-11 (obsolete)
lola: LAUNCH task # 35 (type EXCL) for 6 Peterson-PT-4-ReachabilityCardinality-13
lola: time limit : 1791 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 28 (type FNDP) for 9 Peterson-PT-4-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 29 (type EQUN) for 9 Peterson-PT-4-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 36 (type SRCH) for 9 Peterson-PT-4-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 16 (type FNDP) for Peterson-PT-4-ReachabilityCardinality-11
lola: result : unknown
lola: fired transitions : 1448163
lola: tried executions : 3
lola: time used : 17.000000
lola: memory pages used : 0
lola: FINISHED task # 17 (type EQUN) for Peterson-PT-4-ReachabilityCardinality-11
lola: result : unknown
sara: try reading problem file /home/mcc/execution/374/ReachabilityCardinality-29.sara.
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-ReachabilityCardinality-08: AG false tandem / insertion
Peterson-PT-4-ReachabilityCardinality-11: AG false tandem / insertion

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-ReachabilityCardinality-13: AG 0 4 1 0 1 0 0 0
Peterson-PT-4-ReachabilityCardinality-15: AG 0 2 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 EF FNDP 3/1194 0/5 Peterson-PT-4-ReachabilityCardinality-15 287474 t fired, 1 attempts, .
29 EF STEQ 3/1194 0/5 Peterson-PT-4-ReachabilityCardinality-15 sara is running.
35 EF EXCL 3/1791 1/32 Peterson-PT-4-ReachabilityCardinality-13 64084 m, 12816 m/sec, 200326 t fired, .
36 EF SRCH 3/1791 1/5 Peterson-PT-4-ReachabilityCardinality-15 184097 m, 36819 m/sec, 638571 t fired, .

Time elapsed: 20 secs. Pages in use: 6
# running tasks: 4 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-ReachabilityCardinality-08: AG false tandem / insertion
Peterson-PT-4-ReachabilityCardinality-11: AG false tandem / insertion

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-ReachabilityCardinality-13: AG 0 4 1 0 1 0 0 0
Peterson-PT-4-ReachabilityCardinality-15: AG 0 2 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 EF FNDP 8/1191 0/5 Peterson-PT-4-ReachabilityCardinality-15 702132 t fired, 1 attempts, .
29 EF STEQ 8/1191 0/5 Peterson-PT-4-ReachabilityCardinality-15 sara is running.
35 EF EXCL 8/1791 1/32 Peterson-PT-4-ReachabilityCardinality-13 148258 m, 16834 m/sec, 489603 t fired, .
36 EF SRCH 8/1788 3/5 Peterson-PT-4-ReachabilityCardinality-15 430214 m, 49223 m/sec, 1580477 t fired, .

Time elapsed: 25 secs. Pages in use: 6
# running tasks: 4 of 4 Visible: 4
lola: FINISHED task # 35 (type EXCL) for Peterson-PT-4-ReachabilityCardinality-13
lola: result : true
lola: markings : 178720
lola: fired transitions : 598070
lola: time used : 10.000000
lola: memory pages used : 1
lola: LAUNCH task # 37 (type EXCL) for 9 Peterson-PT-4-ReachabilityCardinality-15
lola: time limit : 3573 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-ReachabilityCardinality-08: AG false tandem / insertion
Peterson-PT-4-ReachabilityCardinality-11: AG false tandem / insertion
Peterson-PT-4-ReachabilityCardinality-13: AG false tandem / relaxed

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-ReachabilityCardinality-15: AG 0 1 4 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 EF FNDP 13/1781 0/5 Peterson-PT-4-ReachabilityCardinality-15 1128787 t fired, 2 attempts, .
29 EF STEQ 13/3573 0/5 Peterson-PT-4-ReachabilityCardinality-15 sara is running.
36 EF SRCH 13/3573 4/5 Peterson-PT-4-ReachabilityCardinality-15 682578 m, 50472 m/sec, 2494708 t fired, .
37 EF EXCL 3/3573 1/32 Peterson-PT-4-ReachabilityCardinality-15 62253 m, 12450 m/sec, 168670 t fired, .

Time elapsed: 30 secs. Pages in use: 6
# running tasks: 4 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-ReachabilityCardinality-08: AG false tandem / insertion
Peterson-PT-4-ReachabilityCardinality-11: AG false tandem / insertion
Peterson-PT-4-ReachabilityCardinality-13: AG false tandem / relaxed

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-ReachabilityCardinality-15: AG 0 1 4 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 EF FNDP 18/1778 0/5 Peterson-PT-4-ReachabilityCardinality-15 1565975 t fired, 2 attempts, .
29 EF STEQ 18/3570 0/5 Peterson-PT-4-ReachabilityCardinality-15 sara is running.
36 EF SRCH 18/3570 5/5 Peterson-PT-4-ReachabilityCardinality-15 929077 m, 49299 m/sec, 3448338 t fired, .
37 EF EXCL 8/3573 1/32 Peterson-PT-4-ReachabilityCardinality-15 156553 m, 18860 m/sec, 449066 t fired, .

Time elapsed: 35 secs. Pages in use: 6
# running tasks: 4 of 4 Visible: 4
lola: CANCELED task # 36 (type SRCH) for Peterson-PT-4-ReachabilityCardinality-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-ReachabilityCardinality-08: AG false tandem / insertion
Peterson-PT-4-ReachabilityCardinality-11: AG false tandem / insertion
Peterson-PT-4-ReachabilityCardinality-13: AG false tandem / relaxed

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-ReachabilityCardinality-15: AG 0 1 3 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 EF FNDP 23/1773 0/5 Peterson-PT-4-ReachabilityCardinality-15 2003687 t fired, 3 attempts, .
29 EF STEQ 23/3565 0/5 Peterson-PT-4-ReachabilityCardinality-15 sara is running.
37 EF EXCL 13/3573 2/32 Peterson-PT-4-ReachabilityCardinality-15 256963 m, 20082 m/sec, 733609 t fired, .

Time elapsed: 40 secs. Pages in use: 7
# running tasks: 4 of 4 Visible: 4
lola: LAUNCH task # 38 (type SRCH) for 9 Peterson-PT-4-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 38 (type SRCH) for Peterson-PT-4-ReachabilityCardinality-15
lola: result : unknown
lola: time used : 0.000000
lola: memory pages used : 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-ReachabilityCardinality-08: AG false tandem / insertion
Peterson-PT-4-ReachabilityCardinality-11: AG false tandem / insertion
Peterson-PT-4-ReachabilityCardinality-13: AG false tandem / relaxed

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-ReachabilityCardinality-15: AG 0 0 3 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 EF FNDP 28/3583 0/5 Peterson-PT-4-ReachabilityCardinality-15 2438278 t fired, 3 attempts, .
29 EF STEQ 28/3583 0/5 Peterson-PT-4-ReachabilityCardinality-15 sara is running.
37 EF EXCL 18/3573 2/32 Peterson-PT-4-ReachabilityCardinality-15 359037 m, 20414 m/sec, 1038893 t fired, .

Time elapsed: 45 secs. Pages in use: 7
# running tasks: 3 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-ReachabilityCardinality-08: AG false tandem / insertion
Peterson-PT-4-ReachabilityCardinality-11: AG false tandem / insertion
Peterson-PT-4-ReachabilityCardinality-13: AG false tandem / relaxed

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-ReachabilityCardinality-15: AG 0 0 3 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 EF FNDP 33/3583 0/5 Peterson-PT-4-ReachabilityCardinality-15 2874814 t fired, 3 attempts, .
29 EF STEQ 33/3583 0/5 Peterson-PT-4-ReachabilityCardinality-15 sara is running.
37 EF EXCL 23/3573 3/32 Peterson-PT-4-ReachabilityCardinality-15 455855 m, 19363 m/sec, 1336981 t fired, .

Time elapsed: 50 secs. Pages in use: 7
# running tasks: 3 of 4 Visible: 4
lola: FINISHED task # 37 (type EXCL) for Peterson-PT-4-ReachabilityCardinality-15
lola: result : true
lola: markings : 483301
lola: fired transitions : 1425097
lola: time used : 25.000000
lola: memory pages used : 3
lola: CANCELED task # 28 (type FNDP) for Peterson-PT-4-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 29 (type EQUN) for Peterson-PT-4-ReachabilityCardinality-15 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-ReachabilityCardinality-08: AG false tandem / insertion
Peterson-PT-4-ReachabilityCardinality-11: AG false tandem / insertion
Peterson-PT-4-ReachabilityCardinality-13: AG false tandem / relaxed
Peterson-PT-4-ReachabilityCardinality-15: AG false tandem / relaxed


Time elapsed: 52 secs. Pages in use: 7

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="Peterson-PT-4"
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 Peterson-PT-4, 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 r263-smll-167863538500622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 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 ;