fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r267-smll-171654405900185
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PermAdmissibility-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9942.256 3600000.00 11178096.00 7977.40 ???TF??????????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r267-smll-171654405900185.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PermAdmissibility-PT-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405900185
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 15K Apr 12 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 41K Apr 12 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 207K Apr 12 09:04 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.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 09:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 12 09:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 12 09:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 504K Apr 12 09:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 336K 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 PermAdmissibility-PT-20-CTLCardinality-2024-00
FORMULA_NAME PermAdmissibility-PT-20-CTLCardinality-2024-01
FORMULA_NAME PermAdmissibility-PT-20-CTLCardinality-2024-02
FORMULA_NAME PermAdmissibility-PT-20-CTLCardinality-2024-03
FORMULA_NAME PermAdmissibility-PT-20-CTLCardinality-2024-04
FORMULA_NAME PermAdmissibility-PT-20-CTLCardinality-2024-05
FORMULA_NAME PermAdmissibility-PT-20-CTLCardinality-2024-06
FORMULA_NAME PermAdmissibility-PT-20-CTLCardinality-2024-07
FORMULA_NAME PermAdmissibility-PT-20-CTLCardinality-2024-08
FORMULA_NAME PermAdmissibility-PT-20-CTLCardinality-2024-09
FORMULA_NAME PermAdmissibility-PT-20-CTLCardinality-2024-10
FORMULA_NAME PermAdmissibility-PT-20-CTLCardinality-2024-11
FORMULA_NAME PermAdmissibility-PT-20-CTLCardinality-2024-12
FORMULA_NAME PermAdmissibility-PT-20-CTLCardinality-2024-13
FORMULA_NAME PermAdmissibility-PT-20-CTLCardinality-2024-14
FORMULA_NAME PermAdmissibility-PT-20-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716708008271

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 07:20:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 07:20:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 07:20:10] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2024-05-26 07:20:10] [INFO ] Transformed 168 places.
[2024-05-26 07:20:10] [INFO ] Transformed 592 transitions.
[2024-05-26 07:20:10] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 380 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 178 ms.
Support contains 167 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Applied a total of 0 rules in 22 ms. Remains 168 /168 variables (removed 0) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 168 cols
[2024-05-26 07:20:10] [INFO ] Computed 32 invariants in 60 ms
[2024-05-26 07:20:11] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-26 07:20:11] [INFO ] Invariant cache hit.
[2024-05-26 07:20:11] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2024-05-26 07:20:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 61/164 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 4/168 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 588 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 592/760 variables, 168/200 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/760 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 8 (OVERLAPS) 0/760 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 588 unsolved
No progress, stopping.
After SMT solving in domain Real declared 760/760 variables, and 200 constraints, problems are : Problem set: 0 solved, 588 unsolved in 26457 ms.
Refiners :[Generalized P Invariants (flows): 32/32 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 61/164 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 4/168 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 6 (OVERLAPS) 592/760 variables, 168/200 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/760 variables, 588/788 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/760 variables, and 788 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30049 ms.
Refiners :[Generalized P Invariants (flows): 32/32 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints]
After SMT, in 58772ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 58827ms
Finished structural reductions in LTL mode , in 1 iterations and 59765 ms. Remains : 168/168 places, 592/592 transitions.
Support contains 167 out of 168 places after structural reductions.
[2024-05-26 07:21:10] [INFO ] Flatten gal took : 156 ms
[2024-05-26 07:21:11] [INFO ] Flatten gal took : 98 ms
[2024-05-26 07:21:11] [INFO ] Input system was already deterministic with 592 transitions.
RANDOM walk for 40040 steps (116 resets) in 1307 ms. (30 steps per ms) remains 42/104 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
[2024-05-26 07:21:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp87 is UNSAT
After SMT solving in domain Real declared 168/760 variables, and 32 constraints, problems are : Problem set: 42 solved, 0 unsolved in 555 ms.
Refiners :[Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 763ms problems are : Problem set: 42 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 42 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PermAdmissibility-PT-20-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 07:21:13] [INFO ] Flatten gal took : 61 ms
[2024-05-26 07:21:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PermAdmissibility-PT-20-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 07:21:13] [INFO ] Flatten gal took : 68 ms
[2024-05-26 07:21:13] [INFO ] Input system was already deterministic with 592 transitions.
Support contains 122 out of 168 places (down from 140) after GAL structural reductions.
Computed a total of 168 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 168 transition count 592
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 104 transition count 592
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 84 place count 84 transition count 356
Iterating global reduction 1 with 20 rules applied. Total rules applied 104 place count 84 transition count 356
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 118 place count 70 transition count 230
Iterating global reduction 1 with 14 rules applied. Total rules applied 132 place count 70 transition count 230
Applied a total of 132 rules in 43 ms. Remains 70 /168 variables (removed 98) and now considering 230/592 (removed 362) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 70/168 places, 230/592 transitions.
[2024-05-26 07:21:13] [INFO ] Flatten gal took : 17 ms
[2024-05-26 07:21:13] [INFO ] Flatten gal took : 18 ms
[2024-05-26 07:21:13] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 90 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 116 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 140 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 164 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 166 place count 52 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 168 place count 52 transition count 92
Applied a total of 168 rules in 22 ms. Remains 52 /168 variables (removed 116) and now considering 92/592 (removed 500) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 52/168 places, 92/592 transitions.
[2024-05-26 07:21:13] [INFO ] Flatten gal took : 6 ms
[2024-05-26 07:21:13] [INFO ] Flatten gal took : 7 ms
[2024-05-26 07:21:13] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 120 transition count 592
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 108 transition count 400
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 108 transition count 400
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 103 transition count 320
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 103 transition count 320
Applied a total of 82 rules in 14 ms. Remains 103 /168 variables (removed 65) and now considering 320/592 (removed 272) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 103/168 places, 320/592 transitions.
[2024-05-26 07:21:13] [INFO ] Flatten gal took : 19 ms
[2024-05-26 07:21:13] [INFO ] Flatten gal took : 20 ms
[2024-05-26 07:21:13] [INFO ] Input system was already deterministic with 320 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Graph (complete) has 1615 edges and 168 vertex of which 94 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.7 ms
Discarding 74 places :
Also discarding 128 output transitions
Drop transitions (Output transitions of discarded places.) removed 128 transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 87 transition count 352
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 87 transition count 352
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 29 place count 73 transition count 226
Iterating global reduction 0 with 14 rules applied. Total rules applied 43 place count 73 transition count 226
Applied a total of 43 rules in 50 ms. Remains 73 /168 variables (removed 95) and now considering 226/592 (removed 366) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 73/168 places, 226/592 transitions.
[2024-05-26 07:21:13] [INFO ] Flatten gal took : 13 ms
[2024-05-26 07:21:13] [INFO ] Flatten gal took : 14 ms
[2024-05-26 07:21:13] [INFO ] Input system was already deterministic with 226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 128 transition count 592
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 53 place count 115 transition count 468
Iterating global reduction 1 with 13 rules applied. Total rules applied 66 place count 115 transition count 468
Applied a total of 66 rules in 10 ms. Remains 115 /168 variables (removed 53) and now considering 468/592 (removed 124) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 115/168 places, 468/592 transitions.
[2024-05-26 07:21:13] [INFO ] Flatten gal took : 27 ms
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 27 ms
[2024-05-26 07:21:14] [INFO ] Input system was already deterministic with 468 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Graph (complete) has 1615 edges and 168 vertex of which 112 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.5 ms
Discarding 56 places :
Also discarding 0 output transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 100 transition count 400
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 100 transition count 400
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 35 place count 90 transition count 290
Iterating global reduction 0 with 10 rules applied. Total rules applied 45 place count 90 transition count 290
Applied a total of 45 rules in 38 ms. Remains 90 /168 variables (removed 78) and now considering 290/592 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 90/168 places, 290/592 transitions.
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 15 ms
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 17 ms
[2024-05-26 07:21:14] [INFO ] Input system was already deterministic with 290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 107 transition count 592
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 85 place count 83 transition count 348
Iterating global reduction 1 with 24 rules applied. Total rules applied 109 place count 83 transition count 348
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 129 place count 63 transition count 132
Iterating global reduction 1 with 20 rules applied. Total rules applied 149 place count 63 transition count 132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 150 place count 62 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 151 place count 62 transition count 124
Applied a total of 151 rules in 12 ms. Remains 62 /168 variables (removed 106) and now considering 124/592 (removed 468) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 62/168 places, 124/592 transitions.
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 7 ms
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 7 ms
[2024-05-26 07:21:14] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Graph (complete) has 1615 edges and 168 vertex of which 106 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.4 ms
Discarding 62 places :
Also discarding 0 output transitions
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 82 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 82 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 69 place count 62 transition count 132
Iterating global reduction 0 with 20 rules applied. Total rules applied 89 place count 62 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 91 place count 60 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 60 transition count 116
Applied a total of 93 rules in 30 ms. Remains 60 /168 variables (removed 108) and now considering 116/592 (removed 476) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 60/168 places, 116/592 transitions.
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 6 ms
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 8 ms
[2024-05-26 07:21:14] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Graph (complete) has 1615 edges and 168 vertex of which 107 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.3 ms
Discarding 61 places :
Also discarding 0 output transitions
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 85 transition count 360
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 85 transition count 360
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 61 place count 69 transition count 172
Iterating global reduction 0 with 16 rules applied. Total rules applied 77 place count 69 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 78 place count 68 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 79 place count 68 transition count 164
Applied a total of 79 rules in 28 ms. Remains 68 /168 variables (removed 100) and now considering 164/592 (removed 428) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 68/168 places, 164/592 transitions.
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 9 ms
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 10 ms
[2024-05-26 07:21:14] [INFO ] Input system was already deterministic with 164 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Graph (complete) has 1615 edges and 168 vertex of which 50 are kept as prefixes of interest. Removing 118 places using SCC suffix rule.3 ms
Discarding 118 places :
Also discarding 384 output transitions
Drop transitions (Output transitions of discarded places.) removed 384 transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 36 transition count 82
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 36 transition count 82
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 36 place count 29 transition count 40
Iterating global reduction 0 with 7 rules applied. Total rules applied 43 place count 29 transition count 40
Applied a total of 43 rules in 12 ms. Remains 29 /168 variables (removed 139) and now considering 40/592 (removed 552) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 29/168 places, 40/592 transitions.
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 3 ms
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 2 ms
[2024-05-26 07:21:14] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 107 transition count 592
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 82 place count 86 transition count 366
Iterating global reduction 1 with 21 rules applied. Total rules applied 103 place count 86 transition count 366
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 118 place count 71 transition count 182
Iterating global reduction 1 with 15 rules applied. Total rules applied 133 place count 71 transition count 182
Applied a total of 133 rules in 10 ms. Remains 71 /168 variables (removed 97) and now considering 182/592 (removed 410) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 71/168 places, 182/592 transitions.
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 10 ms
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 11 ms
[2024-05-26 07:21:14] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Graph (complete) has 1615 edges and 168 vertex of which 87 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.3 ms
Discarding 81 places :
Also discarding 128 output transitions
Drop transitions (Output transitions of discarded places.) removed 128 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 75 transition count 344
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 75 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 49 place count 51 transition count 104
Iterating global reduction 0 with 24 rules applied. Total rules applied 73 place count 51 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 76 place count 48 transition count 80
Iterating global reduction 0 with 3 rules applied. Total rules applied 79 place count 48 transition count 80
Applied a total of 79 rules in 21 ms. Remains 48 /168 variables (removed 120) and now considering 80/592 (removed 512) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 48/168 places, 80/592 transitions.
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 5 ms
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 5 ms
[2024-05-26 07:21:14] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Graph (complete) has 1615 edges and 168 vertex of which 86 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.3 ms
Discarding 82 places :
Also discarding 128 output transitions
Drop transitions (Output transitions of discarded places.) removed 128 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 74 transition count 342
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 74 transition count 342
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 48 place count 51 transition count 112
Iterating global reduction 0 with 23 rules applied. Total rules applied 71 place count 51 transition count 112
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 73 place count 49 transition count 96
Iterating global reduction 0 with 2 rules applied. Total rules applied 75 place count 49 transition count 96
Applied a total of 75 rules in 43 ms. Remains 49 /168 variables (removed 119) and now considering 96/592 (removed 496) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 49/168 places, 96/592 transitions.
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 5 ms
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 5 ms
[2024-05-26 07:21:14] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 105 transition count 592
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 86 place count 82 transition count 358
Iterating global reduction 1 with 23 rules applied. Total rules applied 109 place count 82 transition count 358
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 126 place count 65 transition count 158
Iterating global reduction 1 with 17 rules applied. Total rules applied 143 place count 65 transition count 158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 144 place count 64 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 145 place count 64 transition count 150
Applied a total of 145 rules in 8 ms. Remains 64 /168 variables (removed 104) and now considering 150/592 (removed 442) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 64/168 places, 150/592 transitions.
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 7 ms
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 8 ms
[2024-05-26 07:21:14] [INFO ] Input system was already deterministic with 150 transitions.
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 32 ms
[2024-05-26 07:21:14] [INFO ] Flatten gal took : 33 ms
[2024-05-26 07:21:14] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-26 07:21:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 168 places, 592 transitions and 3456 arcs took 9 ms.
Total runtime 64774 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PermAdmissibility-PT-20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 168
TRANSITIONS: 592
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.022s, Sys 0.002s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 559
MODEL NAME: /home/mcc/execution/411/model
168 places, 592 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
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
MEDDLY ERROR: Insufficient memory

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="PermAdmissibility-PT-20"
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 PermAdmissibility-PT-20, 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 r267-smll-171654405900185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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