fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of GreatSPN+red for QuasiCertifProtocol-COL-22

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12078.663 3600000.00 7167947.00 5928.50 ?T??T?F?T???FT?? 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-171662335700034.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 QuasiCertifProtocol-COL-22, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335700034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.7K Apr 13 04:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:03 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 3.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 04:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 13 04:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 104K 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 QuasiCertifProtocol-COL-22-CTLFireability-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716647526129

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 14:32:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 14:32:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:32:07] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 14:32:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 14:32:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 622 ms
[2024-05-25 14:32:08] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
[2024-05-25 14:32:08] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-05-25 14:32:08] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
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 11 formulas.
FORMULA QuasiCertifProtocol-COL-22-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40028 steps (1241 resets) in 810 ms. (49 steps per ms) remains 4/22 properties
BEST_FIRST walk for 40004 steps (420 resets) in 352 ms. (113 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (420 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (420 resets) in 268 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40007 steps (386 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 14:32:08] [INFO ] Computed 5 invariants in 5 ms
Problem AtomicPropp10 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 26/51 variables, 25/30 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 7 (OVERLAPS) 5/56 variables, 5/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 2 solved, 2 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/21 variables, 9/10 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/33 variables, 7/17 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 2/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/41 variables, 2/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/45 variables, 2/23 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/45 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 10/55 variables, 13/36 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/55 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/56 variables, 1/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 37 constraints, problems are : Problem set: 2 solved, 2 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 584ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 134 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=44 )
Parikh walk visited 2 properties in 12 ms.
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
[2024-05-25 14:32:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-25 14:32:09] [INFO ] Flatten gal took : 41 ms
FORMULA QuasiCertifProtocol-COL-22-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 14:32:09] [INFO ] Flatten gal took : 5 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2024-05-25 14:32:09] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 27 ms.
[2024-05-25 14:32:09] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 1916 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 29 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 14:32:09] [INFO ] Computed 1562 invariants in 106 ms
[2024-05-25 14:32:10] [INFO ] Implicit Places using invariants in 666 ms returned []
[2024-05-25 14:32:10] [INFO ] Invariant cache hit.
[2024-05-25 14:32:11] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 14:32:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60629ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60643ms
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62218 ms. Remains : 1916/1966 places, 356/356 transitions.
Support contains 1916 out of 1916 places after structural reductions.
[2024-05-25 14:33:12] [INFO ] Flatten gal took : 157 ms
[2024-05-25 14:33:12] [INFO ] Flatten gal took : 110 ms
[2024-05-25 14:33:12] [INFO ] Input system was already deterministic with 356 transitions.
Reduction of identical properties reduced properties to check from 44 to 42
RANDOM walk for 40000 steps (1482 resets) in 2914 ms. (13 steps per ms) remains 35/42 properties
BEST_FIRST walk for 4002 steps (9 resets) in 207 ms. (19 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (11 resets) in 36 ms. (108 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (9 resets) in 27 ms. (143 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 240 ms. (16 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (9 resets) in 92 ms. (43 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (12 resets) in 37 ms. (105 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (9 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (12 resets) in 35 ms. (111 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (9 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (10 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (9 resets) in 90 ms. (44 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (9 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (9 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (9 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
[2024-05-25 14:33:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1916 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1916 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 2 (OVERLAPS) 356/2272 variables, 1916/3478 constraints. Problems are: Problem set: 7 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2272/2272 variables, and 3478 constraints, problems are : Problem set: 7 solved, 28 unsolved in 5017 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 7 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 7 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 23/1915 variables, 22/1562 constraints. Problems are: Problem set: 7 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1915/2272 variables, and 1562 constraints, problems are : Problem set: 7 solved, 28 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 0/1916 constraints, PredecessorRefiner: 0/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 11374ms problems are : Problem set: 7 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1892 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 35 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1916/1916 places, 356/356 transitions.
RANDOM walk for 40000 steps (1485 resets) in 2172 ms. (18 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (10 resets) in 172 ms. (23 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (10 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 172 ms. (23 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (12 resets) in 96 ms. (41 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (10 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (9 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (12 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (11 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (12 resets) in 69 ms. (57 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
Finished probabilistic random walk after 6846 steps, run visited all 28 properties in 258 ms. (steps per millisecond=26 )
Probabilistic random walk after 6846 steps, saw 6682 distinct states, run finished after 263 ms. (steps per millisecond=26 ) properties seen :28
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
[2024-05-25 14:33:27] [INFO ] Flatten gal took : 73 ms
[2024-05-25 14:33:27] [INFO ] Flatten gal took : 84 ms
[2024-05-25 14:33:27] [INFO ] Input system was already deterministic with 356 transitions.
FORMULA QuasiCertifProtocol-COL-22-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.22 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 119 ms. Remains 1892 /1916 variables (removed 24) and now considering 354/356 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 120 ms. Remains : 1892/1916 places, 354/356 transitions.
[2024-05-25 14:33:28] [INFO ] Flatten gal took : 51 ms
[2024-05-25 14:33:28] [INFO ] Flatten gal took : 53 ms
[2024-05-25 14:33:28] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 294 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 1916/1916 places, 356/356 transitions.
[2024-05-25 14:33:28] [INFO ] Flatten gal took : 48 ms
[2024-05-25 14:33:28] [INFO ] Flatten gal took : 48 ms
[2024-05-25 14:33:28] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 41 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 1916/1916 places, 356/356 transitions.
[2024-05-25 14:33:28] [INFO ] Flatten gal took : 51 ms
[2024-05-25 14:33:28] [INFO ] Flatten gal took : 57 ms
[2024-05-25 14:33:28] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1891 transition count 353
Applied a total of 2 rules in 417 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 417 ms. Remains : 1891/1916 places, 353/356 transitions.
[2024-05-25 14:33:29] [INFO ] Flatten gal took : 44 ms
[2024-05-25 14:33:29] [INFO ] Flatten gal took : 45 ms
[2024-05-25 14:33:29] [INFO ] Input system was already deterministic with 353 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 214 are kept as prefixes of interest. Removing 1702 places using SCC suffix rule.4 ms
Discarding 1702 places :
Also discarding 115 output transitions
Drop transitions (Output transitions of discarded places.) removed 115 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 213 transition count 149
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 213 transition count 149
Applied a total of 93 rules in 21 ms. Remains 213 /1916 variables (removed 1703) and now considering 149/356 (removed 207) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 213/1916 places, 149/356 transitions.
[2024-05-25 14:33:29] [INFO ] Flatten gal took : 6 ms
[2024-05-25 14:33:29] [INFO ] Flatten gal took : 5 ms
[2024-05-25 14:33:29] [INFO ] Input system was already deterministic with 149 transitions.
RANDOM walk for 40000 steps (1266 resets) in 320 ms. (124 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (48 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2532490 steps, run timeout after 3001 ms. (steps per millisecond=843 ) properties seen :0 out of 1
Probabilistic random walk after 2532490 steps, saw 353591 distinct states, run finished after 3009 ms. (steps per millisecond=841 ) properties seen :0
// Phase 1: matrix 149 rows 213 cols
[2024-05-25 14:33:32] [INFO ] Computed 66 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/75 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 22/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 96/171 variables, 47/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 23/194 variables, 22/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 23/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 97/291 variables, 25/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 71/362 variables, 70/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 22/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/362 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Generalized P Invariants (flows): 66/66 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/75 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 22/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/171 variables, 47/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/194 variables, 22/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 23/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 97/291 variables, 25/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 71/362 variables, 70/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 22/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/362 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/362 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Generalized P Invariants (flows): 66/66 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 280ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 62 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=31 )
FORMULA QuasiCertifProtocol-COL-22-CTLFireability-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 71 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 1916/1916 places, 356/356 transitions.
[2024-05-25 14:33:33] [INFO ] Flatten gal took : 39 ms
[2024-05-25 14:33:33] [INFO ] Flatten gal took : 39 ms
[2024-05-25 14:33:33] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 32 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 1916/1916 places, 356/356 transitions.
[2024-05-25 14:33:33] [INFO ] Flatten gal took : 37 ms
[2024-05-25 14:33:33] [INFO ] Flatten gal took : 40 ms
[2024-05-25 14:33:33] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1915 transition count 355
Applied a total of 1 rules in 113 ms. Remains 1915 /1916 variables (removed 1) and now considering 355/356 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 113 ms. Remains : 1915/1916 places, 355/356 transitions.
[2024-05-25 14:33:33] [INFO ] Flatten gal took : 38 ms
[2024-05-25 14:33:33] [INFO ] Flatten gal took : 39 ms
[2024-05-25 14:33:33] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 32 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 1916/1916 places, 356/356 transitions.
[2024-05-25 14:33:33] [INFO ] Flatten gal took : 38 ms
[2024-05-25 14:33:33] [INFO ] Flatten gal took : 42 ms
[2024-05-25 14:33:33] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 64 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 1916/1916 places, 356/356 transitions.
[2024-05-25 14:33:33] [INFO ] Flatten gal took : 35 ms
[2024-05-25 14:33:34] [INFO ] Flatten gal took : 36 ms
[2024-05-25 14:33:34] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 30 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 1916/1916 places, 356/356 transitions.
[2024-05-25 14:33:34] [INFO ] Flatten gal took : 37 ms
[2024-05-25 14:33:34] [INFO ] Flatten gal took : 41 ms
[2024-05-25 14:33:34] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-25 14:33:34] [INFO ] Flatten gal took : 65 ms
[2024-05-25 14:33:34] [INFO ] Flatten gal took : 66 ms
[2024-05-25 14:33:34] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 25 ms.
[2024-05-25 14:33:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1916 places, 356 transitions and 4110 arcs took 8 ms.
Total runtime 87475 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-COL-22

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 579
MODEL NAME: /home/mcc/execution/404/model
1916 places, 356 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.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
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="QuasiCertifProtocol-COL-22"
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 QuasiCertifProtocol-COL-22, 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-171662335700034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-22.tgz
mv QuasiCertifProtocol-COL-22 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 ;