Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156400386.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HealthRecord-PT-17, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156400386
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.2K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 119K May 12 08:13 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 HealthRecord-PT-17-CTLFireability-00
FORMULA_NAME HealthRecord-PT-17-CTLFireability-01
FORMULA_NAME HealthRecord-PT-17-CTLFireability-02
FORMULA_NAME HealthRecord-PT-17-CTLFireability-03
FORMULA_NAME HealthRecord-PT-17-CTLFireability-04
FORMULA_NAME HealthRecord-PT-17-CTLFireability-05
FORMULA_NAME HealthRecord-PT-17-CTLFireability-06
FORMULA_NAME HealthRecord-PT-17-CTLFireability-07
FORMULA_NAME HealthRecord-PT-17-CTLFireability-08
FORMULA_NAME HealthRecord-PT-17-CTLFireability-09
FORMULA_NAME HealthRecord-PT-17-CTLFireability-10
FORMULA_NAME HealthRecord-PT-17-CTLFireability-11
FORMULA_NAME HealthRecord-PT-17-CTLFireability-12
FORMULA_NAME HealthRecord-PT-17-CTLFireability-13
FORMULA_NAME HealthRecord-PT-17-CTLFireability-14
FORMULA_NAME HealthRecord-PT-17-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621283563250

Running Version 0
[2021-05-17 20:32:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 20:32:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:32:44] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2021-05-17 20:32:44] [INFO ] Transformed 624 places.
[2021-05-17 20:32:44] [INFO ] Transformed 828 transitions.
[2021-05-17 20:32:44] [INFO ] Found NUPN structural information;
[2021-05-17 20:32:44] [INFO ] Parsed PT model containing 624 places and 828 transitions in 112 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
[2021-05-17 20:32:44] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:32:44] [INFO ] Reduced 1 identical enabling conditions.
Support contains 369 out of 624 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 624/624 places, 828/828 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 578 transition count 779
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 578 transition count 779
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 573 transition count 774
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 573 transition count 774
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 572 transition count 772
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 572 transition count 772
Applied a total of 104 rules in 101 ms. Remains 572 /624 variables (removed 52) and now considering 772/828 (removed 56) transitions.
// Phase 1: matrix 772 rows 572 cols
[2021-05-17 20:32:45] [INFO ] Computed 18 place invariants in 23 ms
[2021-05-17 20:32:45] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 772 rows 572 cols
[2021-05-17 20:32:45] [INFO ] Computed 18 place invariants in 6 ms
[2021-05-17 20:32:45] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
// Phase 1: matrix 772 rows 572 cols
[2021-05-17 20:32:45] [INFO ] Computed 18 place invariants in 8 ms
[2021-05-17 20:32:46] [INFO ] Dead Transitions using invariants and state equation in 370 ms returned []
Finished structural reductions, in 1 iterations. Remains : 572/624 places, 772/828 transitions.
[2021-05-17 20:32:46] [INFO ] Flatten gal took : 117 ms
[2021-05-17 20:32:46] [INFO ] Flatten gal took : 45 ms
[2021-05-17 20:32:46] [INFO ] Input system was already deterministic with 772 transitions.
Incomplete random walk after 100000 steps, including 870 resets, run finished after 549 ms. (steps per millisecond=182 ) properties (out of 90) seen :76
Running SMT prover for 14 properties.
// Phase 1: matrix 772 rows 572 cols
[2021-05-17 20:32:47] [INFO ] Computed 18 place invariants in 3 ms
[2021-05-17 20:32:47] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2021-05-17 20:32:47] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:32:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:32:47] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-17 20:32:47] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 65 ms.
[2021-05-17 20:32:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:32:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2021-05-17 20:32:47] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-17 20:32:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:32:48] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2021-05-17 20:32:48] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 49 ms.
[2021-05-17 20:32:51] [INFO ] Added : 503 causal constraints over 101 iterations in 3701 ms. Result :sat
[2021-05-17 20:32:51] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2021-05-17 20:32:51] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-17 20:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:32:52] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2021-05-17 20:32:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:32:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2021-05-17 20:32:52] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-17 20:32:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:32:52] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2021-05-17 20:32:52] [INFO ] Deduced a trap composed of 105 places in 177 ms of which 4 ms to minimize.
[2021-05-17 20:32:53] [INFO ] Deduced a trap composed of 116 places in 203 ms of which 1 ms to minimize.
[2021-05-17 20:32:53] [INFO ] Deduced a trap composed of 113 places in 157 ms of which 0 ms to minimize.
[2021-05-17 20:32:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 679 ms
[2021-05-17 20:32:53] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 42 ms.
[2021-05-17 20:32:56] [INFO ] Added : 410 causal constraints over 83 iterations in 2903 ms. Result :sat
[2021-05-17 20:32:56] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:32:56] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:32:56] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-17 20:32:56] [INFO ] Deduced a trap composed of 124 places in 115 ms of which 2 ms to minimize.
[2021-05-17 20:32:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2021-05-17 20:32:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:32:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2021-05-17 20:32:56] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-17 20:32:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:32:57] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2021-05-17 20:32:57] [INFO ] Deduced a trap composed of 124 places in 127 ms of which 1 ms to minimize.
[2021-05-17 20:32:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2021-05-17 20:32:57] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 46 ms.
[2021-05-17 20:33:00] [INFO ] Added : 457 causal constraints over 93 iterations in 3189 ms. Result :sat
[2021-05-17 20:33:00] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:33:00] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned unsat
[2021-05-17 20:33:00] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-17 20:33:00] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:33:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:00] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2021-05-17 20:33:00] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 42 ms.
[2021-05-17 20:33:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:33:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:33:01] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:33:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:01] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2021-05-17 20:33:01] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 40 ms.
[2021-05-17 20:33:04] [INFO ] Added : 448 causal constraints over 90 iterations in 3244 ms. Result :sat
[2021-05-17 20:33:04] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-17 20:33:04] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:33:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:04] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2021-05-17 20:33:04] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 1 ms to minimize.
[2021-05-17 20:33:05] [INFO ] Deduced a trap composed of 163 places in 122 ms of which 1 ms to minimize.
[2021-05-17 20:33:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 334 ms
[2021-05-17 20:33:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:33:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:33:05] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:33:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:05] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2021-05-17 20:33:05] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 1 ms to minimize.
[2021-05-17 20:33:05] [INFO ] Deduced a trap composed of 163 places in 121 ms of which 0 ms to minimize.
[2021-05-17 20:33:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 329 ms
[2021-05-17 20:33:05] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 43 ms.
[2021-05-17 20:33:09] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 1 ms to minimize.
[2021-05-17 20:33:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2021-05-17 20:33:09] [INFO ] Added : 459 causal constraints over 93 iterations in 3429 ms. Result :sat
[2021-05-17 20:33:09] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-17 20:33:09] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:33:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:09] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2021-05-17 20:33:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:33:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:33:09] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:33:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:09] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2021-05-17 20:33:09] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 38 ms.
[2021-05-17 20:33:12] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 1 ms to minimize.
[2021-05-17 20:33:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2021-05-17 20:33:13] [INFO ] Added : 447 causal constraints over 91 iterations in 3333 ms. Result :sat
[2021-05-17 20:33:13] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:33:13] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:33:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:13] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2021-05-17 20:33:13] [INFO ] Deduced a trap composed of 127 places in 112 ms of which 0 ms to minimize.
[2021-05-17 20:33:13] [INFO ] Deduced a trap composed of 124 places in 109 ms of which 0 ms to minimize.
[2021-05-17 20:33:13] [INFO ] Deduced a trap composed of 124 places in 85 ms of which 1 ms to minimize.
[2021-05-17 20:33:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 390 ms
[2021-05-17 20:33:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:33:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:33:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:33:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:14] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2021-05-17 20:33:14] [INFO ] Deduced a trap composed of 127 places in 112 ms of which 1 ms to minimize.
[2021-05-17 20:33:14] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 0 ms to minimize.
[2021-05-17 20:33:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
[2021-05-17 20:33:14] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 38 ms.
[2021-05-17 20:33:17] [INFO ] Added : 456 causal constraints over 92 iterations in 3247 ms. Result :sat
[2021-05-17 20:33:17] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:33:17] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:33:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:17] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2021-05-17 20:33:17] [INFO ] Deduced a trap composed of 174 places in 122 ms of which 1 ms to minimize.
[2021-05-17 20:33:18] [INFO ] Deduced a trap composed of 117 places in 79 ms of which 0 ms to minimize.
[2021-05-17 20:33:18] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 0 ms to minimize.
[2021-05-17 20:33:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 397 ms
[2021-05-17 20:33:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:33:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-17 20:33:18] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:33:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:18] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2021-05-17 20:33:18] [INFO ] Deduced a trap composed of 174 places in 119 ms of which 0 ms to minimize.
[2021-05-17 20:33:18] [INFO ] Deduced a trap composed of 117 places in 77 ms of which 0 ms to minimize.
[2021-05-17 20:33:18] [INFO ] Deduced a trap composed of 120 places in 109 ms of which 0 ms to minimize.
[2021-05-17 20:33:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 399 ms
[2021-05-17 20:33:18] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 36 ms.
[2021-05-17 20:33:22] [INFO ] Added : 446 causal constraints over 90 iterations in 3208 ms. Result :sat
[2021-05-17 20:33:22] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:33:22] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-17 20:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:22] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2021-05-17 20:33:22] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 37 ms.
[2021-05-17 20:33:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:33:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 40 ms returned sat
[2021-05-17 20:33:23] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:23] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2021-05-17 20:33:23] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 36 ms.
[2021-05-17 20:33:26] [INFO ] Added : 473 causal constraints over 95 iterations in 3328 ms. Result :sat
[2021-05-17 20:33:26] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:33:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-17 20:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:26] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2021-05-17 20:33:26] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 37 ms.
[2021-05-17 20:33:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:33:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:33:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-17 20:33:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:27] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2021-05-17 20:33:27] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 37 ms.
[2021-05-17 20:33:31] [INFO ] Added : 481 causal constraints over 97 iterations in 3493 ms. Result :sat
[2021-05-17 20:33:31] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-17 20:33:31] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:31] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2021-05-17 20:33:31] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 37 ms.
[2021-05-17 20:33:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:33:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:33:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:32] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2021-05-17 20:33:32] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 37 ms.
[2021-05-17 20:33:35] [INFO ] Added : 482 causal constraints over 97 iterations in 3286 ms. Result :sat
[2021-05-17 20:33:35] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-17 20:33:35] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:35] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-17 20:33:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:33:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-17 20:33:35] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-17 20:33:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:36] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2021-05-17 20:33:36] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 1 ms to minimize.
[2021-05-17 20:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2021-05-17 20:33:36] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 38 ms.
[2021-05-17 20:33:39] [INFO ] Added : 462 causal constraints over 93 iterations in 3150 ms. Result :sat
[2021-05-17 20:33:39] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-17 20:33:39] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-17 20:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:39] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2021-05-17 20:33:39] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 1 ms to minimize.
[2021-05-17 20:33:39] [INFO ] Deduced a trap composed of 123 places in 80 ms of which 1 ms to minimize.
[2021-05-17 20:33:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2021-05-17 20:33:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:33:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-17 20:33:40] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-17 20:33:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:33:40] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2021-05-17 20:33:40] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 1 ms to minimize.
[2021-05-17 20:33:40] [INFO ] Deduced a trap composed of 123 places in 79 ms of which 0 ms to minimize.
[2021-05-17 20:33:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2021-05-17 20:33:40] [INFO ] Computed and/alt/rep : 700/894/700 causal constraints (skipped 71 transitions) in 35 ms.
[2021-05-17 20:33:43] [INFO ] Added : 458 causal constraints over 92 iterations in 3189 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Graph (trivial) has 654 edges and 572 vertex of which 68 / 572 are part of one of the 19 SCC in 9 ms
Free SCC test removed 49 places
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 522 transition count 476
Reduce places removed 240 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 271 rules applied. Total rules applied 512 place count 282 transition count 445
Reduce places removed 11 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 17 rules applied. Total rules applied 529 place count 271 transition count 439
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 535 place count 265 transition count 439
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 535 place count 265 transition count 429
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 555 place count 255 transition count 429
Discarding 80 places :
Symmetric choice reduction at 4 with 80 rule applications. Total rules 635 place count 175 transition count 284
Iterating global reduction 4 with 80 rules applied. Total rules applied 715 place count 175 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 6 rules applied. Total rules applied 721 place count 175 transition count 278
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 726 place count 171 transition count 277
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 744 place count 153 transition count 245
Iterating global reduction 6 with 18 rules applied. Total rules applied 762 place count 153 transition count 245
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 763 place count 153 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 764 place count 152 transition count 244
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 768 place count 148 transition count 238
Iterating global reduction 8 with 4 rules applied. Total rules applied 772 place count 148 transition count 238
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 775 place count 145 transition count 233
Iterating global reduction 8 with 3 rules applied. Total rules applied 778 place count 145 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 779 place count 145 transition count 232
Performed 43 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 9 with 86 rules applied. Total rules applied 865 place count 102 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 869 place count 102 transition count 182
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 870 place count 101 transition count 180
Iterating global reduction 10 with 1 rules applied. Total rules applied 871 place count 101 transition count 180
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 872 place count 100 transition count 179
Iterating global reduction 10 with 1 rules applied. Total rules applied 873 place count 100 transition count 179
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 881 place count 96 transition count 214
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 882 place count 95 transition count 212
Iterating global reduction 10 with 1 rules applied. Total rules applied 883 place count 95 transition count 212
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 10 with 12 rules applied. Total rules applied 895 place count 95 transition count 200
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 896 place count 94 transition count 197
Iterating global reduction 10 with 1 rules applied. Total rules applied 897 place count 94 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 899 place count 93 transition count 208
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 900 place count 92 transition count 205
Iterating global reduction 10 with 1 rules applied. Total rules applied 901 place count 92 transition count 205
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 905 place count 88 transition count 199
Iterating global reduction 10 with 4 rules applied. Total rules applied 909 place count 88 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 911 place count 88 transition count 197
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 11 with 13 rules applied. Total rules applied 924 place count 88 transition count 184
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 925 place count 87 transition count 181
Iterating global reduction 11 with 1 rules applied. Total rules applied 926 place count 87 transition count 181
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 928 place count 87 transition count 179
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 929 place count 87 transition count 179
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 930 place count 87 transition count 178
Applied a total of 930 rules in 127 ms. Remains 87 /572 variables (removed 485) and now considering 178/772 (removed 594) transitions.
[2021-05-17 20:33:43] [INFO ] Flatten gal took : 12 ms
[2021-05-17 20:33:43] [INFO ] Flatten gal took : 12 ms
[2021-05-17 20:33:43] [INFO ] Input system was already deterministic with 178 transitions.
[2021-05-17 20:33:44] [INFO ] Flatten gal took : 11 ms
[2021-05-17 20:33:44] [INFO ] Flatten gal took : 11 ms
[2021-05-17 20:33:44] [INFO ] Time to serialize gal into /tmp/CTLFireability3446793457969457794.gal : 6 ms
[2021-05-17 20:33:44] [INFO ] Time to serialize properties into /tmp/CTLFireability5331402859610121084.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability3446793457969457794.gal, -t, CGAL, -ctl, /tmp/CTLFireability5331402859610121084.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability3446793457969457794.gal -t CGAL -ctl /tmp/CTLFireability5331402859610121084.ctl --gen-order FOLLOW
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,5.94035e+08,1.85261,56996,2,12263,5,229901,6,0,517,216479,0


Converting to forward existential form...Done !
original formula: AF(AG((AG(((EF((((((((p439==1)||(p485==1))||(p603==1))||(p85==1))||(p242==1))||(p545==1))||(p596==1))) * (p23==0)) * (p123==0))) * (p59==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!(E(TRUE U !(((E(TRUE U (((((((p439==1)||(p485==1))||(p603==1))||(p85==1))||(p242==1))||(p545==1))||(p596==1))) * (p23==0)) * (p123==0))))) * (p59==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t5, t7, t8, t9, t10, t11, t20, t21, t31, t32, t40, t41, t42, t43, t44, t46, t47, t48, t49, t66, t83, t85, t90, t108, t109, t111, t112, t125, t126, t127, t128, t129, t130, t131, t132, t135, t136, t137, t138, t143, t144, t145, t146, t147, t149, t151, t153, t155, t157, t159, t161, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/123/55/178
Detected timeout of ITS tools.
[2021-05-17 20:34:14] [INFO ] Flatten gal took : 10 ms
[2021-05-17 20:34:14] [INFO ] Applying decomposition
[2021-05-17 20:34:14] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16110355234515439521.txt, -o, /tmp/graph16110355234515439521.bin, -w, /tmp/graph16110355234515439521.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16110355234515439521.bin, -l, -1, -v, -w, /tmp/graph16110355234515439521.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:34:14] [INFO ] Decomposing Gal with order
[2021-05-17 20:34:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:34:14] [INFO ] Removed a total of 182 redundant transitions.
[2021-05-17 20:34:14] [INFO ] Flatten gal took : 47 ms
[2021-05-17 20:34:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2021-05-17 20:34:14] [INFO ] Time to serialize gal into /tmp/CTLFireability2805629350172711618.gal : 3 ms
[2021-05-17 20:34:14] [INFO ] Time to serialize properties into /tmp/CTLFireability3099499106789994011.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2805629350172711618.gal, -t, CGAL, -ctl, /tmp/CTLFireability3099499106789994011.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2805629350172711618.gal -t CGAL -ctl /tmp/CTLFireability3099499106789994011.ctl
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,5.94035e+08,0.065855,6840,185,170,3749,2218,317,4849,190,5408,0


Converting to forward existential form...Done !
original formula: AF(AG((AG(((EF((((((((i6.u10.p439==1)||(i7.u12.p485==1))||(u15.p603==1))||(u0.p85==1))||(u3.p242==1))||(u16.p545==1))||(u16.p596==1))) * (u0.p23==0)) * (u2.p123==0))) * (u0.p59==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!(E(TRUE U !(((E(TRUE U (((((((i6.u10.p439==1)||(i7.u12.p485==1))||(u15.p603==1))||(u0.p85==1))||(u3.p242==1))||(u16.p545==1))||(u16.p596==1))) * (u0.p23==0)) * (u2.p123==0))))) * (u0.p59==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t46, t47, t48, t49, t66, t114, t126, t130, t132, t147, t149, t151, t153, t163, u0.t40, u0.t41, u0.t42, u0.t43, u0.t44, u0.t90, u2.t31, u2.t32, u3.t20, u3.t21, u16.t0, u16.t3, u16.t4, u16.t5, u16.t7, u16.t8, u16.t9, u16.t83, u16.t108, u16.t135, u16.t136, u16.t137, u16.t138, u16.t155, u16.t157, u16.t159, u16.t161, i7.t145, i7.t144, i7.t85, i7.u12.t143, i7.u13.t146, i7.u14.t10, i7.u14.t11, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/96/49/145
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,0.257689,13028,1,0,13133,7974,1976,20413,1156,24936,30000
FORMULA HealthRecord-PT-17-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Graph (trivial) has 688 edges and 572 vertex of which 87 / 572 are part of one of the 21 SCC in 1 ms
Free SCC test removed 66 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 505 transition count 455
Reduce places removed 241 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 272 rules applied. Total rules applied 514 place count 264 transition count 424
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 525 place count 254 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 526 place count 253 transition count 423
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 526 place count 253 transition count 412
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 548 place count 242 transition count 412
Discarding 82 places :
Symmetric choice reduction at 4 with 82 rule applications. Total rules 630 place count 160 transition count 255
Iterating global reduction 4 with 82 rules applied. Total rules applied 712 place count 160 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 6 rules applied. Total rules applied 718 place count 160 transition count 249
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 725 place count 155 transition count 247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 725 place count 155 transition count 246
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 727 place count 154 transition count 246
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 743 place count 138 transition count 218
Iterating global reduction 6 with 16 rules applied. Total rules applied 759 place count 138 transition count 218
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 760 place count 138 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 761 place count 137 transition count 217
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 768 place count 130 transition count 208
Iterating global reduction 8 with 7 rules applied. Total rules applied 775 place count 130 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 777 place count 130 transition count 206
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 782 place count 125 transition count 199
Iterating global reduction 9 with 5 rules applied. Total rules applied 787 place count 125 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 790 place count 125 transition count 196
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 791 place count 124 transition count 195
Iterating global reduction 10 with 1 rules applied. Total rules applied 792 place count 124 transition count 195
Performed 37 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 10 with 74 rules applied. Total rules applied 866 place count 87 transition count 156
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 867 place count 86 transition count 154
Iterating global reduction 10 with 1 rules applied. Total rules applied 868 place count 86 transition count 154
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 871 place count 83 transition count 151
Iterating global reduction 10 with 3 rules applied. Total rules applied 874 place count 83 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 875 place count 83 transition count 150
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 876 place count 82 transition count 146
Iterating global reduction 11 with 1 rules applied. Total rules applied 877 place count 82 transition count 146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 880 place count 82 transition count 143
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 12 with 12 rules applied. Total rules applied 892 place count 76 transition count 187
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 893 place count 75 transition count 184
Iterating global reduction 12 with 1 rules applied. Total rules applied 894 place count 75 transition count 184
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 898 place count 71 transition count 178
Iterating global reduction 12 with 4 rules applied. Total rules applied 902 place count 71 transition count 178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 905 place count 71 transition count 175
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 906 place count 70 transition count 171
Iterating global reduction 13 with 1 rules applied. Total rules applied 907 place count 70 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 911 place count 70 transition count 167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 913 place count 69 transition count 180
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 914 place count 68 transition count 176
Iterating global reduction 14 with 1 rules applied. Total rules applied 915 place count 68 transition count 176
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 916 place count 67 transition count 172
Iterating global reduction 14 with 1 rules applied. Total rules applied 917 place count 67 transition count 172
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 938 place count 67 transition count 151
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 939 place count 66 transition count 148
Iterating global reduction 14 with 1 rules applied. Total rules applied 940 place count 66 transition count 148
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 943 place count 63 transition count 143
Iterating global reduction 14 with 3 rules applied. Total rules applied 946 place count 63 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 948 place count 62 transition count 160
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 14 with 9 rules applied. Total rules applied 957 place count 62 transition count 151
Applied a total of 957 rules in 95 ms. Remains 62 /572 variables (removed 510) and now considering 151/772 (removed 621) transitions.
[2021-05-17 20:34:14] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:34:14] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:34:14] [INFO ] Input system was already deterministic with 151 transitions.
[2021-05-17 20:34:14] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:34:14] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:34:14] [INFO ] Time to serialize gal into /tmp/CTLFireability11425025883537941742.gal : 1 ms
[2021-05-17 20:34:14] [INFO ] Time to serialize properties into /tmp/CTLFireability7097586080883191845.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11425025883537941742.gal, -t, CGAL, -ctl, /tmp/CTLFireability7097586080883191845.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11425025883537941742.gal -t CGAL -ctl /tmp/CTLFireability7097586080883191845.ctl --gen-order FOLLOW
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,2.28407e+07,0.603658,26444,2,5822,5,99297,6,0,388,93385,0


Converting to forward existential form...Done !
original formula: !(AF((((p422==1)||(p294==1))||(p8==1))))
=> equivalent forward existential formula: [FwdG(Init,!((((p422==1)||(p294==1))||(p8==1))))] != FALSE
Hit Full ! (commute/partial/dont) 134/34/17
(forward)formula 0,1,2.08314,53600,1,0,11,249922,20,3,2548,128450,9
FORMULA HealthRecord-PT-17-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2021-05-17 20:34:16] [INFO ] Flatten gal took : 29 ms
[2021-05-17 20:34:16] [INFO ] Flatten gal took : 29 ms
[2021-05-17 20:34:16] [INFO ] Applying decomposition
[2021-05-17 20:34:16] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12727677523753558462.txt, -o, /tmp/graph12727677523753558462.bin, -w, /tmp/graph12727677523753558462.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12727677523753558462.bin, -l, -1, -v, -w, /tmp/graph12727677523753558462.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:34:16] [INFO ] Decomposing Gal with order
[2021-05-17 20:34:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:34:17] [INFO ] Removed a total of 245 redundant transitions.
[2021-05-17 20:34:17] [INFO ] Flatten gal took : 60 ms
[2021-05-17 20:34:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 10 ms.
[2021-05-17 20:34:17] [INFO ] Time to serialize gal into /tmp/CTLFireability8599178130717156143.gal : 9 ms
[2021-05-17 20:34:17] [INFO ] Time to serialize properties into /tmp/CTLFireability5742929043379509241.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8599178130717156143.gal, -t, CGAL, -ctl, /tmp/CTLFireability5742929043379509241.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8599178130717156143.gal -t CGAL -ctl /tmp/CTLFireability5742929043379509241.ctl
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Detected timeout of ITS tools.
[2021-05-17 20:54:51] [INFO ] Applying decomposition
[2021-05-17 20:54:52] [INFO ] Flatten gal took : 300 ms
[2021-05-17 20:54:52] [INFO ] Decomposing Gal with order
[2021-05-17 20:54:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:54:52] [INFO ] Removed a total of 43 redundant transitions.
[2021-05-17 20:54:52] [INFO ] Flatten gal took : 226 ms
[2021-05-17 20:54:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 34 ms.
[2021-05-17 20:54:52] [INFO ] Time to serialize gal into /tmp/CTLFireability8571044793725736105.gal : 22 ms
[2021-05-17 20:54:53] [INFO ] Time to serialize properties into /tmp/CTLFireability2544517739848805451.ctl : 8 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8571044793725736105.gal, -t, CGAL, -ctl, /tmp/CTLFireability2544517739848805451.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8571044793725736105.gal -t CGAL -ctl /tmp/CTLFireability2544517739848805451.ctl
No direction supplied, using forward translation only.
Parsed 14 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,4.4093e+15,78.2374,1755316,3579,17161,1.70781e+06,988022,657,7.31494e+06,989,1.31031e+07,0


Converting to forward existential form...Done !
original formula: EF((E(AX(((((i0.i0.i0.u4.p99==1)||(i0.i0.i0.u4.p66==1))||(i1.u18.p557==1))||(i0.i0.i0.u4.p78==1))) U EG(((((((i0.i0.i0.u5.p119==1)||(i0.i0.u6.p216==1))||(i0.i0.i0.u5.p127==1))||(i0.i0.u6.p189==1))||(i0.i0.i0.u5.p156==1))||((((i0.i0.i0.u4.p85==1)&&(i0.i0.i0.u5.p170==1))&&(i0.i0.u6.p252==1))&&(i1.u18.p561==1))))) * (((((((((i0.i1.i0.i0.i0.u11.p276==1)||(u23.p0==1))||(i0.i0.u6.p260==1))||(i0.i0.i0.u4.p80==1))||(i0.i1.i0.u14.p388==1))||(i0.i1.i0.i0.u13.p378==1))||(i0.i0.i0.u4.p45==1))||(i0.i0.u6.p189==1)) + ((E(((((((((((i1.u17.p498==1)||(i0.i0.u6.p252==1))||(i0.i0.u6.p186==1))||(i0.i1.i0.i0.i0.u12.p316==1))||(i0.i0.i0.u4.p59==1))||(i0.i0.i0.u5.p126==1))||(i1.u18.p564==1))||(i0.i0.i0.u4.p63==1))||(i0.i0.u6.p237==1))||(i1.u18.p551==1)) U (((((((i1.u18.p552==1)||(i0.i0.i0.u5.p144==1))||(i0.i0.i0.u5.p148==1))||(i0.i0.i0.u5.p149==1))||(i1.u17.p529==1))||(i0.i0.u6.p189==1))||((((i0.i0.i0.u4.p85==1)&&(i0.i0.i0.u5.p170==1))&&(i0.i0.u6.p252==1))&&(i1.u18.p561==1)))) * A(((((i0.i0.i0.u4.p49==1)||(i0.i1.u15.p448==1))||(i1.u18.p545==1))||(i0.i1.i0.i0.u13.p380==1)) U ((((((((((i0.i1.i0.i0.i0.u11.p292==1)||(i0.i0.i0.u5.p179==1))||(i0.i0.i0.u4.p85==1))||(i1.u24.p449==1))||(i0.i1.u15.p448==1))||(i0.i0.i0.u5.p138==1))||(i0.i0.u6.p216==1))||(i0.i0.i0.u4.p93==1))||(i0.i1.u15.p443==1))||(i1.u18.p581==1)))) * ((((((((((i0.i0.u6.p227==1)||(i0.i0.i0.u5.p147==1))||(i0.i1.i0.i0.i0.u12.p337==1))||(i0.i1.i0.u14.p402==1))||(i0.i1.i0.i0.i0.u12.p322==1))||(i0.i0.i0.u5.p154==1))||(i0.i0.u6.p219==1))||(i0.i0.u6.p218==1))||(i0.i1.u19.p266==1))||((((((((((i0.i0.i0.u4.p89==1)&&(i0.i0.i0.u5.p174==1))&&(i0.i0.u6.p256==1))&&(i0.i1.i0.i0.i0.u11.p302==1))&&(i0.i1.i0.i0.i0.u12.p338==1))&&(i0.i1.i0.i0.u13.p374==1))&&(i0.i1.i0.u14.p410==1))&&(i0.i1.u15.p444==1))&&(i1.u17.p516==1))&&(i1.u18.p618==1)))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * E(!(EX(!(((((i0.i0.i0.u4.p99==1)||(i0.i0.i0.u4.p66==1))||(i1.u18.p557==1))||(i0.i0.i0.u4.p78==1))))) U EG(((((((i0.i0.i0.u5.p119==1)||(i0.i0.u6.p216==1))||(i0.i0.i0.u5.p127==1))||(i0.i0.u6.p189==1))||(i0.i0.i0.u5.p156==1))||((((i0.i0.i0.u4.p85==1)&&(i0.i0.i0.u5.p170==1))&&(i0.i0.u6.p252==1))&&(i1.u18.p561==1)))))) * ((((((((i0.i1.i0.i0.i0.u11.p276==1)||(u23.p0==1))||(i0.i0.u6.p260==1))||(i0.i0.i0.u4.p80==1))||(i0.i1.i0.u14.p388==1))||(i0.i1.i0.i0.u13.p378==1))||(i0.i0.i0.u4.p45==1))||(i0.i0.u6.p189==1)))] != FALSE + [(((((FwdU(Init,TRUE) * E(!(EX(!(((((i0.i0.i0.u4.p99==1)||(i0.i0.i0.u4.p66==1))||(i1.u18.p557==1))||(i0.i0.i0.u4.p78==1))))) U EG(((((((i0.i0.i0.u5.p119==1)||(i0.i0.u6.p216==1))||(i0.i0.i0.u5.p127==1))||(i0.i0.u6.p189==1))||(i0.i0.i0.u5.p156==1))||((((i0.i0.i0.u4.p85==1)&&(i0.i0.i0.u5.p170==1))&&(i0.i0.u6.p252==1))&&(i1.u18.p561==1)))))) * ((((((((((i0.i0.u6.p227==1)||(i0.i0.i0.u5.p147==1))||(i0.i1.i0.i0.i0.u12.p337==1))||(i0.i1.i0.u14.p402==1))||(i0.i1.i0.i0.i0.u12.p322==1))||(i0.i0.i0.u5.p154==1))||(i0.i0.u6.p219==1))||(i0.i0.u6.p218==1))||(i0.i1.u19.p266==1))||((((((((((i0.i0.i0.u4.p89==1)&&(i0.i0.i0.u5.p174==1))&&(i0.i0.u6.p256==1))&&(i0.i1.i0.i0.i0.u11.p302==1))&&(i0.i1.i0.i0.i0.u12.p338==1))&&(i0.i1.i0.i0.u13.p374==1))&&(i0.i1.i0.u14.p410==1))&&(i0.i1.u15.p444==1))&&(i1.u17.p516==1))&&(i1.u18.p618==1)))) * E(((((((((((i1.u17.p498==1)||(i0.i0.u6.p252==1))||(i0.i0.u6.p186==1))||(i0.i1.i0.i0.i0.u12.p316==1))||(i0.i0.i0.u4.p59==1))||(i0.i0.i0.u5.p126==1))||(i1.u18.p564==1))||(i0.i0.i0.u4.p63==1))||(i0.i0.u6.p237==1))||(i1.u18.p551==1)) U (((((((i1.u18.p552==1)||(i0.i0.i0.u5.p144==1))||(i0.i0.i0.u5.p148==1))||(i0.i0.i0.u5.p149==1))||(i1.u17.p529==1))||(i0.i0.u6.p189==1))||((((i0.i0.i0.u4.p85==1)&&(i0.i0.i0.u5.p170==1))&&(i0.i0.u6.p252==1))&&(i1.u18.p561==1))))) * !(EG(!(((((((((((i0.i1.i0.i0.i0.u11.p292==1)||(i0.i0.i0.u5.p179==1))||(i0.i0.i0.u4.p85==1))||(i1.u24.p449==1))||(i0.i1.u15.p448==1))||(i0.i0.i0.u5.p138==1))||(i0.i0.u6.p216==1))||(i0.i0.i0.u4.p93==1))||(i0.i1.u15.p443==1))||(i1.u18.p581==1)))))) * !(E(!(((((((((((i0.i1.i0.i0.i0.u11.p292==1)||(i0.i0.i0.u5.p179==1))||(i0.i0.i0.u4.p85==1))||(i1.u24.p449==1))||(i0.i1.u15.p448==1))||(i0.i0.i0.u5.p138==1))||(i0.i0.u6.p216==1))||(i0.i0.i0.u4.p93==1))||(i0.i1.u15.p443==1))||(i1.u18.p581==1))) U (!(((((i0.i0.i0.u4.p49==1)||(i0.i1.u15.p448==1))||(i1.u18.p545==1))||(i0.i1.i0.i0.u13.p380==1))) * !(((((((((((i0.i1.i0.i0.i0.u11.p292==1)||(i0.i0.i0.u5.p179==1))||(i0.i0.i0.u4.p85==1))||(i1.u24.p449==1))||(i0.i1.u15.p448==1))||(i0.i0.i0.u5.p138==1))||(i0.i0.u6.p216==1))||(i0.i0.i0.u4.p93==1))||(i0.i1.u15.p443==1))||(i1.u18.p581==1)))))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t706, i0.i0.u6.t407, i0.i0.u6.t409, i0.i0.u6.t411, i0.i0.u6.t412, i0.i0.u6.t413, i0.i0.u6.t415, i0.i0.u6.t419, i0.i0.u6.t420, i0.i0.u6.t421, i0.i0.u6.t422, i0.i0.u6.t425, i0.i0.u6.t426, i0.i0.u6.t427, i0.i0.u6.t428, i0.i0.u6.t433, i0.i0.u6.t434, i0.i0.u6.t435, i0.i0.u6.t436, i0.i0.u6.t438, i0.i0.u6.t439, i0.i0.u6.t442, i0.i0.u6.t444, i0.i0.u6.t445, i0.i0.u6.t450, i0.i0.u6.t451, i0.i0.u6.t452, i0.i0.u6.t454, i0.i0.u6.t458, i0.i0.u6.t463, i0.i0.u6.t464, i0.i0.u6.t471, i0.i0.u6.t472, i0.i0.u6.t482, i0.i0.u6.t483, i0.i0.u6.t490, i0.i0.u6.t492, i0.i0.i0.u4.t593, i0.i0.i0.u4.t597, i0.i0.i0.u4.t599, i0.i0.i0.u4.t600, i0.i0.i0.u4.t601, i0.i0.i0.u4.t603, i0.i0.i0.u4.t607, i0.i0.i0.u4.t608, i0.i0.i0.u4.t609, i0.i0.i0.u4.t610, i0.i0.i0.u4.t613, i0.i0.i0.u4.t614, i0.i0.i0.u4.t615, i0.i0.i0.u4.t616, i0.i0.i0.u4.t617, i0.i0.i0.u4.t619, i0.i0.i0.u4.t624, i0.i0.i0.u4.t625, i0.i0.i0.u4.t626, i0.i0.i0.u4.t628, i0.i0.i0.u4.t629, i0.i0.i0.u4.t630, i0.i0.i0.u4.t631, i0.i0.i0.u4.t632, i0.i0.i0.u4.t633, i0.i0.i0.u4.t637, i0.i0.i0.u4.t638, i0.i0.i0.u4.t639, i0.i0.i0.u4.t642, i0.i0.i0.u4.t646, i0.i0.i0.u4.t651, i0.i0.i0.u4.t652, i0.i0.i0.u4.t659, i0.i0.i0.u4.t660, i0.i0.i0.u4.t670, i0.i0.i0.u4.t671, i0.i0.i0.u4.t681, i0.i0.i0.u5.t500, i0.i0.i0.u5.t503, i0.i0.i0.u5.t505, i0.i0.i0.u5.t506, i0.i0.i0.u5.t507, i0.i0.i0.u5.t509, i0.i0.i0.u5.t513, i0.i0.i0.u5.t514, i0.i0.i0.u5.t517, i0.i0.i0.u5.t518, i0.i0.i0.u5.t519, i0.i0.i0.u5.t520, i0.i0.i0.u5.t521, i0.i0.i0.u5.t524, i0.i0.i0.u5.t529, i0.i0.i0.u5.t530, i0.i0.i0.u5.t532, i0.i0.i0.u5.t533, i0.i0.i0.u5.t534, i0.i0.i0.u5.t536, i0.i0.i0.u5.t537, i0.i0.i0.u5.t538, i0.i0.i0.u5.t542, i0.i0.i0.u5.t544, i0.i0.i0.u5.t545, i0.i0.i0.u5.t547, i0.i0.i0.u5.t551, i0.i0.i0.u5.t552, i0.i0.i0.u5.t557, i0.i0.i0.u5.t558, i0.i0.i0.u5.t574, i0.i0.i0.u5.t575, i0.i0.i0.u5.t582, i0.i0.i0.u5.t584, i0.i1.u15.t208, i0.i1.u15.t209, i0.i1.u15.t217, i0.i1.u15.t219, i0.i1.u15.t222, i0.i1.u15.t227, i0.i1.u15.t233, i0.i1.u15.t234, i0.i1.u15.t236, i0.i1.i0.u14.t245, i0.i1.i0.u14.t246, i0.i1.i0.u14.t254, i0.i1.i0.u14.t255, i0.i1.i0.u14.t258, i0.i1.i0.u14.t263, i0.i1.i0.u14.t264, i0.i1.i0.u14.t270, i0.i1.i0.u14.t271, i0.i1.i0.u14.t273, i0.i1.i0.i0.u13.t285, i0.i1.i0.i0.u13.t286, i0.i1.i0.i0.u13.t294, i0.i1.i0.i0.u13.t295, i0.i1.i0.i0.u13.t298, i0.i1.i0.i0.u13.t303, i0.i1.i0.i0.u13.t304, i0.i1.i0.i0.u13.t310, i0.i1.i0.i0.u13.t311, i0.i1.i0.i0.i0.u11.t363, i0.i1.i0.i0.i0.u11.t364, i0.i1.i0.i0.i0.u11.t372, i0.i1.i0.i0.i0.u11.t374, i0.i1.i0.i0.i0.u11.t377, i0.i1.i0.i0.i0.u11.t383, i0.i1.i0.i0.i0.u11.t389, i0.i1.i0.i0.i0.u11.t390, i0.i1.i0.i0.i0.u11.t392, i0.i1.i0.i0.i0.u12.t324, i0.i1.i0.i0.i0.u12.t325, i0.i1.i0.i0.i0.u12.t333, i0.i1.i0.i0.i0.u12.t335, i0.i1.i0.i0.i0.u12.t338, i0.i1.i0.i0.i0.u12.t344, i0.i1.i0.i0.i0.u12.t350, i0.i1.i0.i0.i0.u12.t351, i1.u17.t122, i1.u17.t123, i1.u17.t125, i1.u17.t127, i1.u17.t132, i1.u17.t134, i1.u17.t138, i1.u17.t141, i1.u17.t142, i1.u17.t145, i1.u17.t146, i1.u17.t149, i1.u17.t150, i1.u17.t153, i1.u17.t154, i1.u17.t156, i1.u17.t157, i1.u17.t159, i1.u17.t160, i1.u17.t163, i1.u17.t164, i1.u17.t166, i1.u17.t167, i1.u17.t170, i1.u17.t171, i1.u17.t173, i1.u17.t174, i1.u17.t175, i1.u17.t176, i1.u17.t179, i1.u17.t180, i1.u17.t183, i1.u17.t184, i1.u17.t185, i1.u17.t186, i1.u17.t187, i1.u17.t189, i1.u17.t190, i1.u17.t191, i1.u17.t194, i1.u18.t12, i1.u18.t13, i1.u18.t14, i1.u18.t15, i1.u18.t16, i1.u18.t17, i1.u18.t18, i1.u18.t21, i1.u18.t25, i1.u18.t27, i1.u18.t29, i1.u18.t31, i1.u18.t34, i1.u18.t36, i1.u18.t38, i1.u18.t39, i1.u18.t40, i1.u18.t41, i1.u18.t42, i1.u18.t43, i1.u18.t45, i1.u18.t46, i1.u18.t47, i1.u18.t50, i1.u18.t51, i1.u18.t53, i1.u18.t55, i1.u18.t56, i1.u18.t57, i1.u18.t60, i1.u18.t61, i1.u18.t63, i1.u18.t64, i1.u18.t65, i1.u18.t66, i1.u18.t69, i1.u18.t70, i1.u18.t71, i1.u18.t73, i1.u18.t74, i1.u18.t75, i1.u18.t78, i1.u18.t79, i1.u18.t81, i1.u18.t83, i1.u18.t88, i1.u18.t89, i1.u18.t90, i1.u18.t91, i1.u18.t92, i1.u18.t93, i1.u18.t94, i1.u18.t95, i1.u18.t96, i1.u18.t97, i1.u18.t98, i1.u18.t99, i1.u18.t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/497/251/748
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
(forward)formula 0,1,1068.59,14944412,1,0,1.60192e+07,5.28192e+06,1363,8.43929e+07,2797,3.71357e+07,277822
FORMULA HealthRecord-PT-17-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(EF(((((((AX(AX((i0.i0.u6.p208==1))) * (!(EG((((((((i0.i0.i0.u4.p37==1)||(i1.u18.p557==1))||(i1.u17.p465==1))||(i0.i1.i0.i0.u13.p354==1))||(i0.i0.i0.u4.p40==1))||(i0.i1.i0.i0.i0.u11.p298==1))||(i0.i0.i0.u5.p125==1)))) + ((i0.i1.i0.i0.i0.u11.p301==1) * !(EF((((((i1.u18.p589==1)||(i1.u17.p498==1))||(i0.i0.i0.u4.p71==1))||(i0.i1.i0.i0.i0.u12.p322==1))||(i0.i1.i0.i0.i0.u12.p318==1))))))) + (i1.u18.p601==1)) + (i0.i1.i0.i0.i0.u11.p277==1)) + ((((i0.i0.i0.u4.p85==1)&&(i0.i0.i0.u5.p170==1))&&(i0.i0.u6.p252==1))&&(i1.u18.p585==1))) + (i0.i0.i0.u4.p88==1)) + (i1.u17.p475==1))))
=> equivalent forward existential formula: (((((([((FwdU(Init,TRUE) * !(EX(!(!(EX(!((i0.i0.u6.p208==1)))))))) * !(EG((((((((i0.i0.i0.u4.p37==1)||(i1.u18.p557==1))||(i1.u17.p465==1))||(i0.i1.i0.i0.u13.p354==1))||(i0.i0.i0.u4.p40==1))||(i0.i1.i0.i0.i0.u11.p298==1))||(i0.i0.i0.u5.p125==1)))))] = FALSE * [(((FwdU(Init,TRUE) * !(EX(!(!(EX(!((i0.i0.u6.p208==1)))))))) * (i0.i1.i0.i0.i0.u11.p301==1)) * !(E(TRUE U (((((i1.u18.p589==1)||(i1.u17.p498==1))||(i0.i0.i0.u4.p71==1))||(i0.i1.i0.i0.i0.u12.p322==1))||(i0.i1.i0.i0.i0.u12.p318==1)))))] = FALSE) * [(FwdU(Init,TRUE) * (i1.u18.p601==1))] = FALSE) * [(FwdU(Init,TRUE) * (i0.i1.i0.i0.i0.u11.p277==1))] = FALSE) * [(FwdU(Init,TRUE) * ((((i0.i0.i0.u4.p85==1)&&(i0.i0.i0.u5.p170==1))&&(i0.i0.u6.p252==1))&&(i1.u18.p585==1)))] = FALSE) * [(FwdU(Init,TRUE) * (i0.i0.i0.u4.p88==1))] = FALSE) * [(FwdU(Init,TRUE) * (i1.u17.p475==1))] = FALSE)
(forward)formula 1,0,1068.6,14944412,1,0,1.60192e+07,5.28192e+06,1366,8.43929e+07,2798,3.71357e+07,278281
FORMULA HealthRecord-PT-17-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AX((A(((A((((((((((i1.u18.p604==1)||(i1.u17.p513==1))||(i0.i0.u6.p258==1))||(i0.i1.i0.u14.p400==1))||(i0.i0.i0.u4.p23==1))||(i0.i0.i0.u4.p25==1))||(i0.i0.i0.u5.p175==1))||(i0.i1.u19.p265==1))||(i0.i0.i0.u5.p143==1)) U ((((((((((i0.i1.i0.i0.i0.u11.p277==1)||(i1.u18.p603==1))||(i1.u17.p499==1))||(i0.i0.i0.u5.p148==1))||(i1.u17.p513==1))||(i0.i0.i0.u4.p70==1))||(i0.i0.u26.p10==1))||(i0.i0.u6.p216==1))||(i0.i1.i0.i0.u13.p381==1))||(i1.u17.p491==1))) * EG((((i0.i0.u6.p251==1)&&(i1.u18.p617==1))||(i0.i0.i0.u5.p175==1)))) + (AX(((((((i1.u17.p471==1)||(i1.u17.p465==1))||(i0.i0.i0.u5.p170==1))||((((((((((i0.i0.i0.u4.p89==1)&&(i0.i0.i0.u5.p174==1))&&(i0.i0.u6.p256==1))&&(i0.i1.i0.i0.i0.u11.p302==1))&&(i0.i1.i0.i0.i0.u12.p338==1))&&(i0.i1.i0.i0.u13.p374==1))&&(i0.i1.i0.u14.p410==1))&&(i0.i1.u15.p444==1))&&(i1.u17.p518==1))&&(i1.u18.p605==1)))||(i0.i0.u6.p205==1))||(i0.i0.i0.u4.p94==1))) * ((((((((i1.u17.p466==1)||(i0.i0.u6.p230==1))||(i1.u18.p541==1))||(i0.i0.u6.p213==1))||(i0.i1.u15.p432==1))||((i1.u17.p505==1)&&(i1.u18.p549==1)))||((i0.i0.u6.p251==1)&&(i1.u18.p617==1)))||(i0.i1.i0.i0.u13.p377==1)))) U (i1.u17.p452==1)) + AF((((((((((((i0.i0.i0.u4.p84==0)||(i1.u18.p617==0))&&(i0.i0.u26.p10==0))&&(i1.u18.p619==0))&&(i0.i0.u6.p224==0))&&(i1.u18.p574==0))&&(i1.u17.p477==0))&&(i0.i1.i0.u14.p395==0))&&(i1.u17.p519==0))||((((((i0.i0.u6.p225==0)&&((i0.i0.i0.u4.p84==0)||(i1.u18.p617==0)))&&(i0.i0.u6.p212==0))&&(i0.i1.i0.i0.u13.p381==0))&&(i0.i1.i0.i0.i0.u11.p296==0))&&(i1.u18.p596==0)))||(((((((((i0.i0.u6.p260==0)&&(i0.i1.i0.i0.i0.u11.p294==0))&&(i0.i0.u6.p247==0))&&(i0.i0.i0.u5.p104==0))&&(i0.i1.i0.i0.u13.p380==0))&&(i0.i0.u6.p184==0))&&(i1.u17.p508==0))&&(i0.i1.i0.i0.i0.u12.p334==0))&&(i1.u18.p580==0)))))) * (EG(((i1.u17.p468==0)&&(i0.i0.u26.p8==0))) + ((AF((i0.i0.i0.u4.p69==1)) * !(AF(!(AG((((i0.i0.i0.u5.p166==1)||(i0.i0.u6.p238==1))||(i0.i1.i0.i0.i0.u11.p298==1))))))) * !(A(A((((((((i0.i0.u6.p211==1)||(i0.i0.i0.u4.p99==1))||(i0.i1.i0.i0.u13.p352==1))||(i0.i0.i0.u5.p165==1))||(i1.u18.p593==1))||(i0.i0.i0.u5.p152==1))||(i1.u18.p611==1)) U (((((((i0.i1.u15.p420==1)||(i1.u18.p586==1))||(i0.i0.u6.p224==1))||(i0.i0.u26.p7==1))||(i0.i0.i0.u5.p155==1))||(i1.u18.p594==1))||((i0.i0.i0.u4.p77==1)&&(i1.u18.p617==1)))) U ((((((((((((((((i1.u18.p556==1)||(i0.i0.i0.u4.p75==1))||(i1.u18.p601==1))||(i0.i1.i0.u14.p388==1))||(i0.i1.i0.i0.u13.p368==1))||(i1.u18.p576==1))||(i0.i0.i0.u5.p153==1))||(i0.i1.i0.i0.u13.p346==1))||(i1.u17.p519==1))||(i1.u17.p452==1))||(i0.i1.i0.i0.u13.p369==1))||(i1.u18.p574==1))||(i0.i1.i0.i0.i0.u11.p274==1))||(i1.u18.p622==1))||(i0.i1.i0.i0.i0.u12.p316==1))||(i0.i0.u6.p222==1)))))))
Detected timeout of ITS tools.
=> equivalent forward existential formula: ([FwdG((EY(Init) * !(!((E(!((i1.u17.p452==1)) U (!(((!((E(!(((((((((((i0.i1.i0.i0.i0.u11.p277==1)||(i1.u18.p603==1))||(i1.u17.p499==1))||(i0.i0.i0.u5.p148==1))||(i1.u17.p513==1))||(i0.i0.i0.u4.p70==1))||(i0.i0.u26.p10==1))||(i0.i0.u6.p216==1))||(i0.i1.i0.i0.u13.p381==1))||(i1.u17.p491==1))) U (!((((((((((i1.u18.p604==1)||(i1.u17.p513==1))||(i0.i0.u6.p258==1))||(i0.i1.i0.u14.p400==1))||(i0.i0.i0.u4.p23==1))||(i0.i0.i0.u4.p25==1))||(i0.i0.i0.u5.p175==1))||(i0.i1.u19.p265==1))||(i0.i0.i0.u5.p143==1))) * !(((((((((((i0.i1.i0.i0.i0.u11.p277==1)||(i1.u18.p603==1))||(i1.u17.p499==1))||(i0.i0.i0.u5.p148==1))||(i1.u17.p513==1))||(i0.i0.i0.u4.p70==1))||(i0.i0.u26.p10==1))||(i0.i0.u6.p216==1))||(i0.i1.i0.i0.u13.p381==1))||(i1.u17.p491==1))))) + EG(!(((((((((((i0.i1.i0.i0.i0.u11.p277==1)||(i1.u18.p603==1))||(i1.u17.p499==1))||(i0.i0.i0.u5.p148==1))||(i1.u17.p513==1))||(i0.i0.i0.u4.p70==1))||(i0.i0.u26.p10==1))||(i0.i0.u6.p216==1))||(i0.i1.i0.i0.u13.p381==1))||(i1.u17.p491==1)))))) * EG((((i0.i0.u6.p251==1)&&(i1.u18.p617==1))||(i0.i0.i0.u5.p175==1)))) + (!(EX(!(((((((i1.u17.p471==1)||(i1.u17.p465==1))||(i0.i0.i0.u5.p170==1))||((((((((((i0.i0.i0.u4.p89==1)&&(i0.i0.i0.u5.p174==1))&&(i0.i0.u6.p256==1))&&(i0.i1.i0.i0.i0.u11.p302==1))&&(i0.i1.i0.i0.i0.u12.p338==1))&&(i0.i1.i0.i0.u13.p374==1))&&(i0.i1.i0.u14.p410==1))&&(i0.i1.u15.p444==1))&&(i1.u17.p518==1))&&(i1
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:176)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:342)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:185)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:161)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:326)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:392)
at fr.lip6.move.gal.application.ITSRunner$ITSInterpreter.run(ITSRunner.java:182)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-17 21:15:23] [INFO ] Flatten gal took : 59 ms
[2021-05-17 21:15:24] [INFO ] Input system was already deterministic with 772 transitions.
[2021-05-17 21:15:24] [INFO ] Transformed 572 places.
[2021-05-17 21:15:24] [INFO ] Transformed 772 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 21:15:24] [INFO ] Time to serialize gal into /tmp/CTLFireability9886801362452507916.gal : 2 ms
[2021-05-17 21:15:24] [INFO ] Time to serialize properties into /tmp/CTLFireability10668899643864000331.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability9886801362452507916.gal, -t, CGAL, -ctl, /tmp/CTLFireability10668899643864000331.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability9886801362452507916.gal -t CGAL -ctl /tmp/CTLFireability10668899643864000331.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="HealthRecord-PT-17"
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-4028"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-17, 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 r292-tall-162124156400386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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