About the Execution of ITS-Tools for Anderson-PT-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 483.915 | 225829.00 | 275771.00 | 776.80 | FFFFTTTFFTTFTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r004-smll-171620118300314.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 Anderson-PT-04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118300314
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 15:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 15:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-00
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-01
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-02
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-03
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-04
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-05
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-06
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-07
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-08
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-09
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-10
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-11
FORMULA_NAME Anderson-PT-04-CTLFireability-2023-12
FORMULA_NAME Anderson-PT-04-CTLFireability-2023-13
FORMULA_NAME Anderson-PT-04-CTLFireability-2023-14
FORMULA_NAME Anderson-PT-04-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716422443705
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-23 00:00:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 00:00:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:00:45] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2024-05-23 00:00:46] [INFO ] Transformed 105 places.
[2024-05-23 00:00:46] [INFO ] Transformed 200 transitions.
[2024-05-23 00:00:46] [INFO ] Found NUPN structural information;
[2024-05-23 00:00:46] [INFO ] Parsed PT model containing 105 places and 200 transitions and 752 arcs in 455 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Support contains 62 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 200/200 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 98 transition count 193
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 98 transition count 193
Applied a total of 14 rules in 73 ms. Remains 98 /105 variables (removed 7) and now considering 193/200 (removed 7) transitions.
// Phase 1: matrix 193 rows 98 cols
[2024-05-23 00:00:46] [INFO ] Computed 11 invariants in 30 ms
[2024-05-23 00:00:46] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-05-23 00:00:46] [INFO ] Invariant cache hit.
[2024-05-23 00:00:47] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:00:47] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 921 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-05-23 00:00:47] [INFO ] Invariant cache hit.
[2024-05-23 00:00:47] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 00:00:48] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 19 ms to minimize.
[2024-05-23 00:00:49] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 3 ms to minimize.
[2024-05-23 00:00:49] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-23 00:00:49] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:00:49] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 3 ms to minimize.
[2024-05-23 00:00:49] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 3 ms to minimize.
[2024-05-23 00:00:49] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 3 ms to minimize.
[2024-05-23 00:00:49] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 3 ms to minimize.
[2024-05-23 00:00:50] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 2 ms to minimize.
[2024-05-23 00:00:50] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:00:50] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:00:50] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:00:50] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:00:50] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:00:50] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:00:50] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-05-23 00:00:50] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:00:51] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:00:51] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:00:51] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 00:00:51] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 3 ms to minimize.
[2024-05-23 00:00:51] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 3 ms to minimize.
[2024-05-23 00:00:51] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2024-05-23 00:00:52] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2024-05-23 00:00:52] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:00:52] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
[2024-05-23 00:00:52] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2024-05-23 00:00:52] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:00:52] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:00:52] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:00:52] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:00:53] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2024-05-23 00:00:53] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-05-23 00:00:53] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 3 ms to minimize.
[2024-05-23 00:00:53] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 15/46 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 00:00:54] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2024-05-23 00:00:54] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:00:54] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:00:54] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:00:54] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 3 ms to minimize.
[2024-05-23 00:00:54] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:00:55] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:00:55] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:00:55] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:00:55] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:00:55] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:00:56] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:00:56] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 00:00:56] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:00:57] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:00:57] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 4 ms to minimize.
[2024-05-23 00:00:57] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:00:57] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 2 ms to minimize.
[2024-05-23 00:00:57] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-05-23 00:00:57] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:00:57] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 3 ms to minimize.
[2024-05-23 00:00:57] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 4 ms to minimize.
[2024-05-23 00:00:58] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 2 ms to minimize.
[2024-05-23 00:00:58] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 00:00:59] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:00:59] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:00:59] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:00:59] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:01:00] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 3 ms to minimize.
[2024-05-23 00:01:00] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-05-23 00:01:00] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:01:00] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 00:01:02] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 00:01:03] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-23 00:01:04] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-05-23 00:01:04] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:01:04] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 3 ms to minimize.
[2024-05-23 00:01:04] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 00:01:04] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2024-05-23 00:01:05] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:01:05] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:01:05] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-05-23 00:01:05] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 2 ms to minimize.
[2024-05-23 00:01:06] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 2 ms to minimize.
[2024-05-23 00:01:06] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2024-05-23 00:01:06] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (OVERLAPS) 193/291 variables, 98/190 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 12/202 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 14 (OVERLAPS) 0/291 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 202 constraints, problems are : Problem set: 0 solved, 189 unsolved in 29898 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 81/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 193/291 variables, 98/190 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 12/202 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 189/391 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 00:01:28] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 14 ms to minimize.
[2024-05-23 00:01:31] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:01:32] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:01:32] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-05-23 00:01:32] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 2 ms to minimize.
[2024-05-23 00:01:33] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:01:33] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:01:33] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 8/399 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 00:01:44] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:01:44] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:01:45] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:01:47] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:01:47] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 2 ms to minimize.
SMT process timed out in 60502ms, After SMT, problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 60529ms
Starting structural reductions in LTL mode, iteration 1 : 98/105 places, 193/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61568 ms. Remains : 98/105 places, 193/200 transitions.
Support contains 62 out of 98 places after structural reductions.
[2024-05-23 00:01:48] [INFO ] Flatten gal took : 97 ms
[2024-05-23 00:01:48] [INFO ] Flatten gal took : 47 ms
[2024-05-23 00:01:48] [INFO ] Input system was already deterministic with 193 transitions.
Reduction of identical properties reduced properties to check from 76 to 73
RANDOM walk for 40000 steps (8 resets) in 2890 ms. (13 steps per ms) remains 17/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 11/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 9/11 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 9/9 properties
[2024-05-23 00:01:49] [INFO ] Invariant cache hit.
[2024-05-23 00:01:49] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 1 (OVERLAPS) 69/95 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 3/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/98 variables, 3/11 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-23 00:01:49] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/12 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 193/291 variables, 98/110 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 12/122 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/122 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/122 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 122 constraints, problems are : Problem set: 4 solved, 5 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 4 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (OVERLAPS) 76/94 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp35 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/98 variables, 4/11 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/12 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 193/291 variables, 98/110 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 12/122 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 1/123 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/123 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/291 variables, 0/123 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 123 constraints, problems are : Problem set: 8 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 758ms problems are : Problem set: 8 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 193/193 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 98 transition count 182
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 87 transition count 182
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 37 place count 72 transition count 101
Iterating global reduction 0 with 15 rules applied. Total rules applied 52 place count 72 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 71 transition count 100
Applied a total of 54 rules in 51 ms. Remains 71 /98 variables (removed 27) and now considering 100/193 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 71/98 places, 100/193 transitions.
RANDOM walk for 40000 steps (8 resets) in 338 ms. (117 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2245 steps, run visited all 1 properties in 41 ms. (steps per millisecond=54 )
Probabilistic random walk after 2245 steps, saw 1021 distinct states, run finished after 48 ms. (steps per millisecond=46 ) properties seen :1
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2024-05-23 00:01:50] [INFO ] Flatten gal took : 26 ms
[2024-05-23 00:01:50] [INFO ] Flatten gal took : 30 ms
[2024-05-23 00:01:50] [INFO ] Input system was already deterministic with 193 transitions.
Support contains 51 out of 98 places (down from 54) after GAL structural reductions.
FORMULA Anderson-PT-04-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 84 transition count 125
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 84 transition count 125
Applied a total of 28 rules in 12 ms. Remains 84 /98 variables (removed 14) and now considering 125/193 (removed 68) transitions.
// Phase 1: matrix 125 rows 84 cols
[2024-05-23 00:01:50] [INFO ] Computed 11 invariants in 10 ms
[2024-05-23 00:01:50] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-23 00:01:50] [INFO ] Invariant cache hit.
[2024-05-23 00:01:51] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:01:51] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-23 00:01:51] [INFO ] Invariant cache hit.
[2024-05-23 00:01:51] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-23 00:01:51] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 2 ms to minimize.
[2024-05-23 00:01:51] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-23 00:01:51] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 2 ms to minimize.
[2024-05-23 00:01:52] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2024-05-23 00:01:52] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2024-05-23 00:01:52] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:01:52] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-23 00:01:52] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-23 00:01:52] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-23 00:01:52] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-23 00:01:52] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 2 ms to minimize.
[2024-05-23 00:01:52] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 2 ms to minimize.
[2024-05-23 00:01:52] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 2 ms to minimize.
[2024-05-23 00:01:52] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 2 ms to minimize.
[2024-05-23 00:01:52] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-05-23 00:01:53] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-05-23 00:01:53] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-05-23 00:01:53] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 2 ms to minimize.
[2024-05-23 00:01:53] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-05-23 00:01:53] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-23 00:01:53] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 2 ms to minimize.
[2024-05-23 00:01:53] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-23 00:01:53] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 2 ms to minimize.
[2024-05-23 00:01:53] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 2 ms to minimize.
[2024-05-23 00:01:53] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:01:54] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:01:54] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 125/209 variables, 84/122 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 134 constraints, problems are : Problem set: 0 solved, 121 unsolved in 6470 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 84/84 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-23 00:01:58] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 2 ms to minimize.
[2024-05-23 00:01:58] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:01:58] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-23 00:01:59] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
[2024-05-23 00:01:59] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-23 00:01:59] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-05-23 00:01:59] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-23 00:02:00] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 2 ms to minimize.
[2024-05-23 00:02:00] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-23 00:02:00] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-23 00:02:01] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 125/209 variables, 84/133 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 12/145 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 121/266 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-23 00:02:05] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-23 00:02:09] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 0/209 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 268 constraints, problems are : Problem set: 0 solved, 121 unsolved in 24461 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 84/84 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 40/40 constraints]
After SMT, in 31035ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 31037ms
Starting structural reductions in LTL mode, iteration 1 : 84/98 places, 125/193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31446 ms. Remains : 84/98 places, 125/193 transitions.
[2024-05-23 00:02:22] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:02:22] [INFO ] Flatten gal took : 17 ms
[2024-05-23 00:02:22] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-23 00:02:22] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:02:22] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:02:22] [INFO ] Time to serialize gal into /tmp/CTLFireability12921298597556283237.gal : 5 ms
[2024-05-23 00:02:22] [INFO ] Time to serialize properties into /tmp/CTLFireability17143915745565428386.ctl : 3 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/CTLFireability12921298597556283237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17143915745565428386.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,7264,0.555235,17576,2,4474,5,50118,6,0,464,30704,0
Converting to forward existential form...Done !
original formula: (AF(((((((slot_F.T.F.F==1)&&(p2_0_1==1))&&((next_5==1)&&(ncs_2_3==1)))||(next_5==0))||((ncs_0_2==0)||((slot_F.F.F.F==1)&&(cs_0_3==1)))) *...229
=> equivalent forward existential formula: [FwdG((Init * !(!(EG(!(((((((slot_F.T.F.F==1)&&(p2_0_1==1))&&((next_5==1)&&(ncs_2_3==1)))||(next_5==0))||((ncs_0...289
Reverse transition relation is NOT exact ! Due to transitions t109, t110, t111, t112, t113, t114, t115, t116, t117, t118, t119, t120, t121, t122, t123, t12...258
Hit Full ! (commute/partial/dont) 113/0/12
(forward)formula 0,0,2.49534,62036,1,0,240,261820,283,133,3603,128358,268
FORMULA Anderson-PT-04-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 87 transition count 140
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 87 transition count 140
Applied a total of 22 rules in 8 ms. Remains 87 /98 variables (removed 11) and now considering 140/193 (removed 53) transitions.
// Phase 1: matrix 140 rows 87 cols
[2024-05-23 00:02:24] [INFO ] Computed 11 invariants in 5 ms
[2024-05-23 00:02:25] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-23 00:02:25] [INFO ] Invariant cache hit.
[2024-05-23 00:02:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:02:25] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-23 00:02:25] [INFO ] Invariant cache hit.
[2024-05-23 00:02:25] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-23 00:02:25] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-23 00:02:25] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-05-23 00:02:25] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:02:26] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-05-23 00:02:26] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:02:26] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:02:26] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2024-05-23 00:02:26] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 3 ms to minimize.
[2024-05-23 00:02:26] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:02:26] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 2 ms to minimize.
[2024-05-23 00:02:26] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-23 00:02:27] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:02:27] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-05-23 00:02:27] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2024-05-23 00:02:27] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2024-05-23 00:02:27] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-23 00:02:27] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-23 00:02:27] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-23 00:02:27] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 2 ms to minimize.
[2024-05-23 00:02:27] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-23 00:02:27] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 2 ms to minimize.
[2024-05-23 00:02:28] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-23 00:02:28] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-05-23 00:02:28] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 2 ms to minimize.
[2024-05-23 00:02:28] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 2 ms to minimize.
[2024-05-23 00:02:28] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2024-05-23 00:02:28] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-05-23 00:02:28] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:02:28] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:02:28] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:02:28] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 11/42 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-23 00:02:29] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-05-23 00:02:29] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-05-23 00:02:30] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-23 00:02:30] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-05-23 00:02:30] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-05-23 00:02:30] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-23 00:02:31] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:02:31] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:02:31] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-23 00:02:31] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-23 00:02:33] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:02:33] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-23 00:02:33] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-23 00:02:34] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:02:34] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 140/227 variables, 87/144 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 12/156 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 14 (OVERLAPS) 0/227 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 156 constraints, problems are : Problem set: 0 solved, 136 unsolved in 15095 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 140/227 variables, 87/144 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 12/156 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 136/292 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-23 00:02:52] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-23 00:02:54] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 2 ms to minimize.
[2024-05-23 00:02:55] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-23 00:03:00] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-23 00:03:07] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 227/227 variables, and 297 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 51/51 constraints]
After SMT, in 45205ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 45207ms
Starting structural reductions in LTL mode, iteration 1 : 87/98 places, 140/193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45552 ms. Remains : 87/98 places, 140/193 transitions.
[2024-05-23 00:03:10] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:03:10] [INFO ] Flatten gal took : 18 ms
[2024-05-23 00:03:10] [INFO ] Input system was already deterministic with 140 transitions.
[2024-05-23 00:03:10] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:03:10] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:03:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3274864860240528694.gal : 6 ms
[2024-05-23 00:03:10] [INFO ] Time to serialize properties into /tmp/CTLFireability5880785481142072331.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/CTLFireability3274864860240528694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5880785481142072331.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 -...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,9618,1.07113,25408,2,5168,5,72278,6,0,491,47845,0
Converting to forward existential form...Done !
original formula: A((!((!((AX(((next_2==1)&&(ncs_3_2==1))) * !(((next_3==1)&&(ncs_0_1==1))))) * (EF(((slot_F.F.F.F==1)&&(cs_2_3==1))) + AX(((next_2==1)&&(n...327
=> equivalent forward existential formula: [((Init * !(EG(!((p1_2_5==1))))) * !(E(!((p1_2_5==1)) U (!((!((!((!(EX(!(((next_2==1)&&(ncs_3_2==1))))) * !(((ne...462
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t51, t52, t58, t59, t65, t66, t69, t70, t77, t78, t86, t88, t124, t125, t126, t127, ...327
(forward)formula 0,0,5.16254,117220,1,0,377,672292,330,213,3951,294267,429
FORMULA Anderson-PT-04-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 98 transition count 182
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 87 transition count 182
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 35 place count 74 transition count 115
Iterating global reduction 0 with 13 rules applied. Total rules applied 48 place count 74 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 73 transition count 114
Applied a total of 50 rules in 21 ms. Remains 73 /98 variables (removed 25) and now considering 114/193 (removed 79) transitions.
// Phase 1: matrix 114 rows 73 cols
[2024-05-23 00:03:15] [INFO ] Computed 11 invariants in 2 ms
[2024-05-23 00:03:15] [INFO ] Implicit Places using invariants in 115 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 118 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 72/98 places, 114/193 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 72 transition count 101
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 59 transition count 101
Applied a total of 26 rules in 9 ms. Remains 59 /72 variables (removed 13) and now considering 101/114 (removed 13) transitions.
// Phase 1: matrix 101 rows 59 cols
[2024-05-23 00:03:15] [INFO ] Computed 10 invariants in 2 ms
[2024-05-23 00:03:16] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-23 00:03:16] [INFO ] Invariant cache hit.
[2024-05-23 00:03:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:03:16] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 59/98 places, 101/193 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 391 ms. Remains : 59/98 places, 101/193 transitions.
[2024-05-23 00:03:16] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:03:16] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:03:16] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-23 00:03:16] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:03:16] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:03:16] [INFO ] Time to serialize gal into /tmp/CTLFireability10191668813019229661.gal : 2 ms
[2024-05-23 00:03:16] [INFO ] Time to serialize properties into /tmp/CTLFireability1443474399060481497.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/CTLFireability10191668813019229661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1443474399060481497.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,1824,0.155289,8184,2,1948,5,14482,6,0,340,11704,0
Converting to forward existential form...Done !
original formula: AF(((AG(E((((!((next_4==1)&&(ncs_3_2==1)))&&(next_3==1))&&(ncs_2_3==1)) U EF((p1_1_6==1)))) * (next_6==1)) * (ncs_0_1==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !(E((((!((next_4==1)&&(ncs_3_2==1)))&&(next_3==1))&&(ncs_2_3==1)) U E(TRUE U (p1_1_6==...204
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t11, t23, t41, t42, t44, t45, t46, t64, t70, t72, t73, t74, t75, t76, t77, t78, t79,...290
(forward)formula 0,0,1.23415,35572,1,0,304,145574,235,181,2768,102581,319
FORMULA Anderson-PT-04-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 83 transition count 118
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 83 transition count 118
Applied a total of 30 rules in 7 ms. Remains 83 /98 variables (removed 15) and now considering 118/193 (removed 75) transitions.
// Phase 1: matrix 118 rows 83 cols
[2024-05-23 00:03:17] [INFO ] Computed 11 invariants in 6 ms
[2024-05-23 00:03:17] [INFO ] Implicit Places using invariants in 123 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 125 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/98 places, 118/193 transitions.
Applied a total of 0 rules in 7 ms. Remains 82 /82 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 82/98 places, 118/193 transitions.
[2024-05-23 00:03:17] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:03:17] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:03:17] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-23 00:03:17] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:03:17] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:03:17] [INFO ] Time to serialize gal into /tmp/CTLFireability815205857753973449.gal : 2 ms
[2024-05-23 00:03:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12232043796113219355.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability815205857753973449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12232043796113219355.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 -...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,6416,0.122735,7728,2,2646,5,15259,6,0,449,11031,0
Converting to forward existential form...Done !
original formula: EF(((AX(EX(E(((next_5==1)&&(ncs_2_1==1)) U ((next_5==1)&&(ncs_3_2==1))))) * (next_7==1)) * (p1_0_3==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p1_0_3==1)) * (next_7==1)) * !(EX(!(EX(E(((next_5==1)&&(ncs_2_1==1)) U ((next_5==1)&&(ncs...180
Reverse transition relation is NOT exact ! Due to transitions t102, t103, t104, t105, t106, t107, t108, t109, t110, t111, t112, t113, t114, t115, t116, t11...258
(forward)formula 0,0,0.919546,31352,1,0,253,128082,256,136,3129,65744,275
FORMULA Anderson-PT-04-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 82 transition count 105
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 82 transition count 105
Applied a total of 32 rules in 3 ms. Remains 82 /98 variables (removed 16) and now considering 105/193 (removed 88) transitions.
// Phase 1: matrix 105 rows 82 cols
[2024-05-23 00:03:18] [INFO ] Computed 11 invariants in 5 ms
[2024-05-23 00:03:18] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-23 00:03:18] [INFO ] Invariant cache hit.
[2024-05-23 00:03:18] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:03:18] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-23 00:03:18] [INFO ] Invariant cache hit.
[2024-05-23 00:03:18] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:03:19] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-23 00:03:19] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 2 ms to minimize.
[2024-05-23 00:03:19] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2024-05-23 00:03:19] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 2 ms to minimize.
[2024-05-23 00:03:19] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2024-05-23 00:03:20] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/82 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:03:21] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 2 ms to minimize.
[2024-05-23 00:03:21] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:03:21] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:03:21] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:03:22] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:03:22] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:03:22] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:03:23] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:03:23] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:03:23] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:03:23] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-05-23 00:03:23] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 105/187 variables, 82/111 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 0/187 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 123 constraints, problems are : Problem set: 0 solved, 101 unsolved in 8569 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 82/82 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:03:27] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:03:28] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-05-23 00:03:28] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:03:28] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:03:28] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:03:28] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/82 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:03:30] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:03:30] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-23 00:03:30] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-23 00:03:31] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:03:31] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-23 00:03:31] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/82 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/82 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 105/187 variables, 82/123 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 101/236 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 17 (OVERLAPS) 0/187 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 236 constraints, problems are : Problem set: 0 solved, 101 unsolved in 15011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 82/82 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 30/30 constraints]
After SMT, in 23617ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 23618ms
Starting structural reductions in LTL mode, iteration 1 : 82/98 places, 105/193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23913 ms. Remains : 82/98 places, 105/193 transitions.
[2024-05-23 00:03:42] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:03:42] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:03:42] [INFO ] Input system was already deterministic with 105 transitions.
[2024-05-23 00:03:42] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:03:42] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:03:42] [INFO ] Time to serialize gal into /tmp/CTLFireability789005384735447872.gal : 2 ms
[2024-05-23 00:03:42] [INFO ] Time to serialize properties into /tmp/CTLFireability6080688142578270606.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/CTLFireability789005384735447872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6080688142578270606.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,5376,0.171934,9032,2,3576,5,24680,6,0,436,11287,0
Converting to forward existential form...Done !
original formula: AX(EF(EG(!(E(((slot_F.F.F.F==1)&&(cs_3_2==1)) U (p1_3_4==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EG(!(E(((slot_F.F.F.F==1)&&(cs_3_2==1)) U (p1_3_4==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t29, t30, t31, t33, t34, t35, t37, t38, t39, t53, t89, t90, t91, t92, t93, t94, t95, t96, t97...296
Using saturation style SCC detection
(forward)formula 0,1,3.16071,86332,1,0,233,498143,243,114,3286,194728,236
FORMULA Anderson-PT-04-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 98 transition count 181
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 86 transition count 181
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 40 place count 70 transition count 99
Iterating global reduction 0 with 16 rules applied. Total rules applied 56 place count 70 transition count 99
Applied a total of 56 rules in 11 ms. Remains 70 /98 variables (removed 28) and now considering 99/193 (removed 94) transitions.
// Phase 1: matrix 99 rows 70 cols
[2024-05-23 00:03:45] [INFO ] Computed 11 invariants in 3 ms
[2024-05-23 00:03:45] [INFO ] Implicit Places using invariants in 110 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 69/98 places, 99/193 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 69 transition count 84
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 54 transition count 84
Applied a total of 30 rules in 5 ms. Remains 54 /69 variables (removed 15) and now considering 84/99 (removed 15) transitions.
// Phase 1: matrix 84 rows 54 cols
[2024-05-23 00:03:45] [INFO ] Computed 10 invariants in 2 ms
[2024-05-23 00:03:45] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-23 00:03:45] [INFO ] Invariant cache hit.
[2024-05-23 00:03:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:03:46] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 54/98 places, 84/193 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 380 ms. Remains : 54/98 places, 84/193 transitions.
[2024-05-23 00:03:46] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:03:46] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:03:46] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-23 00:03:46] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:03:46] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:03:46] [INFO ] Time to serialize gal into /tmp/CTLFireability10070966129272280970.gal : 2 ms
[2024-05-23 00:03:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1453231750133680342.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10070966129272280970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1453231750133680342.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,1047,0.118492,5936,2,1565,5,8266,6,0,303,5586,0
Converting to forward existential form...Done !
original formula: EG(EF(((next_6==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((next_6==1)&&(ncs_0_1==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t55, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, Intersection...240
(forward)formula 0,1,0.837587,20916,1,0,208,86020,193,105,2491,44189,226
FORMULA Anderson-PT-04-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 86 transition count 139
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 86 transition count 139
Applied a total of 24 rules in 2 ms. Remains 86 /98 variables (removed 12) and now considering 139/193 (removed 54) transitions.
// Phase 1: matrix 139 rows 86 cols
[2024-05-23 00:03:47] [INFO ] Computed 11 invariants in 3 ms
[2024-05-23 00:03:47] [INFO ] Implicit Places using invariants in 115 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/98 places, 139/193 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 119 ms. Remains : 85/98 places, 139/193 transitions.
[2024-05-23 00:03:47] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:03:47] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:03:47] [INFO ] Input system was already deterministic with 139 transitions.
[2024-05-23 00:03:47] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:03:47] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:03:47] [INFO ] Time to serialize gal into /tmp/CTLFireability9467256094270860693.gal : 2 ms
[2024-05-23 00:03:47] [INFO ] Time to serialize properties into /tmp/CTLFireability15760822034630826971.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/CTLFireability9467256094270860693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15760822034630826971.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,9240,0.321069,12920,2,3065,5,28580,6,0,482,24059,0
Converting to forward existential form...Done !
original formula: EX(((EG((((next_2==0)||(ncs_2_1==0))&&((next_2==0)||(ncs_2_2==0)))) * AG(((next_1==0)||(ncs_3_2==0)))) * ((EF(((next_1==0)||(ncs_1_3==0))...225
=> equivalent forward existential formula: (([(FwdU((EY(Init) * (EG((((next_2==0)||(ncs_2_1==0))&&((next_2==0)||(ncs_2_2==0)))) * !(E(TRUE U !(((next_1==0)...567
Reverse transition relation is NOT exact ! Due to transitions t2, t7, t8, t10, t14, t22, t23, t24, t30, t31, t35, t36, t38, t42, t43, t44, t52, t56, t57, t...355
(forward)formula 0,0,1.9771,52804,1,0,308,258095,304,157,3631,124748,330
FORMULA Anderson-PT-04-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 85 transition count 126
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 85 transition count 126
Applied a total of 26 rules in 3 ms. Remains 85 /98 variables (removed 13) and now considering 126/193 (removed 67) transitions.
// Phase 1: matrix 126 rows 85 cols
[2024-05-23 00:03:49] [INFO ] Computed 11 invariants in 2 ms
[2024-05-23 00:03:49] [INFO ] Implicit Places using invariants in 100 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/98 places, 126/193 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 84/98 places, 126/193 transitions.
[2024-05-23 00:03:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:03:49] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:03:49] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-23 00:03:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:03:49] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:03:49] [INFO ] Time to serialize gal into /tmp/CTLFireability17560988950387528495.gal : 2 ms
[2024-05-23 00:03:49] [INFO ] Time to serialize properties into /tmp/CTLFireability17558735849209084505.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/CTLFireability17560988950387528495.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17558735849209084505.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,7688,0.197869,9108,2,3004,5,19761,6,0,465,15363,0
Converting to forward existential form...Done !
original formula: ((EF(EG(((A(((next_4==1)&&(p1_3_3==1)) U (p1_2_5==1)) * (((next_4==1)&&(ncs_1_1==1))||((slot_T.F.F.F==1)&&(p3_1_0==1)))) * EX(((slot_F.F....381
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EG(((!((E(!((p1_2_5==1)) U (!(((next_4==1)&&(p1_3_3==1))) * !((p1_2_5==1)))) + EG(!((p1_2_...545
Reverse transition relation is NOT exact ! Due to transitions t9, t16, t37, t51, t52, t55, t56, t63, t64, t72, t74, t110, t111, t112, t113, t114, t115, t11...311
(forward)formula 0,0,1.67632,47536,1,0,296,229953,288,157,3470,127366,338
FORMULA Anderson-PT-04-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 83 transition count 118
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 83 transition count 118
Applied a total of 30 rules in 2 ms. Remains 83 /98 variables (removed 15) and now considering 118/193 (removed 75) transitions.
// Phase 1: matrix 118 rows 83 cols
[2024-05-23 00:03:51] [INFO ] Computed 11 invariants in 2 ms
[2024-05-23 00:03:51] [INFO ] Implicit Places using invariants in 110 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/98 places, 118/193 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 82/98 places, 118/193 transitions.
[2024-05-23 00:03:51] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:03:51] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:03:51] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-23 00:03:51] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:03:51] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:03:51] [INFO ] Time to serialize gal into /tmp/CTLFireability5948166319477083509.gal : 2 ms
[2024-05-23 00:03:51] [INFO ] Time to serialize properties into /tmp/CTLFireability15521814009981743457.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5948166319477083509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15521814009981743457.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,6416,0.12198,7468,2,2660,5,14510,6,0,449,10409,0
Converting to forward existential form...Done !
original formula: (EG(AF(((next_0==0)||(ncs_1_0==0)))) + EX(((next_4==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: ([FwdG(Init,!(EG(!(((next_0==0)||(ncs_1_0==0))))))] != FALSE + [(EY(Init) * ((next_4==1)&&(ncs_0_0==1)))] != FAL...158
Reverse transition relation is NOT exact ! Due to transitions t102, t103, t104, t105, t106, t107, t108, t109, t110, t111, t112, t113, t114, t115, t116, t11...258
(forward)formula 0,1,0.982187,34316,1,0,274,136997,261,143,3314,72996,317
FORMULA Anderson-PT-04-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 98 transition count 182
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 87 transition count 182
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 36 place count 73 transition count 108
Iterating global reduction 0 with 14 rules applied. Total rules applied 50 place count 73 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 72 transition count 107
Applied a total of 52 rules in 13 ms. Remains 72 /98 variables (removed 26) and now considering 107/193 (removed 86) transitions.
// Phase 1: matrix 107 rows 72 cols
[2024-05-23 00:03:52] [INFO ] Computed 11 invariants in 1 ms
[2024-05-23 00:03:52] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-23 00:03:52] [INFO ] Invariant cache hit.
[2024-05-23 00:03:52] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:03:52] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-23 00:03:52] [INFO ] Redundant transitions in 3 ms returned []
Running 103 sub problems to find dead transitions.
[2024-05-23 00:03:52] [INFO ] Invariant cache hit.
[2024-05-23 00:03:52] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-23 00:03:53] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-23 00:03:53] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 2 ms to minimize.
[2024-05-23 00:03:53] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-23 00:03:53] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 2 ms to minimize.
[2024-05-23 00:03:53] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-05-23 00:03:53] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-23 00:03:53] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-23 00:03:53] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:03:54] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-23 00:03:54] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 2 ms to minimize.
[2024-05-23 00:03:54] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-23 00:03:54] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-23 00:03:54] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:03:55] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-05-23 00:03:55] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 107/179 variables, 72/98 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 103 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/179 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 110 constraints, problems are : Problem set: 0 solved, 103 unsolved in 7436 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 72/72 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-23 00:04:00] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-23 00:04:01] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:04:01] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:04:01] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:04:01] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-23 00:04:02] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-23 00:04:04] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-23 00:04:05] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 3 ms to minimize.
[2024-05-23 00:04:06] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-23 00:04:07] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:04:07] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-23 00:04:09] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 107/179 variables, 72/110 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 12/122 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/179 variables, 103/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/179 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 15 (OVERLAPS) 0/179 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 225 constraints, problems are : Problem set: 0 solved, 103 unsolved in 19621 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 72/72 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 27/27 constraints]
After SMT, in 27109ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 27110ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/98 places, 107/193 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27370 ms. Remains : 72/98 places, 107/193 transitions.
[2024-05-23 00:04:19] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:04:19] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:04:19] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-23 00:04:19] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:04:19] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:04:19] [INFO ] Time to serialize gal into /tmp/CTLFireability4945754047790483596.gal : 5 ms
[2024-05-23 00:04:19] [INFO ] Time to serialize properties into /tmp/CTLFireability3494629409655992782.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/CTLFireability4945754047790483596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3494629409655992782.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 -...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,2002,0.279924,12788,2,3439,5,25625,6,0,398,19685,0
Converting to forward existential form...Done !
original formula: EG(EF(((EG(((slot_F.F.F.F==1)&&(cs_2_3==1))) + (((p1_3_5==1)&&(next_0==1))&&(ncs_2_2==1))) + (EG(((slot_F.T.F.F==0)||(p3_3_1==0))) * ((ne...182
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((EG(((slot_F.F.F.F==1)&&(cs_2_3==1))) + (((p1_3_5==1)&&(next_0==1))&&(ncs_2_2==1))) + (EG((...231
Reverse transition relation is NOT exact ! Due to transitions t78, t79, t80, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93, Intersection...241
(forward)formula 0,1,2.01243,54488,1,0,296,259869,250,147,3226,114353,372
FORMULA Anderson-PT-04-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 98 transition count 181
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 86 transition count 181
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 38 place count 72 transition count 113
Iterating global reduction 0 with 14 rules applied. Total rules applied 52 place count 72 transition count 113
Applied a total of 52 rules in 10 ms. Remains 72 /98 variables (removed 26) and now considering 113/193 (removed 80) transitions.
// Phase 1: matrix 113 rows 72 cols
[2024-05-23 00:04:21] [INFO ] Computed 11 invariants in 1 ms
[2024-05-23 00:04:21] [INFO ] Implicit Places using invariants in 109 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 71/98 places, 113/193 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 71 transition count 100
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 58 transition count 100
Applied a total of 26 rules in 6 ms. Remains 58 /71 variables (removed 13) and now considering 100/113 (removed 13) transitions.
// Phase 1: matrix 100 rows 58 cols
[2024-05-23 00:04:21] [INFO ] Computed 10 invariants in 1 ms
[2024-05-23 00:04:21] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-23 00:04:21] [INFO ] Invariant cache hit.
[2024-05-23 00:04:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:04:21] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 58/98 places, 100/193 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 326 ms. Remains : 58/98 places, 100/193 transitions.
[2024-05-23 00:04:21] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:04:22] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:04:22] [INFO ] Input system was already deterministic with 100 transitions.
[2024-05-23 00:04:22] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:04:22] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:04:22] [INFO ] Time to serialize gal into /tmp/CTLFireability16526683569989628803.gal : 2 ms
[2024-05-23 00:04:22] [INFO ] Time to serialize properties into /tmp/CTLFireability15432508841663531465.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/CTLFireability16526683569989628803.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15432508841663531465.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,1610,0.164665,8444,2,2421,5,14586,6,0,335,12099,0
Converting to forward existential form...Done !
original formula: AF(AG(AF(((E(((next_4==1)&&(p1_1_3==1)) U ((next_5==1)&&(p1_2_3==1))) * (((next_5==1)&&(ncs_2_0==1))||((next_6==1)&&(ncs_0_0==1)))) * (((...213
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!(((E(((next_4==1)&&(p1_1_3==1)) U ((next_5==1)&&(p1_2_3==1))) * (((next_5==1)&&(...276
Reverse transition relation is NOT exact ! Due to transitions t70, t71, t72, t73, t74, t75, t78, t79, t80, t81, t82, t83, t84, t85, t86, t87, Intersection...241
(forward)formula 0,0,0.834303,26420,1,0,203,96852,232,108,2862,56536,227
FORMULA Anderson-PT-04-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 85 transition count 132
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 85 transition count 132
Applied a total of 26 rules in 3 ms. Remains 85 /98 variables (removed 13) and now considering 132/193 (removed 61) transitions.
// Phase 1: matrix 132 rows 85 cols
[2024-05-23 00:04:22] [INFO ] Computed 11 invariants in 2 ms
[2024-05-23 00:04:22] [INFO ] Implicit Places using invariants in 91 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/98 places, 132/193 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 84/98 places, 132/193 transitions.
[2024-05-23 00:04:22] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:04:22] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:04:22] [INFO ] Input system was already deterministic with 132 transitions.
[2024-05-23 00:04:23] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:04:23] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:04:23] [INFO ] Time to serialize gal into /tmp/CTLFireability12884809562384114619.gal : 1 ms
[2024-05-23 00:04:23] [INFO ] Time to serialize properties into /tmp/CTLFireability14889631065389731416.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12884809562384114619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14889631065389731416.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,8252,0.392753,11024,2,3019,5,24609,6,0,471,19944,0
Converting to forward existential form...Done !
original formula: (AG(!(A((AX(((next_5==1)&&(ncs_3_2==1))) * AG(((next_6==1)&&(ncs_0_0==1)))) U (((EG(((next_3==1)&&(ncs_1_0==1))) + AG(((next_0==1)&&(ncs_...238
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!((((EG(((next_3==1)&&(ncs_1_0==1))) + !(E(TRUE U !(((next_0==1)&&(ncs_2_3==1)))))) *...604
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t8, t14, t16, t17, t22, t28, t36, t37, t38, t45, t49, t50, t51, t116, t117, t118,...334
(forward)formula 0,1,1.99712,45464,1,0,321,202991,304,163,3615,112729,369
FORMULA Anderson-PT-04-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 98 transition count 181
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 86 transition count 181
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 39 place count 71 transition count 106
Iterating global reduction 0 with 15 rules applied. Total rules applied 54 place count 71 transition count 106
Applied a total of 54 rules in 9 ms. Remains 71 /98 variables (removed 27) and now considering 106/193 (removed 87) transitions.
// Phase 1: matrix 106 rows 71 cols
[2024-05-23 00:04:25] [INFO ] Computed 11 invariants in 1 ms
[2024-05-23 00:04:25] [INFO ] Implicit Places using invariants in 101 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 70/98 places, 106/193 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 70 transition count 92
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 56 transition count 92
Applied a total of 28 rules in 5 ms. Remains 56 /70 variables (removed 14) and now considering 92/106 (removed 14) transitions.
// Phase 1: matrix 92 rows 56 cols
[2024-05-23 00:04:25] [INFO ] Computed 10 invariants in 1 ms
[2024-05-23 00:04:25] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-23 00:04:25] [INFO ] Invariant cache hit.
[2024-05-23 00:04:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:04:25] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 56/98 places, 92/193 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 318 ms. Remains : 56/98 places, 92/193 transitions.
[2024-05-23 00:04:25] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:04:25] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:04:25] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-23 00:04:25] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:04:25] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:04:25] [INFO ] Time to serialize gal into /tmp/CTLFireability8115720668523109305.gal : 2 ms
[2024-05-23 00:04:25] [INFO ] Time to serialize properties into /tmp/CTLFireability6835193743274481697.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8115720668523109305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6835193743274481697.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 -...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,1308,0.110865,6536,2,1669,5,10692,6,0,319,7944,0
Converting to forward existential form...Done !
original formula: AF(AG(E(((AG(((next_4==1)&&(p1_3_3==1))) + !(((next_4==1)&&(ncs_2_1==1)))) + AG(((next_7==1)&&(p1_0_3==1)))) U EG(((next_0==1)&&(ncs_1_1=...163
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(((!(E(TRUE U !(((next_4==1)&&(p1_3_3==1))))) + !(((next_4==1)&&(ncs_2_1==1)))) + !(E...244
Reverse transition relation is NOT exact ! Due to transitions t62, t63, t64, t65, t66, t68, t69, t70, t72, t73, t74, t75, t76, t77, t78, t79, Intersection...240
(forward)formula 0,0,0.766671,21432,1,0,218,77377,222,106,2671,40641,254
FORMULA Anderson-PT-04-CTLFireability-2023-13 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 : 98/98 places, 193/193 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 85 transition count 132
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 85 transition count 132
Applied a total of 26 rules in 2 ms. Remains 85 /98 variables (removed 13) and now considering 132/193 (removed 61) transitions.
// Phase 1: matrix 132 rows 85 cols
[2024-05-23 00:04:26] [INFO ] Computed 11 invariants in 5 ms
[2024-05-23 00:04:26] [INFO ] Implicit Places using invariants in 113 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/98 places, 132/193 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 84/98 places, 132/193 transitions.
[2024-05-23 00:04:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:04:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:04:26] [INFO ] Input system was already deterministic with 132 transitions.
[2024-05-23 00:04:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:04:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:04:26] [INFO ] Time to serialize gal into /tmp/CTLFireability3731604446827821283.gal : 1 ms
[2024-05-23 00:04:26] [INFO ] Time to serialize properties into /tmp/CTLFireability2938144427728251954.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3731604446827821283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2938144427728251954.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 -...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,7972,0.203363,10236,2,2950,5,22265,6,0,471,17732,0
Converting to forward existential form...Done !
original formula: E((((slot_F.F.T.F==1)&&(p3_3_2==1)) * (!((AF(((next_3==1)&&(ncs_3_3==1))) * AF(((next_5==1)&&(ncs_1_2==1))))) + !(((next_6==1)&&(ncs_1_1=...269
=> equivalent forward existential formula: ([(FwdU(Init,(((slot_F.F.T.F==1)&&(p3_3_2==1)) * (!((!(EG(!(((next_3==1)&&(ncs_3_3==1))))) * !(EG(!(((next_5==1)...526
Reverse transition relation is NOT exact ! Due to transitions t116, t117, t118, t119, t120, t121, t122, t123, t124, t125, t126, t127, t128, t129, t130, t13...258
(forward)formula 0,0,1.41301,42020,1,0,271,169855,308,153,3577,93219,340
FORMULA Anderson-PT-04-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 85 transition count 132
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 85 transition count 132
Applied a total of 26 rules in 2 ms. Remains 85 /98 variables (removed 13) and now considering 132/193 (removed 61) transitions.
// Phase 1: matrix 132 rows 85 cols
[2024-05-23 00:04:27] [INFO ] Computed 11 invariants in 2 ms
[2024-05-23 00:04:27] [INFO ] Implicit Places using invariants in 145 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 147 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/98 places, 132/193 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150 ms. Remains : 84/98 places, 132/193 transitions.
[2024-05-23 00:04:27] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:04:27] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:04:27] [INFO ] Input system was already deterministic with 132 transitions.
[2024-05-23 00:04:27] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:04:27] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:04:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7839444085766644658.gal : 1 ms
[2024-05-23 00:04:27] [INFO ] Time to serialize properties into /tmp/CTLFireability2344686135065060364.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7839444085766644658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2344686135065060364.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 -...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,7972,0.223401,9972,2,2960,5,22166,6,0,471,17120,0
Converting to forward existential form...Done !
original formula: E(!(((next_2==1)&&(ncs_1_3==1))) U ((!(AF(((next_5==1)&&(ncs_0_2==1)))) * (next_5==1)) * ((ncs_1_2==1) * ((AG(AX(((next_4==1)&&(ncs_0_0==...233
=> equivalent forward existential formula: (([(((FwdU(Init,!(((next_2==1)&&(ncs_1_3==1)))) * (!(!(EG(!(((next_5==1)&&(ncs_0_2==1)))))) * (next_5==1))) * (n...573
Reverse transition relation is NOT exact ! Due to transitions t116, t117, t118, t119, t120, t121, t122, t123, t124, t125, t126, t127, t128, t129, t130, t13...258
Hit Full ! (commute/partial/dont) 106/0/26
(forward)formula 0,1,1.50467,43460,1,0,256,168426,306,144,3659,105553,292
FORMULA Anderson-PT-04-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2024-05-23 00:04:29] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:04:29] [INFO ] Flatten gal took : 6 ms
Total runtime 223924 ms.
BK_STOP 1716422669534
--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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="Anderson-PT-04"
export BK_EXAMINATION="CTLFireability"
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 Anderson-PT-04, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r004-smll-171620118300314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-04.tgz
mv Anderson-PT-04 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;