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.r268-smll-171654407200250.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 Peterson-PT-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407200250
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 19K Apr 12 02:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 02:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 02:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 42K Apr 12 02:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 262K Apr 12 02:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 12 02:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 224K Apr 12 02:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 100K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-2-CTLFireability-2024-00
FORMULA_NAME Peterson-PT-2-CTLFireability-2024-01
FORMULA_NAME Peterson-PT-2-CTLFireability-2024-02
FORMULA_NAME Peterson-PT-2-CTLFireability-2024-03
FORMULA_NAME Peterson-PT-2-CTLFireability-2024-04
FORMULA_NAME Peterson-PT-2-CTLFireability-2024-05
FORMULA_NAME Peterson-PT-2-CTLFireability-2024-06
FORMULA_NAME Peterson-PT-2-CTLFireability-2024-07
FORMULA_NAME Peterson-PT-2-CTLFireability-2024-08
FORMULA_NAME Peterson-PT-2-CTLFireability-2024-09
FORMULA_NAME Peterson-PT-2-CTLFireability-2024-10
FORMULA_NAME Peterson-PT-2-CTLFireability-2024-11
FORMULA_NAME Peterson-PT-2-CTLFireability-2024-12
FORMULA_NAME Peterson-PT-2-CTLFireability-2024-13
FORMULA_NAME Peterson-PT-2-CTLFireability-2024-14
FORMULA_NAME Peterson-PT-2-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716761514817

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-26 22:11:57] [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-26 22:11:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:11:57] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2024-05-26 22:11:57] [INFO ] Transformed 102 places.
[2024-05-26 22:11:57] [INFO ] Transformed 126 transitions.
[2024-05-26 22:11:57] [INFO ] Found NUPN structural information;
[2024-05-26 22:11:57] [INFO ] Parsed PT model containing 102 places and 126 transitions and 384 arcs in 462 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Support contains 102 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 23 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 22:11:58] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-26 22:11:58] [INFO ] Computed 11 invariants in 17 ms
[2024-05-26 22:11:58] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-26 22:11:58] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:11:58] [INFO ] Invariant cache hit.
[2024-05-26 22:11:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 22:11:58] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-26 22:11:58] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:11:58] [INFO ] Invariant cache hit.
[2024-05-26 22:11:58] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 3/102 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 22:12:01] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 30 ms to minimize.
[2024-05-26 22:12:01] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-26 22:12:01] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-05-26 22:12:01] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 3 ms to minimize.
[2024-05-26 22:12:01] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-26 22:12:01] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-26 22:12:01] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-26 22:12:02] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-26 22:12:02] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-26 22:12:02] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-05-26 22:12:02] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-26 22:12:02] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-26 22:12:02] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-05-26 22:12:02] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-26 22:12:02] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
[2024-05-26 22:12:02] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
[2024-05-26 22:12:02] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-26 22:12:03] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 22:12:03] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 256 constraints, problems are : Problem set: 0 solved, 123 unsolved in 11522 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 15/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 123/379 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 22:12:14] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 380 constraints, problems are : Problem set: 0 solved, 123 unsolved in 9024 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 20/20 constraints]
After SMT, in 20709ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 20740ms
Finished structural reductions in LTL mode , in 1 iterations and 21631 ms. Remains : 102/102 places, 126/126 transitions.
Support contains 102 out of 102 places after structural reductions.
[2024-05-26 22:12:20] [INFO ] Flatten gal took : 72 ms
[2024-05-26 22:12:20] [INFO ] Flatten gal took : 35 ms
[2024-05-26 22:12:20] [INFO ] Input system was already deterministic with 126 transitions.
Reduction of identical properties reduced properties to check from 56 to 51
RANDOM walk for 40000 steps (8 resets) in 2795 ms. (14 steps per ms) remains 11/51 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
[2024-05-26 22:12:21] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:12:21] [INFO ] Invariant cache hit.
[2024-05-26 22:12:21] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem AtomicPropp8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/49 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/50 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 4 (OVERLAPS) 55/101 variables, 5/55 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 55/110 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/111 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-26 22:12:22] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-26 22:12:22] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 2/113 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-26 22:12:22] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 1/114 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-26 22:12:22] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 1/115 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-26 22:12:22] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 1/116 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 0/116 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1/102 variables, 1/117 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 1/118 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-26 22:12:22] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-26 22:12:22] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 2/120 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 0/120 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 120/222 variables, 102/222 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/222 variables, 22/244 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/222 variables, 0/244 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-26 22:12:23] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 2 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/222 variables, 1/245 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-26 22:12:23] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/222 variables, 1/246 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/222 variables, 0/246 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 0/222 variables, 0/246 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 246 constraints, problems are : Problem set: 4 solved, 7 unsolved in 1693 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 4 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 3/34 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/35 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/35 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 70/101 variables, 5/40 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 70/110 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/111 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 7/118 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-26 22:12:23] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-26 22:12:23] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-26 22:12:23] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 3/121 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/121 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/102 variables, 1/122 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 1/123 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 2/125 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/125 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 120/222 variables, 102/227 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/222 variables, 22/249 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 7/256 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/222 variables, 0/256 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-26 22:12:24] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/222 variables, 1/257 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-26 22:12:24] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/222 variables, 1/258 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-26 22:12:24] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/222 variables, 1/259 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-26 22:12:24] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/222 variables, 1/260 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/222 variables, 0/260 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 0/222 variables, 0/260 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 260 constraints, problems are : Problem set: 4 solved, 7 unsolved in 1477 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 7/11 constraints, Known Traps: 16/16 constraints]
After SMT, in 3214ms problems are : Problem set: 4 solved, 7 unsolved
Parikh walk visited 5 properties in 2232 ms.
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 70 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 69 transition count 93
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 66 place count 69 transition count 75
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 102 place count 51 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 114 place count 45 transition count 69
Applied a total of 114 rules in 34 ms. Remains 45 /102 variables (removed 57) and now considering 69/126 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 45/102 places, 69/126 transitions.
RANDOM walk for 40000 steps (8 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 3134 steps, run visited all 2 properties in 33 ms. (steps per millisecond=94 )
Probabilistic random walk after 3134 steps, saw 825 distinct states, run finished after 38 ms. (steps per millisecond=82 ) properties seen :2
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-26 22:12:27] [INFO ] Flatten gal took : 13 ms
[2024-05-26 22:12:27] [INFO ] Flatten gal took : 16 ms
[2024-05-26 22:12:27] [INFO ] Input system was already deterministic with 126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 22:12:27] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:12:27] [INFO ] Invariant cache hit.
[2024-05-26 22:12:27] [INFO ] Implicit Places using invariants in 105 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 109 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 99/102 places, 126/126 transitions.
[2024-05-26 22:12:27] [INFO ] Flatten gal took : 15 ms
[2024-05-26 22:12:27] [INFO ] Flatten gal took : 17 ms
[2024-05-26 22:12:28] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 22:12:28] [INFO ] Flatten gal took : 17 ms
[2024-05-26 22:12:28] [INFO ] Flatten gal took : 17 ms
[2024-05-26 22:12:28] [INFO ] Time to serialize gal into /tmp/CTLFireability11212920246703607086.gal : 6 ms
[2024-05-26 22:12:28] [INFO ] Time to serialize properties into /tmp/CTLFireability10404235062672747078.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11212920246703607086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10404235062672747078.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,20754,0.366546,12276,2,3417,5,32021,6,0,525,39597,0


Converting to forward existential form...Done !
original formula: (EG(((((((TestTurn_1_0==0)||(Turn_0_1==0))&&((TestTurn_0_0==0)||(Turn_0_0==0)))&&(((TestTurn_2_1==0)||(Turn_1_2==0))&&((TestTurn_1_1==0)|...1634
=> equivalent forward existential formula: ([(FwdU((Init * EG(((((((TestTurn_1_0==0)||(Turn_0_1==0))&&((TestTurn_0_0==0)||(Turn_0_0==0)))&&(((TestTurn_2_1=...2527
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t25, t26, t28, t47, t48, t49, t71, t72, t75, t76, t77, t78, t91, t92, t93, t94, t...314
(forward)formula 0,0,2.78159,77448,1,0,296,472971,282,145,3287,280510,333
FORMULA Peterson-PT-2-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 22:12:30] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:12:30] [INFO ] Invariant cache hit.
[2024-05-26 22:12:31] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-26 22:12:31] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:12:31] [INFO ] Invariant cache hit.
[2024-05-26 22:12:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 22:12:31] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-26 22:12:31] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:12:31] [INFO ] Invariant cache hit.
[2024-05-26 22:12:31] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 3/102 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 22:12:33] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-05-26 22:12:33] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-05-26 22:12:33] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-26 22:12:33] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 3 ms to minimize.
[2024-05-26 22:12:33] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-26 22:12:33] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-05-26 22:12:33] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-26 22:12:33] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-05-26 22:12:33] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2024-05-26 22:12:33] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-26 22:12:33] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-05-26 22:12:33] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-26 22:12:34] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-05-26 22:12:34] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-26 22:12:34] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
[2024-05-26 22:12:34] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-26 22:12:34] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-26 22:12:34] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 22:12:35] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 256 constraints, problems are : Problem set: 0 solved, 123 unsolved in 11442 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 15/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 123/379 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 22:12:46] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 380 constraints, problems are : Problem set: 0 solved, 123 unsolved in 9195 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 20/20 constraints]
After SMT, in 20671ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 20674ms
Finished structural reductions in LTL mode , in 1 iterations and 20841 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 22:12:51] [INFO ] Flatten gal took : 10 ms
[2024-05-26 22:12:51] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:12:51] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 22:12:51] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:12:51] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:12:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14335086894291295362.gal : 4 ms
[2024-05-26 22:12:51] [INFO ] Time to serialize properties into /tmp/CTLFireability3017628675240967747.ctl : 2 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/CTLFireability14335086894291295362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3017628675240967747.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,20754,0.28915,12356,2,3437,5,32029,6,0,537,38900,0


Converting to forward existential form...Done !
original formula: E(!(((((AX(!((AF(((((((WantSection_2_T==1)&&(TestAlone_1_0_2==1))||((WantSection_0_T==1)&&(TestAlone_2_0_0==1)))||(((WantSection_2_T==1)&...2844
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,!(((((!(EX(!(!((!(EG(!(((((((WantSection_2_T==1)&&(TestAlone_1_0_2==1))||((WantSection_0_T==1)...4350
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t25, t26, t28, t47, t48, t49, t71, t72, t75, t76, t77, t78, t91, t92, t93, t94, t...314
(forward)formula 0,0,7.67464,208696,1,0,622,1.5444e+06,300,306,3414,823838,683
FORMULA Peterson-PT-2-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 22:12:59] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:12:59] [INFO ] Invariant cache hit.
[2024-05-26 22:12:59] [INFO ] Implicit Places using invariants in 62 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 63 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 99/102 places, 126/126 transitions.
[2024-05-26 22:12:59] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:12:59] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:12:59] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 22:12:59] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:12:59] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:12:59] [INFO ] Time to serialize gal into /tmp/CTLFireability14449889832001910768.gal : 2 ms
[2024-05-26 22:12:59] [INFO ] Time to serialize properties into /tmp/CTLFireability18256159747652090600.ctl : 2 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/CTLFireability14449889832001910768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18256159747652090600.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,20754,0.28612,12348,2,3417,5,32021,6,0,525,39597,0


Converting to forward existential form...Done !
original formula: (AG(((EF((((((TestIdentity_0_0_2==0)&&(TestIdentity_2_0_0==0))&&((TestIdentity_2_1_1==0)&&(TestIdentity_1_0_2==0)))&&(((TestIdentity_0_1_...2297
=> equivalent forward existential formula: [(((FwdU((Init * !((EX(!(EG(!(((((((TestTurn_1_0==1)&&(Turn_0_1==1))||((TestTurn_0_0==1)&&(Turn_0_0==1)))||(((Te...2378
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t25, t26, t28, t47, t48, t49, t71, t72, t75, t76, t77, t78, t91, t92, t93, t94, t...314
(forward)formula 0,1,1.79017,49612,1,0,254,249794,273,128,3068,165184,262
FORMULA Peterson-PT-2-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 22:13:01] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:13:01] [INFO ] Invariant cache hit.
[2024-05-26 22:13:01] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-26 22:13:01] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:13:01] [INFO ] Invariant cache hit.
[2024-05-26 22:13:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 22:13:01] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-26 22:13:01] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:13:01] [INFO ] Invariant cache hit.
[2024-05-26 22:13:01] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 3/102 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 22:13:03] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-05-26 22:13:03] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-26 22:13:03] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-26 22:13:03] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
[2024-05-26 22:13:03] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-26 22:13:03] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-05-26 22:13:04] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-26 22:13:04] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 3 ms to minimize.
[2024-05-26 22:13:04] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-26 22:13:04] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-05-26 22:13:04] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-26 22:13:04] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-26 22:13:04] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-26 22:13:04] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-26 22:13:04] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
[2024-05-26 22:13:04] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-26 22:13:04] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-26 22:13:04] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 22:13:06] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 256 constraints, problems are : Problem set: 0 solved, 123 unsolved in 11940 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 15/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 123/379 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 22:13:18] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 380 constraints, problems are : Problem set: 0 solved, 123 unsolved in 8531 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 20/20 constraints]
After SMT, in 20494ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 20496ms
Finished structural reductions in LTL mode , in 1 iterations and 20666 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 22:13:22] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:13:22] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:13:22] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 22:13:22] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:13:22] [INFO ] Flatten gal took : 11 ms
[2024-05-26 22:13:22] [INFO ] Time to serialize gal into /tmp/CTLFireability7155531616747378740.gal : 2 ms
[2024-05-26 22:13:22] [INFO ] Time to serialize properties into /tmp/CTLFireability11175803778036381144.ctl : 2 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/CTLFireability7155531616747378740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11175803778036381144.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,20754,0.455313,12364,2,3437,5,32029,6,0,537,38900,0


Converting to forward existential form...Done !
original formula: (AG(((((((TestTurn_1_0==0)||(Turn_0_1==0))&&((TestTurn_0_0==0)||(Turn_0_0==0)))&&(((TestTurn_2_1==0)||(Turn_1_2==0))&&((TestTurn_1_1==0)|...1935
=> equivalent forward existential formula: ([(((FwdU(FwdU((Init * !(!(E(TRUE U !(((((((TestTurn_1_0==0)||(Turn_0_1==0))&&((TestTurn_0_0==0)||(Turn_0_0==0))...5452
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t25, t26, t28, t47, t48, t49, t71, t72, t75, t76, t77, t78, t91, t92, t93, t94, t...314
(forward)formula 0,1,3.26453,80052,1,0,272,451712,286,142,3543,306222,296
FORMULA Peterson-PT-2-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 22:13:25] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:13:25] [INFO ] Invariant cache hit.
[2024-05-26 22:13:25] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-26 22:13:25] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:13:25] [INFO ] Invariant cache hit.
[2024-05-26 22:13:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 22:13:25] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-26 22:13:25] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:13:25] [INFO ] Invariant cache hit.
[2024-05-26 22:13:25] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 3/102 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 22:13:27] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-26 22:13:27] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-26 22:13:28] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 3 ms to minimize.
[2024-05-26 22:13:28] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-26 22:13:28] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-26 22:13:28] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-05-26 22:13:28] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-26 22:13:28] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-05-26 22:13:28] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2024-05-26 22:13:28] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
[2024-05-26 22:13:28] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
[2024-05-26 22:13:28] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-26 22:13:28] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-26 22:13:28] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-26 22:13:28] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-05-26 22:13:29] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
[2024-05-26 22:13:29] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-26 22:13:29] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 22:13:30] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 256 constraints, problems are : Problem set: 0 solved, 123 unsolved in 12398 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 15/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 123/379 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 22:13:42] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 380 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7960 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 20/20 constraints]
After SMT, in 20392ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 20398ms
Finished structural reductions in LTL mode , in 1 iterations and 20663 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 22:13:46] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:13:46] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:13:46] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 22:13:46] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:13:46] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:13:46] [INFO ] Time to serialize gal into /tmp/CTLFireability2941296357209088017.gal : 2 ms
[2024-05-26 22:13:46] [INFO ] Time to serialize properties into /tmp/CTLFireability17888461117337551253.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/CTLFireability2941296357209088017.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17888461117337551253.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,20754,0.276675,12364,2,3437,5,32029,6,0,537,38900,0


Converting to forward existential form...Done !
original formula: EF(AG(EX(((((WantSection_1_F==1)&&(Idle_1==1))||((WantSection_2_F==1)&&(Idle_2==1)))||((WantSection_0_F==1)&&(Idle_0==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(((((WantSection_1_F==1)&&(Idle_1==1))||((WantSection_2_F==1)&&(Idle_2==1)))|...207
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t25, t26, t28, t47, t48, t49, t71, t72, t75, t76, t77, t78, t91, t92, t93, t94, t...314
(forward)formula 0,0,1.77477,51144,1,0,261,259326,273,133,3193,176430,269
FORMULA Peterson-PT-2-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 70 transition count 94
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 64 place count 70 transition count 74
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 104 place count 50 transition count 74
Applied a total of 104 rules in 11 ms. Remains 50 /102 variables (removed 52) and now considering 74/126 (removed 52) transitions.
[2024-05-26 22:13:48] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
// Phase 1: matrix 68 rows 50 cols
[2024-05-26 22:13:48] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 22:13:48] [INFO ] Implicit Places using invariants in 81 ms returned [39, 41, 42]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 82 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 47/102 places, 74/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 97 ms. Remains : 47/102 places, 74/126 transitions.
[2024-05-26 22:13:48] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:13:48] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:13:48] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-26 22:13:48] [INFO ] Flatten gal took : 3 ms
[2024-05-26 22:13:48] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:13:48] [INFO ] Time to serialize gal into /tmp/CTLFireability9279431757129447920.gal : 1 ms
[2024-05-26 22:13:48] [INFO ] Time to serialize properties into /tmp/CTLFireability16004441666270570832.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/CTLFireability9279431757129447920.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16004441666270570832.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,1782,0.075301,5532,2,892,5,7287,6,0,265,7897,0


Converting to forward existential form...Done !
original formula: EF(EG(((((IsEndLoop_0_1_2==1)||(IsEndLoop_2_1_2==1))||((IsEndLoop_0_0_2==1)||(IsEndLoop_2_0_2==1)))||((IsEndLoop_1_0_2==1)||(IsEndLoop_1_...166
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((((IsEndLoop_0_1_2==1)||(IsEndLoop_2_1_2==1))||((IsEndLoop_0_0_2==1)||(IsEndLoop_2_0_2==1...216
Hit Full ! (commute/partial/dont) 62/0/12
(forward)formula 0,1,0.266971,8700,1,0,8,26364,19,1,1394,13446,8
FORMULA Peterson-PT-2-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 22:13:48] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-26 22:13:48] [INFO ] Computed 11 invariants in 4 ms
[2024-05-26 22:13:48] [INFO ] Implicit Places using invariants in 128 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 129 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 99/102 places, 126/126 transitions.
[2024-05-26 22:13:48] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:13:48] [INFO ] Flatten gal took : 10 ms
[2024-05-26 22:13:48] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 22:13:48] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:13:48] [INFO ] Flatten gal took : 10 ms
[2024-05-26 22:13:48] [INFO ] Time to serialize gal into /tmp/CTLFireability13808512639597804647.gal : 2 ms
[2024-05-26 22:13:48] [INFO ] Time to serialize properties into /tmp/CTLFireability10707063420684829093.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/CTLFireability13808512639597804647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10707063420684829093.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,20754,0.471598,12612,2,3417,5,32021,6,0,525,39597,0


Converting to forward existential form...Done !
original formula: EF((AG((EX(((((TestIdentity_2_1_2==0)&&(TestIdentity_2_0_2==0))&&((TestIdentity_1_0_1==0)&&(TestIdentity_0_1_0==0)))&&((TestIdentity_1_1_...1428
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((((((BeginLoop_0_0_1==1)||(BeginLoop_2_1_1==1))||((BeginLoop_0_0_2==1)||(BeginLoop_0_1_1==...1492
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t25, t26, t28, t47, t48, t49, t71, t72, t75, t76, t77, t78, t91, t92, t93, t94, t...314
(forward)formula 0,0,4.46576,117988,1,0,362,774271,278,183,3167,496280,371
FORMULA Peterson-PT-2-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 22:13:53] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:13:53] [INFO ] Invariant cache hit.
[2024-05-26 22:13:53] [INFO ] Implicit Places using invariants in 64 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 65 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 99/102 places, 126/126 transitions.
[2024-05-26 22:13:53] [INFO ] Flatten gal took : 11 ms
[2024-05-26 22:13:53] [INFO ] Flatten gal took : 11 ms
[2024-05-26 22:13:53] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 22:13:53] [INFO ] Flatten gal took : 10 ms
[2024-05-26 22:13:53] [INFO ] Flatten gal took : 10 ms
[2024-05-26 22:13:53] [INFO ] Time to serialize gal into /tmp/CTLFireability9782998688568427584.gal : 2 ms
[2024-05-26 22:13:53] [INFO ] Time to serialize properties into /tmp/CTLFireability11145349322198439520.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/CTLFireability9782998688568427584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11145349322198439520.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,20754,0.448501,12612,2,3417,5,32021,6,0,525,39597,0


Converting to forward existential form...Done !
original formula: EF((AG((((((TestTurn_1_0==1)&&(Turn_0_1==1))||((TestTurn_0_0==1)&&(Turn_0_0==1)))||(((TestTurn_2_1==1)&&(Turn_1_2==1))||((TestTurn_1_1==1...1098
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(E(TRUE U !((((((TestTurn_1_0==1)&&(Turn_0_1==1))||((TestTurn_0_0==1)&&(Turn_0_0==1)))||(...1456
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t25, t26, t28, t47, t48, t49, t71, t72, t75, t76, t77, t78, t91, t92, t93, t94, t...314
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.24307,60828,1,0,271,317757,290,138,3450,222592,283
FORMULA Peterson-PT-2-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 102 transition count 95
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 64 place count 71 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 69 transition count 93
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 66 place count 69 transition count 77
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 98 place count 53 transition count 77
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 110 place count 47 transition count 71
Applied a total of 110 rules in 14 ms. Remains 47 /102 variables (removed 55) and now considering 71/126 (removed 55) transitions.
[2024-05-26 22:13:55] [INFO ] Flow matrix only has 65 transitions (discarded 6 similar events)
// Phase 1: matrix 65 rows 47 cols
[2024-05-26 22:13:55] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 22:13:55] [INFO ] Implicit Places using invariants in 66 ms returned [36, 38, 39]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 67 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 44/102 places, 71/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 85 ms. Remains : 44/102 places, 71/126 transitions.
[2024-05-26 22:13:55] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:13:55] [INFO ] Flatten gal took : 3 ms
[2024-05-26 22:13:55] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-26 22:13:55] [INFO ] Flatten gal took : 3 ms
[2024-05-26 22:13:55] [INFO ] Flatten gal took : 2 ms
[2024-05-26 22:13:55] [INFO ] Time to serialize gal into /tmp/CTLFireability14181666448691574351.gal : 1 ms
[2024-05-26 22:13:55] [INFO ] Time to serialize properties into /tmp/CTLFireability18256649852997460220.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/CTLFireability14181666448691574351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18256649852997460220.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,2190,0.074491,5516,2,1006,5,7644,6,0,250,7467,0


Converting to forward existential form...Done !
original formula: (EG((BeginLoop_1_0_1==1)) + AG((EF((BeginLoop_2_0_1!=1)) + (((((TestAlone_1_0_0!=1)||(WantSection_0_F!=1))||(IsEndLoop_1_0_0!=1))&&(TestT...186
=> equivalent forward existential formula: [((FwdU((Init * !(EG((BeginLoop_1_0_1==1)))),TRUE) * !((((((TestAlone_1_0_0!=1)||(WantSection_0_F!=1))||(IsEndLo...252
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t17, t18, t21, t22, t23, t24, t33, t34, t35, t46, t47, t50, t51, t53, t54, t55, t56, ...293
(forward)formula 0,1,0.379481,12116,1,0,177,46521,163,73,1631,36067,152
FORMULA Peterson-PT-2-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 22:13:56] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-26 22:13:56] [INFO ] Computed 11 invariants in 3 ms
[2024-05-26 22:13:56] [INFO ] Implicit Places using invariants in 132 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 133 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 144 ms. Remains : 99/102 places, 126/126 transitions.
[2024-05-26 22:13:56] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:13:56] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:13:56] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 22:13:56] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:13:56] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:13:56] [INFO ] Time to serialize gal into /tmp/CTLFireability16666753544566534072.gal : 2 ms
[2024-05-26 22:13:56] [INFO ] Time to serialize properties into /tmp/CTLFireability7948145825430219316.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/CTLFireability16666753544566534072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7948145825430219316.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,20754,0.45028,12608,2,3417,5,32021,6,0,525,39597,0


Converting to forward existential form...Done !
original formula: EF(AG(((IsEndLoop_0_1_0==1) * EX(((Turn_1_2==1)&&(AskForSection_2_1==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((IsEndLoop_0_1_0==1) * EX(((Turn_1_2==1)&&(AskForSection_2_1==1))))))))] != FA...158
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t25, t26, t28, t47, t48, t49, t71, t72, t75, t76, t77, t78, t91, t92, t93, t94, t...314
(forward)formula 0,0,2.04248,48100,1,0,258,237002,274,131,3109,161218,266
FORMULA Peterson-PT-2-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 22:13:58] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:13:58] [INFO ] Invariant cache hit.
[2024-05-26 22:13:58] [INFO ] Implicit Places using invariants in 65 ms returned [85, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 100/102 places, 126/126 transitions.
[2024-05-26 22:13:58] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:13:58] [INFO ] Flatten gal took : 5 ms
[2024-05-26 22:13:58] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 22:13:58] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:13:58] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:13:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13021298063836568616.gal : 2 ms
[2024-05-26 22:13:58] [INFO ] Time to serialize properties into /tmp/CTLFireability8039674273575644196.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/CTLFireability13021298063836568616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8039674273575644196.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,20754,0.282749,12616,2,3471,5,32480,6,0,529,40815,0


Converting to forward existential form...Done !
original formula: AG(((AG(AX(((TestTurn_2_1==1)&&(Turn_1_2==1)))) + (((AG((BeginLoop_0_1_2==1)) * AF((((Turn_1_0==1)&&(AskForSection_0_1==1))||(BeginLoop_2...596
=> equivalent forward existential formula: ([(EY(EY(((FwdU(Init,TRUE) * !((!(E(TRUE U !(!(EX(!(((TestTurn_2_1==1)&&(Turn_1_2==1)))))))) + (((!(E(TRUE U !((...1303
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t25, t26, t28, t47, t48, t49, t71, t72, t75, t76, t77, t78, t91, t92, t93, t94, t...314
(forward)formula 0,0,2.1614,61172,1,0,281,317379,302,146,3257,224133,307
FORMULA Peterson-PT-2-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 22:14:00] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:14:00] [INFO ] Invariant cache hit.
[2024-05-26 22:14:00] [INFO ] Implicit Places using invariants in 82 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 84 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 99/102 places, 126/126 transitions.
[2024-05-26 22:14:00] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:14:00] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:14:00] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 22:14:00] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:14:00] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:14:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11172829652430356442.gal : 2 ms
[2024-05-26 22:14:00] [INFO ] Time to serialize properties into /tmp/CTLFireability3875568545282345302.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/CTLFireability11172829652430356442.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3875568545282345302.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,20754,0.456701,12348,2,3417,5,32021,6,0,525,39597,0


Converting to forward existential form...Done !
original formula: AX(EF(AX(EG((((Turn_0_1==1)&&(AskForSection_2_0==1))||((TestTurn_1_1==1)&&(Turn_1_0==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX(!(EG((((Turn_0_1==1)&&(AskForSection_2_0==1))||((TestTurn_1_1==1)&&(Turn_1_0==1))))...170
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t25, t26, t28, t47, t48, t49, t71, t72, t75, t76, t77, t78, t91, t92, t93, t94, t...314
(forward)formula 0,0,1.59088,43308,1,0,261,195806,277,134,3041,156676,269
FORMULA Peterson-PT-2-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 72 place count 66 transition count 72
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 108 place count 48 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 42 transition count 66
Applied a total of 120 rules in 10 ms. Remains 42 /102 variables (removed 60) and now considering 66/126 (removed 60) transitions.
[2024-05-26 22:14:02] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 42 cols
[2024-05-26 22:14:02] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 22:14:02] [INFO ] Implicit Places using invariants in 73 ms returned [31, 33, 34]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 73 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 39/102 places, 66/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 87 ms. Remains : 39/102 places, 66/126 transitions.
[2024-05-26 22:14:02] [INFO ] Flatten gal took : 2 ms
[2024-05-26 22:14:02] [INFO ] Flatten gal took : 3 ms
[2024-05-26 22:14:02] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-26 22:14:02] [INFO ] Flatten gal took : 3 ms
[2024-05-26 22:14:02] [INFO ] Flatten gal took : 2 ms
[2024-05-26 22:14:02] [INFO ] Time to serialize gal into /tmp/CTLFireability13518511711070519446.gal : 1 ms
[2024-05-26 22:14:02] [INFO ] Time to serialize properties into /tmp/CTLFireability1457829824257921075.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/CTLFireability13518511711070519446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1457829824257921075.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,1254,0.037467,4432,2,698,5,4250,6,0,225,4040,0


Converting to forward existential form...Done !
original formula: AG(EF(((TestTurn_1_0==0)||(Turn_0_0==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((TestTurn_1_0==0)||(Turn_0_0==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t15, t16, t17, t18, t27, t28, t29, t40, t41, t44, t45, t46, t47, t48, t49, t50, t51...295
(forward)formula 0,1,0.162556,8920,1,0,169,28029,153,68,1529,22814,142
FORMULA Peterson-PT-2-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 22:14:02] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-26 22:14:02] [INFO ] Computed 11 invariants in 3 ms
[2024-05-26 22:14:02] [INFO ] Implicit Places using invariants in 84 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 85 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 99/102 places, 126/126 transitions.
[2024-05-26 22:14:02] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:14:02] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:14:02] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 22:14:02] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:14:02] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:14:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1315183348120008568.gal : 2 ms
[2024-05-26 22:14:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6083799978401838424.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/CTLFireability1315183348120008568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6083799978401838424.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,20754,0.474856,12348,2,3417,5,32021,6,0,525,39597,0


Converting to forward existential form...Done !
original formula: EF(AG(EX(((Turn_1_0==0)||(AskForSection_0_1==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(((Turn_1_0==0)||(AskForSection_0_1==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t25, t26, t28, t47, t48, t49, t71, t72, t75, t76, t77, t78, t91, t92, t93, t94, t...314
(forward)formula 0,1,1.6277,39668,1,0,255,167222,271,129,2951,134247,259
FORMULA Peterson-PT-2-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 22:14:04] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:14:04] [INFO ] Invariant cache hit.
[2024-05-26 22:14:04] [INFO ] Implicit Places using invariants in 95 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 97 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 99/102 places, 126/126 transitions.
[2024-05-26 22:14:04] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:14:04] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:14:04] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 22:14:04] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:14:04] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:14:04] [INFO ] Time to serialize gal into /tmp/CTLFireability15832547253540865844.gal : 1 ms
[2024-05-26 22:14:04] [INFO ] Time to serialize properties into /tmp/CTLFireability10624506709482326828.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/CTLFireability15832547253540865844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10624506709482326828.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,20754,0.355207,12352,2,3417,5,32021,6,0,525,39597,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.363035,12352,1,0,6,32021,7,1,692,39597,1
FORMULA Peterson-PT-2-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 22:14:04] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 22:14:04] [INFO ] Invariant cache hit.
[2024-05-26 22:14:05] [INFO ] Implicit Places using invariants in 113 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 116 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 119 ms. Remains : 99/102 places, 126/126 transitions.
[2024-05-26 22:14:05] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:14:05] [INFO ] Flatten gal took : 5 ms
[2024-05-26 22:14:05] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 22:14:05] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:14:05] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:14:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8465572382002025622.gal : 1 ms
[2024-05-26 22:14:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10071366362036699446.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/CTLFireability8465572382002025622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10071366362036699446.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,20754,0.472473,12608,2,3417,5,32021,6,0,525,39597,0


Converting to forward existential form...Done !
original formula: EX(EF(((WantSection_2_F==1)&&(TestAlone_1_1_2==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * ((WantSection_2_F==1)&&(TestAlone_1_1_2==1)))] != FALSE
(forward)formula 0,1,0.718723,13136,1,0,7,32191,9,1,1057,39597,4
FORMULA Peterson-PT-2-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-26 22:14:05] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:14:05] [INFO ] Flatten gal took : 4 ms
Total runtime 128496 ms.

BK_STOP 1716761646013

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="Peterson-PT-2"
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 Peterson-PT-2, 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 r268-smll-171654407200250"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-2.tgz
mv Peterson-PT-2 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;