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

About the Execution of LoLa+red for SafeBus-COL-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
397.712 216978.00 586340.00 1030.20 1 6 6 5 1 1 1 1 5 6 1 1 1 1 1 6 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.r359-smll-167891808600213.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 SafeBus-COL-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891808600213
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.8K Feb 26 01:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 01:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 01:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 01:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 01:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 01:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 42K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679005305495

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 22:21:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-16 22:21:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 22:21:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-16 22:21:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 22:21:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1076 ms
[2023-03-16 22:21:49] [INFO ] Detected 1 constant HL places corresponding to 6 PT places.
[2023-03-16 22:21:49] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 150 PT places and 2029.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
[2023-03-16 22:21:49] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 8 ms.
[2023-03-16 22:21:49] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2023-03-16 22:21:49] [INFO ] Computed 7 place invariants in 7 ms
FORMULA SafeBus-COL-06-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-16 22:21:49] [INFO ] Invariant cache hit.
[2023-03-16 22:21:50] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:50] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-16 22:21:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:21:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:50] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-16 22:21:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-16 22:21:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-16 22:21:50] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-16 22:21:50] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Minimization took 11 ms.
[2023-03-16 22:21:50] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:50] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-16 22:21:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:21:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:50] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-16 22:21:50] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-16 22:21:50] [INFO ] Added : 10 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 15 ms.
[2023-03-16 22:21:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:50] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-16 22:21:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:21:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:50] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 16 ms returned sat
[2023-03-16 22:21:50] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-16 22:21:50] [INFO ] Added : 10 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 10 ms.
[2023-03-16 22:21:50] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:50] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-16 22:21:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:21:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:50] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-16 22:21:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-16 22:21:50] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-16 22:21:50] [INFO ] Added : 9 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 11 ms.
[2023-03-16 22:21:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 34 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:51] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-16 22:21:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:21:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:51] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-16 22:21:51] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 22:21:51] [INFO ] Added : 8 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 15 ms.
[2023-03-16 22:21:51] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:51] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:21:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:51] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-16 22:21:51] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 8 ms.
[2023-03-16 22:21:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:51] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-16 22:21:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:21:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:51] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 22:21:51] [INFO ] Added : 8 causal constraints over 3 iterations in 62 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 22:21:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:51] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 22:21:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:21:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:51] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-03-16 22:21:51] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 22:21:51] [INFO ] Added : 13 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 12 ms.
[2023-03-16 22:21:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:51] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 22:21:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:21:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:51] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-16 22:21:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-16 22:21:51] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 22:21:51] [INFO ] Added : 9 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [6, 6, 1, 1, 6, 6, 1, 1, 1]
Domain [It(6), It(6)] of place AMC breaks symmetries in sort It
[2023-03-16 22:21:51] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 49 ms.
[2023-03-16 22:21:51] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 12 places and 12 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 9) seen :22
FORMULA SafeBus-COL-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :18
FORMULA SafeBus-COL-06-UpperBounds-09 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :10
[2023-03-16 22:21:52] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2023-03-16 22:21:52] [INFO ] Computed 29 place invariants in 30 ms
[2023-03-16 22:21:52] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-16 22:21:52] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 8 ms returned sat
[2023-03-16 22:21:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:52] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-16 22:21:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:21:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 30 ms returned sat
[2023-03-16 22:21:52] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 10 ms returned sat
[2023-03-16 22:21:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:52] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2023-03-16 22:21:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-16 22:21:52] [INFO ] [Nat]Added 43 Read/Feed constraints in 98 ms returned sat
[2023-03-16 22:21:52] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 53 ms.
[2023-03-16 22:21:53] [INFO ] Added : 1 causal constraints over 1 iterations in 133 ms. Result :sat
Minimization took 101 ms.
[2023-03-16 22:21:53] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 22:21:53] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 11 ms returned sat
[2023-03-16 22:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:53] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-16 22:21:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:21:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-16 22:21:53] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 7 ms returned sat
[2023-03-16 22:21:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:53] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-16 22:21:53] [INFO ] [Nat]Added 43 Read/Feed constraints in 77 ms returned sat
[2023-03-16 22:21:53] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 12 ms to minimize.
[2023-03-16 22:21:54] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 2 ms to minimize.
[2023-03-16 22:21:54] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 2 ms to minimize.
[2023-03-16 22:21:54] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 4 ms to minimize.
[2023-03-16 22:21:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 859 ms
Current structural bounds on expressions (after SMT) : [6, 5] Max seen :[5, 5]
FORMULA SafeBus-COL-06-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 99 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 138/138 places, 451/451 transitions.
Normalized transition count is 242 out of 451 initially.
// Phase 1: matrix 242 rows 138 cols
[2023-03-16 22:21:54] [INFO ] Computed 29 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3269 ms. (steps per millisecond=305 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1105 ms. (steps per millisecond=904 ) properties (out of 1) seen :5
[2023-03-16 22:21:59] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2023-03-16 22:21:59] [INFO ] Computed 29 place invariants in 6 ms
[2023-03-16 22:21:59] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 22:21:59] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 6 ms returned sat
[2023-03-16 22:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:59] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2023-03-16 22:21:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:21:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 22:21:59] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 7 ms returned sat
[2023-03-16 22:21:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:21:59] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-16 22:21:59] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-16 22:21:59] [INFO ] [Nat]Added 43 Read/Feed constraints in 72 ms returned sat
[2023-03-16 22:21:59] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 41 ms.
[2023-03-16 22:21:59] [INFO ] Added : 1 causal constraints over 1 iterations in 86 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 31 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 36 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2023-03-16 22:21:59] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2023-03-16 22:21:59] [INFO ] Invariant cache hit.
[2023-03-16 22:22:00] [INFO ] Implicit Places using invariants in 340 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 344 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 132/138 places, 451/451 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 565
Applied a total of 12 rules in 152 ms. Remains 126 /132 variables (removed 6) and now considering 565/451 (removed -114) transitions.
[2023-03-16 22:22:00] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
// Phase 1: matrix 356 rows 126 cols
[2023-03-16 22:22:00] [INFO ] Computed 23 place invariants in 10 ms
[2023-03-16 22:22:00] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-16 22:22:00] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2023-03-16 22:22:00] [INFO ] Invariant cache hit.
[2023-03-16 22:22:00] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-16 22:22:01] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 126/138 places, 565/451 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1781 ms. Remains : 126/138 places, 565/451 transitions.
Normalized transition count is 356 out of 565 initially.
// Phase 1: matrix 356 rows 126 cols
[2023-03-16 22:22:01] [INFO ] Computed 23 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4056 ms. (steps per millisecond=246 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1356 ms. (steps per millisecond=737 ) properties (out of 1) seen :5
[2023-03-16 22:22:06] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
// Phase 1: matrix 356 rows 126 cols
[2023-03-16 22:22:06] [INFO ] Computed 23 place invariants in 9 ms
[2023-03-16 22:22:07] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-16 22:22:07] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 9 ms returned sat
[2023-03-16 22:22:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:22:07] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2023-03-16 22:22:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:22:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-16 22:22:07] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-16 22:22:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:22:07] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2023-03-16 22:22:07] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-16 22:22:07] [INFO ] [Nat]Added 43 Read/Feed constraints in 243 ms returned sat
[2023-03-16 22:22:07] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 86 ms.
[2023-03-16 22:22:07] [INFO ] Added : 6 causal constraints over 2 iterations in 183 ms. Result :sat
Minimization took 190 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 565/565 transitions.
Applied a total of 0 rules in 25 ms. Remains 126 /126 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 126/126 places, 565/565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 565/565 transitions.
Applied a total of 0 rules in 26 ms. Remains 126 /126 variables (removed 0) and now considering 565/565 (removed 0) transitions.
[2023-03-16 22:22:08] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2023-03-16 22:22:08] [INFO ] Invariant cache hit.
[2023-03-16 22:22:08] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-16 22:22:08] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2023-03-16 22:22:08] [INFO ] Invariant cache hit.
[2023-03-16 22:22:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-16 22:22:09] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
[2023-03-16 22:22:09] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-16 22:22:09] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2023-03-16 22:22:09] [INFO ] Invariant cache hit.
[2023-03-16 22:22:09] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 36 transitions.
Found 36 dead transitions using SMT.
Drop transitions removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/126 places, 529/565 transitions.
Applied a total of 0 rules in 21 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2023-03-16 22:22:09] [INFO ] Redundant transitions in 12 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1607 ms. Remains : 126/126 places, 529/565 transitions.
Normalized transition count is 356 out of 529 initially.
// Phase 1: matrix 356 rows 126 cols
[2023-03-16 22:22:09] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3644 ms. (steps per millisecond=274 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1337 ms. (steps per millisecond=747 ) properties (out of 1) seen :5
[2023-03-16 22:22:14] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2023-03-16 22:22:14] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-16 22:22:15] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-16 22:22:15] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-16 22:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:22:15] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2023-03-16 22:22:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:22:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-16 22:22:15] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 9 ms returned sat
[2023-03-16 22:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:22:15] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-16 22:22:15] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-16 22:22:15] [INFO ] [Nat]Added 43 Read/Feed constraints in 160 ms returned sat
[2023-03-16 22:22:15] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 43 ms.
[2023-03-16 22:22:15] [INFO ] Added : 7 causal constraints over 2 iterations in 149 ms. Result :sat
Minimization took 200 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 23 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 21 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2023-03-16 22:22:16] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-16 22:22:16] [INFO ] Invariant cache hit.
[2023-03-16 22:22:16] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-16 22:22:16] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-16 22:22:16] [INFO ] Invariant cache hit.
[2023-03-16 22:22:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-16 22:22:17] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
[2023-03-16 22:22:17] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 22:22:17] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-16 22:22:17] [INFO ] Invariant cache hit.
[2023-03-16 22:22:17] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1580 ms. Remains : 126/126 places, 529/529 transitions.
Starting property specific reduction for SafeBus-COL-06-UpperBounds-03
Normalized transition count is 356 out of 529 initially.
// Phase 1: matrix 356 rows 126 cols
[2023-03-16 22:22:17] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :5
[2023-03-16 22:22:17] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2023-03-16 22:22:17] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-16 22:22:17] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-16 22:22:17] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-16 22:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:22:18] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-16 22:22:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:22:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-16 22:22:18] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-16 22:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:22:18] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2023-03-16 22:22:18] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-16 22:22:18] [INFO ] [Nat]Added 43 Read/Feed constraints in 261 ms returned sat
[2023-03-16 22:22:18] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 39 ms.
[2023-03-16 22:22:18] [INFO ] Added : 7 causal constraints over 2 iterations in 136 ms. Result :sat
Minimization took 184 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 21 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 126/126 places, 529/529 transitions.
Normalized transition count is 356 out of 529 initially.
// Phase 1: matrix 356 rows 126 cols
[2023-03-16 22:22:19] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3512 ms. (steps per millisecond=284 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1320 ms. (steps per millisecond=757 ) properties (out of 1) seen :5
[2023-03-16 22:22:23] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2023-03-16 22:22:23] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-16 22:22:23] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-16 22:22:23] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-16 22:22:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:22:24] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-16 22:22:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:22:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-16 22:22:24] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-16 22:22:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:22:24] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-03-16 22:22:24] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-16 22:22:24] [INFO ] [Nat]Added 43 Read/Feed constraints in 164 ms returned sat
[2023-03-16 22:22:24] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 51 ms.
[2023-03-16 22:22:24] [INFO ] Added : 7 causal constraints over 2 iterations in 138 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 27 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 19 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2023-03-16 22:22:25] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-16 22:22:25] [INFO ] Invariant cache hit.
[2023-03-16 22:22:25] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-16 22:22:25] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-16 22:22:25] [INFO ] Invariant cache hit.
[2023-03-16 22:22:25] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-16 22:22:26] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
[2023-03-16 22:22:26] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-16 22:22:26] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-16 22:22:26] [INFO ] Invariant cache hit.
[2023-03-16 22:22:26] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1497 ms. Remains : 126/126 places, 529/529 transitions.
Ending property specific reduction for SafeBus-COL-06-UpperBounds-03 in 8853 ms.
[2023-03-16 22:22:26] [INFO ] Flatten gal took : 161 ms
[2023-03-16 22:22:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-16 22:22:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 529 transitions and 3754 arcs took 7 ms.
Total runtime 38421 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SafeBus-COL-06
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
Upper Bounds

FORMULA SafeBus-COL-06-UpperBounds-03 5 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679005522473

--------------------
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 UpperBounds -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/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 5 (type EXCL) for 0 SafeBus-COL-06-UpperBounds-03
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 SafeBus-COL-06-UpperBounds-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 SafeBus-COL-06-UpperBounds-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 6
sara: try reading problem file /home/mcc/execution/375/UpperBounds-4.sara.
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 4/3599 0/5 SafeBus-COL-06-UpperBounds-03 229706 t fired, 1 attempts, .
4 BOUND STEQ 5/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 5/3599 1/32 SafeBus-COL-06-UpperBounds-03 200162 m, 40032 m/sec, 527355 t fired, result in [5,6] .

Time elapsed: 6 secs. Pages in use: 1
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 10/3599 0/5 SafeBus-COL-06-UpperBounds-03 483020 t fired, 1 attempts, .
4 BOUND STEQ 10/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 10/3599 2/32 SafeBus-COL-06-UpperBounds-03 393709 m, 38709 m/sec, 1093252 t fired, result in [5,6] .

Time elapsed: 11 secs. Pages in use: 2
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 15/3599 0/5 SafeBus-COL-06-UpperBounds-03 734561 t fired, 1 attempts, .
4 BOUND STEQ 15/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 15/3599 3/32 SafeBus-COL-06-UpperBounds-03 579432 m, 37144 m/sec, 1651451 t fired, result in [5,6] .

Time elapsed: 16 secs. Pages in use: 3
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 20/3599 0/5 SafeBus-COL-06-UpperBounds-03 985417 t fired, 1 attempts, .
4 BOUND STEQ 20/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 20/3599 4/32 SafeBus-COL-06-UpperBounds-03 764274 m, 36968 m/sec, 2219690 t fired, result in [5,6] .

Time elapsed: 21 secs. Pages in use: 4
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 25/3599 0/5 SafeBus-COL-06-UpperBounds-03 1242788 t fired, 2 attempts, .
4 BOUND STEQ 25/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 25/3599 5/32 SafeBus-COL-06-UpperBounds-03 946781 m, 36501 m/sec, 2793998 t fired, result in [5,6] .

Time elapsed: 26 secs. Pages in use: 5
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 30/3599 0/5 SafeBus-COL-06-UpperBounds-03 1491947 t fired, 2 attempts, .
4 BOUND STEQ 30/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 30/3599 5/32 SafeBus-COL-06-UpperBounds-03 1119080 m, 34459 m/sec, 3339916 t fired, result in [5,6] .

Time elapsed: 31 secs. Pages in use: 5
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 35/3599 0/5 SafeBus-COL-06-UpperBounds-03 1744822 t fired, 2 attempts, .
4 BOUND STEQ 35/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 35/3599 6/32 SafeBus-COL-06-UpperBounds-03 1296542 m, 35492 m/sec, 3918680 t fired, result in [5,6] .

Time elapsed: 36 secs. Pages in use: 6
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 40/3599 0/5 SafeBus-COL-06-UpperBounds-03 1997649 t fired, 2 attempts, .
4 BOUND STEQ 40/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 40/3599 7/32 SafeBus-COL-06-UpperBounds-03 1469833 m, 34658 m/sec, 4489146 t fired, result in [5,6] .

Time elapsed: 41 secs. Pages in use: 7
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 45/3599 0/5 SafeBus-COL-06-UpperBounds-03 2257289 t fired, 3 attempts, .
4 BOUND STEQ 45/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 45/3599 8/32 SafeBus-COL-06-UpperBounds-03 1639838 m, 34001 m/sec, 5054356 t fired, result in [5,6] .

Time elapsed: 46 secs. Pages in use: 8
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 50/3599 0/5 SafeBus-COL-06-UpperBounds-03 2516647 t fired, 3 attempts, .
4 BOUND STEQ 50/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 50/3599 8/32 SafeBus-COL-06-UpperBounds-03 1811071 m, 34246 m/sec, 5626929 t fired, result in [5,6] .

Time elapsed: 51 secs. Pages in use: 8
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 55/3599 0/5 SafeBus-COL-06-UpperBounds-03 2758123 t fired, 3 attempts, .
4 BOUND STEQ 55/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 55/3599 9/32 SafeBus-COL-06-UpperBounds-03 1981973 m, 34180 m/sec, 6204445 t fired, result in [5,6] .

Time elapsed: 56 secs. Pages in use: 9
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 60/3599 0/5 SafeBus-COL-06-UpperBounds-03 2996332 t fired, 3 attempts, .
4 BOUND STEQ 60/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 60/3599 10/32 SafeBus-COL-06-UpperBounds-03 2151480 m, 33901 m/sec, 6785916 t fired, result in [5,6] .

Time elapsed: 61 secs. Pages in use: 10
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 65/3599 0/5 SafeBus-COL-06-UpperBounds-03 3245569 t fired, 4 attempts, .
4 BOUND STEQ 65/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 65/3599 10/32 SafeBus-COL-06-UpperBounds-03 2316428 m, 32989 m/sec, 7357062 t fired, result in [5,6] .

Time elapsed: 66 secs. Pages in use: 10
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 70/3599 0/5 SafeBus-COL-06-UpperBounds-03 3505012 t fired, 4 attempts, .
4 BOUND STEQ 70/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 70/3599 11/32 SafeBus-COL-06-UpperBounds-03 2481675 m, 33049 m/sec, 7931978 t fired, result in [5,6] .

Time elapsed: 71 secs. Pages in use: 11
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 75/3599 0/5 SafeBus-COL-06-UpperBounds-03 3763853 t fired, 4 attempts, .
4 BOUND STEQ 75/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 75/3599 12/32 SafeBus-COL-06-UpperBounds-03 2647341 m, 33133 m/sec, 8521743 t fired, result in [5,6] .

Time elapsed: 76 secs. Pages in use: 12
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 80/3599 0/5 SafeBus-COL-06-UpperBounds-03 4019548 t fired, 5 attempts, .
4 BOUND STEQ 80/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 80/3599 12/32 SafeBus-COL-06-UpperBounds-03 2813896 m, 33311 m/sec, 9125174 t fired, result in [5,6] .

Time elapsed: 81 secs. Pages in use: 12
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 85/3599 0/5 SafeBus-COL-06-UpperBounds-03 4282686 t fired, 5 attempts, .
4 BOUND STEQ 85/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 85/3599 13/32 SafeBus-COL-06-UpperBounds-03 2973534 m, 31927 m/sec, 9712000 t fired, result in [5,6] .

Time elapsed: 86 secs. Pages in use: 13
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 90/3599 0/5 SafeBus-COL-06-UpperBounds-03 4548429 t fired, 5 attempts, .
4 BOUND STEQ 90/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 90/3599 14/32 SafeBus-COL-06-UpperBounds-03 3131015 m, 31496 m/sec, 10304378 t fired, result in [5,6] .

Time elapsed: 91 secs. Pages in use: 14
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 95/3599 0/5 SafeBus-COL-06-UpperBounds-03 4807790 t fired, 5 attempts, .
4 BOUND STEQ 95/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 95/3599 14/32 SafeBus-COL-06-UpperBounds-03 3290931 m, 31983 m/sec, 10905187 t fired, result in [5,6] .

Time elapsed: 96 secs. Pages in use: 14
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 100/3599 0/5 SafeBus-COL-06-UpperBounds-03 5063181 t fired, 6 attempts, .
4 BOUND STEQ 100/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 100/3599 15/32 SafeBus-COL-06-UpperBounds-03 3452800 m, 32373 m/sec, 11516880 t fired, result in [5,6] .

Time elapsed: 101 secs. Pages in use: 15
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 105/3599 0/5 SafeBus-COL-06-UpperBounds-03 5317706 t fired, 6 attempts, .
4 BOUND STEQ 105/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 105/3599 15/32 SafeBus-COL-06-UpperBounds-03 3605702 m, 30580 m/sec, 12099122 t fired, result in [5,6] .

Time elapsed: 106 secs. Pages in use: 15
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 110/3599 0/5 SafeBus-COL-06-UpperBounds-03 5571951 t fired, 6 attempts, .
4 BOUND STEQ 110/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 110/3599 16/32 SafeBus-COL-06-UpperBounds-03 3756158 m, 30091 m/sec, 12691359 t fired, result in [5,6] .

Time elapsed: 111 secs. Pages in use: 16
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 115/3599 0/5 SafeBus-COL-06-UpperBounds-03 5823589 t fired, 6 attempts, .
4 BOUND STEQ 115/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 115/3599 17/32 SafeBus-COL-06-UpperBounds-03 3907511 m, 30270 m/sec, 13296144 t fired, result in [5,6] .

Time elapsed: 116 secs. Pages in use: 17
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 120/3599 0/5 SafeBus-COL-06-UpperBounds-03 6077325 t fired, 7 attempts, .
4 BOUND STEQ 120/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 120/3599 17/32 SafeBus-COL-06-UpperBounds-03 4058062 m, 30110 m/sec, 13898401 t fired, result in [5,6] .

Time elapsed: 121 secs. Pages in use: 17
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 125/3599 0/5 SafeBus-COL-06-UpperBounds-03 6331431 t fired, 7 attempts, .
4 BOUND STEQ 125/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 125/3599 18/32 SafeBus-COL-06-UpperBounds-03 4207412 m, 29870 m/sec, 14506719 t fired, result in [5,6] .

Time elapsed: 126 secs. Pages in use: 18
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 130/3599 0/5 SafeBus-COL-06-UpperBounds-03 6585650 t fired, 7 attempts, .
4 BOUND STEQ 130/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 130/3599 18/32 SafeBus-COL-06-UpperBounds-03 4355674 m, 29652 m/sec, 15097000 t fired, result in [5,6] .

Time elapsed: 131 secs. Pages in use: 18
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 135/3599 0/5 SafeBus-COL-06-UpperBounds-03 6839965 t fired, 7 attempts, .
4 BOUND STEQ 135/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 135/3599 19/32 SafeBus-COL-06-UpperBounds-03 4503383 m, 29541 m/sec, 15696011 t fired, result in [5,6] .

Time elapsed: 136 secs. Pages in use: 19
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 140/3599 0/5 SafeBus-COL-06-UpperBounds-03 7093092 t fired, 8 attempts, .
4 BOUND STEQ 140/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 140/3599 20/32 SafeBus-COL-06-UpperBounds-03 4650982 m, 29519 m/sec, 16301991 t fired, result in [5,6] .

Time elapsed: 141 secs. Pages in use: 20
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 145/3599 0/5 SafeBus-COL-06-UpperBounds-03 7346796 t fired, 8 attempts, .
4 BOUND STEQ 145/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 145/3599 20/32 SafeBus-COL-06-UpperBounds-03 4797277 m, 29259 m/sec, 16935230 t fired, result in [5,6] .

Time elapsed: 146 secs. Pages in use: 20
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 150/3599 0/5 SafeBus-COL-06-UpperBounds-03 7600559 t fired, 8 attempts, .
4 BOUND STEQ 150/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 150/3599 21/32 SafeBus-COL-06-UpperBounds-03 4939922 m, 28529 m/sec, 17567765 t fired, result in [5,6] .

Time elapsed: 151 secs. Pages in use: 21
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 155/3599 0/5 SafeBus-COL-06-UpperBounds-03 7851479 t fired, 8 attempts, .
4 BOUND STEQ 155/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 155/3599 21/32 SafeBus-COL-06-UpperBounds-03 5078256 m, 27666 m/sec, 18331393 t fired, result in [5,6] .

Time elapsed: 156 secs. Pages in use: 21
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 160/3599 0/5 SafeBus-COL-06-UpperBounds-03 8102035 t fired, 9 attempts, .
4 BOUND STEQ 160/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 160/3599 22/32 SafeBus-COL-06-UpperBounds-03 5221920 m, 28732 m/sec, 19100259 t fired, result in [5,6] .

Time elapsed: 161 secs. Pages in use: 22
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 165/3599 0/5 SafeBus-COL-06-UpperBounds-03 8355439 t fired, 9 attempts, .
4 BOUND STEQ 165/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 165/3599 22/32 SafeBus-COL-06-UpperBounds-03 5358036 m, 27223 m/sec, 19957373 t fired, result in [5,6] .

Time elapsed: 166 secs. Pages in use: 22
# running tasks: 3 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SafeBus-COL-06-UpperBounds-03: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 170/3599 0/5 SafeBus-COL-06-UpperBounds-03 8607884 t fired, 9 attempts, .
4 BOUND STEQ 170/3599 0/5 SafeBus-COL-06-UpperBounds-03 --
5 BOUND EXCL 170/3599 22/32 SafeBus-COL-06-UpperBounds-03 5403999 m, 9192 m/sec, 21234282 t fired, result in [5,6] .

Time elapsed: 171 secs. Pages in use: 22
# running tasks: 3 of 4 Visible: 1
lola: REPORT NUM
lola: FINISHED task # 5 (type EXCL) for SafeBus-COL-06-UpperBounds-03
lola: markings : 5410524
lola: fired transitions : 22574304
lola: time used : 174.000000
lola: memory pages used : 23
lola: CANCELED task # 3 (type FNDP) for SafeBus-COL-06-UpperBounds-03 (obsolete)
lola: CANCELED task # 4 (type EQUN) for SafeBus-COL-06-UpperBounds-03 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SafeBus-COL-06-UpperBounds-03: BOUND 5 state space


Time elapsed: 175 secs. Pages in use: 23

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="SafeBus-COL-06"
export BK_EXAMINATION="UpperBounds"
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 SafeBus-COL-06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r359-smll-167891808600213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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