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-171654445200110.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-S02J06T08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445200110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:06 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.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 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-S02J06T08-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716848072177

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-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:14:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 22:14:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:14:34] [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-27 22:14:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:14:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1299 ms
[2024-05-27 22:14:35] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 73 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 22:14:35] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 10 ms.
[2024-05-27 22:14:35] [INFO ] Skeletonized 16 HLPN properties in 2 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 40000 steps (21 resets) in 2690 ms. (14 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40003 steps (8 resets) in 265 ms. (150 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 517 ms. (77 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (14 resets) in 1080 ms. (37 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (11 resets) in 315 ms. (126 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (11 resets) in 507 ms. (78 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (9 resets) in 390 ms. (102 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (12 resets) in 260 ms. (153 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (10 resets) in 352 ms. (113 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 312 ms. (127 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (10 resets) in 308 ms. (129 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (13 resets) in 316 ms. (126 steps per ms) remains 11/11 properties
[2024-05-27 22:14:38] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:14:38] [INFO ] Computed 26 invariants in 7 ms
[2024-05-27 22:14:38] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-03 is UNSAT
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-04 is UNSAT
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-06 is UNSAT
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-09 is UNSAT
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-12 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 8/8 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-07 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 11/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-00 is UNSAT
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-14 is UNSAT
At refinement iteration 3 (OVERLAPS) 2/81 variables, 3/22 constraints. Problems are: Problem set: 8 solved, 3 unsolved
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-15 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 4/26 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 9 solved, 2 unsolved in 615 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: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 6/9 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/78 variables, 8/17 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/20 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-05-27 22:14:39] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 44 ms to minimize.
[2024-05-27 22:14:39] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 2/22 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/22 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/81 variables, 6/28 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-05-27 22:14:40] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-27 22:14:40] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-27 22:14:40] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 8 ms to minimize.
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-11 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 3/31 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/31 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 64/145 variables, 81/112 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 8/120 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 1/121 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/121 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/121 constraints. Problems are: Problem set: 10 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 121 constraints, problems are : Problem set: 10 solved, 1 unsolved in 1190 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/11 constraints, Known Traps: 5/5 constraints]
After SMT, in 1949ms problems are : Problem set: 10 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 31 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 80 transition count 64
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 79 transition count 61
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 9 place count 76 transition count 61
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 9 place count 76 transition count 58
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 15 place count 73 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 72 transition count 57
Applied a total of 17 rules in 44 ms. Remains 72 /81 variables (removed 9) and now considering 57/65 (removed 8) transitions.
Running 56 sub problems to find dead transitions.
[2024-05-27 22:14:40] [INFO ] Flow matrix only has 56 transitions (discarded 1 similar events)
// Phase 1: matrix 56 rows 72 cols
[2024-05-27 22:14:40] [INFO ] Computed 25 invariants in 5 ms
[2024-05-27 22:14:40] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-27 22:14:40] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-27 22:14:41] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:14:41] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:14:41] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:14:41] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-27 22:14:41] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:14:41] [INFO ] Deduced a trap composed of 32 places in 284 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-27 22:14:41] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 56 unsolved
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/72 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 54 unsolved
[2024-05-27 22:14:48] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 2 ms to minimize.
[2024-05-27 22:14:48] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:14:49] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 3/36 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 56/128 variables, 72/108 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 8/116 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 54 unsolved
[2024-05-27 22:14:50] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/128 variables, 1/117 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 0/117 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 13 (OVERLAPS) 0/128 variables, 0/117 constraints. Problems are: Problem set: 2 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 117 constraints, problems are : Problem set: 2 solved, 54 unsolved in 10327 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 72/72 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 2 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 10/34 constraints. Problems are: Problem set: 2 solved, 54 unsolved
[2024-05-27 22:14:51] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/35 constraints. Problems are: Problem set: 2 solved, 54 unsolved
[2024-05-27 22:14:51] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/36 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 1/72 variables, 1/37 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 2/39 constraints. Problems are: Problem set: 2 solved, 54 unsolved
[2024-05-27 22:14:52] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 1/40 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 56/128 variables, 72/112 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 8/120 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 54/174 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 0/174 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 14 (OVERLAPS) 0/128 variables, 0/174 constraints. Problems are: Problem set: 2 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 174 constraints, problems are : Problem set: 2 solved, 54 unsolved in 3206 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 72/72 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 54/56 constraints, Known Traps: 15/15 constraints]
After SMT, in 13559ms problems are : Problem set: 2 solved, 54 unsolved
Search for dead transitions found 2 dead transitions in 13561ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 72/81 places, 55/65 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 53
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 69 transition count 51
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 3 rules in 3 ms. Remains 69 /72 variables (removed 3) and now considering 51/55 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13624 ms. Remains : 69/81 places, 51/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40001 steps (25 resets) in 486 ms. (82 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (13 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 18503 steps, run visited all 1 properties in 70 ms. (steps per millisecond=264 )
Probabilistic random walk after 18503 steps, saw 9107 distinct states, run finished after 75 ms. (steps per millisecond=246 ) properties seen :1
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-27 22:14:54] [INFO ] Flatten gal took : 42 ms
[2024-05-27 22:14:54] [INFO ] Flatten gal took : 18 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-S02J06T08-ReachabilityCardinality-2024-00 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-03 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-04 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-06 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-07 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-09 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-11 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-12 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-14 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-15 TRUE TECHNIQUES CPN_APPROX
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
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
[2024-05-27 22:14:54] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 73 ms.
[2024-05-27 22:14:54] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
RANDOM walk for 40000 steps (11 resets) in 679 ms. (58 steps per ms) remains 1/6 properties
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (9 resets) in 832 ms. (48 steps per ms) remains 1/1 properties
[2024-05-27 22:14:55] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-05-27 22:14:55] [INFO ] Computed 54 invariants in 88 ms
[2024-05-27 22:14:55] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 209/490 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 196/686 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/686 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/688 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/690 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/690 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1980/1980 variables, and 744 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1455 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 690/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
[2024-05-27 22:14:57] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 209/490 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 196/686 variables, 34/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 22:14:58] [INFO ] Deduced a trap composed of 73 places in 655 ms of which 5 ms to minimize.
[2024-05-27 22:14:58] [INFO ] Deduced a trap composed of 74 places in 492 ms of which 5 ms to minimize.
[2024-05-27 22:14:59] [INFO ] Deduced a trap composed of 69 places in 459 ms of which 4 ms to minimize.
[2024-05-27 22:14:59] [INFO ] Deduced a trap composed of 315 places in 380 ms of which 4 ms to minimize.
[2024-05-27 22:14:59] [INFO ] Deduced a trap composed of 69 places in 370 ms of which 4 ms to minimize.
[2024-05-27 22:15:00] [INFO ] Deduced a trap composed of 74 places in 185 ms of which 3 ms to minimize.
[2024-05-27 22:15:00] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 2 ms to minimize.
[2024-05-27 22:15:00] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 2 ms to minimize.
[2024-05-27 22:15:00] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2024-05-27 22:15:00] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/686 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/686 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/688 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/690 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/690 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1980/1980 variables, and 755 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4773 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 690/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 11/11 constraints]
After SMT, in 6569ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 281 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 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 10 rules applied. Total rules applied 10 place count 688 transition count 1298
Reduce places removed 8 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 32 rules applied. Total rules applied 42 place count 680 transition count 1274
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 66 place count 656 transition count 1274
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 66 place count 656 transition count 1242
Deduced a syphon composed of 32 places in 3 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 130 place count 624 transition count 1242
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 15 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 162 place count 608 transition count 1226
Applied a total of 162 rules in 317 ms. Remains 608 /690 variables (removed 82) and now considering 1226/1306 (removed 80) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-27 22:15:02] [INFO ] Flow matrix only has 1210 transitions (discarded 16 similar events)
// Phase 1: matrix 1210 rows 608 cols
[2024-05-27 22:15:02] [INFO ] Computed 52 invariants in 37 ms
[2024-05-27 22:15:02] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 606/1818 variables, and 50 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/608 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-27 22:15:26] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 2 ms to minimize.
[2024-05-27 22:15:26] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-05-27 22:15:26] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 3 ms to minimize.
[2024-05-27 22:15:26] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 5 ms to minimize.
[2024-05-27 22:15:26] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:15:27] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:15:27] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-05-27 22:15:27] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:15:28] [INFO ] Deduced a trap composed of 320 places in 493 ms of which 32 ms to minimize.
[2024-05-27 22:15:33] [INFO ] Deduced a trap composed of 155 places in 365 ms of which 5 ms to minimize.
[2024-05-27 22:15:34] [INFO ] Deduced a trap composed of 108 places in 395 ms of which 4 ms to minimize.
[2024-05-27 22:15:34] [INFO ] Deduced a trap composed of 277 places in 285 ms of which 17 ms to minimize.
[2024-05-27 22:15:34] [INFO ] Deduced a trap composed of 137 places in 270 ms of which 3 ms to minimize.
[2024-05-27 22:15:34] [INFO ] Deduced a trap composed of 117 places in 265 ms of which 4 ms to minimize.
[2024-05-27 22:15:35] [INFO ] Deduced a trap composed of 148 places in 277 ms of which 4 ms to minimize.
[2024-05-27 22:15:41] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/1818 variables, and 66 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/608 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1224 constraints, Known Traps: 16/16 constraints]
After SMT, in 42348ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 42393ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42715 ms. Remains : 608/690 places, 1226/1306 transitions.
RANDOM walk for 40000 steps (17 resets) in 302 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 404 ms. (98 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 18726 steps, run visited all 1 properties in 228 ms. (steps per millisecond=82 )
Probabilistic random walk after 18726 steps, saw 11312 distinct states, run finished after 229 ms. (steps per millisecond=81 ) properties seen :1
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 71140 ms.
ITS solved all properties within timeout

BK_STOP 1716848145296

--------------------
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-S02J06T08"
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-S02J06T08, 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-171654445200110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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