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.r333-tall-171679077600065.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 RingSingleMessageInMbox-PT-d1m010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679077600065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 00:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 13 00:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 00:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Apr 13 00:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M 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 RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716793304170

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 07:01:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 07:01:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 07:01:45] [INFO ] Load time of PNML (sax parser for PT used): 438 ms
[2024-05-27 07:01:45] [INFO ] Transformed 6690 places.
[2024-05-27 07:01:45] [INFO ] Transformed 11934 transitions.
[2024-05-27 07:01:45] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 616 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
Deduced a syphon composed of 4305 places in 43 ms
Reduce places removed 4305 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1098 places :
Symmetric choice reduction at 1 with 1098 rule applications. Total rules 1217 place count 1270 transition count 2430
Iterating global reduction 1 with 1098 rules applied. Total rules applied 2315 place count 1270 transition count 2430
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 2387 place count 1270 transition count 2358
Discarding 916 places :
Symmetric choice reduction at 2 with 916 rule applications. Total rules 3303 place count 354 transition count 1442
Iterating global reduction 2 with 916 rules applied. Total rules applied 4219 place count 354 transition count 1442
Ensure Unique test removed 869 transitions
Reduce isomorphic transitions removed 869 transitions.
Iterating post reduction 2 with 869 rules applied. Total rules applied 5088 place count 354 transition count 573
Discarding 130 places :
Symmetric choice reduction at 3 with 130 rule applications. Total rules 5218 place count 224 transition count 443
Iterating global reduction 3 with 130 rules applied. Total rules applied 5348 place count 224 transition count 443
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 5446 place count 224 transition count 345
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 5454 place count 216 transition count 337
Iterating global reduction 4 with 8 rules applied. Total rules applied 5462 place count 216 transition count 337
Applied a total of 5462 rules in 459 ms. Remains 216 /2385 variables (removed 2169) and now considering 337/11934 (removed 11597) transitions.
// Phase 1: matrix 337 rows 216 cols
[2024-05-27 07:01:46] [INFO ] Computed 3 invariants in 23 ms
[2024-05-27 07:01:46] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-27 07:01:46] [INFO ] Invariant cache hit.
[2024-05-27 07:01:47] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-27 07:01:47] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-05-27 07:01:47] [INFO ] Invariant cache hit.
[2024-05-27 07:01:47] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
At refinement iteration 4 (OVERLAPS) 337/553 variables, 216/219 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 132/351 constraints. Problems are: Problem set: 24 solved, 312 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/351 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 0/553 variables, 0/351 constraints. Problems are: Problem set: 24 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 351 constraints, problems are : Problem set: 24 solved, 312 unsolved in 15611 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 17/208 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 8/216 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 5 (OVERLAPS) 337/553 variables, 216/219 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 132/351 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 312/663 constraints. Problems are: Problem set: 24 solved, 312 unsolved
[2024-05-27 07:02:14] [INFO ] Deduced a trap composed of 111 places in 88 ms of which 15 ms to minimize.
[2024-05-27 07:02:14] [INFO ] Deduced a trap composed of 101 places in 76 ms of which 2 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-05-27 07:02:15] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
[2024-05-27 07:02:15] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
[2024-05-27 07:02:20] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 2 ms to minimize.
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
[2024-05-27 07:02:20] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
[2024-05-27 07:02:20] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
[2024-05-27 07:02:21] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 2 ms to minimize.
[2024-05-27 07:02:21] [INFO ] Deduced a trap composed of 94 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 9/672 constraints. Problems are: Problem set: 46 solved, 290 unsolved
[2024-05-27 07:02:33] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 673 constraints, problems are : Problem set: 46 solved, 290 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 312/336 constraints, Known Traps: 10/10 constraints]
After SMT, in 46528ms problems are : Problem set: 46 solved, 290 unsolved
Search for dead transitions found 46 dead transitions in 46548ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 216/2385 places, 291/11934 transitions.
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 176 transition count 275
Applied a total of 56 rules in 3 ms. Remains 176 /216 variables (removed 40) and now considering 275/291 (removed 16) transitions.
// Phase 1: matrix 275 rows 176 cols
[2024-05-27 07:02:34] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:02:34] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-27 07:02:34] [INFO ] Invariant cache hit.
[2024-05-27 07:02:34] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-27 07:02:34] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 176/2385 places, 275/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48433 ms. Remains : 176/2385 places, 275/11934 transitions.
Support contains 33 out of 176 places after structural reductions.
[2024-05-27 07:02:34] [INFO ] Flatten gal took : 49 ms
[2024-05-27 07:02:34] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 07:02:34] [INFO ] Flatten gal took : 24 ms
[2024-05-27 07:02:34] [INFO ] Input system was already deterministic with 275 transitions.
Support contains 19 out of 176 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (7074 resets) in 2389 ms. (16 steps per ms) remains 10/16 properties
BEST_FIRST walk for 40003 steps (1647 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1766 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1608 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1719 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1606 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1647 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1694 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (6664 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1567 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1631 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
[2024-05-27 07:02:36] [INFO ] Invariant cache hit.
[2024-05-27 07:02:36] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/23 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 50/73 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 174/247 variables, 73/75 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 23/98 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 8 (OVERLAPS) 200/447 variables, 99/197 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 101/298 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/298 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/451 variables, 4/302 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/302 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/451 variables, 0/302 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 302 constraints, problems are : Problem set: 9 solved, 1 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 154/156 variables, 3/4 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/5 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 1/6 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/215 variables, 1/7 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 27/34 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/34 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/219 variables, 1/35 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 1/36 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/36 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 228/447 variables, 140/176 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 123/299 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/447 variables, 0/299 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/451 variables, 4/303 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/451 variables, 0/303 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/451 variables, 0/303 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 303 constraints, problems are : Problem set: 9 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 1/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 406ms problems are : Problem set: 9 solved, 1 unsolved
Finished Parikh walk after 25 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 9 atomic propositions for a total of 10 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 07:02:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-27 07:02:36] [INFO ] Flatten gal took : 16 ms
[2024-05-27 07:02:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 07:02:36] [INFO ] Flatten gal took : 17 ms
[2024-05-27 07:02:36] [INFO ] Input system was already deterministic with 275 transitions.
Support contains 8 out of 176 places (down from 10) after GAL structural reductions.
Computed a total of 24 stabilizing places and 79 stable transitions
Graph (complete) has 634 edges and 176 vertex of which 173 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 275/275 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 174 transition count 273
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 29 place count 149 transition count 248
Iterating global reduction 1 with 25 rules applied. Total rules applied 54 place count 149 transition count 248
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 71 place count 149 transition count 231
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 79 place count 141 transition count 223
Iterating global reduction 2 with 8 rules applied. Total rules applied 87 place count 141 transition count 223
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 95 place count 141 transition count 215
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 140 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 140 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 139 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 139 transition count 201
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 103 place count 135 transition count 197
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 135 transition count 197
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 119 place count 135 transition count 185
Applied a total of 119 rules in 9 ms. Remains 135 /176 variables (removed 41) and now considering 185/275 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 135/176 places, 185/275 transitions.
[2024-05-27 07:02:36] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:02:36] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:02:36] [INFO ] Input system was already deterministic with 185 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 275/275 transitions.
Graph (complete) has 634 edges and 176 vertex of which 174 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 174 transition count 273
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 29 place count 148 transition count 247
Iterating global reduction 1 with 26 rules applied. Total rules applied 55 place count 148 transition count 247
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 73 place count 148 transition count 229
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 81 place count 140 transition count 221
Iterating global reduction 2 with 8 rules applied. Total rules applied 89 place count 140 transition count 221
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 97 place count 140 transition count 213
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 138 transition count 187
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 138 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 137 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 137 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 137 transition count 185
Applied a total of 104 rules in 34 ms. Remains 137 /176 variables (removed 39) and now considering 185/275 (removed 90) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 137/176 places, 185/275 transitions.
[2024-05-27 07:02:36] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:02:36] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:02:36] [INFO ] Input system was already deterministic with 185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 275/275 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 174 transition count 273
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 29 place count 149 transition count 248
Iterating global reduction 1 with 25 rules applied. Total rules applied 54 place count 149 transition count 248
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 71 place count 149 transition count 231
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 79 place count 141 transition count 223
Iterating global reduction 2 with 8 rules applied. Total rules applied 87 place count 141 transition count 223
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 95 place count 141 transition count 215
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 140 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 140 transition count 202
Applied a total of 97 rules in 6 ms. Remains 140 /176 variables (removed 36) and now considering 202/275 (removed 73) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 140/176 places, 202/275 transitions.
[2024-05-27 07:02:36] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:02:36] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:02:36] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 275/275 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 174 transition count 273
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 30 place count 148 transition count 247
Iterating global reduction 1 with 26 rules applied. Total rules applied 56 place count 148 transition count 247
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 73 place count 148 transition count 230
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 139 transition count 221
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 139 transition count 221
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 100 place count 139 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 137 transition count 186
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 137 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 136 transition count 185
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 136 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 136 transition count 184
Applied a total of 107 rules in 7 ms. Remains 136 /176 variables (removed 40) and now considering 184/275 (removed 91) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 136/176 places, 184/275 transitions.
[2024-05-27 07:02:36] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:02:36] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:02:36] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 275/275 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 175 transition count 274
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 149 transition count 248
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 149 transition count 248
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 71 place count 149 transition count 231
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 140 transition count 222
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 140 transition count 222
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 98 place count 140 transition count 213
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 138 transition count 187
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 138 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 137 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 137 transition count 186
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 108 place count 133 transition count 182
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 133 transition count 182
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 120 place count 133 transition count 174
Applied a total of 120 rules in 8 ms. Remains 133 /176 variables (removed 43) and now considering 174/275 (removed 101) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 133/176 places, 174/275 transitions.
[2024-05-27 07:02:36] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:02:36] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:02:36] [INFO ] Input system was already deterministic with 174 transitions.
[2024-05-27 07:02:36] [INFO ] Flatten gal took : 12 ms
[2024-05-27 07:02:36] [INFO ] Flatten gal took : 13 ms
[2024-05-27 07:02:36] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-27 07:02:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 176 places, 275 transitions and 1079 arcs took 4 ms.
Total runtime 51633 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RingSingleMessageInMbox-PT-d1m010

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 597
MODEL NAME: /home/mcc/execution/410/model
176 places, 275 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-07 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716793811170

--------------------
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

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="RingSingleMessageInMbox-PT-d1m010"
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 RingSingleMessageInMbox-PT-d1m010, 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 r333-tall-171679077600065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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