fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r303-tall-162124171300178
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for HealthRecord-PT-13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2309.327 119412.00 217523.00 378.90 FTFTTFFFFFFFFFFF normal

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-162124171300178.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-13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171300178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.0K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:48 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 52K 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-13-00
FORMULA_NAME HealthRecord-PT-13-01
FORMULA_NAME HealthRecord-PT-13-02
FORMULA_NAME HealthRecord-PT-13-03
FORMULA_NAME HealthRecord-PT-13-04
FORMULA_NAME HealthRecord-PT-13-05
FORMULA_NAME HealthRecord-PT-13-06
FORMULA_NAME HealthRecord-PT-13-07
FORMULA_NAME HealthRecord-PT-13-08
FORMULA_NAME HealthRecord-PT-13-09
FORMULA_NAME HealthRecord-PT-13-10
FORMULA_NAME HealthRecord-PT-13-11
FORMULA_NAME HealthRecord-PT-13-12
FORMULA_NAME HealthRecord-PT-13-13
FORMULA_NAME HealthRecord-PT-13-14
FORMULA_NAME HealthRecord-PT-13-15

=== Now, execution of the tool begins

BK_START 1621341976639

[2021-05-18 12:46:18] [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:46:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:46:18] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2021-05-18 12:46:18] [INFO ] Transformed 161 places.
[2021-05-18 12:46:18] [INFO ] Transformed 341 transitions.
[2021-05-18 12:46:18] [INFO ] Found NUPN structural information;
[2021-05-18 12:46:18] [INFO ] Parsed PT model containing 161 places and 341 transitions in 100 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 7733 resets, run finished after 361 ms. (steps per millisecond=277 ) properties seen :[0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1]
[2021-05-18 12:46:18] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
// Phase 1: matrix 301 rows 161 cols
[2021-05-18 12:46:18] [INFO ] Computed 18 place invariants in 10 ms
[2021-05-18 12:46:18] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2021-05-18 12:46:18] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:19] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-18 12:46:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:46:19] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:19] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 25 ms.
[2021-05-18 12:46:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 55 ms returned sat
[2021-05-18 12:46:19] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-18 12:46:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:19] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-18 12:46:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:19] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 20 ms.
[2021-05-18 12:46:22] [INFO ] Added : 163 causal constraints over 33 iterations in 2529 ms. Result :sat
[2021-05-18 12:46:22] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:22] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:46:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:22] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:46:22] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:22] [INFO ] Deduced a trap composed of 30 places in 87 ms
[2021-05-18 12:46:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2021-05-18 12:46:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 61 ms returned sat
[2021-05-18 12:46:22] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:46:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:22] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2021-05-18 12:46:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:22] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 35 ms.
[2021-05-18 12:46:24] [INFO ] Added : 168 causal constraints over 34 iterations in 1559 ms. Result :sat
[2021-05-18 12:46:24] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:46:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:24] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:46:24] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:46:24] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 23 ms.
[2021-05-18 12:46:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 53 ms returned sat
[2021-05-18 12:46:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-18 12:46:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:24] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:46:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:24] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 20 ms.
[2021-05-18 12:46:26] [INFO ] Added : 157 causal constraints over 32 iterations in 1367 ms. Result :sat
[2021-05-18 12:46:26] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:26] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:46:26] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:26] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 19 ms.
[2021-05-18 12:46:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 25 ms returned sat
[2021-05-18 12:46:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:26] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:46:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:26] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 27 ms.
[2021-05-18 12:46:27] [INFO ] Added : 151 causal constraints over 31 iterations in 608 ms. Result :sat
[2021-05-18 12:46:27] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:27] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:46:27] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:27] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 19 ms.
[2021-05-18 12:46:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 12:46:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:27] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:46:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 18 ms returned sat
[2021-05-18 12:46:27] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 17 ms.
[2021-05-18 12:46:28] [INFO ] Added : 174 causal constraints over 36 iterations in 1137 ms. Result :sat
[2021-05-18 12:46:28] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:46:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:46:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:28] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-18 12:46:28] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:29] [INFO ] Deduced a trap composed of 46 places in 68 ms
[2021-05-18 12:46:29] [INFO ] Deduced a trap composed of 30 places in 48 ms
[2021-05-18 12:46:29] [INFO ] Deduced a trap composed of 30 places in 52 ms
[2021-05-18 12:46:29] [INFO ] Deduced a trap composed of 39 places in 38 ms
[2021-05-18 12:46:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 247 ms
[2021-05-18 12:46:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 33 ms returned sat
[2021-05-18 12:46:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:46:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:29] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:46:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:29] [INFO ] Deduced a trap composed of 39 places in 68 ms
[2021-05-18 12:46:29] [INFO ] Deduced a trap composed of 38 places in 39 ms
[2021-05-18 12:46:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2021-05-18 12:46:29] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 18 ms.
[2021-05-18 12:46:31] [INFO ] Added : 166 causal constraints over 34 iterations in 1795 ms. Result :sat
[2021-05-18 12:46:31] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:31] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:31] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:46:31] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:31] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 22 ms.
[2021-05-18 12:46:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 12:46:31] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:31] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:46:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:46:31] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 15 ms.
[2021-05-18 12:46:32] [INFO ] Added : 174 causal constraints over 36 iterations in 1130 ms. Result :sat
[2021-05-18 12:46:32] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:32] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:33] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:46:33] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:46:33] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 26 ms.
[2021-05-18 12:46:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 12:46:33] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:33] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:46:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2021-05-18 12:46:33] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 15 ms.
[2021-05-18 12:46:34] [INFO ] Added : 165 causal constraints over 34 iterations in 1410 ms. Result :sat
[2021-05-18 12:46:34] [INFO ] Deduced a trap composed of 46 places in 50 ms
[2021-05-18 12:46:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2021-05-18 12:46:34] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:34] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:35] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-18 12:46:35] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:35] [INFO ] Deduced a trap composed of 45 places in 57 ms
[2021-05-18 12:46:35] [INFO ] Deduced a trap composed of 30 places in 48 ms
[2021-05-18 12:46:35] [INFO ] Deduced a trap composed of 30 places in 47 ms
[2021-05-18 12:46:35] [INFO ] Deduced a trap composed of 38 places in 36 ms
[2021-05-18 12:46:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 234 ms
[2021-05-18 12:46:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 33 ms returned sat
[2021-05-18 12:46:35] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:46:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:35] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:46:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:35] [INFO ] Deduced a trap composed of 39 places in 46 ms
[2021-05-18 12:46:35] [INFO ] Deduced a trap composed of 39 places in 53 ms
[2021-05-18 12:46:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2021-05-18 12:46:35] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 15 ms.
[2021-05-18 12:46:40] [INFO ] Added : 170 causal constraints over 34 iterations in 4540 ms. Result :sat
[2021-05-18 12:46:40] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:46:40] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:40] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:46:40] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:40] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 12 ms.
[2021-05-18 12:46:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 49 ms returned sat
[2021-05-18 12:46:40] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:40] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:46:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:40] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 15 ms.
[2021-05-18 12:46:41] [INFO ] Added : 169 causal constraints over 34 iterations in 1201 ms. Result :sat
[2021-05-18 12:46:41] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:41] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:46:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:41] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:46:41] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:41] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 17 ms.
[2021-05-18 12:46:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 49 ms returned sat
[2021-05-18 12:46:42] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:42] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:46:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:42] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 14 ms.
[2021-05-18 12:46:43] [INFO ] Added : 172 causal constraints over 36 iterations in 1103 ms. Result :sat
[2021-05-18 12:46:43] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:43] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:43] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:46:43] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:43] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 18 ms.
[2021-05-18 12:46:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 31 ms returned sat
[2021-05-18 12:46:43] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:46:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:43] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:46:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:43] [INFO ] Deduced a trap composed of 41 places in 46 ms
[2021-05-18 12:46:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2021-05-18 12:46:43] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 13 ms.
[2021-05-18 12:46:45] [INFO ] Added : 164 causal constraints over 33 iterations in 1293 ms. Result :sat
[2021-05-18 12:46:45] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:45] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:45] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:46:45] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:45] [INFO ] Deduced a trap composed of 47 places in 45 ms
[2021-05-18 12:46:45] [INFO ] Deduced a trap composed of 48 places in 45 ms
[2021-05-18 12:46:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2021-05-18 12:46:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 48 ms returned sat
[2021-05-18 12:46:45] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:45] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:46:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:45] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 14 ms.
[2021-05-18 12:46:46] [INFO ] Added : 141 causal constraints over 29 iterations in 706 ms. Result :sat
[2021-05-18 12:46:46] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:46] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:46] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:46:46] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:46] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 15 ms.
[2021-05-18 12:46:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 48 ms returned sat
[2021-05-18 12:46:46] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:46:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:46] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:46:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:46] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 14 ms.
[2021-05-18 12:46:47] [INFO ] Added : 169 causal constraints over 34 iterations in 1208 ms. Result :sat
[2021-05-18 12:46:48] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:48] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:48] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:46:48] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:46:48] [INFO ] Deduced a trap composed of 30 places in 29 ms
[2021-05-18 12:46:48] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2021-05-18 12:46:48] [INFO ] Deduced a trap composed of 30 places in 22 ms
[2021-05-18 12:46:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 107 ms
[2021-05-18 12:46:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 48 ms returned sat
[2021-05-18 12:46:48] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:48] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:46:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:48] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2021-05-18 12:46:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2021-05-18 12:46:48] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 16 ms.
[2021-05-18 12:46:49] [INFO ] Added : 162 causal constraints over 33 iterations in 1279 ms. Result :sat
[2021-05-18 12:46:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 12:46:49] [INFO ] Flatten gal took : 63 ms
FORMULA HealthRecord-PT-13-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 12:46:49] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 12:46:50] [INFO ] Applying decomposition
[2021-05-18 12:46:50] [INFO ] Flatten gal took : 20 ms
[2021-05-18 12:46:50] [INFO ] Input system was already deterministic with 313 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/graph1597604870064785569.txt, -o, /tmp/graph1597604870064785569.bin, -w, /tmp/graph1597604870064785569.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/graph1597604870064785569.bin, -l, -1, -v, -w, /tmp/graph1597604870064785569.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 12:46:50] [INFO ] Decomposing Gal with order
[2021-05-18 12:46:50] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 301 out of 313 initially.
// Phase 1: matrix 301 rows 161 cols
[2021-05-18 12:46:50] [INFO ] Computed 18 place invariants in 3 ms
inv : 2*p0 + p63 + 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 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 = 2
inv : -p0 + p64 + p65 + p66 + p67 + p68 + p69 - 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 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 = -1
inv : 2*p0 + p2 + 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 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 = 2
inv : -p0 + p1 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 - 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 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 = -1
inv : 2*p0 + p58 + 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 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 = 2
inv : 2*p0 + p84 + 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 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 = 2
inv : p0 + 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 = 1
inv : -p0 + p39 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 - 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 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 = -1
inv : -p0 + p71 + p72 + p73 + p74 + p75 + p76 - 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 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 = -1
inv : 2*p0 + p77 + 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 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 = 2
inv : 2*p0 + p21 + 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 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 = 2
inv : -p0 + p85 + p86 + p87 + p88 + p89 + p90 - 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 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 = -1
inv : -p0 + p59 + p60 + p61 + p62 - 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 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 = -1
inv : -p0 + p78 + p79 + p80 + p81 + p82 + p83 - 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 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 = -1
inv : p0 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 = 1
inv : 2*p0 + p70 + 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 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 = 2
inv : 2*p0 + p40 + 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 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 = 2
inv : -p0 + p20 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 - 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 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 = -1
Total of 18 invariants.
[2021-05-18 12:46:50] [INFO ] Computed 18 place invariants in 4 ms
[2021-05-18 12:46:50] [INFO ] Removed a total of 51 redundant transitions.
[2021-05-18 12:46:50] [INFO ] Flatten gal took : 68 ms
[2021-05-18 12:46:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 7 ms.
[2021-05-18 12:46:50] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 12 ms
[2021-05-18 12:46:50] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 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 15 LTL properties
Checking formula 0 : !(((F(X("(u0.p7!=1)")))&&(!(F("(i3.u3.p60==1)")))))
Formula 0 simplified : !(FX"(u0.p7!=1)" & !F"(i3.u3.p60==1)")
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 24 ordering constraints for composite.
[2021-05-18 12:46:50] [INFO ] Proved 161 variables to be positive in 248 ms
[2021-05-18 12:46:50] [INFO ] Computing symmetric may disable matrix : 313 transitions.
[2021-05-18 12:46:50] [INFO ] Computation of disable matrix completed :0/313 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:46:50] [INFO ] Computation of Complete disable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:46:50] [INFO ] Computing symmetric may enable matrix : 313 transitions.
[2021-05-18 12:46:50] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:46:52] [INFO ] Computing symmetric co enabling matrix : 313 transitions.
[2021-05-18 12:46:53] [INFO ] Computation of co-enabling matrix(2/313) took 1601 ms. Total solver calls (SAT/UNSAT): 931(369/562)
[2021-05-18 12:46:57] [INFO ] Computation of co-enabling matrix(7/313) took 5258 ms. Total solver calls (SAT/UNSAT): 2461(1293/1168)
[2021-05-18 12:47:00] [INFO ] Computation of co-enabling matrix(12/313) took 8898 ms. Total solver calls (SAT/UNSAT): 3966(2218/1748)
Reverse transition relation is NOT exact ! Due to transitions t12, u0.t222, u0.t223, u0.t224, u0.t225, u0.t226, u0.t227, u0.t228, u0.t229, u0.t230, u0.t231, u0.t232, u0.t233, u0.t234, u0.t235, u0.t237, u0.t238, u0.t240, u0.t241, u0.t243, u0.t244, u0.t246, u0.t247, u0.t249, u0.t250, u0.t251, u0.t253, u0.t254, u0.t256, u0.t257, u0.t260, u1.t183, u1.t184, u1.t185, u1.t186, u1.t187, u1.t188, u1.t189, u1.t190, u1.t191, u1.t192, u1.t193, u1.t194, u1.t195, u1.t196, u1.t198, u1.t199, u1.t201, u1.t202, u1.t204, u1.t205, u1.t207, u1.t208, u1.t210, u1.t211, u1.t212, u1.t214, u1.t215, u1.t217, u1.t218, u1.t221, u2.t144, u2.t145, u2.t146, u2.t147, u2.t148, u2.t149, u2.t150, u2.t151, u2.t152, u2.t153, u2.t154, u2.t155, u2.t156, u2.t157, u2.t159, u2.t160, u2.t162, u2.t163, u2.t165, u2.t166, u2.t168, u2.t169, u2.t171, u2.t172, u2.t173, u2.t175, u2.t176, u2.t178, u2.t179, u2.t182, u7.t113, u7.t114, u7.t115, u7.t116, u7.t117, u7.t119, u7.t120, u7.t121, u5.t131, u5.t132, u5.t133, u5.t134, u5.t135, u5.t137, u5.t138, u5.t139, u6.t122, u6.t123, u6.t124, u6.t125, u6.t126, u6.t128, u6.t129, u6.t130, u8.t104, u8.t105, u8.t106, u8.t107, u8.t108, u8.t110, u8.t111, u8.t112, u13.t1, u13.t2, u13.t3, u13.t4, u13.t5, u13.t6, u13.t7, u13.t8, u13.t9, u13.t14, u13.t15, u13.t16, u13.t17, u13.t18, u13.t19, u13.t20, u13.t21, u13.t22, u13.t23, u13.t24, u13.t25, u13.t26, u13.t27, u13.t28, u13.t29, u13.t30, u13.t31, u13.t32, u13.t33, u13.t34, u13.t35, u13.t36, u13.t37, u13.t38, u13.t39, u13.t40, u13.t41, u13.t42, u13.t43, u13.t44, u13.t45, u13.t46, u13.t47, u13.t48, u13.t49, u13.t50, u13.t51, u13.t52, u13.t53, u13.t54, u13.t55, u13.t56, u13.t57, u13.t58, u13.t59, i8.t66, i8.t62, i8.u11.t60, i8.u11.t61, i8.u11.t70, i8.u11.t71, i8.u11.t72, i8.u11.t73, i8.u11.t74, i8.u11.t75, i8.u11.t76, i8.u11.t77, i8.u11.t78, i8.u11.t79, i8.u11.t80, i8.u11.t81, i8.u11.t82, i8.u11.t83, i8.u11.t84, i8.u11.t85, i8.u11.t86, i8.u11.t87, i8.u11.t88, i8.u11.t89, i8.u11.t90, i8.u11.t91, i8.u11.t92, i8.u11.t93, i8.u11.t94, i8.u11.t95, i8.u11.t96, i8.u11.t97, i8.u11.t98, i8.u11.t99, i8.u11.t100, i8.u11.t101, i8.u11.t102, i8.u11.t103, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/92/216/308
Computing Next relation with stutter on 257 deadlock states
[2021-05-18 12:47:04] [INFO ] Computation of co-enabling matrix(17/313) took 12584 ms. Total solver calls (SAT/UNSAT): 5446(3141/2305)
[2021-05-18 12:47:08] [INFO ] Computation of co-enabling matrix(22/313) took 16293 ms. Total solver calls (SAT/UNSAT): 6901(4065/2836)
20 unique states visited
20 strongly connected components in search stack
21 transitions explored
20 items max in DFS search stack
1818 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,18.2107,328540,1,0,448640,70378,2542,1.04365e+06,2099,1.36794e+06,596088
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-13-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(((X(G("(i8.u11.p117!=1)")))||(!(X(("(u1.p34==1)")U("(u0.p10==1)")))))||(!(F("(u0.p10==1)")))))))
Formula 1 simplified : !GF(XG"(i8.u11.p117!=1)" | !X("(u1.p34==1)" U "(u0.p10==1)") | !F"(u0.p10==1)")
Computing Next relation with stutter on 257 deadlock states
[2021-05-18 12:47:12] [INFO ] Computation of co-enabling matrix(27/313) took 19961 ms. Total solver calls (SAT/UNSAT): 8331(4990/3341)
33 unique states visited
0 strongly connected components in search stack
34 transitions explored
18 items max in DFS search stack
406 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,22.2836,466120,1,0,761030,76870,2652,1.42148e+06,2105,1.36794e+06,787958
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA HealthRecord-PT-13-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((X(!(X(X(X(F("(i3.u4.p84==1)")))))))U("((u8.p90==1)||(i3.u4.p84==1))")))
Formula 2 simplified : !(X!XXXF"(i3.u4.p84==1)" U "((u8.p90==1)||(i3.u4.p84==1))")
Computing Next relation with stutter on 257 deadlock states
[2021-05-18 12:47:15] [INFO ] Computation of co-enabling matrix(32/313) took 23628 ms. Total solver calls (SAT/UNSAT): 9736(5915/3821)
20 unique states visited
19 strongly connected components in search stack
21 transitions explored
19 items max in DFS search stack
391 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,26.2032,583104,1,0,984568,78486,2683,1.81582e+06,2107,1.37686e+06,922396
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HealthRecord-PT-13-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((((G(X(F("(i8.u9.p109==1)"))))U("((i8.u11.p115!=1)||(u13.p132!=1))"))&&(F("(u7.p83==1)")))&&("(i8.u9.p109!=1)"))))
Formula 3 simplified : !X("(i8.u9.p109!=1)" & (GXF"(i8.u9.p109==1)" U "((i8.u11.p115!=1)||(u13.p132!=1))") & F"(u7.p83==1)")
Computing Next relation with stutter on 257 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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,26.2067,584012,1,0,984568,78486,2705,1.81582e+06,2110,1.37686e+06,922430
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA HealthRecord-PT-13-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((!(X(X(("(u1.p30==1)")U((G("(u1.p30==1)"))&&("(u13.p145!=1)"))))))||("(i3.u3.p59!=1)"))))
Formula 4 simplified : !X("(i3.u3.p59!=1)" | !XX("(u1.p30==1)" U ("(u13.p145!=1)" & G"(u1.p30==1)")))
Computing Next relation with stutter on 257 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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,26.2076,584012,1,0,984568,78486,2708,1.81582e+06,2110,1.37686e+06,922442
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA HealthRecord-PT-13-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(!(G(F(G(X((X((F("(i8.u11.p94==1)"))U(X("(u7.p78==1)"))))U("(u13.p130==1)")))))))))
Formula 5 simplified : !F!GFGX(X(F"(i8.u11.p94==1)" U X"(u7.p78==1)") U "(u13.p130==1)")
Computing Next relation with stutter on 257 deadlock states
28 unique states visited
28 strongly connected components in search stack
29 transitions explored
28 items max in DFS search stack
12 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,26.3279,588192,1,0,990910,79283,2749,1.82933e+06,2114,1.39449e+06,931000
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HealthRecord-PT-13-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G((((X("(i8.u11.p92==1)"))||("(u8.p85==1)"))||("(i8.u11.p92==1)"))||("((i8.u11.p115==1)&&(u13.p126==1))"))))
Formula 6 simplified : !G("((i8.u11.p115==1)&&(u13.p126==1))" | "(i8.u11.p92==1)" | "(u8.p85==1)" | X"(i8.u11.p92==1)")
Computing Next relation with stutter on 257 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
22 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,26.55,597696,1,0,1.00633e+06,79643,2794,1.85604e+06,2115,1.4024e+06,937352
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HealthRecord-PT-13-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F((F("(u1.p30==1)"))&&(("(u2.p53==1)")U(!(F("(u0.p4==1)")))))))
Formula 7 simplified : !F(F"(u1.p30==1)" & ("(u2.p53==1)" U !F"(u0.p4==1)"))
Computing Next relation with stutter on 257 deadlock states
[2021-05-18 12:47:19] [INFO ] Computation of co-enabling matrix(37/313) took 27346 ms. Total solver calls (SAT/UNSAT): 11116(6840/4276)
[2021-05-18 12:47:23] [INFO ] Computation of co-enabling matrix(42/313) took 31009 ms. Total solver calls (SAT/UNSAT): 12471(7764/4707)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
743 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,33.9832,845216,1,0,1.48492e+06,89573,2938,2.70988e+06,2115,1.73928e+06,1317763
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HealthRecord-PT-13-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((("(u13.p145!=1)")U("(u13.p141==1)")))
Formula 8 simplified : !("(u13.p145!=1)" U "(u13.p141==1)")
Computing Next relation with stutter on 257 deadlock states
[2021-05-18 12:47:26] [INFO ] Computation of co-enabling matrix(46/313) took 34033 ms. Total solver calls (SAT/UNSAT): 13537(8504/5033)
[2021-05-18 12:47:29] [INFO ] Computation of co-enabling matrix(51/313) took 37726 ms. Total solver calls (SAT/UNSAT): 14847(9428/5419)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
789 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,41.8714,1036616,1,0,1.83056e+06,97163,2963,3.35559e+06,2123,2.04962e+06,1548942
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA HealthRecord-PT-13-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F("(u2.p51!=1)"))U(!(G(X(F("(u13.p133==1)")))))))
Formula 9 simplified : !(F"(u2.p51!=1)" U !GXF"(u13.p133==1)")
Computing Next relation with stutter on 257 deadlock states
[2021-05-18 12:47:33] [INFO ] Computation of co-enabling matrix(56/313) took 41430 ms. Total solver calls (SAT/UNSAT): 16132(10351/5781)
[2021-05-18 12:47:36] [INFO ] Computation of co-enabling matrix(60/313) took 44541 ms. Total solver calls (SAT/UNSAT): 17142(11091/6051)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
772 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,49.5859,1315908,1,0,2.3476e+06,109111,2983,4.3137e+06,2125,2.48886e+06,1902590
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA HealthRecord-PT-13-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((!(G(X("(u2.p53!=1)"))))&&("(u13.p129==1)"))))
Formula 10 simplified : !X("(u13.p129==1)" & !GX"(u2.p53!=1)")
Computing Next relation with stutter on 257 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,49.5872,1316172,1,0,2.3476e+06,109111,2987,4.3137e+06,2125,2.48886e+06,1902598
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HealthRecord-PT-13-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((G((((X(G("((u2.p55==1)&&(u13.p158==1))")))&&("(u2.p55==1)"))&&("(u13.p158==1)"))&&("(u6.p76==1)")))||(("(u6.p76==1)")U(X("((u2.p55==1)&&(u13.p158==1))")))))
Formula 11 simplified : !(G("(u2.p55==1)" & "(u6.p76==1)" & "(u13.p158==1)" & XG"((u2.p55==1)&&(u13.p158==1))") | ("(u6.p76==1)" U X"((u2.p55==1)&&(u13.p158==1))"))
Computing Next relation with stutter on 257 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,49.5885,1316172,1,0,2.3476e+06,109111,2997,4.3137e+06,2126,2.48886e+06,1902619
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA HealthRecord-PT-13-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(!(F("(u1.p25==1)")))))
Formula 12 simplified : !G!F"(u1.p25==1)"
Computing Next relation with stutter on 257 deadlock states
[2021-05-18 12:47:40] [INFO ] Computation of co-enabling matrix(65/313) took 48033 ms. Total solver calls (SAT/UNSAT): 18382(12018/6364)
[2021-05-18 12:47:43] [INFO ] Computation of co-enabling matrix(70/313) took 51553 ms. Total solver calls (SAT/UNSAT): 19597(12946/6651)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
441 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,53.9955,1474572,1,0,2.64757e+06,112672,3010,4.85746e+06,2128,2.67544e+06,2140333
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA HealthRecord-PT-13-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(!(F(!(X("(u13.p129==1)")))))))
Formula 13 simplified : !F!F!X"(u13.p129==1)"
Computing Next relation with stutter on 257 deadlock states
18 unique states visited
17 strongly connected components in search stack
19 transitions explored
18 items max in DFS search stack
4 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,54.0413,1475364,1,0,2.6485e+06,112729,3017,4.85912e+06,2128,2.67594e+06,2142844
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA HealthRecord-PT-13-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F((F(G(F("((i8.u11.p115==1)&&(u13.p157==1))"))))||(((G(((!(X("(u2.p55==1)")))&&("(u0.p17==1)"))&&("(u13.p158==1)")))&&("(i8.u11.p115==1)"))&&("(u13.p157==1)")))))
Formula 14 simplified : !F(FGF"((i8.u11.p115==1)&&(u13.p157==1))" | ("(i8.u11.p115==1)" & "(u13.p157==1)" & G("(u0.p17==1)" & "(u13.p158==1)" & !X"(u2.p55==1)")))
Computing Next relation with stutter on 257 deadlock states
[2021-05-18 12:47:47] [INFO ] Computation of co-enabling matrix(75/313) took 55041 ms. Total solver calls (SAT/UNSAT): 20787(13873/6914)
[2021-05-18 12:47:50] [INFO ] Computation of co-enabling matrix(80/313) took 58591 ms. Total solver calls (SAT/UNSAT): 21952(14801/7151)
[2021-05-18 12:47:54] [INFO ] Computation of co-enabling matrix(85/313) took 62107 ms. Total solver calls (SAT/UNSAT): 23092(15728/7364)
[2021-05-18 12:47:57] [INFO ] Computation of co-enabling matrix(90/313) took 65654 ms. Total solver calls (SAT/UNSAT): 24207(16656/7551)
41 unique states visited
41 strongly connected components in search stack
42 transitions explored
41 items max in DFS search stack
1631 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,70.3656,2032972,1,0,3.82341e+06,114144,3091,6.57846e+06,2133,2.98173e+06,2731018
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA HealthRecord-PT-13-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2021-05-18 12:48:01] [INFO ] Computation of co-enabling matrix(95/313) took 69127 ms. Total solver calls (SAT/UNSAT): 25297(17583/7714)
[2021-05-18 12:48:04] [INFO ] Computation of co-enabling matrix(100/313) took 72632 ms. Total solver calls (SAT/UNSAT): 26362(18511/7851)
[2021-05-18 12:48:07] [INFO ] Computation of co-enabling matrix(114/313) took 75695 ms. Total solver calls (SAT/UNSAT): 27794(19872/7922)
[2021-05-18 12:48:10] [INFO ] Computation of co-enabling matrix(147/313) took 78777 ms. Total solver calls (SAT/UNSAT): 30359(22437/7922)
[2021-05-18 12:48:13] [INFO ] Computation of co-enabling matrix(178/313) took 81790 ms. Total solver calls (SAT/UNSAT): 32963(25041/7922)
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:48:15] [INFO ] Built C files in 85043ms 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 1621342096051

--------------------
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-13"
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-13, 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-162124171300178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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