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.r303-tall-162124171200142.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 gold2020
Input is HealthRecord-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171200142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 9.9K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.3K May 11 18:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:47 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 36K 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-04-00
FORMULA_NAME HealthRecord-PT-04-01
FORMULA_NAME HealthRecord-PT-04-02
FORMULA_NAME HealthRecord-PT-04-03
FORMULA_NAME HealthRecord-PT-04-04
FORMULA_NAME HealthRecord-PT-04-05
FORMULA_NAME HealthRecord-PT-04-06
FORMULA_NAME HealthRecord-PT-04-07
FORMULA_NAME HealthRecord-PT-04-08
FORMULA_NAME HealthRecord-PT-04-09
FORMULA_NAME HealthRecord-PT-04-10
FORMULA_NAME HealthRecord-PT-04-11
FORMULA_NAME HealthRecord-PT-04-12
FORMULA_NAME HealthRecord-PT-04-13
FORMULA_NAME HealthRecord-PT-04-14
FORMULA_NAME HealthRecord-PT-04-15

=== Now, execution of the tool begins

BK_START 1621341106449

[2021-05-18 12:31:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 12:31:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:31:48] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-18 12:31:48] [INFO ] Transformed 123 places.
[2021-05-18 12:31:48] [INFO ] Transformed 239 transitions.
[2021-05-18 12:31:48] [INFO ] Found NUPN structural information;
[2021-05-18 12:31:48] [INFO ] Parsed PT model containing 123 places and 239 transitions in 96 ms.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 7791 resets, run finished after 361 ms. (steps per millisecond=277 ) properties seen :[1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0]
[2021-05-18 12:31:48] [INFO ] Flow matrix only has 223 transitions (discarded 8 similar events)
// Phase 1: matrix 223 rows 123 cols
[2021-05-18 12:31:48] [INFO ] Computed 14 place invariants in 9 ms
[2021-05-18 12:31:48] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-18 12:31:48] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:48] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2021-05-18 12:31:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:31:48] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:31:48] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 19 ms.
[2021-05-18 12:31:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:31:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 92 ms returned sat
[2021-05-18 12:31:49] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:49] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-18 12:31:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:31:49] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 14 ms.
[2021-05-18 12:31:49] [INFO ] Added : 115 causal constraints over 24 iterations in 465 ms. Result :sat
[2021-05-18 12:31:49] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:31:49] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:49] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2021-05-18 12:31:49] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:31:49] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 22 ms.
[2021-05-18 12:31:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:31:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 282 ms returned sat
[2021-05-18 12:31:50] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:50] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2021-05-18 12:31:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:31:50] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 15 ms.
[2021-05-18 12:31:50] [INFO ] Added : 102 causal constraints over 21 iterations in 342 ms. Result :sat
[2021-05-18 12:31:50] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-18 12:31:50] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:50] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2021-05-18 12:31:50] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:31:50] [INFO ] Deduced a trap composed of 45 places in 71 ms
[2021-05-18 12:31:50] [INFO ] Deduced a trap composed of 30 places in 47 ms
[2021-05-18 12:31:50] [INFO ] Deduced a trap composed of 33 places in 44 ms
[2021-05-18 12:31:50] [INFO ] Deduced a trap composed of 39 places in 46 ms
[2021-05-18 12:31:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 247 ms
[2021-05-18 12:31:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:31:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2021-05-18 12:31:51] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:51] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-18 12:31:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:31:51] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 16 ms.
[2021-05-18 12:31:51] [INFO ] Added : 113 causal constraints over 23 iterations in 475 ms. Result :sat
[2021-05-18 12:31:51] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:31:51] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:51] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-18 12:31:51] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:31:51] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 18 ms.
[2021-05-18 12:31:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:31:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-18 12:31:51] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:51] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2021-05-18 12:31:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:31:51] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 13 ms.
[2021-05-18 12:31:52] [INFO ] Added : 133 causal constraints over 29 iterations in 531 ms. Result :sat
[2021-05-18 12:31:52] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:31:52] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:52] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-18 12:31:52] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:31:52] [INFO ] Deduced a trap composed of 56 places in 45 ms
[2021-05-18 12:31:52] [INFO ] Deduced a trap composed of 45 places in 42 ms
[2021-05-18 12:31:52] [INFO ] Deduced a trap composed of 31 places in 52 ms
[2021-05-18 12:31:52] [INFO ] Deduced a trap composed of 39 places in 70 ms
[2021-05-18 12:31:52] [INFO ] Deduced a trap composed of 31 places in 50 ms
[2021-05-18 12:31:52] [INFO ] Deduced a trap composed of 39 places in 45 ms
[2021-05-18 12:31:52] [INFO ] Deduced a trap composed of 37 places in 44 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 52 places in 63 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 40 places in 44 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 40 places in 39 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 39 places in 42 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 39 places in 43 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 41 places in 38 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 52 places in 39 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 41 places in 35 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 40 places in 36 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 53 places in 36 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 41 places in 38 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 42 places in 37 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 40 places in 37 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 38 places in 38 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 40 places in 38 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 41 places in 40 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 44 places in 49 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 40 places in 39 ms
[2021-05-18 12:31:53] [INFO ] Deduced a trap composed of 40 places in 41 ms
[2021-05-18 12:31:53] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 1342 ms
[2021-05-18 12:31:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:31:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-18 12:31:53] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-18 12:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:54] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-18 12:31:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:31:54] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 16 ms.
[2021-05-18 12:31:54] [INFO ] Added : 116 causal constraints over 24 iterations in 436 ms. Result :sat
[2021-05-18 12:31:54] [INFO ] Deduced a trap composed of 35 places in 37 ms
[2021-05-18 12:31:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2021-05-18 12:31:54] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2021-05-18 12:31:54] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:54] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-18 12:31:54] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:31:54] [INFO ] Deduced a trap composed of 56 places in 49 ms
[2021-05-18 12:31:54] [INFO ] Deduced a trap composed of 45 places in 49 ms
[2021-05-18 12:31:54] [INFO ] Deduced a trap composed of 31 places in 42 ms
[2021-05-18 12:31:54] [INFO ] Deduced a trap composed of 34 places in 52 ms
[2021-05-18 12:31:54] [INFO ] Deduced a trap composed of 39 places in 41 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 40 places in 40 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 39 places in 40 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 52 places in 41 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 39 places in 42 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 39 places in 37 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 52 places in 39 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 40 places in 37 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 39 places in 36 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 39 places in 38 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 39 places in 38 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 41 places in 38 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 41 places in 38 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 32 places in 68 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 41 places in 38 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 40 places in 39 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 40 places in 38 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 40 places in 48 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 41 places in 49 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 42 places in 67 ms
[2021-05-18 12:31:55] [INFO ] Deduced a trap composed of 41 places in 51 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 40 places in 47 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 41 places in 36 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 41 places in 33 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 40 places in 34 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 40 places in 39 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 53 places in 34 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 40 places in 39 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 40 places in 33 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 40 places in 37 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 42 places in 33 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 42 places in 40 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 42 places in 37 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 53 places in 35 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 40 places in 32 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 40 places in 34 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 42 places in 37 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 41 places in 37 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 41 places in 40 ms
[2021-05-18 12:31:56] [INFO ] Deduced a trap composed of 42 places in 35 ms
[2021-05-18 12:31:56] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 2133 ms
[2021-05-18 12:31:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:31:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-18 12:31:56] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-18 12:31:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:56] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-18 12:31:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:31:57] [INFO ] Deduced a trap composed of 24 places in 41 ms
[2021-05-18 12:31:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-18 12:31:57] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 16 ms.
[2021-05-18 12:31:57] [INFO ] Added : 102 causal constraints over 21 iterations in 377 ms. Result :sat
[2021-05-18 12:31:57] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:31:57] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:57] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-18 12:31:57] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:31:57] [INFO ] Deduced a trap composed of 44 places in 49 ms
[2021-05-18 12:31:57] [INFO ] Deduced a trap composed of 24 places in 41 ms
[2021-05-18 12:31:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2021-05-18 12:31:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:31:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-18 12:31:57] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:57] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-18 12:31:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:31:57] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 12 ms.
[2021-05-18 12:31:58] [INFO ] Added : 113 causal constraints over 23 iterations in 393 ms. Result :sat
[2021-05-18 12:31:58] [INFO ] Deduced a trap composed of 34 places in 36 ms
[2021-05-18 12:31:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2021-05-18 12:31:58] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:31:58] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:58] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2021-05-18 12:31:58] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:31:58] [INFO ] Deduced a trap composed of 45 places in 64 ms
[2021-05-18 12:31:58] [INFO ] Deduced a trap composed of 33 places in 30 ms
[2021-05-18 12:31:58] [INFO ] Deduced a trap composed of 35 places in 30 ms
[2021-05-18 12:31:58] [INFO ] Deduced a trap composed of 35 places in 29 ms
[2021-05-18 12:31:58] [INFO ] Deduced a trap composed of 35 places in 31 ms
[2021-05-18 12:31:58] [INFO ] Deduced a trap composed of 34 places in 30 ms
[2021-05-18 12:31:58] [INFO ] Deduced a trap composed of 32 places in 29 ms
[2021-05-18 12:31:58] [INFO ] Deduced a trap composed of 34 places in 29 ms
[2021-05-18 12:31:58] [INFO ] Deduced a trap composed of 32 places in 31 ms
[2021-05-18 12:31:58] [INFO ] Deduced a trap composed of 34 places in 37 ms
[2021-05-18 12:31:58] [INFO ] Deduced a trap composed of 34 places in 29 ms
[2021-05-18 12:31:58] [INFO ] Deduced a trap composed of 46 places in 50 ms
[2021-05-18 12:31:58] [INFO ] Deduced a trap composed of 34 places in 35 ms
[2021-05-18 12:31:58] [INFO ] Deduced a trap composed of 37 places in 39 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 45 places in 38 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 38 places in 38 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 39 places in 38 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 39 places in 39 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 38 places in 39 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 33 places in 44 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 45 places in 44 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 35 places in 37 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 35 places in 44 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 41 places in 33 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 40 places in 37 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 41 places in 39 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 42 places in 39 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 39 places in 37 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 40 places in 34 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 40 places in 37 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 40 places in 38 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 39 places in 37 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 41 places in 32 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 40 places in 40 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 39 places in 39 ms
[2021-05-18 12:31:59] [INFO ] Deduced a trap composed of 40 places in 37 ms
[2021-05-18 12:32:00] [INFO ] Deduced a trap composed of 41 places in 36 ms
[2021-05-18 12:32:00] [INFO ] Deduced a trap composed of 39 places in 55 ms
[2021-05-18 12:32:00] [INFO ] Deduced a trap composed of 38 places in 38 ms
[2021-05-18 12:32:00] [INFO ] Deduced a trap composed of 39 places in 38 ms
[2021-05-18 12:32:00] [INFO ] Deduced a trap composed of 39 places in 38 ms
[2021-05-18 12:32:00] [INFO ] Deduced a trap composed of 39 places in 38 ms
[2021-05-18 12:32:00] [INFO ] Deduced a trap composed of 39 places in 34 ms
[2021-05-18 12:32:00] [INFO ] Deduced a trap composed of 39 places in 38 ms
[2021-05-18 12:32:00] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 1977 ms
[2021-05-18 12:32:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:32:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2021-05-18 12:32:00] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:32:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:32:00] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-18 12:32:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:32:00] [INFO ] Deduced a trap composed of 39 places in 37 ms
[2021-05-18 12:32:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-18 12:32:00] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 15 ms.
[2021-05-18 12:32:02] [INFO ] Added : 113 causal constraints over 24 iterations in 2086 ms. Result :sat
[2021-05-18 12:32:02] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-18 12:32:02] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-18 12:32:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:32:02] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-18 12:32:02] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-18 12:32:02] [INFO ] Deduced a trap composed of 32 places in 32 ms
[2021-05-18 12:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-18 12:32:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:32:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2021-05-18 12:32:02] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:32:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:32:02] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2021-05-18 12:32:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:32:02] [INFO ] Deduced a trap composed of 33 places in 40 ms
[2021-05-18 12:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2021-05-18 12:32:02] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 14 ms.
[2021-05-18 12:32:03] [INFO ] Added : 111 causal constraints over 23 iterations in 458 ms. Result :sat
[2021-05-18 12:32:03] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:32:03] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-18 12:32:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:32:03] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-18 12:32:03] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:32:03] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 25 ms.
[2021-05-18 12:32:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:32:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2021-05-18 12:32:03] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-18 12:32:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:32:03] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-18 12:32:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:32:03] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 11 ms.
[2021-05-18 12:32:04] [INFO ] Added : 99 causal constraints over 21 iterations in 308 ms. Result :sat
[2021-05-18 12:32:04] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2021-05-18 12:32:04] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:32:04] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2021-05-18 12:32:04] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:32:04] [INFO ] Deduced a trap composed of 39 places in 44 ms
[2021-05-18 12:32:04] [INFO ] Deduced a trap composed of 35 places in 35 ms
[2021-05-18 12:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 92 ms
[2021-05-18 12:32:04] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:32:04] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:32:04] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2021-05-18 12:32:04] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:32:04] [INFO ] Deduced a trap composed of 37 places in 36 ms
[2021-05-18 12:32:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2021-05-18 12:32:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:32:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-18 12:32:04] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:32:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:32:04] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2021-05-18 12:32:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:32:04] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 11 ms.
[2021-05-18 12:32:04] [INFO ] Added : 105 causal constraints over 21 iterations in 304 ms. Result :sat
[2021-05-18 12:32:04] [INFO ] Deduced a trap composed of 39 places in 34 ms
[2021-05-18 12:32:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2021-05-18 12:32:04] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:32:04] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:32:05] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2021-05-18 12:32:05] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:32:05] [INFO ] Deduced a trap composed of 37 places in 36 ms
[2021-05-18 12:32:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2021-05-18 12:32:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:32:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2021-05-18 12:32:05] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:32:05] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-18 12:32:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:32:05] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 14 ms.
[2021-05-18 12:32:05] [INFO ] Added : 105 causal constraints over 21 iterations in 305 ms. Result :sat
[2021-05-18 12:32:05] [INFO ] Deduced a trap composed of 39 places in 34 ms
[2021-05-18 12:32:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2021-05-18 12:32:05] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:32:05] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:32:05] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-18 12:32:05] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:32:05] [INFO ] Deduced a trap composed of 31 places in 48 ms
[2021-05-18 12:32:05] [INFO ] Deduced a trap composed of 40 places in 36 ms
[2021-05-18 12:32:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2021-05-18 12:32:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:32:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-18 12:32:05] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:32:05] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-18 12:32:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:32:05] [INFO ] Deduced a trap composed of 24 places in 34 ms
[2021-05-18 12:32:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-18 12:32:05] [INFO ] Computed and/alt/rep : 230/1468/222 causal constraints in 11 ms.
[2021-05-18 12:32:06] [INFO ] Added : 107 causal constraints over 22 iterations in 327 ms. Result :sat
[2021-05-18 12:32:06] [INFO ] Deduced a trap composed of 39 places in 35 ms
[2021-05-18 12:32:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-18 12:32:06] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-18 12:32:06] [INFO ] Flatten gal took : 50 ms
FORMULA HealthRecord-PT-04-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-04-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-04-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 12:32:06] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 12:32:06] [INFO ] Applying decomposition
[2021-05-18 12:32:06] [INFO ] Flatten gal took : 23 ms
[2021-05-18 12:32:06] [INFO ] Input system was already deterministic with 231 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph11949968176186913752.txt, -o, /tmp/graph11949968176186913752.bin, -w, /tmp/graph11949968176186913752.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph11949968176186913752.bin, -l, -1, -v, -w, /tmp/graph11949968176186913752.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 12:32:06] [INFO ] Decomposing Gal with order
[2021-05-18 12:32:06] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 223 out of 231 initially.
// Phase 1: matrix 223 rows 123 cols
[2021-05-18 12:32:06] [INFO ] Computed 14 place invariants in 2 ms
inv : p0 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 = 1
inv : 2*p0 + p46 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 = 2
inv : -p0 + p26 + p27 + p28 + p29 + p30 + p31 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 = -1
inv : -p0 + p33 + p34 + p35 + p36 + p37 + p38 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 = -1
[2021-05-18 12:32:06] [INFO ] Removed a total of 59 redundant transitions.
inv : -p0 + p47 + p48 + p49 + p50 + p51 + p52 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 = -1
inv : 2*p0 + p25 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 = 2
inv : -p0 + p21 + p22 + p23 + p24 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 = -1
inv : -p0 + p40 + p41 + p42 + p43 + p44 + p45 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 = -1
inv : p0 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 = 1
inv : 2*p0 + p32 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 = 2
inv : 2*p0 + p1 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 = 2
inv : 2*p0 + p20 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 = 2
inv : -p0 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 = -1
inv : 2*p0 + p39 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 = 2
Total of 14 invariants.
[2021-05-18 12:32:06] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-18 12:32:06] [INFO ] Flatten gal took : 62 ms
[2021-05-18 12:32:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 6 ms.
[2021-05-18 12:32:06] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2021-05-18 12:32:06] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !((F(G((F(G((F((F("(u4.p34==1)"))&&("(i6.u9.p58==1)")))&&("(u3.p31==1)"))))&&(F("(i8.u12.p81==1)"))))))
Formula 0 simplified : !FG(FG("(u3.p31==1)" & F("(i6.u9.p58==1)" & F"(u4.p34==1)")) & F"(i8.u12.p81==1)")
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 24 ordering constraints for composite.
built 49 ordering constraints for composite.
[2021-05-18 12:32:07] [INFO ] Proved 123 variables to be positive in 197 ms
[2021-05-18 12:32:07] [INFO ] Computing symmetric may disable matrix : 231 transitions.
[2021-05-18 12:32:07] [INFO ] Computation of disable matrix completed :0/231 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:32:07] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:32:07] [INFO ] Computing symmetric may enable matrix : 231 transitions.
[2021-05-18 12:32:07] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:32:08] [INFO ] Computing symmetric co enabling matrix : 231 transitions.
Reverse transition relation is NOT exact ! Due to transitions t10, u0.t144, u0.t145, u0.t146, u0.t147, u0.t148, u0.t149, u0.t150, u0.t151, u0.t152, u0.t153, u0.t154, u0.t155, u0.t156, u0.t157, u0.t158, u0.t159, u0.t160, u0.t161, u0.t162, u0.t163, u0.t164, u0.t165, u0.t167, u0.t168, u0.t169, u0.t171, u0.t172, u0.t174, u0.t175, u0.t178, u6.t104, u6.t105, u6.t106, u6.t107, u6.t108, u6.t110, u6.t111, u6.t112, u3.t131, u3.t132, u3.t133, u3.t134, u3.t135, u3.t137, u3.t138, u3.t139, u4.t122, u4.t123, u4.t124, u4.t125, u4.t126, u4.t128, u4.t129, u4.t130, u5.t113, u5.t114, u5.t115, u5.t116, u5.t117, u5.t119, u5.t120, u5.t121, i6.t66, i6.t64, i6.u9.t60, i6.u9.t61, i6.u9.t70, i6.u9.t71, i6.u9.t72, i6.u9.t73, i6.u9.t74, i6.u9.t75, i6.u9.t76, i6.u9.t77, i6.u9.t78, i6.u9.t79, i6.u9.t80, i6.u9.t81, i6.u9.t82, i6.u9.t83, i6.u9.t84, i6.u9.t85, i6.u9.t86, i6.u9.t87, i6.u9.t88, i6.u9.t89, i6.u9.t90, i6.u9.t91, i6.u9.t92, i6.u9.t93, i6.u9.t94, i6.u9.t95, i6.u9.t96, i6.u9.t97, i6.u9.t98, i6.u9.t99, i6.u9.t100, i6.u9.t101, i6.u9.t102, i6.u9.t103, i8.t34, i8.t22, i8.t14, i8.t8, i8.t6, i8.u11.t2, i8.u11.t5, i8.u11.t9, i8.u11.t23, i8.u11.t28, i8.u11.t40, i8.u11.t56, i8.u12.t7, i8.u12.t15, i8.u12.t16, i8.u12.t18, i8.u12.t19, i8.u12.t21, i8.u12.t24, i8.u12.t25, i8.u12.t26, i8.u12.t30, i8.u12.t31, i8.u12.t32, i8.u12.t33, i8.u12.t36, i8.u12.t37, i8.u12.t38, i8.u12.t42, i8.u12.t43, i8.u12.t44, i8.u12.t45, i8.u12.t48, i8.u12.t49, i8.u12.t51, i8.u12.t52, i8.u12.t54, i8.u12.t57, i8.u12.t58, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/71/140/211
Computing Next relation with stutter on 65 deadlock states
13 unique states visited
13 strongly connected components in search stack
14 transitions explored
13 items max in DFS search stack
314 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.17092,102608,1,0,132154,57655,2502,243147,1702,273505,180352
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-04-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(F("(i6.u8.p76==1)")))U("(u10.p112==1)")))
Formula 1 simplified : !(!F"(i6.u8.p76==1)" U "(u10.p112==1)")
Computing Next relation with stutter on 65 deadlock states
[2021-05-18 12:32:10] [INFO ] Computation of co-enabling matrix(5/231) took 2105 ms. Total solver calls (SAT/UNSAT): 1360(603/757)
11 unique states visited
11 strongly connected components in search stack
11 transitions explored
11 items max in DFS search stack
43 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.6087,120796,1,0,163524,63141,2545,300437,1706,307253,199010
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HealthRecord-PT-04-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!((F("((u5.p43==1)&&(i8.u11.p120==1))"))U(X(F("(u0.p11==1)"))))))
Formula 2 simplified : F"((u5.p43==1)&&(i8.u11.p120==1))" U XF"(u0.p11==1)"
Computing Next relation with stutter on 65 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
71 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.31011,148232,1,0,208967,73872,2578,387836,1708,378232,235502
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HealthRecord-PT-04-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G((X(F(!(G("(i6.u9.p67==1)")))))||(X("(i1.u1.p22==1)"))))U(G(X("(i6.u9.p67==1)")))))
Formula 3 simplified : !(G(XF!G"(i6.u9.p67==1)" | X"(i1.u1.p22==1)") U GX"(i6.u9.p67==1)")
Computing Next relation with stutter on 65 deadlock states
25 unique states visited
25 strongly connected components in search stack
27 transitions explored
25 items max in DFS search stack
17 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.474,151612,1,0,215918,74105,2640,397349,1710,380382,247168
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA HealthRecord-PT-04-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(!(F(!((X(G("(u3.p31==1)")))U("(u3.p31==1)")))))))
Formula 4 simplified : !X!F!(XG"(u3.p31==1)" U "(u3.p31==1)")
Computing Next relation with stutter on 65 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 items max in DFS search stack
114 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.6209,191984,1,0,285314,87992,2680,525383,1710,465649,299217
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA HealthRecord-PT-04-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(!(G(X(G(F("(u4.p33==1)"))))))))
Formula 5 simplified : !F!GXGF"(u4.p33==1)"
Computing Next relation with stutter on 65 deadlock states
[2021-05-18 12:32:13] [INFO ] Computation of co-enabling matrix(13/231) took 5261 ms. Total solver calls (SAT/UNSAT): 3116(1570/1546)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
178 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.40266,264848,1,0,413815,108430,2698,747853,1710,606757,392186
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HealthRecord-PT-04-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(X((((X(G("(i8.u12.p94==1)")))||("(i6.u9.p79==1)"))&&("(u0.p18==1)"))&&("(i6.u9.p57!=1)"))))))
Formula 6 simplified : !GXX("(i6.u9.p57!=1)" & "(u0.p18==1)" & ("(i6.u9.p79==1)" | XG"(i8.u12.p94==1)"))
Computing Next relation with stutter on 65 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
38 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.77326,273232,1,0,425361,110544,2752,773174,1720,624740,394035
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HealthRecord-PT-04-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((X("(i6.u9.p69==1)"))U("((u6.p50==1)&&(i8.u11.p120==1))"))||(F((G("(i8.u12.p89==1)"))&&("((((u6.p50!=1)||(i8.u11.p120!=1))||(u0.p16!=1))||(i8.u11.p120!=1))")))))
Formula 7 simplified : !((X"(i6.u9.p69==1)" U "((u6.p50==1)&&(i8.u11.p120==1))") | F("((((u6.p50!=1)||(i8.u11.p120!=1))||(u0.p16!=1))||(i8.u11.p120!=1))" & G"(i8.u12.p89==1)"))
Computing Next relation with stutter on 65 deadlock states
11 unique states visited
11 strongly connected components in search stack
11 transitions explored
11 items max in DFS search stack
93 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.71016,301084,1,0,475995,115512,2794,859351,1723,672552,424528
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HealthRecord-PT-04-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X(X((X("((i6.u9.p77==1)&&(i8.u12.p86==1))"))||(X(F("((((u10.p112==1)&&(u4.p36==1))&&(i8.u11.p120==1))||(u10.p112==1))"))))))))
Formula 8 simplified : !FXX(X"((i6.u9.p77==1)&&(i8.u12.p86==1))" | XF"((((u10.p112==1)&&(u4.p36==1))&&(i8.u11.p120==1))||(u10.p112==1))")
Computing Next relation with stutter on 65 deadlock states
[2021-05-18 12:32:16] [INFO ] Computation of co-enabling matrix(21/231) took 8410 ms. Total solver calls (SAT/UNSAT): 4808(2536/2272)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
127 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.97551,363388,1,0,589104,124547,2833,1.04751e+06,1723,753779,491888
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA HealthRecord-PT-04-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((("(u6.p47==1)")U(X("(i8.u11.p83==1)"))))
Formula 9 simplified : !("(u6.p47==1)" U X"(i8.u11.p83==1)")
Computing Next relation with stutter on 65 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
20 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.1863,372892,1,0,603847,126049,2842,1.07527e+06,1723,765970,496273
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA HealthRecord-PT-04-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G((X(X(G("((u0.p16==1)&&(i8.u12.p103==1))"))))U(G(X((!(("((u0.p16==1)&&(i8.u12.p103==1))")U("(i8.u12.p106==1)")))&&("((u0.p16!=1)||(i8.u12.p103!=1))")))))))
Formula 10 simplified : !G(XXG"((u0.p16==1)&&(i8.u12.p103==1))" U GX("((u0.p16!=1)||(i8.u12.p103!=1))" & !("((u0.p16==1)&&(i8.u12.p103==1))" U "(i8.u12.p106==1)")))
Computing Next relation with stutter on 65 deadlock states
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 items max in DFS search stack
21 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.3979,380516,1,0,614898,127807,2902,1.09697e+06,1728,777555,507951
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HealthRecord-PT-04-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(G("(u5.p45==1)"))))
Formula 11 simplified : !FG"(u5.p45==1)"
Computing Next relation with stutter on 65 deadlock states
[2021-05-18 12:32:19] [INFO ] Computation of co-enabling matrix(29/231) took 11570 ms. Total solver calls (SAT/UNSAT): 6436(3503/2933)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
538 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,15.7754,585656,1,0,1.03699e+06,154019,2925,1.70729e+06,1728,1.0542e+06,698595
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA HealthRecord-PT-04-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(F((!(F(G("(i8.u12.p99==1)"))))||(F("(i8.u11.p93==1)"))))))
Formula 12 simplified : !GF(!FG"(i8.u12.p99==1)" | F"(i8.u11.p93==1)")
Computing Next relation with stutter on 65 deadlock states
13 unique states visited
13 strongly connected components in search stack
14 transitions explored
13 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,15.779,585920,1,0,1.03714e+06,154019,2953,1.70736e+06,1730,1.0542e+06,699709
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA HealthRecord-PT-04-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2021-05-18 12:32:22] [INFO ] Computation of co-enabling matrix(37/231) took 14640 ms. Total solver calls (SAT/UNSAT): 8000(4472/3528)
[2021-05-18 12:32:25] [INFO ] Computation of co-enabling matrix(45/231) took 17648 ms. Total solver calls (SAT/UNSAT): 9500(5440/4060)
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-18 12:32:26] [INFO ] Built C files in 19533ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1621341148124

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is HealthRecord-PT-04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r303-tall-162124171200142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-04.tgz
mv HealthRecord-PT-04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;