fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r289-tajo-171654445700337
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBLF-PT-S06J06T04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16173.300 3600000.00 13934498.00 237.30 FTFTTF?FTT?TF?T? normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 16K Apr 11 17:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 11 17:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 855K Apr 11 17:23 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 9.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 341K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 483K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.1M Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.9M 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-PT-S06J06T04-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716871238737

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 04:40:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 04:40:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 04:40:41] [INFO ] Load time of PNML (sax parser for PT used): 646 ms
[2024-05-28 04:40:41] [INFO ] Transformed 506 places.
[2024-05-28 04:40:41] [INFO ] Transformed 7154 transitions.
[2024-05-28 04:40:41] [INFO ] Parsed PT model containing 506 places and 7154 transitions and 59824 arcs in 863 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 318 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 500 transition count 1774
Applied a total of 6 rules in 103 ms. Remains 500 /506 variables (removed 6) and now considering 1774/1774 (removed 0) transitions.
Running 1768 sub problems to find dead transitions.
[2024-05-28 04:40:41] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 500 cols
[2024-05-28 04:40:41] [INFO ] Computed 48 invariants in 87 ms
[2024-05-28 04:40:41] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
[2024-05-28 04:41:11] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 19 ms to minimize.
[2024-05-28 04:41:14] [INFO ] Deduced a trap composed of 83 places in 204 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/2250 variables, and 39 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 20100 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 18/29 constraints, State Equation: 0/500 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1768/1768 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/2250 variables, and 39 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 18/29 constraints, State Equation: 0/500 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1768 constraints, Known Traps: 2/2 constraints]
After SMT, in 56029ms problems are : Problem set: 0 solved, 1768 unsolved
Search for dead transitions found 0 dead transitions in 56128ms
[2024-05-28 04:41:37] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 04:41:37] [INFO ] Invariant cache hit.
[2024-05-28 04:41:37] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-28 04:41:37] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 04:41:37] [INFO ] Invariant cache hit.
[2024-05-28 04:41:39] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:41:44] [INFO ] Implicit Places using invariants and state equation in 6749 ms returned []
Implicit Place search using SMT with State Equation took 7120 ms to find 0 implicit places.
Running 1768 sub problems to find dead transitions.
[2024-05-28 04:41:44] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 04:41:44] [INFO ] Invariant cache hit.
[2024-05-28 04:41:44] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
[2024-05-28 04:42:13] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-05-28 04:42:14] [INFO ] Deduced a trap composed of 83 places in 197 ms of which 3 ms to minimize.
[2024-05-28 04:42:25] [INFO ] Deduced a trap composed of 82 places in 193 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/2250 variables, and 40 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 18/29 constraints, State Equation: 0/500 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1768/1768 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
[2024-05-28 04:42:43] [INFO ] Deduced a trap composed of 49 places in 407 ms of which 3 ms to minimize.
[2024-05-28 04:42:43] [INFO ] Deduced a trap composed of 31 places in 362 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/494 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/2250 variables, and 42 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 18/29 constraints, State Equation: 0/500 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1768 constraints, Known Traps: 5/5 constraints]
After SMT, in 75959ms problems are : Problem set: 0 solved, 1768 unsolved
Search for dead transitions found 0 dead transitions in 75999ms
Starting structural reductions in LTL mode, iteration 1 : 500/506 places, 1774/1774 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139428 ms. Remains : 500/506 places, 1774/1774 transitions.
Support contains 318 out of 500 places after structural reductions.
[2024-05-28 04:43:01] [INFO ] Flatten gal took : 277 ms
[2024-05-28 04:43:01] [INFO ] Flatten gal took : 192 ms
[2024-05-28 04:43:01] [INFO ] Input system was already deterministic with 1774 transitions.
RANDOM walk for 40000 steps (181 resets) in 2804 ms. (14 steps per ms) remains 52/80 properties
BEST_FIRST walk for 4002 steps (12 resets) in 78 ms. (50 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (19 resets) in 94 ms. (42 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (15 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (12 resets) in 69 ms. (57 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (12 resets) in 75 ms. (52 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (12 resets) in 44 ms. (88 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (13 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (9 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (11 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (13 resets) in 42 ms. (93 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (112 resets) in 47 ms. (83 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (12 resets) in 38 ms. (102 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (112 resets) in 60 ms. (65 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (44 resets) in 77 ms. (51 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (112 resets) in 72 ms. (54 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (12 resets) in 38 ms. (102 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (17 resets) in 46 ms. (85 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (10 resets) in 60 ms. (65 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (14 resets) in 47 ms. (83 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (20 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (12 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (13 resets) in 43 ms. (90 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (12 resets) in 45 ms. (87 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (16 resets) in 38 ms. (102 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (17 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (14 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (16 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (16 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (14 resets) in 49 ms. (80 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (15 resets) in 50 ms. (78 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (9 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (11 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (12 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (12 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (13 resets) in 56 ms. (70 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (10 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (11 resets) in 56 ms. (70 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (13 resets) in 28 ms. (137 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (10 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (13 resets) in 42 ms. (93 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (11 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (10 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (9 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (17 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (10 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (11 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (10 resets) in 39 ms. (100 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (14 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (13 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (15 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
[2024-05-28 04:43:03] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 04:43:03] [INFO ] Invariant cache hit.
[2024-05-28 04:43:03] [INFO ] State equation strengthened by 112 read => feed constraints.
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp68 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 6/9 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/9 constraints. Problems are: Problem set: 8 solved, 44 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 3 (OVERLAPS) 101/293 variables, 12/21 constraints. Problems are: Problem set: 16 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 1/22 constraints. Problems are: Problem set: 16 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/22 constraints. Problems are: Problem set: 16 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 12/305 variables, 2/24 constraints. Problems are: Problem set: 16 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/24 constraints. Problems are: Problem set: 16 solved, 36 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp79 is UNSAT
After SMT solving in domain Real declared 497/2250 variables, and 46 constraints, problems are : Problem set: 52 solved, 0 unsolved in 862 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/500 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 52/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 1048ms problems are : Problem set: 52 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 52 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 04:43:04] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-28 04:43:04] [INFO ] Flatten gal took : 82 ms
[2024-05-28 04:43:04] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 04:43:05] [INFO ] Flatten gal took : 82 ms
[2024-05-28 04:43:05] [INFO ] Input system was already deterministic with 1774 transitions.
Support contains 63 out of 500 places (down from 88) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 1774/1774 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 496 transition count 1770
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 496 transition count 1770
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 492 transition count 1766
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 492 transition count 1766
Applied a total of 16 rules in 85 ms. Remains 492 /500 variables (removed 8) and now considering 1766/1774 (removed 8) transitions.
Running 1760 sub problems to find dead transitions.
[2024-05-28 04:43:05] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
// Phase 1: matrix 1742 rows 492 cols
[2024-05-28 04:43:05] [INFO ] Computed 48 invariants in 59 ms
[2024-05-28 04:43:05] [INFO ] State equation strengthened by 112 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S06J06T04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 506
TRANSITIONS: 7154
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.331s, Sys 0.036s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.050s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 611
MODEL NAME: /home/mcc/execution/model
506 places, 7154 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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-PT-S06J06T04"
export BK_EXAMINATION="CTLCardinality"
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-PT-S06J06T04, examination is CTLCardinality"
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-171654445700337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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