About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d0m06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 57654.00 | 0.00 | 0.00 | FFTFFFTFFFTFTTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994200361.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d0m06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994200361
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 57K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2023-15
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1749147111709
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-05 18:11:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 18:11:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 18:11:53] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2025-06-05 18:11:53] [INFO ] Transformed 262 places.
[2025-06-05 18:11:53] [INFO ] Transformed 73 transitions.
[2025-06-05 18:11:53] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 71 transition count 73
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 64 transition count 66
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 64 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 63 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 63 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 62 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 62 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 62 transition count 63
Applied a total of 20 rules in 27 ms. Remains 62 /72 variables (removed 10) and now considering 63/73 (removed 10) transitions.
// Phase 1: matrix 63 rows 62 cols
[2025-06-05 18:11:53] [INFO ] Computed 5 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:11:53] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-06-05 18:11:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:11:53] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:11:53] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2025-06-05 18:11:53] [INFO ] Invariant cache hit.
[2025-06-05 18:11:53] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:54] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:54] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:54] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:54] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:54] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 63/124 variables, 61/71 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:55] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:55] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:55] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:55] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:55] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:55] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:55] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:55] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:55] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:55] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:55] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:55] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:55] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:56] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:56] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:56] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 1/125 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/125 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (OVERLAPS) 0/125 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 113 constraints, problems are : Problem set: 0 solved, 62 unsolved in 4311 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:11:58] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 63/124 variables, 61/88 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 25/113 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 57/170 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:00] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:00] [INFO ] Deduced a trap along path composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (OVERLAPS) 1/125 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/125 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:06] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/125 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/125 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 17 (OVERLAPS) 0/125 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 179 constraints, problems are : Problem set: 0 solved, 62 unsolved in 14300 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 18696ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 18706ms
Starting structural reductions in LTL mode, iteration 1 : 62/72 places, 63/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19134 ms. Remains : 62/72 places, 63/73 transitions.
Support contains 14 out of 62 places after structural reductions.
[2025-06-05 18:12:12] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2025-06-05 18:12:12] [INFO ] Flatten gal took : 26 ms
[2025-06-05 18:12:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 18:12:12] [INFO ] Flatten gal took : 9 ms
[2025-06-05 18:12:12] [INFO ] Input system was already deterministic with 63 transitions.
Support contains 7 out of 62 places (down from 14) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8939 resets) in 1091 ms. (36 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40002 steps (4115 resets) in 368 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4125 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4075 resets) in 85 ms. (465 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4069 resets) in 95 ms. (416 steps per ms) remains 3/4 properties
[2025-06-05 18:12:13] [INFO ] Invariant cache hit.
[2025-06-05 18:12:13] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 28/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
At refinement iteration 5 (OVERLAPS) 11/50 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/105 variables, 50/55 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 17/72 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/72 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/124 variables, 11/83 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 8/91 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/125 variables, 1/92 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/125 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/125 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 92 constraints, problems are : Problem set: 2 solved, 1 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/48 variables, 4/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 5/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 1/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/68 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 14/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/92 variables, 2/28 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 3/31 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/95 variables, 2/33 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/95 variables, 3/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/95 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 30/125 variables, 37/73 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/125 variables, 20/93 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/125 variables, 0/93 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/125 variables, 0/93 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 93 constraints, problems are : Problem set: 2 solved, 1 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 180ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (complete) has 170 edges and 62 vertex of which 60 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 60 transition count 61
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 58 transition count 59
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 58 transition count 59
Applied a total of 7 rules in 11 ms. Remains 58 /62 variables (removed 4) and now considering 59/63 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 58/62 places, 59/63 transitions.
RANDOM walk for 40000 steps (8998 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4090 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1161 steps, run visited all 1 properties in 15 ms. (steps per millisecond=77 )
Probabilistic random walk after 1161 steps, saw 569 distinct states, run finished after 18 ms. (steps per millisecond=64 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 18:12:13] [INFO ] Flatten gal took : 5 ms
[2025-06-05 18:12:13] [INFO ] Flatten gal took : 6 ms
[2025-06-05 18:12:13] [INFO ] Input system was already deterministic with 63 transitions.
Computed a total of 7 stabilizing places and 9 stable transitions
Graph (complete) has 191 edges and 62 vertex of which 60 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 63
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 59 transition count 61
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 59 transition count 61
Applied a total of 5 rules in 4 ms. Remains 59 /62 variables (removed 3) and now considering 61/63 (removed 2) transitions.
// Phase 1: matrix 61 rows 59 cols
[2025-06-05 18:12:13] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:12:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-05 18:12:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:12:13] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:12:13] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-05 18:12:13] [INFO ] Invariant cache hit.
[2025-06-05 18:12:13] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:14] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:14] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:14] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:14] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:14] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:14] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:14] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:14] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:14] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:14] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:15] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:15] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:15] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 7/102 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:15] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:15] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/120 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 104 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3161 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/164 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:18] [INFO ] Deduced a trap along path composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/120 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 165 constraints, problems are : Problem set: 0 solved, 60 unsolved in 7908 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11095ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 11095ms
Starting structural reductions in LTL mode, iteration 1 : 59/62 places, 61/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11243 ms. Remains : 59/62 places, 61/63 transitions.
[2025-06-05 18:12:24] [INFO ] Flatten gal took : 6 ms
[2025-06-05 18:12:24] [INFO ] Flatten gal took : 4 ms
[2025-06-05 18:12:24] [INFO ] Input system was already deterministic with 61 transitions.
[2025-06-05 18:12:24] [INFO ] Flatten gal took : 4 ms
[2025-06-05 18:12:24] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:12:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality5385751976044778308.gal : 2 ms
[2025-06-05 18:12:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality7623442842431408999.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5385751976044778308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7623442842431408999.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,19185,0.121209,9096,2,1685,5,20895,6,0,297,12216,0
Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t40, t44, t45, t46, t47, t48, t49, t50, t52, t53, t54, t55, t56, t58, t60, Intersection with...235
(forward)formula 0,0,0.720774,33264,1,0,454,139591,143,259,1945,135906,377
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 60 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 60 transition count 62
Applied a total of 3 rules in 6 ms. Remains 60 /62 variables (removed 2) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 60 cols
[2025-06-05 18:12:25] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:12:25] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-05 18:12:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:12:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:12:25] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2025-06-05 18:12:25] [INFO ] Invariant cache hit.
[2025-06-05 18:12:25] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:26] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:26] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:26] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:26] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:26] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:26] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:26] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:26] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:26] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:26] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:26] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 7/101 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 101 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2392 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/101 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:30] [INFO ] Deduced a trap along path composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 163 constraints, problems are : Problem set: 0 solved, 61 unsolved in 8141 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 10552ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 10554ms
Starting structural reductions in LTL mode, iteration 1 : 60/62 places, 62/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10710 ms. Remains : 60/62 places, 62/63 transitions.
[2025-06-05 18:12:36] [INFO ] Flatten gal took : 9 ms
[2025-06-05 18:12:36] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:12:36] [INFO ] Input system was already deterministic with 62 transitions.
[2025-06-05 18:12:36] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:12:36] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:12:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality7871064410992927252.gal : 1 ms
[2025-06-05 18:12:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality8115435448298646493.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7871064410992927252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8115435448298646493.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,19185,0.110295,9108,2,1921,5,21342,6,0,302,13336,0
Converting to forward existential form...Done !
original formula: AF((AX(FALSE) * (AF((p12>=1)) + (l206>0))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(FALSE))) * (!(EG(!((p12>=1)))) + (l206>0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t40, t44, t45, t46, t47, t48, t49, t50, t52, t53, t54, t55, t56, t57, t59, t61, Intersection...240
(forward)formula 0,0,1.29387,54200,1,0,565,254806,152,333,1947,234751,575
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 63
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 59 transition count 61
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 59 transition count 61
Applied a total of 5 rules in 5 ms. Remains 59 /62 variables (removed 3) and now considering 61/63 (removed 2) transitions.
// Phase 1: matrix 61 rows 59 cols
[2025-06-05 18:12:37] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:12:37] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-05 18:12:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:12:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:12:37] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-05 18:12:37] [INFO ] Invariant cache hit.
[2025-06-05 18:12:37] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:38] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:38] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:38] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:38] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:38] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:38] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:38] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:38] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:38] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:38] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:39] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:39] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:39] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 7/102 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:39] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:39] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/120 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 104 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3060 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/164 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:12:42] [INFO ] Deduced a trap along path composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/120 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 165 constraints, problems are : Problem set: 0 solved, 60 unsolved in 7870 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 10952ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 10953ms
Starting structural reductions in LTL mode, iteration 1 : 59/62 places, 61/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11091 ms. Remains : 59/62 places, 61/63 transitions.
[2025-06-05 18:12:48] [INFO ] Flatten gal took : 11 ms
[2025-06-05 18:12:48] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:12:48] [INFO ] Input system was already deterministic with 61 transitions.
[2025-06-05 18:12:48] [INFO ] Flatten gal took : 4 ms
[2025-06-05 18:12:48] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:12:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality4048839736380844323.gal : 1 ms
[2025-06-05 18:12:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality9089624396419150597.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4048839736380844323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9089624396419150597.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,19185,0.108223,8976,2,1685,5,20895,6,0,297,12216,0
Converting to forward existential form...Done !
original formula: AX(EG((s0<=0)))
=> equivalent forward existential formula: [(EY(Init) * !(EG((s0<=0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t40, t44, t45, t46, t47, t48, t49, t50, t52, t53, t54, t55, t56, t58, t60, Intersection with...235
(forward)formula 0,1,0.692555,32992,1,0,355,165066,144,145,1948,103647,425
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 18:12:49] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:12:49] [INFO ] Flatten gal took : 3 ms
Total runtime 56428 ms.
BK_STOP 1749147169363
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="SieveSingleMsgMbox-PT-d0m06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d0m06, 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 r212-tall-174901994200361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m06.tgz
mv SieveSingleMsgMbox-PT-d0m06 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.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 '
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 ;