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

About the Execution of GreatSPN+red for AutoFlight-PT-04a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
295.407 11340.00 27956.00 218.20 FFFTTTFTFTTTTFTT 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.r025-smll-171620165900106.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 AutoFlight-PT-04a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620165900106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 22:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 22:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 22:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 22:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 29K May 18 16:42 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 AutoFlight-PT-04a-CTLFireability-2024-00
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-2024-01
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-2024-02
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-2024-03
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-2024-04
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-2024-05
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-2024-06
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-2024-07
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-2024-08
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-2024-09
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-2024-10
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-2024-11
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-2023-12
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-2023-13
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-2023-14
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716275351621

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-04a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 07:09:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 07:09:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:09:14] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2024-05-21 07:09:14] [INFO ] Transformed 107 places.
[2024-05-21 07:09:14] [INFO ] Transformed 105 transitions.
[2024-05-21 07:09:14] [INFO ] Found NUPN structural information;
[2024-05-21 07:09:14] [INFO ] Parsed PT model containing 107 places and 105 transitions and 340 arcs in 393 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
Support contains 81 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 85/85 transitions.
Applied a total of 0 rules in 120 ms. Remains 107 /107 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 107 cols
[2024-05-21 07:09:15] [INFO ] Computed 28 invariants in 26 ms
[2024-05-21 07:09:15] [INFO ] Implicit Places using invariants in 475 ms returned [37, 80]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 577 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/107 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 759 ms. Remains : 105/107 places, 85/85 transitions.
Support contains 81 out of 105 places after structural reductions.
[2024-05-21 07:09:15] [INFO ] Flatten gal took : 64 ms
[2024-05-21 07:09:16] [INFO ] Flatten gal took : 26 ms
[2024-05-21 07:09:16] [INFO ] Input system was already deterministic with 85 transitions.
Support contains 75 out of 105 places (down from 81) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 58 to 50
RANDOM walk for 40000 steps (1332 resets) in 3492 ms. (11 steps per ms) remains 8/50 properties
BEST_FIRST walk for 40003 steps (245 resets) in 369 ms. (108 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40002 steps (195 resets) in 196 ms. (203 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (316 resets) in 187 ms. (212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (222 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (190 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (259 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
// Phase 1: matrix 85 rows 105 cols
[2024-05-21 07:09:17] [INFO ] Computed 26 invariants in 4 ms
[2024-05-21 07:09:17] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 2 (OVERLAPS) 62/81 variables, 14/33 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 62/95 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/95 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 24/105 variables, 12/107 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 24/131 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/131 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 85/190 variables, 105/236 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 19/255 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/255 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/255 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 255 constraints, problems are : Problem set: 3 solved, 3 unsolved in 547 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 105/105 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 66/75 variables, 8/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 66/83 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/83 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 30/105 variables, 18/101 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 30/131 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/131 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 85/190 variables, 105/236 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 19/255 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 3/258 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/258 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/190 variables, 0/258 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 258 constraints, problems are : Problem set: 3 solved, 3 unsolved in 431 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 105/105 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1053ms problems are : Problem set: 3 solved, 3 unsolved
Parikh walk visited 1 properties in 705 ms.
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 85/85 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 105 transition count 75
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 95 transition count 75
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 20 place count 95 transition count 68
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 88 transition count 68
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 46 place count 82 transition count 62
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 54 place count 82 transition count 54
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 62 place count 74 transition count 54
Applied a total of 62 rules in 70 ms. Remains 74 /105 variables (removed 31) and now considering 54/85 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 74/105 places, 54/85 transitions.
RANDOM walk for 2913 steps (0 resets) in 37 ms. (76 steps per ms) remains 0/2 properties
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA AutoFlight-PT-04a-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 07:09:19] [INFO ] Flatten gal took : 17 ms
[2024-05-21 07:09:19] [INFO ] Flatten gal took : 17 ms
[2024-05-21 07:09:19] [INFO ] Input system was already deterministic with 85 transitions.
Support contains 61 out of 105 places (down from 63) after GAL structural reductions.
Computed a total of 8 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Applied a total of 0 rules in 10 ms. Remains 105 /105 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 105/105 places, 85/85 transitions.
[2024-05-21 07:09:19] [INFO ] Flatten gal took : 13 ms
[2024-05-21 07:09:19] [INFO ] Flatten gal took : 14 ms
[2024-05-21 07:09:19] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Applied a total of 0 rules in 11 ms. Remains 105 /105 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 105/105 places, 85/85 transitions.
[2024-05-21 07:09:19] [INFO ] Flatten gal took : 12 ms
[2024-05-21 07:09:19] [INFO ] Flatten gal took : 14 ms
[2024-05-21 07:09:19] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 105/105 places, 85/85 transitions.
[2024-05-21 07:09:19] [INFO ] Flatten gal took : 12 ms
[2024-05-21 07:09:19] [INFO ] Flatten gal took : 14 ms
[2024-05-21 07:09:19] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Applied a total of 0 rules in 10 ms. Remains 105 /105 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 105/105 places, 85/85 transitions.
[2024-05-21 07:09:19] [INFO ] Flatten gal took : 13 ms
[2024-05-21 07:09:19] [INFO ] Flatten gal took : 13 ms
[2024-05-21 07:09:19] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 105/105 places, 85/85 transitions.
[2024-05-21 07:09:19] [INFO ] Flatten gal took : 11 ms
[2024-05-21 07:09:19] [INFO ] Flatten gal took : 13 ms
[2024-05-21 07:09:20] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 105 transition count 75
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 95 transition count 75
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 20 place count 95 transition count 68
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 88 transition count 68
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 46 place count 82 transition count 62
Applied a total of 46 rules in 21 ms. Remains 82 /105 variables (removed 23) and now considering 62/85 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 82/105 places, 62/85 transitions.
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 9 ms
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 11 ms
[2024-05-21 07:09:20] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 77
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 97 transition count 77
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 97 transition count 72
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 92 transition count 72
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 40 place count 85 transition count 65
Applied a total of 40 rules in 30 ms. Remains 85 /105 variables (removed 20) and now considering 65/85 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 85/105 places, 65/85 transitions.
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 10 ms
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 11 ms
[2024-05-21 07:09:20] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 105/105 places, 85/85 transitions.
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 12 ms
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 13 ms
[2024-05-21 07:09:20] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 105/105 places, 85/85 transitions.
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 8 ms
[2024-05-21 07:09:20] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 105/105 places, 85/85 transitions.
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 7 ms
[2024-05-21 07:09:20] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 105 transition count 75
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 95 transition count 75
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 20 place count 95 transition count 68
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 88 transition count 68
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 46 place count 82 transition count 62
Applied a total of 46 rules in 11 ms. Remains 82 /105 variables (removed 23) and now considering 62/85 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 82/105 places, 62/85 transitions.
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 5 ms
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 07:09:20] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 105 transition count 75
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 95 transition count 75
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 20 place count 95 transition count 68
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 88 transition count 68
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 48 place count 81 transition count 61
Applied a total of 48 rules in 11 ms. Remains 81 /105 variables (removed 24) and now considering 61/85 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 81/105 places, 61/85 transitions.
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 5 ms
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 5 ms
[2024-05-21 07:09:20] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 105/105 places, 85/85 transitions.
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 7 ms
[2024-05-21 07:09:20] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 105/105 places, 85/85 transitions.
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 7 ms
[2024-05-21 07:09:20] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 105/105 places, 85/85 transitions.
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 7 ms
[2024-05-21 07:09:20] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 7 ms
[2024-05-21 07:09:20] [INFO ] Flatten gal took : 7 ms
[2024-05-21 07:09:20] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-21 07:09:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 105 places, 85 transitions and 294 arcs took 2 ms.
Total runtime 6249 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutoFlight-PT-04a

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/415/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: 535
MODEL NAME: /home/mcc/execution/415/model
105 places, 85 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.
Building monolithic NSF...
FORMULA AutoFlight-PT-04a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutoFlight-PT-04a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutoFlight-PT-04a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutoFlight-PT-04a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutoFlight-PT-04a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutoFlight-PT-04a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutoFlight-PT-04a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutoFlight-PT-04a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutoFlight-PT-04a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutoFlight-PT-04a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutoFlight-PT-04a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutoFlight-PT-04a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutoFlight-PT-04a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutoFlight-PT-04a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutoFlight-PT-04a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716275362961

--------------------
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="AutoFlight-PT-04a"
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 AutoFlight-PT-04a, 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 r025-smll-171620165900106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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