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

About the Execution of GreatSPN+red for CSRepetitions-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12748.084 571716.00 1133348.00 1217.30 ??F??F?TFTT?F??F 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.r069-tall-171620504100265.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 CSRepetitions-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504100265
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 559K Apr 12 10:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Apr 12 10:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 699K Apr 12 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 243K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 645K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 252K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 779K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 562K Apr 12 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.0M Apr 12 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.8M Apr 12 12:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 34K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 67K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 CSRepetitions-PT-10-CTLCardinality-2024-00
FORMULA_NAME CSRepetitions-PT-10-CTLCardinality-2024-01
FORMULA_NAME CSRepetitions-PT-10-CTLCardinality-2024-02
FORMULA_NAME CSRepetitions-PT-10-CTLCardinality-2024-03
FORMULA_NAME CSRepetitions-PT-10-CTLCardinality-2024-04
FORMULA_NAME CSRepetitions-PT-10-CTLCardinality-2024-05
FORMULA_NAME CSRepetitions-PT-10-CTLCardinality-2024-06
FORMULA_NAME CSRepetitions-PT-10-CTLCardinality-2024-07
FORMULA_NAME CSRepetitions-PT-10-CTLCardinality-2024-08
FORMULA_NAME CSRepetitions-PT-10-CTLCardinality-2024-09
FORMULA_NAME CSRepetitions-PT-10-CTLCardinality-2024-10
FORMULA_NAME CSRepetitions-PT-10-CTLCardinality-2024-11
FORMULA_NAME CSRepetitions-PT-10-CTLCardinality-2024-12
FORMULA_NAME CSRepetitions-PT-10-CTLCardinality-2024-13
FORMULA_NAME CSRepetitions-PT-10-CTLCardinality-2024-14
FORMULA_NAME CSRepetitions-PT-10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716423100082

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 00:11:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 00:11:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:11:41] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-23 00:11:41] [INFO ] Transformed 1311 places.
[2024-05-23 00:11:41] [INFO ] Transformed 2300 transitions.
[2024-05-23 00:11:41] [INFO ] Parsed PT model containing 1311 places and 2300 transitions and 8700 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 87 ms.
Support contains 1311 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 27 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2024-05-23 00:11:41] [INFO ] Computed 110 invariants in 58 ms
[2024-05-23 00:11:42] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-23 00:11:42] [INFO ] Invariant cache hit.
[2024-05-23 00:11:43] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-23 00:11:43] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1244 ms to find 0 implicit places.
Running 2200 sub problems to find dead transitions.
[2024-05-23 00:11:43] [INFO ] Invariant cache hit.
[2024-05-23 00:11:43] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30090 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2200/2100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 100/2100 constraints, Known Traps: 0/0 constraints]
After SMT, in 65687ms problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 65738ms
Finished structural reductions in LTL mode , in 1 iterations and 67047 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Support contains 1311 out of 1311 places after structural reductions.
[2024-05-23 00:12:49] [INFO ] Flatten gal took : 213 ms
[2024-05-23 00:12:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CSRepetitions-PT-10-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 00:12:49] [INFO ] Flatten gal took : 142 ms
[2024-05-23 00:12:49] [INFO ] Input system was already deterministic with 2300 transitions.
RANDOM walk for 40000 steps (220 resets) in 10631 ms. (3 steps per ms) remains 67/99 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 176 ms. (22 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
[2024-05-23 00:12:53] [INFO ] Invariant cache hit.
[2024-05-23 00:12:53] [INFO ] State equation strengthened by 100 read => feed constraints.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp97 is UNSAT
Problem AtomicPropp98 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1311 variables, 110/110 constraints. Problems are: Problem set: 57 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1311 variables, 0/110 constraints. Problems are: Problem set: 57 solved, 10 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 2 (OVERLAPS) 2300/3611 variables, 1311/1421 constraints. Problems are: Problem set: 60 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3611 variables, 100/1521 constraints. Problems are: Problem set: 60 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3611 variables, 0/1521 constraints. Problems are: Problem set: 60 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/3611 variables, 0/1521 constraints. Problems are: Problem set: 60 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3611/3611 variables, and 1521 constraints, problems are : Problem set: 60 solved, 7 unsolved in 1832 ms.
Refiners :[Positive P Invariants (semi-flows): 110/110 constraints, State Equation: 1311/1311 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 53/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 60 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1104 variables, 2/2 constraints. Problems are: Problem set: 60 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1104 variables, 0/2 constraints. Problems are: Problem set: 60 solved, 7 unsolved
Problem AtomicPropp56 is UNSAT
At refinement iteration 2 (OVERLAPS) 108/1212 variables, 108/110 constraints. Problems are: Problem set: 61 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1212 variables, 0/110 constraints. Problems are: Problem set: 61 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2104/3316 variables, 1212/1322 constraints. Problems are: Problem set: 61 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3316 variables, 2/1324 constraints. Problems are: Problem set: 61 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3316 variables, 0/1324 constraints. Problems are: Problem set: 61 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 295/3611 variables, 99/1423 constraints. Problems are: Problem set: 61 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3611 variables, 98/1521 constraints. Problems are: Problem set: 61 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3611 variables, 5/1526 constraints. Problems are: Problem set: 61 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3611 variables, 0/1526 constraints. Problems are: Problem set: 61 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/3611 variables, 0/1526 constraints. Problems are: Problem set: 61 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3611/3611 variables, and 1526 constraints, problems are : Problem set: 61 solved, 6 unsolved in 2727 ms.
Refiners :[Positive P Invariants (semi-flows): 110/110 constraints, State Equation: 1311/1311 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 6/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 5712ms problems are : Problem set: 61 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 5 properties in 3282 ms.
Support contains 3 out of 1311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1311 transition count 2201
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 399 place count 1111 transition count 2101
Discarding 988 places :
Symmetric choice reduction at 1 with 988 rule applications. Total rules 1387 place count 123 transition count 1113
Iterating global reduction 1 with 988 rules applied. Total rules applied 2375 place count 123 transition count 1113
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 2463 place count 35 transition count 233
Iterating global reduction 1 with 88 rules applied. Total rules applied 2551 place count 35 transition count 233
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 2639 place count 35 transition count 145
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 2667 place count 17 transition count 135
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Graph (trivial) has 22 edges and 17 vertex of which 12 / 17 are part of one of the 1 SCC in 2 ms
Free SCC test removed 11 places
Iterating post reduction 2 with 85 rules applied. Total rules applied 2752 place count 6 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 2794 place count 6 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 2796 place count 6 transition count 7
Applied a total of 2796 rules in 343 ms. Remains 6 /1311 variables (removed 1305) and now considering 7/2300 (removed 2293) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 343 ms. Remains : 6/1311 places, 7/2300 transitions.
RANDOM walk for 195 steps (3 resets) in 6 ms. (27 steps per ms) remains 0/1 properties
Successfully simplified 61 atomic propositions for a total of 15 simplifications.
FORMULA CSRepetitions-PT-10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 00:13:03] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-23 00:13:03] [INFO ] Flatten gal took : 88 ms
[2024-05-23 00:13:03] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA CSRepetitions-PT-10-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 00:13:03] [INFO ] Flatten gal took : 106 ms
[2024-05-23 00:13:03] [INFO ] Input system was already deterministic with 2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 10 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 1311/1311 places, 2300/2300 transitions.
[2024-05-23 00:13:03] [INFO ] Flatten gal took : 70 ms
[2024-05-23 00:13:03] [INFO ] Flatten gal took : 79 ms
[2024-05-23 00:13:03] [INFO ] Input system was already deterministic with 2300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 300 rules applied. Total rules applied 300 place count 1111 transition count 2200
Applied a total of 300 rules in 166 ms. Remains 1111 /1311 variables (removed 200) and now considering 2200/2300 (removed 100) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 167 ms. Remains : 1111/1311 places, 2200/2300 transitions.
[2024-05-23 00:13:03] [INFO ] Flatten gal took : 50 ms
[2024-05-23 00:13:04] [INFO ] Flatten gal took : 52 ms
[2024-05-23 00:13:04] [INFO ] Input system was already deterministic with 2200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 64 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 1311/1311 places, 2300/2300 transitions.
[2024-05-23 00:13:04] [INFO ] Flatten gal took : 71 ms
[2024-05-23 00:13:04] [INFO ] Flatten gal took : 76 ms
[2024-05-23 00:13:04] [INFO ] Input system was already deterministic with 2300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 6 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 1311/1311 places, 2300/2300 transitions.
[2024-05-23 00:13:04] [INFO ] Flatten gal took : 67 ms
[2024-05-23 00:13:04] [INFO ] Flatten gal took : 74 ms
[2024-05-23 00:13:04] [INFO ] Input system was already deterministic with 2300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 95 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 1311/1311 places, 2300/2300 transitions.
[2024-05-23 00:13:05] [INFO ] Flatten gal took : 61 ms
[2024-05-23 00:13:05] [INFO ] Flatten gal took : 68 ms
[2024-05-23 00:13:05] [INFO ] Input system was already deterministic with 2300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 110 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 1311/1311 places, 2300/2300 transitions.
[2024-05-23 00:13:05] [INFO ] Flatten gal took : 65 ms
[2024-05-23 00:13:05] [INFO ] Flatten gal took : 75 ms
[2024-05-23 00:13:05] [INFO ] Input system was already deterministic with 2300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 50 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 1311/1311 places, 2300/2300 transitions.
[2024-05-23 00:13:05] [INFO ] Flatten gal took : 61 ms
[2024-05-23 00:13:05] [INFO ] Flatten gal took : 69 ms
[2024-05-23 00:13:05] [INFO ] Input system was already deterministic with 2300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 51 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 1311/1311 places, 2300/2300 transitions.
[2024-05-23 00:13:06] [INFO ] Flatten gal took : 62 ms
[2024-05-23 00:13:06] [INFO ] Flatten gal took : 69 ms
[2024-05-23 00:13:06] [INFO ] Input system was already deterministic with 2300 transitions.
[2024-05-23 00:13:06] [INFO ] Flatten gal took : 67 ms
[2024-05-23 00:13:06] [INFO ] Flatten gal took : 71 ms
[2024-05-23 00:13:06] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-23 00:13:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1311 places, 2300 transitions and 8700 arcs took 12 ms.
Total runtime 85266 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CSRepetitions-PT-10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/403/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1311
TRANSITIONS: 2300
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.041s, Sys 0.010s]


SAVING FILE /home/mcc/execution/403/model (.net / .def) ...
EXPORT TIME: [User 0.008s, 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: 557
MODEL NAME: /home/mcc/execution/403/model
1311 places, 2300 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716423671798

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="CSRepetitions-PT-10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CSRepetitions-PT-10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620504100265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-10.tgz
mv CSRepetitions-PT-10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;