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.r378-smll-171683810700057.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 itstools
Input is SieveSingleMsgMbox-PT-d1m06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810700057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K 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 SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716896360664

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-d1m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 11:39:23] [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]
[2024-05-28 11:39:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 11:39:23] [INFO ] Load time of PNML (sax parser for PT used): 340 ms
[2024-05-28 11:39:23] [INFO ] Transformed 1295 places.
[2024-05-28 11:39:23] [INFO ] Transformed 749 transitions.
[2024-05-28 11:39:23] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 606 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 42 ms.
Deduced a syphon composed of 1036 places in 14 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 224 transitions
Reduce isomorphic transitions removed 224 transitions.
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 243 transition count 525
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 301 place count 182 transition count 233
Iterating global reduction 1 with 61 rules applied. Total rules applied 362 place count 182 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 368 place count 182 transition count 227
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 409 place count 141 transition count 186
Iterating global reduction 2 with 41 rules applied. Total rules applied 450 place count 141 transition count 186
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 463 place count 141 transition count 173
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 485 place count 119 transition count 150
Iterating global reduction 3 with 22 rules applied. Total rules applied 507 place count 119 transition count 150
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 519 place count 119 transition count 138
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 524 place count 114 transition count 130
Iterating global reduction 4 with 5 rules applied. Total rules applied 529 place count 114 transition count 130
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 534 place count 109 transition count 125
Iterating global reduction 4 with 5 rules applied. Total rules applied 539 place count 109 transition count 125
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 540 place count 108 transition count 124
Iterating global reduction 4 with 1 rules applied. Total rules applied 541 place count 108 transition count 124
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 542 place count 107 transition count 123
Iterating global reduction 4 with 1 rules applied. Total rules applied 543 place count 107 transition count 123
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 544 place count 106 transition count 122
Iterating global reduction 4 with 1 rules applied. Total rules applied 545 place count 106 transition count 122
Applied a total of 545 rules in 268 ms. Remains 106 /259 variables (removed 153) and now considering 122/749 (removed 627) transitions.
// Phase 1: matrix 122 rows 106 cols
[2024-05-28 11:39:24] [INFO ] Computed 5 invariants in 31 ms
[2024-05-28 11:39:24] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-05-28 11:39:24] [INFO ] Invariant cache hit.
[2024-05-28 11:39:24] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-28 11:39:25] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-28 11:39:25] [INFO ] Invariant cache hit.
[2024-05-28 11:39:25] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 11:39:27] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 1/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 11:39:29] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 3 ms to minimize.
[2024-05-28 11:39:29] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-28 11:39:29] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 11:39:29] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 122/227 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 48/163 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 1/228 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 164 constraints, problems are : Problem set: 0 solved, 121 unsolved in 12244 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 11:39:39] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 1/105 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 122/227 variables, 105/116 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 48/164 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 110/274 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 11:39:44] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 4 ms to minimize.
[2024-05-28 11:39:44] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-28 11:39:45] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (OVERLAPS) 1/228 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 11/289 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 16 (OVERLAPS) 0/228 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 289 constraints, problems are : Problem set: 0 solved, 121 unsolved in 28228 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 9/9 constraints]
After SMT, in 41060ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 41106ms
Starting structural reductions in LTL mode, iteration 1 : 106/259 places, 122/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42488 ms. Remains : 106/259 places, 122/749 transitions.
Support contains 12 out of 106 places after structural reductions.
[2024-05-28 11:40:06] [INFO ] Flatten gal took : 56 ms
[2024-05-28 11:40:06] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 11:40:06] [INFO ] Flatten gal took : 24 ms
[2024-05-28 11:40:06] [INFO ] Input system was already deterministic with 122 transitions.
Support contains 7 out of 106 places (down from 12) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8864 resets) in 2684 ms. (14 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (4192 resets) in 1363 ms. (29 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (4062 resets) in 267 ms. (149 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (4170 resets) in 241 ms. (165 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (4210 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (4237 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (4205 resets) in 163 ms. (243 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (4114 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
Probably explored full state space saw : 113399 states, properties seen :2
Probabilistic random walk after 295758 steps, saw 113399 distinct states, run finished after 2642 ms. (steps per millisecond=111 ) properties seen :2
Explored full state space saw : 113399 states, properties seen :0
Exhaustive walk after 295758 steps, saw 113399 distinct states, run finished after 1837 ms. (steps per millisecond=161 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2024-05-28 11:40:13] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 11:40:13] [INFO ] Flatten gal took : 28 ms
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 11:40:13] [INFO ] Flatten gal took : 22 ms
[2024-05-28 11:40:13] [INFO ] Input system was already deterministic with 122 transitions.
Computed a total of 24 stabilizing places and 29 stable transitions
Graph (complete) has 335 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 122/122 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 105 transition count 121
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 98 transition count 114
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 98 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 98 transition count 110
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 26 place count 92 transition count 103
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 92 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 92 transition count 100
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 39 place count 88 transition count 95
Iterating global reduction 3 with 4 rules applied. Total rules applied 43 place count 88 transition count 95
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 47 place count 84 transition count 90
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 84 transition count 90
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 55 place count 80 transition count 86
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 80 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 80 transition count 84
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 64 place count 77 transition count 81
Iterating global reduction 4 with 3 rules applied. Total rules applied 67 place count 77 transition count 81
Applied a total of 67 rules in 25 ms. Remains 77 /106 variables (removed 29) and now considering 81/122 (removed 41) transitions.
// Phase 1: matrix 81 rows 77 cols
[2024-05-28 11:40:13] [INFO ] Computed 5 invariants in 12 ms
[2024-05-28 11:40:13] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-28 11:40:13] [INFO ] Invariant cache hit.
[2024-05-28 11:40:13] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-28 11:40:13] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-28 11:40:13] [INFO ] Invariant cache hit.
[2024-05-28 11:40:13] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-28 11:40:14] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
[2024-05-28 11:40:14] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-28 11:40:14] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-05-28 11:40:14] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 1/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-28 11:40:15] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:40:15] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:40:15] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-28 11:40:16] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 81/158 variables, 77/90 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 32/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-28 11:40:17] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-05-28 11:40:17] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/158 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 124 constraints, problems are : Problem set: 0 solved, 80 unsolved in 6355 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 1/77 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 81/158 variables, 77/92 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 32/124 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 80/204 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 204 constraints, problems are : Problem set: 0 solved, 80 unsolved in 6022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 10/10 constraints]
After SMT, in 12478ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 12481ms
Starting structural reductions in LTL mode, iteration 1 : 77/106 places, 81/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12895 ms. Remains : 77/106 places, 81/122 transitions.
[2024-05-28 11:40:26] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:40:26] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:40:26] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-28 11:40:26] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:40:26] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:40:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality8142840134764574370.gal : 5 ms
[2024-05-28 11:40:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality12730562632508310133.ctl : 4 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8142840134764574370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12730562632508310133.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,52143,0.336769,12672,2,2284,5,34925,6,0,389,19677,0


Converting to forward existential form...Done !
original formula: AG(EF(EX(TRUE)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EX(TRUE))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t52, t59, t60, t61, t62, t63, t64, t65, t66, t69, t70, t73, t74, t76, t77, t78, t79, t80, In...250
(forward)formula 0,0,1.09758,22764,1,0,147,81877,182,77,2574,42716,174
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 122/122 transitions.
Graph (complete) has 335 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 121
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 99 transition count 115
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 17 place count 99 transition count 112
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 94 transition count 106
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 94 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 94 transition count 104
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 32 place count 91 transition count 100
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 91 transition count 100
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 88 transition count 96
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 88 transition count 96
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 85 transition count 93
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 85 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 85 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 50 place count 83 transition count 90
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 83 transition count 90
Applied a total of 52 rules in 38 ms. Remains 83 /106 variables (removed 23) and now considering 90/122 (removed 32) transitions.
// Phase 1: matrix 90 rows 83 cols
[2024-05-28 11:40:27] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 11:40:27] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 11:40:27] [INFO ] Invariant cache hit.
[2024-05-28 11:40:27] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 11:40:27] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-05-28 11:40:27] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-28 11:40:27] [INFO ] Invariant cache hit.
[2024-05-28 11:40:27] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-28 11:40:29] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-28 11:40:29] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 6 ms to minimize.
[2024-05-28 11:40:29] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-28 11:40:29] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-28 11:40:29] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-28 11:40:29] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 90/173 variables, 83/94 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 130 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5854 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-28 11:40:34] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/83 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 90/173 variables, 83/95 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 36/131 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 89/220 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/173 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 220 constraints, problems are : Problem set: 0 solved, 89 unsolved in 8251 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 7/7 constraints]
After SMT, in 14205ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 14207ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/106 places, 90/122 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14659 ms. Remains : 83/106 places, 90/122 transitions.
[2024-05-28 11:40:42] [INFO ] Flatten gal took : 11 ms
[2024-05-28 11:40:42] [INFO ] Flatten gal took : 12 ms
[2024-05-28 11:40:42] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-28 11:40:42] [INFO ] Flatten gal took : 18 ms
[2024-05-28 11:40:42] [INFO ] Flatten gal took : 24 ms
RANDOM walk for 40000 steps (8977 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
[2024-05-28 11:40:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14422535263501690780.gal : 16 ms
[2024-05-28 11:40:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17813322024213709132.prop : 1 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14422535263501690780.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17813322024213709132.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40002 steps (4192 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Finished probabilistic random walk after 3670 steps, run visited all 1 properties in 14 ms. (steps per millisecond=262 )
Probabilistic random walk after 3670 steps, saw 1633 distinct states, run finished after 20 ms. (steps per millisecond=183 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 122/122 transitions.
Graph (complete) has 335 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 121
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 99 transition count 115
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 17 place count 99 transition count 112
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 94 transition count 106
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 94 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 94 transition count 104
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 32 place count 91 transition count 100
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 91 transition count 100
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 88 transition count 96
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 88 transition count 96
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 85 transition count 93
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 85 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 85 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 50 place count 83 transition count 90
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 83 transition count 90
Applied a total of 52 rules in 50 ms. Remains 83 /106 variables (removed 23) and now considering 90/122 (removed 32) transitions.
// Phase 1: matrix 90 rows 83 cols
[2024-05-28 11:40:42] [INFO ] Computed 5 invariants in 4 ms
[2024-05-28 11:40:42] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 11:40:42] [INFO ] Invariant cache hit.
[2024-05-28 11:40:42] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 11:40:42] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-05-28 11:40:42] [INFO ] Redundant transitions in 3 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-28 11:40:42] [INFO ] Invariant cache hit.
[2024-05-28 11:40:42] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-28 11:40:44] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:40:44] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-28 11:40:44] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-28 11:40:44] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-28 11:40:44] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-05-28 11:40:44] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 90/173 variables, 83/94 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 130 constraints, problems are : Problem set: 0 solved, 89 unsolved in 6046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-28 11:40:49] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/83 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 90/173 variables, 83/95 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 36/131 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 89/220 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/173 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 220 constraints, problems are : Problem set: 0 solved, 89 unsolved in 7808 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 7/7 constraints]
After SMT, in 13961ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 13963ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/106 places, 90/122 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14401 ms. Remains : 83/106 places, 90/122 transitions.
[2024-05-28 11:40:56] [INFO ] Flatten gal took : 13 ms
[2024-05-28 11:40:56] [INFO ] Flatten gal took : 26 ms
[2024-05-28 11:40:56] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-28 11:40:56] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:40:56] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:40:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality228152259058288702.gal : 2 ms
[2024-05-28 11:40:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality6131229655840909739.ctl : 1 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality228152259058288702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6131229655840909739.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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,67181,0.458458,14396,2,2571,5,43521,6,0,422,24715,0


Converting to forward existential form...Done !
original formula: EG(EF((p68<=0)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p68<=0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t47, t49, t59, t66, t67, t68, t69, t70, t71, t72, t73, t76, t77, t80, t81, t83...270
(forward)formula 0,1,2.49194,62220,1,0,517,259610,207,326,2849,259233,480
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 122/122 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 105 transition count 121
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 98 transition count 114
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 98 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 98 transition count 110
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 26 place count 92 transition count 103
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 92 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 92 transition count 100
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 39 place count 88 transition count 95
Iterating global reduction 3 with 4 rules applied. Total rules applied 43 place count 88 transition count 95
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 47 place count 84 transition count 90
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 84 transition count 90
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 55 place count 80 transition count 86
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 80 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 80 transition count 84
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 64 place count 77 transition count 81
Iterating global reduction 4 with 3 rules applied. Total rules applied 67 place count 77 transition count 81
Applied a total of 67 rules in 10 ms. Remains 77 /106 variables (removed 29) and now considering 81/122 (removed 41) transitions.
// Phase 1: matrix 81 rows 77 cols
[2024-05-28 11:40:59] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 11:40:59] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-28 11:40:59] [INFO ] Invariant cache hit.
[2024-05-28 11:40:59] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-28 11:40:59] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-28 11:40:59] [INFO ] Invariant cache hit.
[2024-05-28 11:40:59] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-28 11:41:00] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:41:00] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-28 11:41:00] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:41:00] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 1/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-28 11:41:00] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
[2024-05-28 11:41:00] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:41:01] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-28 11:41:01] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 81/158 variables, 77/90 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 32/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-28 11:41:02] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-28 11:41:02] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/158 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 124 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4692 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 1/77 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 81/158 variables, 77/92 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 32/124 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 80/204 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 204 constraints, problems are : Problem set: 0 solved, 80 unsolved in 5226 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 10/10 constraints]
After SMT, in 9974ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 9976ms
Starting structural reductions in LTL mode, iteration 1 : 77/106 places, 81/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10255 ms. Remains : 77/106 places, 81/122 transitions.
[2024-05-28 11:41:09] [INFO ] Flatten gal took : 6 ms
[2024-05-28 11:41:09] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:41:09] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-28 11:41:09] [INFO ] Flatten gal took : 6 ms
[2024-05-28 11:41:09] [INFO ] Flatten gal took : 8 ms
[2024-05-28 11:41:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality11212805689906361970.gal : 2 ms
[2024-05-28 11:41:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality10857599466089433387.ctl : 1 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11212805689906361970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10857599466089433387.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
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,52143,0.278458,12740,2,2284,5,34925,6,0,389,19677,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.280577,12740,1,0,6,34925,7,1,519,19677,1
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 11:41:09] [INFO ] Flatten gal took : 9 ms
[2024-05-28 11:41:09] [INFO ] Flatten gal took : 8 ms
Total runtime 106744 ms.

BK_STOP 1716896469965

--------------------
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
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-d1m06"
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-5568"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m06, 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 r378-smll-171683810700057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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