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.r298-tall-167873951900557.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 marciexred
Input is PolyORBLF-PT-S04J04T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951900557
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 27K Feb 26 13:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 13:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 101K Feb 26 13:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 457K Feb 26 13:39 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:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Feb 26 13:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 26 13:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 196K Feb 26 13:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 805K Feb 26 13:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 PolyORBLF-PT-S04J04T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679587837959

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 16:10:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 16:10:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 16:10:39] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2023-03-23 16:10:39] [INFO ] Transformed 870 places.
[2023-03-23 16:10:39] [INFO ] Transformed 5034 transitions.
[2023-03-23 16:10:39] [INFO ] Parsed PT model containing 870 places and 5034 transitions and 34774 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Normalized transition count is 2284 out of 2324 initially.
// Phase 1: matrix 2284 rows 870 cols
[2023-03-23 16:10:40] [INFO ] Computed 58 place invariants in 146 ms
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 14) seen :28
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :21
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :21
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :18
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :22
[2023-03-23 16:10:40] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 870 cols
[2023-03-23 16:10:40] [INFO ] Computed 58 place invariants in 87 ms
[2023-03-23 16:10:41] [INFO ] [Real]Absence check using 16 positive place invariants in 31 ms returned sat
[2023-03-23 16:10:41] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 18 ms returned unsat
[2023-03-23 16:10:41] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2023-03-23 16:10:41] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 24 ms returned unsat
[2023-03-23 16:10:41] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2023-03-23 16:10:41] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 28 ms returned unsat
[2023-03-23 16:10:41] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2023-03-23 16:10:41] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 26 ms returned unsat
[2023-03-23 16:10:41] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2023-03-23 16:10:41] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 28 ms returned unsat
[2023-03-23 16:10:41] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2023-03-23 16:10:41] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 24 ms returned unsat
[2023-03-23 16:10:42] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2023-03-23 16:10:42] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 27 ms returned unsat
[2023-03-23 16:10:42] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2023-03-23 16:10:42] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 32 ms returned sat
[2023-03-23 16:10:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:10:44] [INFO ] [Real]Absence check using state equation in 2268 ms returned sat
[2023-03-23 16:10:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:10:44] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2023-03-23 16:10:44] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 27 ms returned sat
[2023-03-23 16:10:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:10:49] [INFO ] [Nat]Absence check using state equation in 4890 ms returned unknown
[2023-03-23 16:10:49] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2023-03-23 16:10:49] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 30 ms returned unsat
[2023-03-23 16:10:49] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2023-03-23 16:10:49] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 19 ms returned unsat
[2023-03-23 16:10:49] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2023-03-23 16:10:49] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 41 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 4, 1, 4, 1, 1, -1, 1, 4, 1] Max seen :[4, 1, 4, 1, 4, 1, 1, 1, 1, 4, 1]
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 870 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 866 transition count 2234
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 184 place count 776 transition count 2234
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 184 place count 776 transition count 2134
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 384 place count 676 transition count 2134
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 584 place count 576 transition count 2034
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 604 place count 576 transition count 2014
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 624 place count 556 transition count 2014
Applied a total of 624 rules in 411 ms. Remains 556 /870 variables (removed 314) and now considering 2014/2324 (removed 310) transitions.
[2023-03-23 16:10:50] [INFO ] Flow matrix only has 1974 transitions (discarded 40 similar events)
// Phase 1: matrix 1974 rows 556 cols
[2023-03-23 16:10:50] [INFO ] Computed 54 place invariants in 37 ms
[2023-03-23 16:10:51] [INFO ] Dead Transitions using invariants and state equation in 1203 ms found 540 transitions.
Found 540 dead transitions using SMT.
Drop transitions removed 540 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 540 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 556/870 places, 1474/2324 transitions.
Applied a total of 0 rules in 33 ms. Remains 556 /556 variables (removed 0) and now considering 1474/1474 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1650 ms. Remains : 556/870 places, 1474/2324 transitions.
Normalized transition count is 1434 out of 1474 initially.
// Phase 1: matrix 1434 rows 556 cols
[2023-03-23 16:10:51] [INFO ] Computed 54 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 67 resets, run finished after 6202 ms. (steps per millisecond=161 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2164 ms. (steps per millisecond=462 ) properties (out of 1) seen :1
[2023-03-23 16:11:00] [INFO ] Flow matrix only has 1434 transitions (discarded 40 similar events)
// Phase 1: matrix 1434 rows 556 cols
[2023-03-23 16:11:00] [INFO ] Computed 54 place invariants in 31 ms
[2023-03-23 16:11:00] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-23 16:11:00] [INFO ] [Real]Absence check using 12 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-23 16:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:11:01] [INFO ] [Real]Absence check using state equation in 1350 ms returned sat
[2023-03-23 16:11:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:11:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-23 16:11:01] [INFO ] [Nat]Absence check using 12 positive and 42 generalized place invariants in 18 ms returned sat
[2023-03-23 16:11:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:11:07] [INFO ] [Nat]Absence check using state equation in 5838 ms returned sat
[2023-03-23 16:11:07] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-23 16:11:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 16:11:13] [INFO ] [Nat]Added 200 Read/Feed constraints in 6014 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[1]
Support contains 1 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1474/1474 transitions.
Applied a total of 0 rules in 32 ms. Remains 556 /556 variables (removed 0) and now considering 1474/1474 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 556/556 places, 1474/1474 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1474/1474 transitions.
Applied a total of 0 rules in 29 ms. Remains 556 /556 variables (removed 0) and now considering 1474/1474 (removed 0) transitions.
[2023-03-23 16:11:13] [INFO ] Flow matrix only has 1434 transitions (discarded 40 similar events)
[2023-03-23 16:11:13] [INFO ] Invariant cache hit.
[2023-03-23 16:11:14] [INFO ] Implicit Places using invariants in 711 ms returned [104, 177, 223, 224, 247, 319, 335, 397, 458, 550]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 716 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 546/556 places, 1474/1474 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 540 transition count 1468
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 540 transition count 1468
Applied a total of 12 rules in 50 ms. Remains 540 /546 variables (removed 6) and now considering 1468/1474 (removed 6) transitions.
[2023-03-23 16:11:14] [INFO ] Flow matrix only has 1428 transitions (discarded 40 similar events)
// Phase 1: matrix 1428 rows 540 cols
[2023-03-23 16:11:14] [INFO ] Computed 44 place invariants in 26 ms
[2023-03-23 16:11:15] [INFO ] Implicit Places using invariants in 692 ms returned []
[2023-03-23 16:11:15] [INFO ] Flow matrix only has 1428 transitions (discarded 40 similar events)
[2023-03-23 16:11:15] [INFO ] Invariant cache hit.
[2023-03-23 16:11:15] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-23 16:11:33] [INFO ] Implicit Places using invariants and state equation in 18137 ms returned []
Implicit Place search using SMT with State Equation took 18832 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 540/556 places, 1468/1474 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19627 ms. Remains : 540/556 places, 1468/1474 transitions.
Normalized transition count is 1428 out of 1468 initially.
// Phase 1: matrix 1428 rows 540 cols
[2023-03-23 16:11:33] [INFO ] Computed 44 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 55 resets, run finished after 5844 ms. (steps per millisecond=171 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2020 ms. (steps per millisecond=495 ) properties (out of 1) seen :1
[2023-03-23 16:11:41] [INFO ] Flow matrix only has 1428 transitions (discarded 40 similar events)
// Phase 1: matrix 1428 rows 540 cols
[2023-03-23 16:11:41] [INFO ] Computed 44 place invariants in 28 ms
[2023-03-23 16:11:41] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-23 16:11:41] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 21 ms returned sat
[2023-03-23 16:11:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:11:42] [INFO ] [Real]Absence check using state equation in 1319 ms returned sat
[2023-03-23 16:11:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:11:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-23 16:11:42] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 19 ms returned sat
[2023-03-23 16:11:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:11:44] [INFO ] [Nat]Absence check using state equation in 1779 ms returned sat
[2023-03-23 16:11:44] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-23 16:11:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 16:11:50] [INFO ] [Nat]Added 200 Read/Feed constraints in 6021 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[1]
Support contains 1 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1468/1468 transitions.
Applied a total of 0 rules in 38 ms. Remains 540 /540 variables (removed 0) and now considering 1468/1468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 540/540 places, 1468/1468 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1468/1468 transitions.
Applied a total of 0 rules in 31 ms. Remains 540 /540 variables (removed 0) and now considering 1468/1468 (removed 0) transitions.
[2023-03-23 16:11:50] [INFO ] Flow matrix only has 1428 transitions (discarded 40 similar events)
[2023-03-23 16:11:50] [INFO ] Invariant cache hit.
[2023-03-23 16:11:51] [INFO ] Implicit Places using invariants in 679 ms returned []
[2023-03-23 16:11:51] [INFO ] Flow matrix only has 1428 transitions (discarded 40 similar events)
[2023-03-23 16:11:51] [INFO ] Invariant cache hit.
[2023-03-23 16:11:51] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-23 16:12:08] [INFO ] Implicit Places using invariants and state equation in 17106 ms returned []
Implicit Place search using SMT with State Equation took 17789 ms to find 0 implicit places.
[2023-03-23 16:12:08] [INFO ] Redundant transitions in 91 ms returned []
[2023-03-23 16:12:08] [INFO ] Flow matrix only has 1428 transitions (discarded 40 similar events)
[2023-03-23 16:12:08] [INFO ] Invariant cache hit.
[2023-03-23 16:12:09] [INFO ] Dead Transitions using invariants and state equation in 1087 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19015 ms. Remains : 540/540 places, 1468/1468 transitions.
Starting property specific reduction for PolyORBLF-PT-S04J04T10-UpperBounds-09
Normalized transition count is 1428 out of 1468 initially.
// Phase 1: matrix 1428 rows 540 cols
[2023-03-23 16:12:09] [INFO ] Computed 44 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :1
[2023-03-23 16:12:09] [INFO ] Flow matrix only has 1428 transitions (discarded 40 similar events)
// Phase 1: matrix 1428 rows 540 cols
[2023-03-23 16:12:09] [INFO ] Computed 44 place invariants in 22 ms
[2023-03-23 16:12:09] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-23 16:12:09] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 25 ms returned sat
[2023-03-23 16:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:12:11] [INFO ] [Real]Absence check using state equation in 1299 ms returned sat
[2023-03-23 16:12:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:12:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-23 16:12:11] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 21 ms returned sat
[2023-03-23 16:12:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:12:13] [INFO ] [Nat]Absence check using state equation in 1843 ms returned sat
[2023-03-23 16:12:13] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-23 16:12:16] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 16:12:16] [INFO ] [Nat]Added 200 Read/Feed constraints in 3064 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1468/1468 transitions.
Applied a total of 0 rules in 33 ms. Remains 540 /540 variables (removed 0) and now considering 1468/1468 (removed 0) transitions.
[2023-03-23 16:12:16] [INFO ] Flow matrix only has 1428 transitions (discarded 40 similar events)
[2023-03-23 16:12:16] [INFO ] Invariant cache hit.
[2023-03-23 16:12:17] [INFO ] Dead Transitions using invariants and state equation in 1050 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1085 ms. Remains : 540/540 places, 1468/1468 transitions.
Normalized transition count is 1428 out of 1468 initially.
// Phase 1: matrix 1428 rows 540 cols
[2023-03-23 16:12:17] [INFO ] Computed 44 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 86 resets, run finished after 5867 ms. (steps per millisecond=170 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1997 ms. (steps per millisecond=500 ) properties (out of 1) seen :1
[2023-03-23 16:12:25] [INFO ] Flow matrix only has 1428 transitions (discarded 40 similar events)
// Phase 1: matrix 1428 rows 540 cols
[2023-03-23 16:12:25] [INFO ] Computed 44 place invariants in 26 ms
[2023-03-23 16:12:25] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-23 16:12:25] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 27 ms returned sat
[2023-03-23 16:12:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:12:26] [INFO ] [Real]Absence check using state equation in 1303 ms returned sat
[2023-03-23 16:12:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:12:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-23 16:12:26] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 31 ms returned sat
[2023-03-23 16:12:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:12:28] [INFO ] [Nat]Absence check using state equation in 1919 ms returned sat
[2023-03-23 16:12:28] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-23 16:12:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 16:12:34] [INFO ] [Nat]Added 200 Read/Feed constraints in 5937 ms returned sat
[2023-03-23 16:12:34] [INFO ] Computed and/alt/rep : 604/2744/574 causal constraints (skipped 850 transitions) in 113 ms.
[2023-03-23 16:12:36] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 4 ms to minimize.
[2023-03-23 16:12:37] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 1 ms to minimize.
[2023-03-23 16:12:38] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2023-03-23 16:12:38] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2023-03-23 16:12:39] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2023-03-23 16:12:39] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 0 ms to minimize.
[2023-03-23 16:12:40] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2023-03-23 16:12:40] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2023-03-23 16:12:41] [INFO ] Deduced a trap composed of 289 places in 280 ms of which 1 ms to minimize.
[2023-03-23 16:12:41] [INFO ] Deduced a trap composed of 253 places in 252 ms of which 1 ms to minimize.
[2023-03-23 16:12:41] [INFO ] Deduced a trap composed of 257 places in 261 ms of which 0 ms to minimize.
[2023-03-23 16:12:42] [INFO ] Deduced a trap composed of 302 places in 269 ms of which 0 ms to minimize.
[2023-03-23 16:12:42] [INFO ] Deduced a trap composed of 248 places in 278 ms of which 1 ms to minimize.
[2023-03-23 16:12:42] [INFO ] Deduced a trap composed of 249 places in 277 ms of which 1 ms to minimize.
[2023-03-23 16:12:43] [INFO ] Deduced a trap composed of 218 places in 248 ms of which 3 ms to minimize.
[2023-03-23 16:12:43] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 1 ms to minimize.
[2023-03-23 16:12:43] [INFO ] Deduced a trap composed of 242 places in 258 ms of which 1 ms to minimize.
[2023-03-23 16:12:44] [INFO ] Deduced a trap composed of 264 places in 267 ms of which 0 ms to minimize.
[2023-03-23 16:12:44] [INFO ] Deduced a trap composed of 271 places in 264 ms of which 1 ms to minimize.
[2023-03-23 16:12:47] [INFO ] Deduced a trap composed of 259 places in 273 ms of which 1 ms to minimize.
[2023-03-23 16:12:47] [INFO ] Deduced a trap composed of 253 places in 265 ms of which 1 ms to minimize.
[2023-03-23 16:12:49] [INFO ] Deduced a trap composed of 238 places in 259 ms of which 1 ms to minimize.
[2023-03-23 16:12:50] [INFO ] Deduced a trap composed of 264 places in 250 ms of which 1 ms to minimize.
[2023-03-23 16:12:50] [INFO ] Deduced a trap composed of 271 places in 248 ms of which 0 ms to minimize.
[2023-03-23 16:12:50] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 0 ms to minimize.
[2023-03-23 16:12:51] [INFO ] Deduced a trap composed of 259 places in 251 ms of which 1 ms to minimize.
[2023-03-23 16:12:53] [INFO ] Deduced a trap composed of 246 places in 275 ms of which 1 ms to minimize.
[2023-03-23 16:12:53] [INFO ] Deduced a trap composed of 261 places in 263 ms of which 0 ms to minimize.
[2023-03-23 16:12:53] [INFO ] Deduced a trap composed of 270 places in 263 ms of which 1 ms to minimize.
[2023-03-23 16:12:54] [INFO ] Deduced a trap composed of 262 places in 260 ms of which 1 ms to minimize.
[2023-03-23 16:12:54] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 0 ms to minimize.
[2023-03-23 16:12:54] [INFO ] Deduced a trap composed of 256 places in 274 ms of which 0 ms to minimize.
[2023-03-23 16:12:55] [INFO ] Deduced a trap composed of 271 places in 262 ms of which 0 ms to minimize.
[2023-03-23 16:12:55] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 19154 ms
[2023-03-23 16:12:58] [INFO ] Added : 34 causal constraints over 7 iterations in 23764 ms.(timeout) Result :sat
Minimization took 2614 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1468/1468 transitions.
Applied a total of 0 rules in 26 ms. Remains 540 /540 variables (removed 0) and now considering 1468/1468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 540/540 places, 1468/1468 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1468/1468 transitions.
Applied a total of 0 rules in 26 ms. Remains 540 /540 variables (removed 0) and now considering 1468/1468 (removed 0) transitions.
[2023-03-23 16:13:03] [INFO ] Flow matrix only has 1428 transitions (discarded 40 similar events)
[2023-03-23 16:13:03] [INFO ] Invariant cache hit.
[2023-03-23 16:13:04] [INFO ] Implicit Places using invariants in 697 ms returned []
[2023-03-23 16:13:04] [INFO ] Flow matrix only has 1428 transitions (discarded 40 similar events)
[2023-03-23 16:13:04] [INFO ] Invariant cache hit.
[2023-03-23 16:13:05] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-23 16:13:24] [INFO ] Implicit Places using invariants and state equation in 20151 ms returned []
Implicit Place search using SMT with State Equation took 20852 ms to find 0 implicit places.
[2023-03-23 16:13:24] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-23 16:13:24] [INFO ] Flow matrix only has 1428 transitions (discarded 40 similar events)
[2023-03-23 16:13:24] [INFO ] Invariant cache hit.
[2023-03-23 16:13:25] [INFO ] Dead Transitions using invariants and state equation in 1035 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21998 ms. Remains : 540/540 places, 1468/1468 transitions.
Ending property specific reduction for PolyORBLF-PT-S04J04T10-UpperBounds-09 in 76297 ms.
[2023-03-23 16:13:26] [INFO ] Flatten gal took : 162 ms
[2023-03-23 16:13:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-23 16:13:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 540 places, 1468 transitions and 7792 arcs took 8 ms.
Total runtime 166746 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: PolyORBLF_PT_S04J04T10
(NrP: 540 NrTr: 1468 NrArc: 7792)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.079sec

net check time: 0m 0.000sec

init dd package: 0m 2.688sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8089384 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093352 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.019sec

14454 19678 33654 36342 37750 39567 39609 42190 40780 39690 224868 274648 284771 276709 274888 276629 291955 277337 220964 325747 333166 336096 356562 421248 428204 429305 482144 508833 512918 517049 577938 589782 597948 596983 650059 664174 669963 665682 720045 730209 732942 720698 779218 786432 791697 802113 828072 835899 837639

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="PolyORBLF-PT-S04J04T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is PolyORBLF-PT-S04J04T10, 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 r298-tall-167873951900557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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