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-167863538500613.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-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538500613
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 29K Feb 25 22:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Feb 25 22:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 22:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 194K Feb 25 22:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 93K Feb 25 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 439K Feb 25 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 283K Feb 25 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K 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 143K 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 Peterson-PT-3-UpperBounds-00
FORMULA_NAME Peterson-PT-3-UpperBounds-01
FORMULA_NAME Peterson-PT-3-UpperBounds-02
FORMULA_NAME Peterson-PT-3-UpperBounds-03
FORMULA_NAME Peterson-PT-3-UpperBounds-04
FORMULA_NAME Peterson-PT-3-UpperBounds-05
FORMULA_NAME Peterson-PT-3-UpperBounds-06
FORMULA_NAME Peterson-PT-3-UpperBounds-07
FORMULA_NAME Peterson-PT-3-UpperBounds-08
FORMULA_NAME Peterson-PT-3-UpperBounds-09
FORMULA_NAME Peterson-PT-3-UpperBounds-10
FORMULA_NAME Peterson-PT-3-UpperBounds-11
FORMULA_NAME Peterson-PT-3-UpperBounds-12
FORMULA_NAME Peterson-PT-3-UpperBounds-13
FORMULA_NAME Peterson-PT-3-UpperBounds-14
FORMULA_NAME Peterson-PT-3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678856669135

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=Peterson-PT-3
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 05:04:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 05:04:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 05:04:32] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-15 05:04:32] [INFO ] Transformed 244 places.
[2023-03-15 05:04:32] [INFO ] Transformed 332 transitions.
[2023-03-15 05:04:32] [INFO ] Found NUPN structural information;
[2023-03-15 05:04:32] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2023-03-15 05:04:32] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
FORMULA Peterson-PT-3-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 308 out of 332 initially.
// Phase 1: matrix 308 rows 244 cols
[2023-03-15 05:04:32] [INFO ] Computed 15 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :23
FORMULA Peterson-PT-3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :20
[2023-03-15 05:04:32] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-15 05:04:32] [INFO ] Computed 15 place invariants in 15 ms
[2023-03-15 05:04:32] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned unsat
[2023-03-15 05:04:32] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned unsat
[2023-03-15 05:04:33] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned unsat
[2023-03-15 05:04:33] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-15 05:04:33] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-15 05:04:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:04:33] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-15 05:04:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:04:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-15 05:04:33] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 05:04:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:04:33] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-15 05:04:33] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-15 05:04:33] [INFO ] [Nat]Added 57 Read/Feed constraints in 16 ms returned sat
[2023-03-15 05:04:33] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 4 ms to minimize.
[2023-03-15 05:04:33] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 2 ms to minimize.
[2023-03-15 05:04:34] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2023-03-15 05:04:34] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2023-03-15 05:04:34] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2023-03-15 05:04:34] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 2 ms to minimize.
[2023-03-15 05:04:34] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2023-03-15 05:04:34] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2023-03-15 05:04:34] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 1 ms to minimize.
[2023-03-15 05:04:35] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2023-03-15 05:04:35] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 0 ms to minimize.
[2023-03-15 05:04:35] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 0 ms to minimize.
[2023-03-15 05:04:35] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2023-03-15 05:04:35] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2023-03-15 05:04:35] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2023-03-15 05:04:36] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2023-03-15 05:04:36] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 0 ms to minimize.
[2023-03-15 05:04:36] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2023-03-15 05:04:36] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2023-03-15 05:04:36] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2023-03-15 05:04:36] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2023-03-15 05:04:36] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2023-03-15 05:04:36] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2023-03-15 05:04:37] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2023-03-15 05:04:37] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2023-03-15 05:04:37] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 1 ms to minimize.
[2023-03-15 05:04:37] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 1 ms to minimize.
[2023-03-15 05:04:37] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 0 ms to minimize.
[2023-03-15 05:04:37] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 0 ms to minimize.
[2023-03-15 05:04:37] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2023-03-15 05:04:37] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2023-03-15 05:04:37] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 0 ms to minimize.
[2023-03-15 05:04:37] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 0 ms to minimize.
[2023-03-15 05:04:38] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2023-03-15 05:04:38] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2023-03-15 05:04:38] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 4717 ms
[2023-03-15 05:04:38] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned unsat
[2023-03-15 05:04:38] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-15 05:04:38] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 05:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:04:38] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2023-03-15 05:04:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:04:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 05:04:38] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 05:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:04:38] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-15 05:04:38] [INFO ] [Nat]Added 57 Read/Feed constraints in 18 ms returned sat
[2023-03-15 05:04:39] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2023-03-15 05:04:39] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-15 05:04:39] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2023-03-15 05:04:39] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2023-03-15 05:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 437 ms
[2023-03-15 05:04:39] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-15 05:04:39] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-15 05:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:04:39] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2023-03-15 05:04:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:04:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-15 05:04:39] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 05:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:04:39] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-15 05:04:39] [INFO ] [Nat]Added 57 Read/Feed constraints in 12 ms returned sat
[2023-03-15 05:04:39] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 26 ms.
[2023-03-15 05:04:40] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2023-03-15 05:04:40] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2023-03-15 05:04:40] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2023-03-15 05:04:40] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2023-03-15 05:04:40] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2023-03-15 05:04:41] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2023-03-15 05:04:41] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2023-03-15 05:04:41] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2023-03-15 05:04:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 913 ms
[2023-03-15 05:04:41] [INFO ] Added : 163 causal constraints over 34 iterations in 1811 ms. Result :sat
Minimization took 90 ms.
[2023-03-15 05:04:41] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-15 05:04:41] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 05:04:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:04:41] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-15 05:04:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:04:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-15 05:04:41] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 05:04:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:04:42] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-03-15 05:04:42] [INFO ] [Nat]Added 57 Read/Feed constraints in 14 ms returned sat
[2023-03-15 05:04:42] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 24 ms.
[2023-03-15 05:04:42] [INFO ] Added : 10 causal constraints over 2 iterations in 96 ms. Result :sat
Minimization took 35 ms.
[2023-03-15 05:04:42] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-15 05:04:42] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 05:04:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:04:42] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-03-15 05:04:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:04:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-15 05:04:42] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 05:04:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:04:42] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-15 05:04:42] [INFO ] [Nat]Added 57 Read/Feed constraints in 15 ms returned sat
[2023-03-15 05:04:42] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 26 ms.
[2023-03-15 05:04:42] [INFO ] Added : 12 causal constraints over 3 iterations in 111 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [4, 4, 4, 4, 4, 3, 1, 1, 1] Max seen :[4, 4, 4, 1, 4, 3, 0, 0, 0]
FORMULA Peterson-PT-3-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 244 transition count 239
Reduce places removed 93 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 187 place count 151 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 188 place count 150 transition count 238
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 188 place count 150 transition count 194
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 276 place count 106 transition count 194
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 300 place count 94 transition count 182
Applied a total of 300 rules in 63 ms. Remains 94 /244 variables (removed 150) and now considering 182/332 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 94/244 places, 182/332 transitions.
Normalized transition count is 158 out of 182 initially.
// Phase 1: matrix 158 rows 94 cols
[2023-03-15 05:04:42] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1211 ms. (steps per millisecond=825 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=1976 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 528 ms. (steps per millisecond=1893 ) properties (out of 2) seen :1
[2023-03-15 05:04:45] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 94 cols
[2023-03-15 05:04:45] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-15 05:04:45] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-15 05:04:45] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 05:04:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:04:45] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-15 05:04:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:04:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-15 05:04:45] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-15 05:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:04:45] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-15 05:04:45] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-15 05:04:45] [INFO ] [Nat]Added 57 Read/Feed constraints in 10 ms returned sat
[2023-03-15 05:04:45] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2023-03-15 05:04:45] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2023-03-15 05:04:45] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2023-03-15 05:04:45] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2023-03-15 05:04:45] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2023-03-15 05:04:45] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2023-03-15 05:04:45] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2023-03-15 05:04:45] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2023-03-15 05:04:46] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-15 05:04:46] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 16 ms to minimize.
[2023-03-15 05:04:46] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2023-03-15 05:04:46] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2023-03-15 05:04:46] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2023-03-15 05:04:46] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2023-03-15 05:04:46] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2023-03-15 05:04:46] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2023-03-15 05:04:46] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2023-03-15 05:04:46] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2023-03-15 05:04:46] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
[2023-03-15 05:04:46] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2023-03-15 05:04:46] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2023-03-15 05:04:46] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2023-03-15 05:04:46] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2023-03-15 05:04:47] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2023-03-15 05:04:47] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2023-03-15 05:04:47] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2023-03-15 05:04:47] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2023-03-15 05:04:47] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2023-03-15 05:04:47] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-15 05:04:47] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2023-03-15 05:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 30 trap constraints in 2276 ms
[2023-03-15 05:04:47] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 05:04:47] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-15 05:04:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:04:47] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-15 05:04:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:04:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-15 05:04:47] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 05:04:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:04:47] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-15 05:04:47] [INFO ] [Nat]Added 57 Read/Feed constraints in 7 ms returned sat
[2023-03-15 05:04:47] [INFO ] Computed and/alt/rep : 133/335/133 causal constraints (skipped 21 transitions) in 13 ms.
[2023-03-15 05:04:48] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2023-03-15 05:04:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-15 05:04:48] [INFO ] Added : 33 causal constraints over 7 iterations in 177 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[1, 0]
FORMULA Peterson-PT-3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 94 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 181/181 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 93 transition count 179
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 1 place count 93 transition count 175
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 9 place count 89 transition count 175
Applied a total of 9 rules in 13 ms. Remains 89 /94 variables (removed 5) and now considering 175/181 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 89/94 places, 175/181 transitions.
Normalized transition count is 151 out of 175 initially.
// Phase 1: matrix 151 rows 89 cols
[2023-03-15 05:04:48] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1009 ms. (steps per millisecond=991 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=2551 ) properties (out of 1) seen :0
[2023-03-15 05:04:49] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 89 cols
[2023-03-15 05:04:49] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-15 05:04:49] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 05:04:49] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 05:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:04:49] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-15 05:04:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:04:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 05:04:49] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 05:04:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:04:49] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-15 05:04:49] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-15 05:04:49] [INFO ] [Nat]Added 56 Read/Feed constraints in 7 ms returned sat
[2023-03-15 05:04:49] [INFO ] Computed and/alt/rep : 127/335/127 causal constraints (skipped 20 transitions) in 14 ms.
[2023-03-15 05:04:50] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2023-03-15 05:04:50] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2023-03-15 05:04:50] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2023-03-15 05:04:50] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2023-03-15 05:04:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 193 ms
[2023-03-15 05:04:50] [INFO ] Added : 84 causal constraints over 17 iterations in 447 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA Peterson-PT-3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 18383 ms.
ITS solved all properties within timeout

BK_STOP 1678856691286

--------------------
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

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

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