About the Execution of ITS-Tools for ShieldIIPt-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.020 | 2001286.00 | 2181091.00 | 3362.70 | TFFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033475600362.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475600362
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 3.0K May 14 01:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 01:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 18:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 18:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.8K May 13 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 08:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 265K May 12 20:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-050A-00
FORMULA_NAME ShieldIIPt-PT-050A-01
FORMULA_NAME ShieldIIPt-PT-050A-02
FORMULA_NAME ShieldIIPt-PT-050A-03
FORMULA_NAME ShieldIIPt-PT-050A-04
FORMULA_NAME ShieldIIPt-PT-050A-05
FORMULA_NAME ShieldIIPt-PT-050A-06
FORMULA_NAME ShieldIIPt-PT-050A-07
FORMULA_NAME ShieldIIPt-PT-050A-08
FORMULA_NAME ShieldIIPt-PT-050A-09
FORMULA_NAME ShieldIIPt-PT-050A-10
FORMULA_NAME ShieldIIPt-PT-050A-11
FORMULA_NAME ShieldIIPt-PT-050A-12
FORMULA_NAME ShieldIIPt-PT-050A-13
FORMULA_NAME ShieldIIPt-PT-050A-14
FORMULA_NAME ShieldIIPt-PT-050A-15
=== Now, execution of the tool begins
BK_START 1590586106731
[2020-05-27 13:28:29] [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]
[2020-05-27 13:28:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 13:28:29] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2020-05-27 13:28:29] [INFO ] Transformed 953 places.
[2020-05-27 13:28:29] [INFO ] Transformed 703 transitions.
[2020-05-27 13:28:29] [INFO ] Found NUPN structural information;
[2020-05-27 13:28:29] [INFO ] Parsed PT model containing 953 places and 703 transitions in 279 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 90 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 876 ms. (steps per millisecond=114 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1]
// Phase 1: matrix 702 rows 953 cols
[2020-05-27 13:28:30] [INFO ] Computed 451 place invariants in 41 ms
[2020-05-27 13:28:31] [INFO ] [Real]Absence check using 451 positive place invariants in 299 ms returned sat
[2020-05-27 13:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:28:34] [INFO ] [Real]Absence check using state equation in 2875 ms returned sat
[2020-05-27 13:28:34] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 58 ms.
[2020-05-27 13:28:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:28:35] [INFO ] [Nat]Absence check using 451 positive place invariants in 451 ms returned sat
[2020-05-27 13:28:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:28:39] [INFO ] [Nat]Absence check using state equation in 3960 ms returned sat
[2020-05-27 13:28:39] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 97 ms.
[2020-05-27 13:28:54] [INFO ] Added : 693 causal constraints over 140 iterations in 14929 ms. Result :sat
[2020-05-27 13:28:57] [INFO ] [Real]Absence check using 451 positive place invariants in 2687 ms returned sat
[2020-05-27 13:28:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:29:01] [INFO ] [Real]Absence check using state equation in 4292 ms returned sat
[2020-05-27 13:29:01] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 62 ms.
[2020-05-27 13:29:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:29:02] [INFO ] [Nat]Absence check using 451 positive place invariants in 485 ms returned sat
[2020-05-27 13:29:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:29:05] [INFO ] [Nat]Absence check using state equation in 2697 ms returned sat
[2020-05-27 13:29:05] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 60 ms.
[2020-05-27 13:29:22] [INFO ] Added : 678 causal constraints over 140 iterations in 16656 ms. Result :unknown
[2020-05-27 13:29:23] [INFO ] [Real]Absence check using 451 positive place invariants in 818 ms returned sat
[2020-05-27 13:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:29:26] [INFO ] [Real]Absence check using state equation in 3435 ms returned sat
[2020-05-27 13:29:26] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 58 ms.
[2020-05-27 13:29:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:29:28] [INFO ] [Nat]Absence check using 451 positive place invariants in 1170 ms returned sat
[2020-05-27 13:29:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:29:30] [INFO ] [Nat]Absence check using state equation in 2514 ms returned sat
[2020-05-27 13:29:31] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 69 ms.
[2020-05-27 13:29:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t127 0) (or (and (> t485 0) (< o485 o127)) (and (> t489 0) (< o489 o127))))") while checking expression at index 2
[2020-05-27 13:29:48] [INFO ] [Real]Absence check using 451 positive place invariants in 1256 ms returned sat
[2020-05-27 13:29:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:29:54] [INFO ] [Real]Absence check using state equation in 6059 ms returned sat
[2020-05-27 13:29:54] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 55 ms.
[2020-05-27 13:29:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:29:56] [INFO ] [Nat]Absence check using 451 positive place invariants in 995 ms returned sat
[2020-05-27 13:29:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:30:00] [INFO ] [Nat]Absence check using state equation in 4562 ms returned sat
[2020-05-27 13:30:00] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 71 ms.
[2020-05-27 13:30:14] [INFO ] Added : 675 causal constraints over 135 iterations in 14294 ms. Result :unknown
[2020-05-27 13:30:15] [INFO ] [Real]Absence check using 451 positive place invariants in 209 ms returned sat
[2020-05-27 13:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:30:16] [INFO ] [Real]Absence check using state equation in 1584 ms returned sat
[2020-05-27 13:30:16] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 31 ms.
[2020-05-27 13:30:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:30:17] [INFO ] [Nat]Absence check using 451 positive place invariants in 378 ms returned sat
[2020-05-27 13:30:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:30:19] [INFO ] [Nat]Absence check using state equation in 1714 ms returned sat
[2020-05-27 13:30:19] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 34 ms.
[2020-05-27 13:30:36] [INFO ] Added : 690 causal constraints over 138 iterations in 16709 ms. Result :sat
[2020-05-27 13:30:36] [INFO ] [Real]Absence check using 451 positive place invariants in 289 ms returned sat
[2020-05-27 13:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:30:38] [INFO ] [Real]Absence check using state equation in 1655 ms returned sat
[2020-05-27 13:30:38] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 41 ms.
[2020-05-27 13:30:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:30:39] [INFO ] [Nat]Absence check using 451 positive place invariants in 358 ms returned sat
[2020-05-27 13:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:30:41] [INFO ] [Nat]Absence check using state equation in 2410 ms returned sat
[2020-05-27 13:30:41] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 69 ms.
[2020-05-27 13:30:56] [INFO ] Added : 700 causal constraints over 141 iterations in 14972 ms. Result :sat
[2020-05-27 13:30:57] [INFO ] [Real]Absence check using 451 positive place invariants in 481 ms returned sat
[2020-05-27 13:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:30:59] [INFO ] [Real]Absence check using state equation in 1865 ms returned sat
[2020-05-27 13:30:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:30:59] [INFO ] [Nat]Absence check using 451 positive place invariants in 607 ms returned sat
[2020-05-27 13:30:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:31:03] [INFO ] [Nat]Absence check using state equation in 3264 ms returned sat
[2020-05-27 13:31:03] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 63 ms.
[2020-05-27 13:31:19] [INFO ] Added : 684 causal constraints over 138 iterations in 15973 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-27 13:31:21] [INFO ] [Real]Absence check using 451 positive place invariants in 1951 ms returned sat
[2020-05-27 13:31:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:31:29] [INFO ] [Real]Absence check using state equation in 8120 ms returned sat
[2020-05-27 13:31:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:31:32] [INFO ] [Nat]Absence check using 451 positive place invariants in 2720 ms returned sat
[2020-05-27 13:31:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:31:36] [INFO ] [Nat]Absence check using state equation in 3902 ms returned sat
[2020-05-27 13:31:36] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 35 ms.
[2020-05-27 13:31:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t658 0) (and (or (and (> t50 0) (< o50 o658)) (and (> t655 0) (< o655 o658))) (or (and (> t657 0) (< o657 o658)) (and (> t659 0) (< o659 o658)))))") while checking expression at index 7
[2020-05-27 13:31:50] [INFO ] [Real]Absence check using 451 positive place invariants in 674 ms returned sat
[2020-05-27 13:31:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:31:53] [INFO ] [Real]Absence check using state equation in 2951 ms returned sat
[2020-05-27 13:31:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:31:54] [INFO ] [Nat]Absence check using 451 positive place invariants in 638 ms returned sat
[2020-05-27 13:31:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:32:01] [INFO ] [Nat]Absence check using state equation in 7460 ms returned sat
[2020-05-27 13:32:01] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 48 ms.
[2020-05-27 13:32:13] [INFO ] Added : 590 causal constraints over 118 iterations in 11729 ms. Result :unknown
[2020-05-27 13:32:14] [INFO ] [Real]Absence check using 451 positive place invariants in 501 ms returned sat
[2020-05-27 13:32:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:32:18] [INFO ] [Real]Absence check using state equation in 3838 ms returned sat
[2020-05-27 13:32:18] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 59 ms.
[2020-05-27 13:32:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:32:19] [INFO ] [Nat]Absence check using 451 positive place invariants in 1212 ms returned sat
[2020-05-27 13:32:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:32:21] [INFO ] [Nat]Absence check using state equation in 1729 ms returned sat
[2020-05-27 13:32:21] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 41 ms.
[2020-05-27 13:32:34] [INFO ] Added : 679 causal constraints over 139 iterations in 13044 ms. Result :sat
[2020-05-27 13:32:34] [INFO ] [Real]Absence check using 451 positive place invariants in 288 ms returned sat
[2020-05-27 13:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:32:36] [INFO ] [Real]Absence check using state equation in 1623 ms returned sat
[2020-05-27 13:32:36] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 70 ms.
[2020-05-27 13:32:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:32:37] [INFO ] [Nat]Absence check using 451 positive place invariants in 284 ms returned sat
[2020-05-27 13:32:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:32:40] [INFO ] [Nat]Absence check using state equation in 3498 ms returned sat
[2020-05-27 13:32:41] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 112 ms.
[2020-05-27 13:32:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t674 0) (and (and (> t677 0) (< o677 o674)) (or (and (> t50 0) (< o50 o674)) (and (> t235 0) (< o235 o674)) (and (> t304 0) (< o304 o674)))))") while checking expression at index 10
[2020-05-27 13:32:57] [INFO ] [Real]Absence check using 451 positive place invariants in 315 ms returned sat
[2020-05-27 13:32:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:33:00] [INFO ] [Real]Absence check using state equation in 3347 ms returned sat
[2020-05-27 13:33:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:33:03] [INFO ] [Nat]Absence check using 451 positive place invariants in 2579 ms returned sat
[2020-05-27 13:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:33:07] [INFO ] [Nat]Absence check using state equation in 3989 ms returned sat
[2020-05-27 13:33:07] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 42 ms.
[2020-05-27 13:33:20] [INFO ] Added : 625 causal constraints over 125 iterations in 13289 ms. Result :unknown
[2020-05-27 13:33:21] [INFO ] [Real]Absence check using 451 positive place invariants in 287 ms returned sat
[2020-05-27 13:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:33:22] [INFO ] [Real]Absence check using state equation in 1689 ms returned sat
[2020-05-27 13:33:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:33:24] [INFO ] [Nat]Absence check using 451 positive place invariants in 1776 ms returned sat
[2020-05-27 13:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:33:26] [INFO ] [Nat]Absence check using state equation in 1840 ms returned sat
[2020-05-27 13:33:26] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 61 ms.
[2020-05-27 13:33:43] [INFO ] Added : 680 causal constraints over 136 iterations in 16189 ms. Result :unknown
[2020-05-27 13:33:44] [INFO ] [Real]Absence check using 451 positive place invariants in 956 ms returned sat
[2020-05-27 13:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:33:49] [INFO ] [Real]Absence check using state equation in 5124 ms returned sat
[2020-05-27 13:33:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:33:50] [INFO ] [Nat]Absence check using 451 positive place invariants in 509 ms returned sat
[2020-05-27 13:33:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:33:51] [INFO ] [Nat]Absence check using state equation in 1654 ms returned sat
[2020-05-27 13:33:51] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 40 ms.
[2020-05-27 13:34:08] [INFO ] Added : 693 causal constraints over 143 iterations in 16439 ms. Result :sat
[2020-05-27 13:34:08] [INFO ] [Real]Absence check using 451 positive place invariants in 276 ms returned sat
[2020-05-27 13:34:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:34:14] [INFO ] [Real]Absence check using state equation in 5881 ms returned sat
[2020-05-27 13:34:14] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 52 ms.
[2020-05-27 13:34:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:34:15] [INFO ] [Nat]Absence check using 451 positive place invariants in 824 ms returned sat
[2020-05-27 13:34:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:34:18] [INFO ] [Nat]Absence check using state equation in 2976 ms returned sat
[2020-05-27 13:34:19] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 64 ms.
[2020-05-27 13:34:35] [INFO ] Added : 655 causal constraints over 131 iterations in 15971 ms. Result :unknown
[2020-05-27 13:34:35] [INFO ] [Real]Absence check using 451 positive place invariants in 291 ms returned sat
[2020-05-27 13:34:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:34:37] [INFO ] [Real]Absence check using state equation in 1801 ms returned sat
[2020-05-27 13:34:37] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 47 ms.
[2020-05-27 13:34:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:34:38] [INFO ] [Nat]Absence check using 451 positive place invariants in 444 ms returned sat
[2020-05-27 13:34:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:34:40] [INFO ] [Nat]Absence check using state equation in 2687 ms returned sat
[2020-05-27 13:34:40] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 57 ms.
[2020-05-27 13:34:57] [INFO ] Added : 696 causal constraints over 140 iterations in 16566 ms. Result :sat
[2020-05-27 13:34:59] [INFO ] [Real]Absence check using 451 positive place invariants in 2271 ms returned sat
[2020-05-27 13:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:35:05] [INFO ] [Real]Absence check using state equation in 6047 ms returned sat
[2020-05-27 13:35:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:35:06] [INFO ] [Nat]Absence check using 451 positive place invariants in 298 ms returned sat
[2020-05-27 13:35:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:35:08] [INFO ] [Nat]Absence check using state equation in 1713 ms returned sat
[2020-05-27 13:35:08] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 56 ms.
[2020-05-27 13:35:21] [INFO ] Added : 689 causal constraints over 138 iterations in 13570 ms. Result :sat
[2020-05-27 13:35:22] [INFO ] [Real]Absence check using 451 positive place invariants in 278 ms returned sat
[2020-05-27 13:35:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:35:23] [INFO ] [Real]Absence check using state equation in 1618 ms returned sat
[2020-05-27 13:35:23] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 39 ms.
[2020-05-27 13:35:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:35:24] [INFO ] [Nat]Absence check using 451 positive place invariants in 278 ms returned sat
[2020-05-27 13:35:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:35:27] [INFO ] [Nat]Absence check using state equation in 2669 ms returned sat
[2020-05-27 13:35:27] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 63 ms.
[2020-05-27 13:35:43] [INFO ] Added : 696 causal constraints over 142 iterations in 16813 ms. Result :sat
[2020-05-27 13:35:44] [INFO ] [Real]Absence check using 451 positive place invariants in 377 ms returned sat
[2020-05-27 13:35:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:35:47] [INFO ] [Real]Absence check using state equation in 3277 ms returned sat
[2020-05-27 13:35:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:35:48] [INFO ] [Nat]Absence check using 451 positive place invariants in 384 ms returned sat
[2020-05-27 13:35:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:35:51] [INFO ] [Nat]Absence check using state equation in 3172 ms returned sat
[2020-05-27 13:35:51] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 36 ms.
[2020-05-27 13:36:06] [INFO ] Added : 694 causal constraints over 142 iterations in 14815 ms. Result :sat
[2020-05-27 13:36:07] [INFO ] [Real]Absence check using 451 positive place invariants in 383 ms returned sat
[2020-05-27 13:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:36:10] [INFO ] [Real]Absence check using state equation in 3263 ms returned sat
[2020-05-27 13:36:10] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 71 ms.
[2020-05-27 13:36:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:36:11] [INFO ] [Nat]Absence check using 451 positive place invariants in 291 ms returned sat
[2020-05-27 13:36:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:36:12] [INFO ] [Nat]Absence check using state equation in 1786 ms returned sat
[2020-05-27 13:36:12] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 58 ms.
[2020-05-27 13:36:28] [INFO ] Added : 687 causal constraints over 139 iterations in 15986 ms. Result :sat
[2020-05-27 13:36:29] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-27 13:36:29] [INFO ] Flatten gal took : 232 ms
FORMULA ShieldIIPt-PT-050A-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 13:36:29] [INFO ] Flatten gal took : 171 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 13:36:29] [INFO ] Applying decomposition
[2020-05-27 13:36:29] [INFO ] Flatten gal took : 82 ms
[2020-05-27 13:36:30] [INFO ] Input system was already deterministic with 702 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/graph3913727060045545587.txt, -o, /tmp/graph3913727060045545587.bin, -w, /tmp/graph3913727060045545587.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/graph3913727060045545587.bin, -l, -1, -v, -w, /tmp/graph3913727060045545587.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 13:36:30] [INFO ] Decomposing Gal with order
[2020-05-27 13:36:31] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 702 rows 953 cols
[2020-05-27 13:36:31] [INFO ] Computed 451 place invariants in 20 ms
inv : p0 + p622 + p623 = 1
inv : p0 + p35 + p36 = 1
inv : p0 + p637 + p638 = 1
inv : p0 + p592 + p593 = 1
inv : p0 + p20 + p21 = 1
inv : p0 + p60 + p61 = 1
inv : p0 + p582 + p583 = 1
inv : p0 + p746 + p749 + p750 = 1
inv : p0 + p50 + p51 = 1
inv : p0 + p10 + p11 = 1
inv : p0 + p702 + p703 = 1
inv : p0 + p90 + p91 = 1
inv : p0 + p936 + p939 + p940 = 1
inv : p0 + p662 + p663 = 1
inv : p0 + p717 + p718 = 1
inv : p0 + p542 + p543 = 1
inv : p0 + p512 + p513 = 1
inv : p0 + p155 + p156 = 1
inv : p0 + p497 + p498 = 1
inv : p0 + p556 + p559 + p560 = 1
inv : p0 + p487 + p488 = 1
inv : p0 + p632 + p633 + p634 = 1
inv : p0 + p75 + p76 = 1
inv : p0 + p145 + p146 = 1
inv : p0 + p309 + p312 + p313 = 1
inv : p0 + p176 + p179 + p180 = 1
inv : p0 + p647 + p648 = 1
inv : p0 + p797 + p798 = 1
inv : p0 + p567 + p568 = 1
inv : p0 + p62 + p63 + p64 = 1
inv : p0 + p210 + p211 = 1
inv : p0 + p812 + p813 = 1
inv : p0 + p417 + p418 = 1
inv : p0 + p457 + p458 = 1
inv : p0 + p402 + p403 = 1
inv : p0 + p575 + p576 + p577 = 1
inv : p0 + p827 + p828 = 1
inv : p0 + p252 + p253 + p254 = 1
inv : p0 + p250 + p251 = 1
inv : p0 + p472 + p473 = 1
inv : p0 + p772 + p773 = 1
inv : p0 + p742 + p743 = 1
inv : p0 + p280 + p281 = 1
inv : p0 + p352 + p353 = 1
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p949 + p950 = 1
inv : p0 + p879 + p882 + p883 = 1
inv : p0 + p105 + p106 = 1
inv : p0 + p119 + p122 + p123 = 1
inv : p0 + p335 + p336 = 1
inv : p0 + p265 + p266 = 1
inv : p0 + p757 + p758 = 1
inv : p0 + p297 + p298 = 1
inv : p0 + p366 + p369 + p370 = 1
inv : p0 + p687 + p688 = 1
inv : p0 + p822 + p823 + p824 = 1
inv : p0 + p527 + p528 = 1
inv : p0 + p415 + p416 = 1
inv : p0 + p499 + p500 + p501 = 1
inv : p0 + p282 + p283 = 1
inv : p0 + p62 + p65 + p66 = 1
inv : p0 + p839 + p840 = 1
inv : p0 + p138 + p139 + p140 = 1
inv : p0 + p803 + p806 + p807 = 1
inv : p0 + p932 + p933 = 1
inv : p0 + p934 + p935 = 1
inv : p0 + p759 + p760 = 1
inv : p0 + p305 + p306 = 1
inv : p0 + p922 + p923 = 1
inv : p0 + p187 + p188 = 1
inv : p0 + p879 + p880 + p881 = 1
inv : p0 + p362 + p363 = 1
inv : p0 + p689 + p692 + p693 = 1
inv : p0 + p525 + p526 = 1
inv : p0 + p455 + p456 = 1
inv : p0 + p107 + p108 = 1
inv : p0 + p212 + p213 = 1
inv : p0 + p375 + p376 = 1
inv : p0 + p442 + p445 + p446 = 1
inv : p0 + p909 + p910 = 1
inv : p0 + p257 + p258 = 1
inv : p0 + p829 + p830 = 1
inv : p0 + p385 + p386 + p387 = 1
inv : p0 + p708 + p709 + p710 = 1
inv : p0 + p590 + p591 = 1
inv : p0 + p432 + p433 = 1
inv : p0 + p200 + p201 = 1
inv : p0 + p77 + p78 = 1
inv : p0 + p624 + p625 = 1
inv : p0 + p630 + p631 = 1
inv : p0 + p852 + p853 = 1
inv : p0 + p170 + p171 = 1
inv : p0 + p392 + p393 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p782 + p783 = 1
inv : p0 + p240 + p241 = 1
inv : p0 + p694 + p695 = 1
inv : p0 + p892 + p893 = 1
inv : p0 + p130 + p131 = 1
inv : p0 + p233 + p236 + p237 = 1
inv : p0 + p700 + p701 = 1
inv : p0 + p322 + p323 = 1
inv : p0 + p584 + p585 = 1
inv : p0 + p147 + p148 = 1
inv : p0 + p48 + p49 = 1
inv : p0 + p485 + p486 = 1
inv : p0 + p799 + p800 = 1
inv : p0 + p345 + p346 = 1
inv : p0 + p514 + p515 = 1
inv : p0 + p677 + p678 = 1
inv : p0 + p869 + p870 = 1
inv : p0 + p607 + p608 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p474 + p475 = 1
inv : p0 + p770 + p771 = 1
inv : p0 + p780 + p781 = 1
inv : p0 + p795 + p796 = 1
inv : p0 + p449 + p450 = 1
inv : p0 + p176 + p177 + p178 = 1
inv : p0 + p223 + p224 = 1
inv : p0 + p128 + p129 = 1
inv : p0 + p143 + p144 = 1
inv : p0 + p480 + p483 + p484 = 1
inv : p0 + p715 + p716 = 1
inv : p0 + p208 + p209 = 1
inv : p0 + p459 + p460 = 1
inv : p0 + p5 + p8 + p9 = 1
inv : p0 + p651 + p652 + p653 = 1
inv : p0 + p379 + p380 = 1
inv : p0 + p544 + p545 = 1
inv : p0 + p746 + p747 + p748 = 1
inv : p0 + p394 + p395 = 1
inv : p0 + p263 + p264 = 1
inv : p0 + p660 + p661 = 1
inv : p0 + p529 + p530 = 1
inv : p0 + p915 + p916 = 1
inv : p0 + p81 + p82 + p83 = 1
inv : p0 + p898 + p899 + p900 = 1
inv : p0 + p896 + p897 = 1
inv : p0 + p599 + p600 = 1
inv : p0 + p324 + p325 = 1
inv : p0 + p193 + p194 = 1
inv : p0 + p575 + p578 + p579 = 1
inv : p0 + p580 + p581 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p679 + p680 = 1
inv : p0 + p343 + p344 = 1
inv : p0 + p565 + p566 = 1
inv : p0 + p803 + p804 + p805 = 1
inv : p0 + p314 + p315 = 1
inv : p0 + p911 + p912 = 1
inv : p0 + p259 + p260 = 1
inv : p0 + p664 + p665 = 1
inv : p0 + p358 + p359 = 1
inv : p0 + p413 + p414 = 1
inv : p0 + p12 + p13 = 1
inv : p0 + p609 + p610 = 1
inv : p0 + p288 + p289 = 1
inv : p0 + p734 + p735 = 1
inv : p0 + p58 + p59 = 1
inv : p0 + p495 + p496 = 1
inv : p0 + p347 + p350 + p351 = 1
inv : p0 + p865 + p866 = 1
inv : p0 + p670 + p673 + p674 = 1
inv : p0 + p850 + p851 = 1
inv : p0 + p172 + p173 = 1
inv : p0 + p73 + p74 = 1
inv : p0 + p309 + p310 + p311 = 1
inv : p0 + p725 + p726 = 1
inv : p0 + p917 + p920 + p921 = 1
inv : p0 + p751 + p752 = 1
inv : p0 + p100 + p103 + p104 = 1
inv : p0 + p428 + p429 = 1
inv : p0 + p556 + p557 + p558 = 1
inv : p0 + p696 + p697 = 1
inv : p0 + p109 + p110 = 1
inv : p0 + p242 + p243 = 1
inv : p0 + p681 + p682 = 1
inv : p0 + p430 + p431 = 1
inv : p0 + p404 + p405 + p406 = 1
inv : p0 + p423 + p426 + p427 = 1
inv : p0 + p227 + p228 = 1
inv : p0 + p440 + p441 = 1
inv : p0 + p894 + p895 = 1
inv : p0 + p884 + p885 = 1
inv : p0 + p307 + p308 = 1
inv : p0 + p328 + p331 + p332 = 1
inv : p0 + p814 + p815 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p761 + p762 = 1
inv : p0 + p563 + p564 = 1
inv : p0 + p360 + p361 = 1
inv : p0 + p611 + p612 = 1
inv : p0 + p328 + p329 + p330 = 1
inv : p0 + p510 + p511 = 1
inv : p0 + p233 + p234 + p235 = 1
inv : p0 + p295 + p296 = 1
inv : p0 + p628 + p629 = 1
inv : p0 + p493 + p494 = 1
inv : p0 + p867 + p868 = 1
inv : p0 + p56 + p57 = 1
inv : p0 + p244 + p245 = 1
inv : p0 + p947 + p948 = 1
inv : p0 + p174 + p175 = 1
inv : p0 + p877 + p878 = 1
inv : p0 + p698 + p699 = 1
inv : p0 + p126 + p127 = 1
inv : p0 + p225 + p226 = 1
inv : p0 + p447 + p448 = 1
inv : p0 + p499 + p502 + p503 = 1
inv : p0 + p930 + p931 = 1
inv : p0 + p92 + p93 = 1
inv : p0 + p822 + p825 + p826 = 1
inv : p0 + p480 + p481 + p482 = 1
inv : p0 + p191 + p192 = 1
inv : p0 + p744 + p745 = 1
inv : p0 + p278 + p279 = 1
inv : p0 + p162 + p163 = 1
inv : p0 + p252 + p255 + p256 = 1
inv : p0 + p732 + p733 = 1
inv : p0 + p831 + p832 = 1
inv : p0 + p22 + p23 = 1
inv : p0 + p476 + p477 = 1
inv : p0 + p546 + p547 = 1
inv : p0 + p645 + p646 = 1
inv : p0 + p377 + p378 = 1
inv : p0 + p157 + p158 + p159 = 1
inv : p0 + p326 + p327 = 1
inv : p0 + p917 + p918 + p919 = 1
inv : p0 + p913 + p914 = 1
inv : p0 + p341 + p342 = 1
inv : p0 + p943 + p944 = 1
inv : p0 + p903 + p904 = 1
inv : p0 + p873 + p874 = 1
inv : p0 + p727 + p728 + p729 = 1
inv : p0 + p381 + p382 = 1
inv : p0 + p371 + p372 = 1
inv : p0 + p261 + p262 = 1
inv : p0 + p301 + p302 = 1
inv : p0 + p833 + p834 = 1
inv : p0 + p461 + p464 + p465 = 1
inv : p0 + p411 + p412 = 1
inv : p0 + p100 + p101 + p102 = 1
inv : p0 + p24 + p27 + p28 = 1
inv : p0 + p231 + p232 = 1
inv : p0 + p778 + p779 = 1
inv : p0 + p276 + p277 = 1
inv : p0 + p286 + p287 = 1
inv : p0 + p858 + p859 = 1
inv : p0 + p347 + p348 + p349 = 1
inv : p0 + p206 + p207 = 1
inv : p0 + p848 + p849 = 1
inv : p0 + p436 + p437 = 1
inv : p0 + p841 + p844 + p845 = 1
inv : p0 + p928 + p929 = 1
inv : p0 + p356 + p357 = 1
inv : p0 + p404 + p407 + p408 = 1
inv : p0 + p81 + p84 + p85 = 1
inv : p0 + p151 + p152 = 1
inv : p0 + p516 + p517 = 1
inv : p0 + p506 + p507 = 1
inv : p0 + p763 + p764 = 1
inv : p0 + p96 + p97 = 1
inv : p0 + p181 + p182 = 1
inv : p0 + p594 + p597 + p598 = 1
inv : p0 + p111 + p112 = 1
inv : p0 + p713 + p714 = 1
inv : p0 + p451 + p452 = 1
inv : p0 + p571 + p572 = 1
inv : p0 + p221 + p222 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p818 + p819 = 1
inv : p0 + p898 + p901 + p902 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p537 + p538 + p539 = 1
inv : p0 + p466 + p467 = 1
inv : p0 + p588 + p589 = 1
inv : p0 + p651 + p654 + p655 = 1
inv : p0 + p626 + p627 = 1
inv : p0 + p166 + p167 = 1
inv : p0 + p290 + p291 + p292 = 1
inv : p0 + p396 + p397 = 1
inv : p0 + p888 + p889 = 1
inv : p0 + p658 + p659 = 1
inv : p0 + p548 + p549 = 1
inv : p0 + p594 + p595 + p596 = 1
inv : p0 + p518 + p521 + p522 = 1
inv : p0 + p124 + p125 = 1
inv : p0 + p573 + p574 = 1
inv : p0 + p784 + p785 + p786 = 1
inv : p0 + p641 + p642 = 1
inv : p0 + p31 + p32 = 1
inv : p0 + p189 + p190 = 1
inv : p0 + p643 + p644 = 1
inv : p0 + p14 + p15 = 1
inv : p0 + p468 + p469 = 1
inv : p0 + p214 + p215 + p216 = 1
inv : p0 + p71 + p72 = 1
inv : p0 + p478 + p479 = 1
inv : p0 + p164 + p165 = 1
inv : p0 + p157 + p160 + p161 = 1
inv : p0 + p736 + p737 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p816 + p817 = 1
inv : p0 + p618 + p619 = 1
inv : p0 + p94 + p95 = 1
inv : p0 + p666 + p667 = 1
inv : p0 + p136 + p137 = 1
inv : p0 + p886 + p887 = 1
inv : p0 + p299 + p300 = 1
inv : p0 + p727 + p730 + p731 = 1
inv : p0 + p723 + p724 = 1
inv : p0 + p945 + p946 = 1
inv : p0 + p398 + p399 = 1
inv : p0 + p339 + p340 = 1
inv : p0 + p561 + p562 = 1
inv : p0 + p271 + p274 + p275 = 1
inv : p0 + p846 + p847 = 1
inv : p0 + p683 + p684 = 1
inv : p0 + p269 + p270 = 1
inv : p0 + p491 + p492 = 1
inv : p0 + p333 + p334 = 1
inv : p0 + p753 + p754 = 1
inv : p0 + p793 + p794 = 1
inv : p0 + p531 + p532 = 1
inv : p0 + p229 + p230 = 1
inv : p0 + p421 + p422 = 1
inv : p0 + p601 + p602 = 1
inv : p0 + p776 + p777 = 1
inv : p0 + p246 + p247 = 1
inv : p0 + p409 + p410 = 1
inv : p0 + p438 + p439 = 1
inv : p0 + p670 + p671 + p672 = 1
inv : p0 + p875 + p876 = 1
inv : p0 + p508 + p509 = 1
inv : p0 + p765 + p768 + p769 = 1
inv : p0 + p423 + p424 + p425 = 1
inv : p0 + p706 + p707 = 1
inv : p0 + p316 + p317 = 1
inv : p0 + p54 + p55 = 1
inv : p0 + p183 + p184 = 1
inv : p0 + p271 + p272 + p273 = 1
inv : p0 + p168 + p169 = 1
inv : p0 + p740 + p741 = 1
inv : p0 + p755 + p756 = 1
inv : p0 + p195 + p198 + p199 = 1
inv : p0 + p290 + p293 + p294 = 1
inv : p0 + p489 + p490 = 1
inv : p0 + p461 + p462 + p463 = 1
inv : p0 + p419 + p420 = 1
inv : p0 + p820 + p821 = 1
inv : p0 + p504 + p505 = 1
inv : p0 + p248 + p249 = 1
inv : p0 + p98 + p99 = 1
inv : p0 + p554 + p555 = 1
inv : p0 + p685 + p686 = 1
inv : p0 + p675 + p676 = 1
inv : p0 + p951 + p952 = 1
inv : p0 + p890 + p891 = 1
inv : p0 + p88 + p89 = 1
inv : p0 + p835 + p836 = 1
inv : p0 + p318 + p319 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p941 + p942 = 1
inv : p0 + p366 + p367 + p368 = 1
inv : p0 + p810 + p811 = 1
inv : p0 + p238 + p239 = 1
inv : p0 + p113 + p114 = 1
inv : p0 + p67 + p68 = 1
inv : p0 + p649 + p650 = 1
inv : p0 + p373 + p374 = 1
inv : p0 + p613 + p614 + p615 = 1
inv : p0 + p605 + p606 = 1
inv : p0 + p620 + p621 = 1
inv : p0 + p871 + p872 = 1
inv : p0 + p52 + p53 = 1
inv : p0 + p518 + p519 + p520 = 1
inv : p0 + p841 + p842 + p843 = 1
inv : p0 + p926 + p927 = 1
inv : p0 + p117 + p118 = 1
inv : p0 + p860 + p863 + p864 = 1
inv : p0 + p905 + p906 = 1
inv : p0 + p550 + p551 = 1
inv : p0 + p18 + p19 = 1
inv : p0 + p801 + p802 = 1
inv : p0 + p138 + p141 + p142 = 1
inv : p0 + p204 + p205 = 1
inv : p0 + p303 + p304 = 1
inv : p0 + p434 + p435 = 1
inv : p0 + p385 + p388 + p389 = 1
inv : p0 + p719 + p720 = 1
inv : p0 + p632 + p635 + p636 = 1
inv : p0 + p856 + p857 = 1
inv : p0 + p134 + p135 = 1
inv : p0 + p789 + p790 = 1
inv : p0 + p364 + p365 = 1
inv : p0 + p24 + p25 + p26 = 1
inv : p0 + p400 + p401 = 1
inv : p0 + p854 + p855 = 1
inv : p0 + p613 + p616 + p617 = 1
inv : p0 + p390 + p391 = 1
inv : p0 + p267 + p268 = 1
inv : p0 + p43 + p44 + p45 = 1
inv : p0 + p656 + p657 = 1
inv : p0 + p533 + p534 = 1
inv : p0 + p149 + p150 = 1
inv : p0 + p603 + p604 = 1
inv : p0 + p69 + p70 = 1
inv : p0 + p202 + p203 = 1
inv : p0 + p79 + p80 = 1
inv : p0 + p774 + p775 = 1
inv : p0 + p721 + p722 = 1
inv : p0 + p860 + p861 + p862 = 1
inv : p0 + p320 + p321 = 1
inv : p0 + p924 + p925 = 1
inv : p0 + p523 + p524 = 1
inv : p0 + p791 + p792 = 1
inv : p0 + p119 + p120 + p121 = 1
inv : p0 + p337 + p338 = 1
inv : p0 + p765 + p766 + p767 = 1
inv : p0 + p219 + p220 = 1
inv : p0 + p132 + p133 = 1
inv : p0 + p704 + p705 = 1
inv : p0 + p586 + p587 = 1
inv : p0 + p708 + p711 + p712 = 1
inv : p0 + p43 + p46 + p47 = 1
inv : p0 + p535 + p536 = 1
inv : p0 + p738 + p739 = 1
inv : p0 + p284 + p285 = 1
inv : p0 + p383 + p384 = 1
inv : p0 + p936 + p937 + p938 = 1
inv : p0 + p537 + p540 + p541 = 1
inv : p0 + p214 + p217 + p218 = 1
inv : p0 + p195 + p196 + p197 = 1
inv : p0 + p569 + p570 = 1
inv : p0 + p784 + p787 + p788 = 1
inv : p0 + p907 + p908 = 1
inv : p0 + p453 + p454 = 1
inv : p0 + p115 + p116 = 1
inv : p0 + p808 + p809 = 1
inv : p0 + p552 + p553 = 1
inv : p0 + p470 + p471 = 1
inv : p0 + p16 + p17 = 1
inv : p0 + p442 + p443 + p444 = 1
inv : p0 + p668 + p669 = 1
inv : p0 + p354 + p355 = 1
inv : p0 + p639 + p640 = 1
inv : p0 + p185 + p186 = 1
inv : p0 + p689 + p690 + p691 = 1
inv : p0 + p86 + p87 = 1
inv : p0 + p837 + p838 = 1
Total of 451 invariants.
[2020-05-27 13:36:31] [INFO ] Computed 451 place invariants in 42 ms
[2020-05-27 13:36:31] [INFO ] Removed a total of 150 redundant transitions.
[2020-05-27 13:36:31] [INFO ] Flatten gal took : 336 ms
[2020-05-27 13:36:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 72 ms.
[2020-05-27 13:36:31] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 55 ms
[2020-05-27 13:36:32] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 16 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 14 LTL properties
Checking formula 0 : !(((("(((i0.u3.p11!=1)||(i0.u5.p15!=1))||(i0.u8.p21!=1))")U(G(!(X("(((i0.u3.p11==1)&&(i0.u5.p15==1))&&(i0.u8.p21==1))")))))&&(((F(X("(((i26.i1.i3.u379.p904==1)&&(i27.i0.i3.u381.p908==1))&&(i27.i0.i0.u384.p914==1))")))||("(((i26.i1.i3.u379.p904==1)&&(i27.i0.i3.u381.p908==1))&&(i27.i0.i0.u384.p914==1))"))U("(i17.i0.i1.u238.p567==1)"))))
Formula 0 simplified : !(("(((i0.u3.p11!=1)||(i0.u5.p15!=1))||(i0.u8.p21!=1))" U G!X"(((i0.u3.p11==1)&&(i0.u5.p15==1))&&(i0.u8.p21==1))") & (("(((i26.i1.i3.u379.p904==1)&&(i27.i0.i3.u381.p908==1))&&(i27.i0.i0.u384.p914==1))" | FX"(((i26.i1.i3.u379.p904==1)&&(i27.i0.i3.u381.p908==1))&&(i27.i0.i0.u384.p914==1))") U "(i17.i0.i1.u238.p567==1)"))
built 29 ordering constraints for composite.
built 21 ordering constraints for composite.
built 38 ordering constraints for composite.
built 38 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 ordering constraints for composite.
built 20 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 ordering constraints for composite.
built 23 ordering constraints for composite.
built 15 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 38 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 ordering constraints for composite.
built 38 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 23 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 23 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 38 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 23 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 23 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 23 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 23 ordering constraints for composite.
built 15 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 18 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-27 13:36:37] [INFO ] Proved 953 variables to be positive in 6408 ms
[2020-05-27 13:36:37] [INFO ] Computing symmetric may disable matrix : 702 transitions.
[2020-05-27 13:36:37] [INFO ] Computation of disable matrix completed :0/702 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 13:36:37] [INFO ] Computation of Complete disable matrix. took 68 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 13:36:37] [INFO ] Computing symmetric may enable matrix : 702 transitions.
[2020-05-27 13:36:37] [INFO ] Computation of Complete enable matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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)
[2020-05-27 13:36:38] [INFO ] Built C files in 8693ms 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]
Compilation finished in 8681 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 87 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( ((LTLAP0==true))U([](!( X((LTLAP1==true))) )) ) && ( (( <>(X((LTLAP2==true)))) || ( (LTLAP2==true)) )U((LTLAP3==true)) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( ((LTLAP0==true))U([](!( X((LTLAP1==true))) )) ) && ( (( <>(X((LTLAP2==true)))) || ( (LTLAP2==true)) )U((LTLAP3==true)) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( ((LTLAP0==true))U([](!( X((LTLAP1==true))) )) ) && ( (( <>(X((LTLAP2==true)))) || ( (LTLAP2==true)) )U((LTLAP3==true)) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2020-05-27 13:59:12] [INFO ] Applying decomposition
[2020-05-27 13:59:12] [INFO ] Flatten gal took : 75 ms
[2020-05-27 13:59:12] [INFO ] Decomposing Gal with order
[2020-05-27 13:59:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 13:59:12] [INFO ] Removed a total of 200 redundant transitions.
[2020-05-27 13:59:12] [INFO ] Flatten gal took : 95 ms
[2020-05-27 13:59:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2020-05-27 13:59:12] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 15 ms
[2020-05-27 13:59:12] [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 14 LTL properties
Checking formula 0 : !(((("(((u6.p11!=1)||(u8.p15!=1))||(u11.p21!=1))")U(G(!(X("(((u6.p11==1)&&(u8.p15==1))&&(u11.p21==1))")))))&&(((F(X("(((u476.p904==1)&&(u478.p908==1))&&(u481.p914==1))")))||("(((u476.p904==1)&&(u478.p908==1))&&(u481.p914==1))"))U("(u299.p567==1)"))))
Formula 0 simplified : !(("(((u6.p11!=1)||(u8.p15!=1))||(u11.p21!=1))" U G!X"(((u6.p11==1)&&(u8.p15==1))&&(u11.p21==1))") & (("(((u476.p904==1)&&(u478.p908==1))&&(u481.p914==1))" | FX"(((u476.p904==1)&&(u478.p908==1))&&(u481.p914==1))") U "(u299.p567==1)"))
built 451 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2492 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,25.0736,431764,1,0,913325,1369,10353,1.39884e+06,46,999,2043374
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(((F(X((X(G(F("((u208.p394==1)&&(u216.p409==1))"))))&&(G("(u481.p913==1)")))))&&("(i210.u264.p500==1)"))&&("(u268.p509==1)"))))
Formula 1 simplified : !X("(i210.u264.p500==1)" & "(u268.p509==1)" & FX(XGF"((u208.p394==1)&&(u216.p409==1))" & G"(u481.p913==1)"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
437 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,29.4399,577036,1,0,1.25567e+06,1369,10410,1.92116e+06,46,999,2707495
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G((G("((i282.u515.p670!=1)||(u359.p681!=1))"))||(F(X(G(F(G(("(u280.p531==1)")U("((i234.u294.p558==1)&&(i234.u295.p560==1))")))))))))))
Formula 2 simplified : !FG(G"((i282.u515.p670!=1)||(u359.p681!=1))" | FXGFG("(u280.p531==1)" U "((i234.u294.p558==1)&&(i234.u295.p560==1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
898 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,38.4345,934856,1,0,2.08971e+06,1369,10957,3.21834e+06,46,999,4292388
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(!(G((!(X(X("((i282.u355.p673==1)&&(u360.p684==1))"))))&&((F("((u258.p489!=1)||(u266.p504!=1))"))U(F("(((u466.p885==1)&&(u468.p889==1))&&(u471.p895==1))"))))))))
Formula 3 simplified : !F!G(!XX"((i282.u355.p673==1)&&(u360.p684==1))" & (F"((u258.p489!=1)||(u266.p504!=1))" U F"(((u466.p885==1)&&(u468.p889==1))&&(u471.p895==1))"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3609 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,74.5327,1712560,1,0,3.65633e+06,1369,11179,6.74304e+06,46,999,6551645
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(("((u407.p772==1)&&(u420.p797==1))")U(G("((u407.p772==1)&&(u420.p797==1))"))))U((((!(G(F("((u407.p772==1)&&(u420.p797==1))"))))&&("(u407.p772==1)"))&&("(u420.p797==1)"))&&("(u309.p586!=1)"))))
Formula 4 simplified : !(F("((u407.p772==1)&&(u420.p797==1))" U G"((u407.p772==1)&&(u420.p797==1))") U ("(u309.p586!=1)" & "(u407.p772==1)" & "(u420.p797==1)" & !GF"((u407.p772==1)&&(u420.p797==1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
577 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,80.2978,1974892,1,0,4.26374e+06,1369,11560,7.70437e+06,46,999,7664160
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((((((!(G("((u352.p668==1)&&(u361.p685==1))")))&&(!(F("((u208.p394==1)&&(u216.p409==1))"))))&&("((u352.p668!=1)||(u361.p685!=1))"))U("((i290.u364.p690!=1)||(u368.p699!=1))"))&&(X("(((u447.p849==1)&&(u450.p855==1))&&(u451.p857==1))"))))
Formula 5 simplified : !((("((u352.p668!=1)||(u361.p685!=1))" & !G"((u352.p668==1)&&(u361.p685==1))" & !F"((u208.p394==1)&&(u216.p409==1))") U "((i290.u364.p690!=1)||(u368.p699!=1))") & X"(((u447.p849==1)&&(u450.p855==1))&&(u451.p857==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 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,80.3203,1975420,1,0,4.26374e+06,1369,11622,7.70437e+06,46,999,7664931
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X("((i98.u125.p236==1)&&(u130.p247==1))"))))
Formula 6 simplified : !GX"((i98.u125.p236==1)&&(u130.p247==1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 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,80.3449,1975684,1,0,4.26374e+06,1369,11644,7.70437e+06,46,999,7665569
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G(((!(F("((u67.p126!=1)||(u80.p151!=1))")))&&(!(X("((i234.u294.p558==1)&&(i234.u295.p560==1))"))))U("((u67.p126==1)&&(u80.p151==1))")))))
Formula 7 simplified : !XG((!F"((u67.p126!=1)||(u80.p151!=1))" & !X"((i234.u294.p558==1)&&(i234.u295.p560==1))") U "((u67.p126==1)&&(u80.p151==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3 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,80.3733,1975684,1,0,4.26374e+06,1369,11676,7.70437e+06,46,999,7666642
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(((X(("((i298.u375.p711==1)&&(u380.p722==1))")U(F("(u51.p96==1)"))))&&("(u387.p734==1)"))&&("(u400.p759==1)"))))
Formula 8 simplified : !F("(u387.p734==1)" & "(u400.p759==1)" & X("((i298.u375.p711==1)&&(u380.p722==1))" U F"(u51.p96==1)"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
905 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,89.417,2399932,1,0,5.25232e+06,1369,12506,9.25236e+06,46,999,9631308
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(((F(("(((u466.p885==1)&&(u468.p889==1))&&(u471.p895==1))")U("(u158.p299==1)")))||("(u210.p398==1)"))U(F(((F("(((u466.p885==1)&&(u468.p889==1))&&(u471.p895==1))"))&&("(i306.u538.p727==1)"))&&("(u389.p738==1)"))))))
Formula 9 simplified : !F(("(u210.p398==1)" | F("(((u466.p885==1)&&(u468.p889==1))&&(u471.p895==1))" U "(u158.p299==1)")) U F("(i306.u538.p727==1)" & "(u389.p738==1)" & F"(((u466.p885==1)&&(u468.p889==1))&&(u471.p895==1))"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3408 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,123.504,2717884,1,0,6.0106e+06,1369,6924,1.0444e+07,35,999,10782
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(X(G(("(u441.p837==1)")U(X("(u441.p837==1)")))))))
Formula 10 simplified : !FXG("(u441.p837==1)" U X"(u441.p837==1)")
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
802 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,131.523,2717884,1,0,6.0106e+06,1369,8824,1.0444e+07,37,999,1992643
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((!(F(X(F((G("(u188.p356==1)"))||(F("(u409.p776==1)"))))))))
Formula 11 simplified : FXF(G"(u188.p356==1)" | F"(u409.p776==1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
471 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,136.236,2717884,1,0,6.0106e+06,1369,8985,1.0444e+07,37,999,3139472
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(!((G(X("((u252.p479==1)&&(u259.p492==1))")))U((((!(("((u402.p764==1)&&(u409.p777==1))")U("((i42.u537.p100==1)&&(u59.p111==1))")))||("(i42.u537.p100!=1)"))||("(u59.p111!=1)"))||("((u402.p764==1)&&(u409.p777==1))"))))))
Formula 12 simplified : !X!(GX"((u252.p479==1)&&(u259.p492==1))" U ("((u402.p764==1)&&(u409.p777==1))" | "(i42.u537.p100!=1)" | "(u59.p111!=1)" | !("((u402.p764==1)&&(u409.p777==1))" U "((i42.u537.p100==1)&&(u59.p111==1))")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,136.271,2717884,1,0,6.0106e+06,1369,9019,1.0444e+07,37,999,3144243
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(((X("(u268.p508==1)"))||((F("(u171.p324!=1)"))&&(!(F("(((u326.p619==1)&&(u328.p623==1))&&(u331.p629==1))")))))U(F("(u268.p508==1)")))))
Formula 13 simplified : !F((X"(u268.p508==1)" | (F"(u171.p324!=1)" & !F"(((u326.p619==1)&&(u328.p623==1))&&(u331.p629==1))")) U F"(u268.p508==1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
708 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,143.352,2717884,1,0,6.0106e+06,1369,9321,1.0444e+07,37,999,4516989
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1590588108017
--------------------
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="ShieldIIPt-PT-050A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-050A, 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 r210-tajo-159033475600362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050A.tgz
mv ShieldIIPt-PT-050A 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 '
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 ;