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

About the Execution of GreatSPN+red for Referendum-PT-0500

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10373.792 815335.00 2309394.00 1114.50 TFTFFTTFF?T?FFTT 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.r311-tall-171662337000626.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 Referendum-PT-0500, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662337000626
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 641K Apr 11 20:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.0M Apr 11 20:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 191K Apr 11 17:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 11 17:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 246K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 813K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 286K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 339K Apr 12 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 12 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 614K Apr 11 23:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.2M Apr 11 23:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 50K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 124K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 571K 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 Referendum-PT-0500-CTLFireability-2024-00
FORMULA_NAME Referendum-PT-0500-CTLFireability-2024-01
FORMULA_NAME Referendum-PT-0500-CTLFireability-2024-02
FORMULA_NAME Referendum-PT-0500-CTLFireability-2024-03
FORMULA_NAME Referendum-PT-0500-CTLFireability-2024-04
FORMULA_NAME Referendum-PT-0500-CTLFireability-2024-05
FORMULA_NAME Referendum-PT-0500-CTLFireability-2024-06
FORMULA_NAME Referendum-PT-0500-CTLFireability-2024-07
FORMULA_NAME Referendum-PT-0500-CTLFireability-2024-08
FORMULA_NAME Referendum-PT-0500-CTLFireability-2024-09
FORMULA_NAME Referendum-PT-0500-CTLFireability-2024-10
FORMULA_NAME Referendum-PT-0500-CTLFireability-2024-11
FORMULA_NAME Referendum-PT-0500-CTLFireability-2024-12
FORMULA_NAME Referendum-PT-0500-CTLFireability-2024-13
FORMULA_NAME Referendum-PT-0500-CTLFireability-2024-14
FORMULA_NAME Referendum-PT-0500-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716763186173

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0500
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 22:39:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 22:39:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:39:47] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2024-05-26 22:39:47] [INFO ] Transformed 1501 places.
[2024-05-26 22:39:47] [INFO ] Transformed 1001 transitions.
[2024-05-26 22:39:47] [INFO ] Found NUPN structural information;
[2024-05-26 22:39:47] [INFO ] Parsed PT model containing 1501 places and 1001 transitions and 2501 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 54 ms.
Support contains 501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 1000 places and 0 transitions.
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 1500 rules applied. Total rules applied 1500 place count 501 transition count 501
Applied a total of 1500 rules in 58 ms. Remains 501 /1501 variables (removed 1000) and now considering 501/1001 (removed 500) transitions.
// Phase 1: matrix 501 rows 501 cols
[2024-05-26 22:39:47] [INFO ] Computed 0 invariants in 7 ms
[2024-05-26 22:39:48] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-26 22:39:48] [INFO ] Invariant cache hit.
[2024-05-26 22:39:48] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-26 22:39:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 501/1001 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (OVERLAPS) 1/1002 variables, 1/1001 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1002 variables, 1/1002 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 1002 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30049 ms.
Refiners :[Domain max(s): 501/501 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 501/1001 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 500/1500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (OVERLAPS) 1/1002 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 1502 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30018 ms.
Refiners :[Domain max(s): 501/501 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints]
After SMT, in 60382ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60405ms
Starting structural reductions in LTL mode, iteration 1 : 501/1501 places, 501/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60985 ms. Remains : 501/1501 places, 501/1001 transitions.
Support contains 501 out of 501 places after structural reductions.
[2024-05-26 22:40:49] [INFO ] Flatten gal took : 284 ms
[2024-05-26 22:40:50] [INFO ] Flatten gal took : 195 ms
[2024-05-26 22:40:51] [INFO ] Input system was already deterministic with 501 transitions.
Reduction of identical properties reduced properties to check from 50 to 45
RANDOM walk for 40000 steps (76 resets) in 3692 ms. (10 steps per ms) remains 1/45 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4183 ms. (9 steps per ms) remains 1/1 properties
[2024-05-26 22:40:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 501/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 1002/1002 variables, and 1002 constraints, problems are : Problem set: 1 solved, 0 unsolved in 423 ms.
Refiners :[Domain max(s): 501/501 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 732ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-26 22:40:54] [INFO ] Flatten gal took : 74 ms
[2024-05-26 22:40:54] [INFO ] Flatten gal took : 92 ms
[2024-05-26 22:40:55] [INFO ] Input system was already deterministic with 501 transitions.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA Referendum-PT-0500-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 4 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 501/501 places, 501/501 transitions.
[2024-05-26 22:40:55] [INFO ] Flatten gal took : 63 ms
[2024-05-26 22:40:55] [INFO ] Flatten gal took : 68 ms
[2024-05-26 22:40:55] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 2 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 501/501 places, 501/501 transitions.
[2024-05-26 22:40:55] [INFO ] Flatten gal took : 67 ms
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 61 ms
[2024-05-26 22:40:56] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 6 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 501/501 places, 501/501 transitions.
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 30 ms
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 45 ms
[2024-05-26 22:40:56] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 2 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 501/501 places, 501/501 transitions.
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 30 ms
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 78 ms
[2024-05-26 22:40:56] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 499 places :
Symmetric choice reduction at 0 with 499 rule applications. Total rules 499 place count 2 transition count 2
Iterating global reduction 0 with 499 rules applied. Total rules applied 998 place count 2 transition count 2
Applied a total of 998 rules in 41 ms. Remains 2 /501 variables (removed 499) and now considering 2/501 (removed 499) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 2/501 places, 2/501 transitions.
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:40:56] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 9 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 501/501 places, 501/501 transitions.
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 28 ms
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 31 ms
[2024-05-26 22:40:56] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 499 places :
Symmetric choice reduction at 0 with 499 rule applications. Total rules 499 place count 2 transition count 2
Iterating global reduction 0 with 499 rules applied. Total rules applied 998 place count 2 transition count 2
Applied a total of 998 rules in 16 ms. Remains 2 /501 variables (removed 499) and now considering 2/501 (removed 499) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 2/501 places, 2/501 transitions.
[2024-05-26 22:40:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 1 ms
FORMULA Referendum-PT-0500-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:40:56] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 491 places :
Symmetric choice reduction at 0 with 491 rule applications. Total rules 491 place count 10 transition count 10
Iterating global reduction 0 with 491 rules applied. Total rules applied 982 place count 10 transition count 10
Applied a total of 982 rules in 34 ms. Remains 10 /501 variables (removed 491) and now considering 10/501 (removed 491) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 10/501 places, 10/501 transitions.
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:40:56] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 487 places :
Symmetric choice reduction at 0 with 487 rule applications. Total rules 487 place count 14 transition count 14
Iterating global reduction 0 with 487 rules applied. Total rules applied 974 place count 14 transition count 14
Applied a total of 974 rules in 33 ms. Remains 14 /501 variables (removed 487) and now considering 14/501 (removed 487) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 14/501 places, 14/501 transitions.
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:40:56] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 492 places :
Symmetric choice reduction at 0 with 492 rule applications. Total rules 492 place count 9 transition count 9
Iterating global reduction 0 with 492 rules applied. Total rules applied 984 place count 9 transition count 9
Applied a total of 984 rules in 45 ms. Remains 9 /501 variables (removed 492) and now considering 9/501 (removed 492) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 9/501 places, 9/501 transitions.
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:40:56] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 490 places :
Symmetric choice reduction at 0 with 490 rule applications. Total rules 490 place count 11 transition count 11
Iterating global reduction 0 with 490 rules applied. Total rules applied 980 place count 11 transition count 11
Applied a total of 980 rules in 19 ms. Remains 11 /501 variables (removed 490) and now considering 11/501 (removed 490) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 11/501 places, 11/501 transitions.
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:40:56] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 494 places :
Symmetric choice reduction at 0 with 494 rule applications. Total rules 494 place count 7 transition count 7
Iterating global reduction 0 with 494 rules applied. Total rules applied 988 place count 7 transition count 7
Applied a total of 988 rules in 10 ms. Remains 7 /501 variables (removed 494) and now considering 7/501 (removed 494) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 7/501 places, 7/501 transitions.
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:40:56] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 497 places :
Symmetric choice reduction at 0 with 497 rule applications. Total rules 497 place count 4 transition count 4
Iterating global reduction 0 with 497 rules applied. Total rules applied 994 place count 4 transition count 4
Applied a total of 994 rules in 18 ms. Remains 4 /501 variables (removed 497) and now considering 4/501 (removed 497) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 4/501 places, 4/501 transitions.
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:40:56] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 494 places :
Symmetric choice reduction at 0 with 494 rule applications. Total rules 494 place count 7 transition count 7
Iterating global reduction 0 with 494 rules applied. Total rules applied 988 place count 7 transition count 7
Applied a total of 988 rules in 6 ms. Remains 7 /501 variables (removed 494) and now considering 7/501 (removed 494) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 7/501 places, 7/501 transitions.
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:40:56] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 496 places :
Symmetric choice reduction at 0 with 496 rule applications. Total rules 496 place count 5 transition count 5
Iterating global reduction 0 with 496 rules applied. Total rules applied 992 place count 5 transition count 5
Applied a total of 992 rules in 16 ms. Remains 5 /501 variables (removed 496) and now considering 5/501 (removed 496) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 5/501 places, 5/501 transitions.
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:40:56] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:40:56] [INFO ] Input system was already deterministic with 5 transitions.
[2024-05-26 22:40:57] [INFO ] Flatten gal took : 100 ms
[2024-05-26 22:40:57] [INFO ] Flatten gal took : 77 ms
[2024-05-26 22:40:57] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 52 ms.
[2024-05-26 22:40:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 501 places, 501 transitions and 1001 arcs took 4 ms.
Total runtime 70580 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Referendum-PT-0500

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 558
MODEL NAME: /home/mcc/execution/405/model
501 places, 501 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Referendum-PT-0500-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0500-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0500-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0500-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0500-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0500-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0500-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0500-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0500-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0500-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0500-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0500-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0500-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA Referendum-PT-0500-CTLFireability-2024-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716764001508

--------------------
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
MEDDLY ERROR: Insufficient memory

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="Referendum-PT-0500"
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 Referendum-PT-0500, 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 r311-tall-171662337000626"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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