Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445400198.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-COL-S06J06T04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445400198
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 12K Apr 11 17:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 17:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 11 17:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 11 17:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716856504254

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 00:35:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 00:35:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:35:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 00:35:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 00:35:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 621 ms
[2024-05-28 00:35:06] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 506 PT places and 7196.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 00:35:06] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 00:35:06] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40010 steps (3916 resets) in 1072 ms. (37 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4000 steps (9 resets) in 34 ms. (114 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (10 resets) in 42 ms. (93 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (10 resets) in 88 ms. (44 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (10 resets) in 69 ms. (57 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (14 resets) in 23 ms. (166 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (11 resets) in 36 ms. (108 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (16 resets) in 60 ms. (65 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (9 resets) in 30 ms. (129 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (12 resets) in 34 ms. (114 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (13 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (13 resets) in 20 ms. (190 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (10 resets) in 26 ms. (148 steps per ms) remains 13/13 properties
[2024-05-28 00:35:06] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 00:35:06] [INFO ] Computed 26 invariants in 8 ms
[2024-05-28 00:35:06] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-00 is UNSAT
Problem PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-04 is UNSAT
Problem PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-06 is UNSAT
Problem PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-07 is UNSAT
Problem PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-08 is UNSAT
Problem PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-09 is UNSAT
Problem PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-13 is UNSAT
Problem PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-14 is UNSAT
Problem PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-15 is UNSAT
At refinement iteration 3 (OVERLAPS) 18/68 variables, 8/13 constraints. Problems are: Problem set: 9 solved, 4 unsolved
Problem PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-03 is UNSAT
Problem PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-10 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/14 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 11 solved, 2 unsolved
Problem PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-12 is UNSAT
At refinement iteration 6 (OVERLAPS) 13/81 variables, 12/26 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 12 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 12 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/35 variables, 4/6 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/45 variables, 2/8 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/49 variables, 1/9 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/21 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/78 variables, 3/24 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/79 variables, 1/25 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 1/113 constraints. Problems are: Problem set: 12 solved, 1 unsolved
[2024-05-28 00:35:07] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 8 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 1/114 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/114 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/116 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/117 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/117 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/117 constraints. Problems are: Problem set: 12 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 117 constraints, problems are : Problem set: 12 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 524ms problems are : Problem set: 12 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 80 transition count 57
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 72 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 30 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2024-05-28 00:35:07] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2024-05-28 00:35:07] [INFO ] Computed 25 invariants in 4 ms
[2024-05-28 00:35:07] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-28 00:35:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
[2024-05-28 00:35:07] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 00:35:07] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 44/104 variables, 60/88 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 96 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1108 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-28 00:35:08] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-28 00:35:08] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 00:35:08] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-28 00:35:08] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-28 00:35:08] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 00:35:09] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 1/60 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/94 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/102 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 44/146 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 146 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1615 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 9/9 constraints]
After SMT, in 2746ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2747ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2790 ms. Remains : 60/81 places, 45/65 transitions.
RANDOM walk for 40009 steps (4322 resets) in 468 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (87 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
Probably explored full state space saw : 121030 states, properties seen :0
Probabilistic random walk after 373471 steps, saw 121030 distinct states, run finished after 572 ms. (steps per millisecond=652 ) properties seen :0
Explored full state space saw : 121068 states, properties seen :0
Exhaustive walk after 373596 steps, saw 121068 distinct states, run finished after 459 ms. (steps per millisecond=813 ) properties seen :0
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-28 00:35:11] [INFO ] Flatten gal took : 23 ms
[2024-05-28 00:35:11] [INFO ] Flatten gal took : 11 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-00 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-03 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-04 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-05 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-06 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-07 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-08 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-09 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-10 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-12 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-13 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-14 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-15 TRUE TECHNIQUES CPN_APPROX
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2024-05-28 00:35:11] [INFO ] Unfolded HLPN to a Petri net with 506 places and 7154 transitions 59824 arcs in 166 ms.
[2024-05-28 00:35:11] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
RANDOM walk for 795 steps (10 resets) in 80 ms. (9 steps per ms) remains 0/3 properties
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6262 ms.
ITS solved all properties within timeout

BK_STOP 1716856511757

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="PolyORBLF-COL-S06J06T04"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-COL-S06J06T04, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445400198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J06T04.tgz
mv PolyORBLF-COL-S06J06T04 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;