fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r399-tall-171690531200810
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Szymanski-PT-a02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4823.552 561723.00 1530000.00 755.70 FFTTFTFFTFFFFTFF 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.r399-tall-171690531200810.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 Szymanski-PT-a02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690531200810
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 11 15:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 101K 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 Szymanski-PT-a02-CTLFireability-2024-00
FORMULA_NAME Szymanski-PT-a02-CTLFireability-2024-01
FORMULA_NAME Szymanski-PT-a02-CTLFireability-2024-02
FORMULA_NAME Szymanski-PT-a02-CTLFireability-2024-03
FORMULA_NAME Szymanski-PT-a02-CTLFireability-2024-04
FORMULA_NAME Szymanski-PT-a02-CTLFireability-2024-05
FORMULA_NAME Szymanski-PT-a02-CTLFireability-2024-06
FORMULA_NAME Szymanski-PT-a02-CTLFireability-2024-07
FORMULA_NAME Szymanski-PT-a02-CTLFireability-2024-08
FORMULA_NAME Szymanski-PT-a02-CTLFireability-2024-09
FORMULA_NAME Szymanski-PT-a02-CTLFireability-2024-10
FORMULA_NAME Szymanski-PT-a02-CTLFireability-2024-11
FORMULA_NAME Szymanski-PT-a02-CTLFireability-2023-12
FORMULA_NAME Szymanski-PT-a02-CTLFireability-2023-13
FORMULA_NAME Szymanski-PT-a02-CTLFireability-2023-14
FORMULA_NAME Szymanski-PT-a02-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717092143126

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-a02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 18:02:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 18:02:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 18:02:24] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-30 18:02:24] [INFO ] Transformed 61 places.
[2024-05-30 18:02:24] [INFO ] Transformed 224 transitions.
[2024-05-30 18:02:24] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a02-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Applied a total of 2 rules in 16 ms. Remains 47 /49 variables (removed 2) and now considering 216/216 (removed 0) transitions.
[2024-05-30 18:02:24] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 47 cols
[2024-05-30 18:02:24] [INFO ] Computed 1 invariants in 11 ms
[2024-05-30 18:02:24] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-30 18:02:24] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2024-05-30 18:02:24] [INFO ] Invariant cache hit.
[2024-05-30 18:02:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 18:02:24] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-30 18:02:24] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2024-05-30 18:02:24] [INFO ] Invariant cache hit.
[2024-05-30 18:02:24] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 79/126 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 57 constraints, problems are : Problem set: 0 solved, 214 unsolved in 2843 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 79/126 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 214/271 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 0/126 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 271 constraints, problems are : Problem set: 0 solved, 214 unsolved in 3631 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
After SMT, in 6615ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 6654ms
Starting structural reductions in LTL mode, iteration 1 : 47/49 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6983 ms. Remains : 47/49 places, 216/216 transitions.
Support contains 42 out of 47 places after structural reductions.
[2024-05-30 18:02:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 18:02:31] [INFO ] Flatten gal took : 39 ms
FORMULA Szymanski-PT-a02-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 18:02:31] [INFO ] Flatten gal took : 16 ms
[2024-05-30 18:02:31] [INFO ] Input system was already deterministic with 216 transitions.
Reduction of identical properties reduced properties to check from 58 to 56
RANDOM walk for 40002 steps (118 resets) in 1650 ms. (24 steps per ms) remains 20/56 properties
BEST_FIRST walk for 4003 steps (9 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
[2024-05-30 18:02:32] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2024-05-30 18:02:32] [INFO ] Invariant cache hit.
[2024-05-30 18:02:32] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 20/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 3 (OVERLAPS) 79/126 variables, 47/48 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 9/57 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/126 variables, 0/57 constraints. Problems are: Problem set: 5 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 57 constraints, problems are : Problem set: 5 solved, 12 unsolved in 244 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 35/47 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 79/126 variables, 47/48 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 9/57 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 12/69 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/69 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/69 constraints. Problems are: Problem set: 5 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 69 constraints, problems are : Problem set: 5 solved, 12 unsolved in 252 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 12/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 512ms problems are : Problem set: 5 solved, 12 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 12 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 216/216 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 215
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 199
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 199
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 25 place count 43 transition count 183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 42 transition count 179
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 42 transition count 179
Applied a total of 27 rules in 29 ms. Remains 42 /47 variables (removed 5) and now considering 179/216 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 42/47 places, 179/216 transitions.
RANDOM walk for 40000 steps (13 resets) in 200 ms. (199 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (10 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (14 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (9 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (13 resets) in 70 ms. (563 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (11 resets) in 62 ms. (634 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (11 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (12 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (14 resets) in 66 ms. (597 steps per ms) remains 12/12 properties
Finished probabilistic random walk after 148988 steps, run visited all 12 properties in 460 ms. (steps per millisecond=323 )
Probabilistic random walk after 148988 steps, saw 32056 distinct states, run finished after 464 ms. (steps per millisecond=321 ) properties seen :12
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 10 ms
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 13 ms
[2024-05-30 18:02:34] [INFO ] Input system was already deterministic with 216 transitions.
Computed a total of 9 stabilizing places and 36 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 3 ms. Remains 43 /47 variables (removed 4) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/47 places, 200/216 transitions.
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 10 ms
[2024-05-30 18:02:34] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 3 ms. Remains 43 /47 variables (removed 4) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/47 places, 200/216 transitions.
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 10 ms
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 11 ms
[2024-05-30 18:02:34] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 204
Applied a total of 6 rules in 2 ms. Remains 44 /47 variables (removed 3) and now considering 204/216 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/47 places, 204/216 transitions.
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 10 ms
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 10 ms
[2024-05-30 18:02:34] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 24 place count 43 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 41 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 41 transition count 176
Applied a total of 28 rules in 19 ms. Remains 41 /47 variables (removed 6) and now considering 176/216 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 41/47 places, 176/216 transitions.
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 8 ms
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:02:34] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 3 ms. Remains 43 /47 variables (removed 4) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/47 places, 200/216 transitions.
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 8 ms
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:02:34] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 24 place count 43 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 41 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 41 transition count 176
Applied a total of 28 rules in 13 ms. Remains 41 /47 variables (removed 6) and now considering 176/216 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 41/47 places, 176/216 transitions.
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:02:34] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 208
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 208
Applied a total of 4 rules in 3 ms. Remains 45 /47 variables (removed 2) and now considering 208/216 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 45/47 places, 208/216 transitions.
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 8 ms
[2024-05-30 18:02:34] [INFO ] Input system was already deterministic with 208 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 204
Applied a total of 6 rules in 2 ms. Remains 44 /47 variables (removed 3) and now considering 204/216 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/47 places, 204/216 transitions.
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:02:34] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 26 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 40 transition count 172
Applied a total of 30 rules in 12 ms. Remains 40 /47 variables (removed 7) and now considering 172/216 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 40/47 places, 172/216 transitions.
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 5 ms
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 5 ms
[2024-05-30 18:02:34] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 204
Applied a total of 6 rules in 2 ms. Remains 44 /47 variables (removed 3) and now considering 204/216 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/47 places, 204/216 transitions.
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 6 ms
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 6 ms
[2024-05-30 18:02:34] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 22 place count 42 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 41 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 41 transition count 180
Applied a total of 24 rules in 11 ms. Remains 41 /47 variables (removed 6) and now considering 180/216 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 41/47 places, 180/216 transitions.
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 5 ms
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 6 ms
[2024-05-30 18:02:34] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/47 places, 196/216 transitions.
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 5 ms
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 6 ms
[2024-05-30 18:02:34] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/47 places, 196/216 transitions.
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 6 ms
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 6 ms
[2024-05-30 18:02:34] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 8 ms
[2024-05-30 18:02:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:02:34] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-30 18:02:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 47 places, 216 transitions and 860 arcs took 4 ms.
Total runtime 10428 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Szymanski-PT-a02

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 47
TRANSITIONS: 216
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 547
MODEL NAME: /home/mcc/execution/412/model
47 places, 216 transitions.

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.
Building monolithic NSF...
FORMULA Szymanski-PT-a02-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a02-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a02-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a02-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a02-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a02-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a02-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a02-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a02-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a02-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a02-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a02-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a02-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717092704849

--------------------
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 CTLFireability -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="Szymanski-PT-a02"
export BK_EXAMINATION="CTLFireability"
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 Szymanski-PT-a02, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690531200810"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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