Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699200537.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200537
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 22:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 146K Mar 24 05:37 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 BusinessProcesses-PT-12-00
FORMULA_NAME BusinessProcesses-PT-12-01
FORMULA_NAME BusinessProcesses-PT-12-02
FORMULA_NAME BusinessProcesses-PT-12-03
FORMULA_NAME BusinessProcesses-PT-12-04
FORMULA_NAME BusinessProcesses-PT-12-05
FORMULA_NAME BusinessProcesses-PT-12-06
FORMULA_NAME BusinessProcesses-PT-12-07
FORMULA_NAME BusinessProcesses-PT-12-08
FORMULA_NAME BusinessProcesses-PT-12-09
FORMULA_NAME BusinessProcesses-PT-12-10
FORMULA_NAME BusinessProcesses-PT-12-11
FORMULA_NAME BusinessProcesses-PT-12-12
FORMULA_NAME BusinessProcesses-PT-12-13
FORMULA_NAME BusinessProcesses-PT-12-14
FORMULA_NAME BusinessProcesses-PT-12-15

=== Now, execution of the tool begins

BK_START 1589253293938

[2020-05-12 03:14:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-12 03:14:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:14:55] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2020-05-12 03:14:55] [INFO ] Transformed 586 places.
[2020-05-12 03:14:55] [INFO ] Transformed 525 transitions.
[2020-05-12 03:14:55] [INFO ] Found NUPN structural information;
[2020-05-12 03:14:55] [INFO ] Parsed PT model containing 586 places and 525 transitions in 124 ms.
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 730 resets, run finished after 286 ms. (steps per millisecond=349 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1]
// Phase 1: matrix 521 rows 582 cols
[2020-05-12 03:14:56] [INFO ] Computed 98 place invariants in 41 ms
[2020-05-12 03:14:56] [INFO ] [Real]Absence check using 55 positive place invariants in 61 ms returned sat
[2020-05-12 03:14:56] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 23 ms returned sat
[2020-05-12 03:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:57] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2020-05-12 03:14:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:14:57] [INFO ] [Nat]Absence check using 55 positive place invariants in 266 ms returned sat
[2020-05-12 03:14:57] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:14:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:58] [INFO ] [Nat]Absence check using state equation in 750 ms returned sat
[2020-05-12 03:14:58] [INFO ] Deduced a trap composed of 109 places in 243 ms
[2020-05-12 03:14:58] [INFO ] Deduced a trap composed of 16 places in 172 ms
[2020-05-12 03:14:59] [INFO ] Deduced a trap composed of 22 places in 159 ms
[2020-05-12 03:14:59] [INFO ] Deduced a trap composed of 20 places in 166 ms
[2020-05-12 03:14:59] [INFO ] Deduced a trap composed of 13 places in 352 ms
[2020-05-12 03:14:59] [INFO ] Deduced a trap composed of 21 places in 252 ms
[2020-05-12 03:15:00] [INFO ] Deduced a trap composed of 11 places in 220 ms
[2020-05-12 03:15:00] [INFO ] Deduced a trap composed of 26 places in 188 ms
[2020-05-12 03:15:00] [INFO ] Deduced a trap composed of 21 places in 319 ms
[2020-05-12 03:15:00] [INFO ] Deduced a trap composed of 26 places in 108 ms
[2020-05-12 03:15:01] [INFO ] Deduced a trap composed of 18 places in 119 ms
[2020-05-12 03:15:01] [INFO ] Deduced a trap composed of 25 places in 206 ms
[2020-05-12 03:15:01] [INFO ] Deduced a trap composed of 17 places in 77 ms
[2020-05-12 03:15:01] [INFO ] Deduced a trap composed of 27 places in 122 ms
[2020-05-12 03:15:01] [INFO ] Deduced a trap composed of 17 places in 143 ms
[2020-05-12 03:15:01] [INFO ] Deduced a trap composed of 26 places in 303 ms
[2020-05-12 03:15:02] [INFO ] Deduced a trap composed of 32 places in 78 ms
[2020-05-12 03:15:02] [INFO ] Deduced a trap composed of 21 places in 146 ms
[2020-05-12 03:15:02] [INFO ] Deduced a trap composed of 45 places in 86 ms
[2020-05-12 03:15:02] [INFO ] Deduced a trap composed of 48 places in 87 ms
[2020-05-12 03:15:02] [INFO ] Deduced a trap composed of 23 places in 86 ms
[2020-05-12 03:15:02] [INFO ] Deduced a trap composed of 36 places in 76 ms
[2020-05-12 03:15:02] [INFO ] Deduced a trap composed of 27 places in 76 ms
[2020-05-12 03:15:02] [INFO ] Deduced a trap composed of 31 places in 68 ms
[2020-05-12 03:15:02] [INFO ] Deduced a trap composed of 37 places in 80 ms
[2020-05-12 03:15:03] [INFO ] Deduced a trap composed of 25 places in 72 ms
[2020-05-12 03:15:03] [INFO ] Deduced a trap composed of 56 places in 74 ms
[2020-05-12 03:15:03] [INFO ] Deduced a trap composed of 58 places in 73 ms
[2020-05-12 03:15:03] [INFO ] Deduced a trap composed of 40 places in 74 ms
[2020-05-12 03:15:03] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4981 ms
[2020-05-12 03:15:03] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 48 ms.
[2020-05-12 03:15:06] [INFO ] Added : 324 causal constraints over 65 iterations in 3403 ms. Result :sat
[2020-05-12 03:15:07] [INFO ] [Real]Absence check using 55 positive place invariants in 67 ms returned sat
[2020-05-12 03:15:07] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 38 ms returned sat
[2020-05-12 03:15:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:15:09] [INFO ] [Real]Absence check using state equation in 2348 ms returned sat
[2020-05-12 03:15:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:15:09] [INFO ] [Nat]Absence check using 55 positive place invariants in 52 ms returned unsat
[2020-05-12 03:15:09] [INFO ] [Real]Absence check using 55 positive place invariants in 51 ms returned sat
[2020-05-12 03:15:09] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-05-12 03:15:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:15:10] [INFO ] [Real]Absence check using state equation in 1149 ms returned sat
[2020-05-12 03:15:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:15:11] [INFO ] [Nat]Absence check using 55 positive place invariants in 67 ms returned sat
[2020-05-12 03:15:11] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 34 ms returned sat
[2020-05-12 03:15:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:15:12] [INFO ] [Nat]Absence check using state equation in 1202 ms returned sat
[2020-05-12 03:15:12] [INFO ] Deduced a trap composed of 26 places in 122 ms
[2020-05-12 03:15:12] [INFO ] Deduced a trap composed of 19 places in 83 ms
[2020-05-12 03:15:12] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2020-05-12 03:15:12] [INFO ] Deduced a trap composed of 13 places in 79 ms
[2020-05-12 03:15:12] [INFO ] Deduced a trap composed of 12 places in 82 ms
[2020-05-12 03:15:13] [INFO ] Deduced a trap composed of 13 places in 183 ms
[2020-05-12 03:15:13] [INFO ] Deduced a trap composed of 28 places in 133 ms
[2020-05-12 03:15:13] [INFO ] Deduced a trap composed of 35 places in 728 ms
[2020-05-12 03:15:14] [INFO ] Deduced a trap composed of 11 places in 79 ms
[2020-05-12 03:15:14] [INFO ] Deduced a trap composed of 14 places in 90 ms
[2020-05-12 03:15:14] [INFO ] Deduced a trap composed of 19 places in 107 ms
[2020-05-12 03:15:14] [INFO ] Deduced a trap composed of 20 places in 136 ms
[2020-05-12 03:15:14] [INFO ] Deduced a trap composed of 31 places in 91 ms
[2020-05-12 03:15:14] [INFO ] Deduced a trap composed of 22 places in 88 ms
[2020-05-12 03:15:14] [INFO ] Deduced a trap composed of 26 places in 73 ms
[2020-05-12 03:15:14] [INFO ] Deduced a trap composed of 28 places in 107 ms
[2020-05-12 03:15:14] [INFO ] Deduced a trap composed of 29 places in 67 ms
[2020-05-12 03:15:15] [INFO ] Deduced a trap composed of 22 places in 78 ms
[2020-05-12 03:15:15] [INFO ] Deduced a trap composed of 19 places in 73 ms
[2020-05-12 03:15:17] [INFO ] Deduced a trap composed of 45 places in 2747 ms
[2020-05-12 03:15:19] [INFO ] Deduced a trap composed of 28 places in 1036 ms
[2020-05-12 03:15:21] [INFO ] Deduced a trap composed of 21 places in 2615 ms
[2020-05-12 03:15:21] [INFO ] Deduced a trap composed of 22 places in 149 ms
[2020-05-12 03:15:21] [INFO ] Deduced a trap composed of 35 places in 68 ms
[2020-05-12 03:15:22] [INFO ] Deduced a trap composed of 32 places in 195 ms
[2020-05-12 03:15:22] [INFO ] Deduced a trap composed of 41 places in 162 ms
[2020-05-12 03:15:22] [INFO ] Deduced a trap composed of 25 places in 574 ms
[2020-05-12 03:15:23] [INFO ] Deduced a trap composed of 18 places in 142 ms
[2020-05-12 03:15:23] [INFO ] Deduced a trap composed of 27 places in 200 ms
[2020-05-12 03:15:23] [INFO ] Deduced a trap composed of 21 places in 174 ms
[2020-05-12 03:15:23] [INFO ] Deduced a trap composed of 42 places in 136 ms
[2020-05-12 03:15:23] [INFO ] Deduced a trap composed of 35 places in 126 ms
[2020-05-12 03:15:24] [INFO ] Deduced a trap composed of 39 places in 147 ms
[2020-05-12 03:15:24] [INFO ] Deduced a trap composed of 46 places in 132 ms
[2020-05-12 03:15:24] [INFO ] Deduced a trap composed of 31 places in 132 ms
[2020-05-12 03:15:24] [INFO ] Deduced a trap composed of 44 places in 212 ms
[2020-05-12 03:15:24] [INFO ] Deduced a trap composed of 29 places in 133 ms
[2020-05-12 03:15:24] [INFO ] Deduced a trap composed of 31 places in 137 ms
[2020-05-12 03:15:25] [INFO ] Deduced a trap composed of 45 places in 126 ms
[2020-05-12 03:15:25] [INFO ] Deduced a trap composed of 25 places in 126 ms
[2020-05-12 03:15:25] [INFO ] Deduced a trap composed of 41 places in 123 ms
[2020-05-12 03:15:25] [INFO ] Deduced a trap composed of 46 places in 125 ms
[2020-05-12 03:15:25] [INFO ] Deduced a trap composed of 46 places in 124 ms
[2020-05-12 03:15:25] [INFO ] Deduced a trap composed of 26 places in 66 ms
[2020-05-12 03:15:25] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 13455 ms
[2020-05-12 03:15:25] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 43 ms.
[2020-05-12 03:15:29] [INFO ] Added : 377 causal constraints over 76 iterations in 4106 ms. Result :sat
[2020-05-12 03:15:30] [INFO ] Deduced a trap composed of 134 places in 193 ms
[2020-05-12 03:15:30] [INFO ] Deduced a trap composed of 134 places in 159 ms
[2020-05-12 03:15:30] [INFO ] Deduced a trap composed of 130 places in 316 ms
[2020-05-12 03:15:30] [INFO ] Deduced a trap composed of 148 places in 210 ms
[2020-05-12 03:15:30] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s27 s28 s31 s32 s42 s43 s48 s49 s52 s53 s66 s67 s68 s71 s75 s77 s86 s87 s88 s96 s108 s114 s139 s140 s141 s145 s148 s149 s151 s152 s154 s155 s171 s172 s173 s191 s192 s193 s206 s209 s210 s211 s215 s216 s217 s270 s283 s285 s294 s309 s314 s319 s324 s329 s334 s344 s374 s379 s384 s389 s394 s404 s409 s413 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s439 s440 s443 s444 s445 s446 s447 s448 s453 s455 s456 s457 s459 s461 s462 s463 s464 s465 s466 s467 s468 s474 s475 s478 s479 s484 s485 s496 s497 s498 s499 s500 s501 s502 s503 s508 s509 s510 s511 s512 s517 s518 s521 s522 s533 s534 s535 s536 s539 s540 s543 s552 s553 s557 s558 s559 s564 s565 s570 s571 s579 s580 s581) 0)") while checking expression at index 2
[2020-05-12 03:15:31] [INFO ] [Real]Absence check using 55 positive place invariants in 35 ms returned sat
[2020-05-12 03:15:31] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-05-12 03:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:15:31] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2020-05-12 03:15:32] [INFO ] Deduced a trap composed of 19 places in 175 ms
[2020-05-12 03:15:32] [INFO ] Deduced a trap composed of 18 places in 195 ms
[2020-05-12 03:15:32] [INFO ] Deduced a trap composed of 16 places in 247 ms
[2020-05-12 03:15:32] [INFO ] Deduced a trap composed of 21 places in 90 ms
[2020-05-12 03:15:33] [INFO ] Deduced a trap composed of 25 places in 886 ms
[2020-05-12 03:15:33] [INFO ] Deduced a trap composed of 17 places in 125 ms
[2020-05-12 03:15:33] [INFO ] Deduced a trap composed of 27 places in 107 ms
[2020-05-12 03:15:34] [INFO ] Deduced a trap composed of 25 places in 156 ms
[2020-05-12 03:15:34] [INFO ] Deduced a trap composed of 22 places in 625 ms
[2020-05-12 03:15:34] [INFO ] Deduced a trap composed of 26 places in 96 ms
[2020-05-12 03:15:34] [INFO ] Deduced a trap composed of 35 places in 122 ms
[2020-05-12 03:15:35] [INFO ] Deduced a trap composed of 22 places in 144 ms
[2020-05-12 03:15:35] [INFO ] Deduced a trap composed of 25 places in 264 ms
[2020-05-12 03:15:35] [INFO ] Deduced a trap composed of 39 places in 274 ms
[2020-05-12 03:15:35] [INFO ] Deduced a trap composed of 32 places in 71 ms
[2020-05-12 03:15:36] [INFO ] Deduced a trap composed of 29 places in 58 ms
[2020-05-12 03:15:36] [INFO ] Deduced a trap composed of 28 places in 60 ms
[2020-05-12 03:15:36] [INFO ] Deduced a trap composed of 39 places in 85 ms
[2020-05-12 03:15:36] [INFO ] Deduced a trap composed of 35 places in 65 ms
[2020-05-12 03:15:36] [INFO ] Deduced a trap composed of 47 places in 51 ms
[2020-05-12 03:15:36] [INFO ] Deduced a trap composed of 27 places in 410 ms
[2020-05-12 03:15:36] [INFO ] Deduced a trap composed of 30 places in 113 ms
[2020-05-12 03:15:37] [INFO ] Deduced a trap composed of 46 places in 176 ms
[2020-05-12 03:15:37] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5383 ms
[2020-05-12 03:15:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:15:37] [INFO ] [Nat]Absence check using 55 positive place invariants in 244 ms returned sat
[2020-05-12 03:15:37] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 236 ms returned sat
[2020-05-12 03:15:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:15:38] [INFO ] [Nat]Absence check using state equation in 905 ms returned sat
[2020-05-12 03:15:38] [INFO ] Deduced a trap composed of 24 places in 154 ms
[2020-05-12 03:15:39] [INFO ] Deduced a trap composed of 16 places in 138 ms
[2020-05-12 03:15:39] [INFO ] Deduced a trap composed of 38 places in 106 ms
[2020-05-12 03:15:39] [INFO ] Deduced a trap composed of 22 places in 99 ms
[2020-05-12 03:15:39] [INFO ] Deduced a trap composed of 22 places in 73 ms
[2020-05-12 03:15:39] [INFO ] Deduced a trap composed of 13 places in 126 ms
[2020-05-12 03:15:39] [INFO ] Deduced a trap composed of 25 places in 72 ms
[2020-05-12 03:15:39] [INFO ] Deduced a trap composed of 22 places in 70 ms
[2020-05-12 03:15:39] [INFO ] Deduced a trap composed of 22 places in 69 ms
[2020-05-12 03:15:40] [INFO ] Deduced a trap composed of 33 places in 70 ms
[2020-05-12 03:15:40] [INFO ] Deduced a trap composed of 23 places in 70 ms
[2020-05-12 03:15:40] [INFO ] Deduced a trap composed of 22 places in 142 ms
[2020-05-12 03:15:40] [INFO ] Deduced a trap composed of 27 places in 182 ms
[2020-05-12 03:15:40] [INFO ] Deduced a trap composed of 34 places in 223 ms
[2020-05-12 03:15:40] [INFO ] Deduced a trap composed of 35 places in 83 ms
[2020-05-12 03:15:40] [INFO ] Deduced a trap composed of 27 places in 83 ms
[2020-05-12 03:15:41] [INFO ] Deduced a trap composed of 41 places in 85 ms
[2020-05-12 03:15:41] [INFO ] Deduced a trap composed of 22 places in 84 ms
[2020-05-12 03:15:41] [INFO ] Deduced a trap composed of 24 places in 83 ms
[2020-05-12 03:15:41] [INFO ] Deduced a trap composed of 27 places in 80 ms
[2020-05-12 03:15:41] [INFO ] Deduced a trap composed of 47 places in 340 ms
[2020-05-12 03:15:41] [INFO ] Deduced a trap composed of 41 places in 82 ms
[2020-05-12 03:15:41] [INFO ] Deduced a trap composed of 48 places in 138 ms
[2020-05-12 03:15:42] [INFO ] Deduced a trap composed of 45 places in 109 ms
[2020-05-12 03:15:42] [INFO ] Deduced a trap composed of 47 places in 65 ms
[2020-05-12 03:15:42] [INFO ] Deduced a trap composed of 30 places in 400 ms
[2020-05-12 03:15:42] [INFO ] Deduced a trap composed of 50 places in 107 ms
[2020-05-12 03:15:42] [INFO ] Deduced a trap composed of 42 places in 60 ms
[2020-05-12 03:15:42] [INFO ] Deduced a trap composed of 24 places in 99 ms
[2020-05-12 03:15:43] [INFO ] Deduced a trap composed of 45 places in 113 ms
[2020-05-12 03:15:43] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 4384 ms
[2020-05-12 03:15:43] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 34 ms.
[2020-05-12 03:15:46] [INFO ] Added : 314 causal constraints over 63 iterations in 3625 ms. Result :sat
[2020-05-12 03:15:47] [INFO ] [Real]Absence check using 55 positive place invariants in 61 ms returned sat
[2020-05-12 03:15:47] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 88 ms returned sat
[2020-05-12 03:15:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:15:47] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2020-05-12 03:15:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:15:47] [INFO ] [Nat]Absence check using 55 positive place invariants in 15 ms returned unsat
[2020-05-12 03:15:48] [INFO ] [Real]Absence check using 55 positive place invariants in 54 ms returned sat
[2020-05-12 03:15:48] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 39 ms returned sat
[2020-05-12 03:15:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:15:49] [INFO ] [Real]Absence check using state equation in 1237 ms returned sat
[2020-05-12 03:15:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:15:49] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned unsat
[2020-05-12 03:15:49] [INFO ] [Real]Absence check using 55 positive place invariants in 53 ms returned sat
[2020-05-12 03:15:49] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-05-12 03:15:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:15:50] [INFO ] [Real]Absence check using state equation in 668 ms returned sat
[2020-05-12 03:15:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:15:50] [INFO ] [Nat]Absence check using 55 positive place invariants in 51 ms returned sat
[2020-05-12 03:15:50] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 45 ms returned sat
[2020-05-12 03:15:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:15:51] [INFO ] [Nat]Absence check using state equation in 700 ms returned sat
[2020-05-12 03:15:51] [INFO ] Deduced a trap composed of 107 places in 276 ms
[2020-05-12 03:15:51] [INFO ] Deduced a trap composed of 116 places in 304 ms
[2020-05-12 03:15:52] [INFO ] Deduced a trap composed of 13 places in 259 ms
[2020-05-12 03:15:52] [INFO ] Deduced a trap composed of 18 places in 145 ms
[2020-05-12 03:15:52] [INFO ] Deduced a trap composed of 117 places in 146 ms
[2020-05-12 03:15:52] [INFO ] Deduced a trap composed of 11 places in 143 ms
[2020-05-12 03:15:52] [INFO ] Deduced a trap composed of 14 places in 141 ms
[2020-05-12 03:15:53] [INFO ] Deduced a trap composed of 25 places in 176 ms
[2020-05-12 03:15:53] [INFO ] Deduced a trap composed of 17 places in 159 ms
[2020-05-12 03:15:53] [INFO ] Deduced a trap composed of 17 places in 133 ms
[2020-05-12 03:15:53] [INFO ] Deduced a trap composed of 107 places in 509 ms
[2020-05-12 03:15:54] [INFO ] Deduced a trap composed of 21 places in 152 ms
[2020-05-12 03:15:54] [INFO ] Deduced a trap composed of 27 places in 124 ms
[2020-05-12 03:15:54] [INFO ] Deduced a trap composed of 24 places in 116 ms
[2020-05-12 03:15:54] [INFO ] Deduced a trap composed of 106 places in 150 ms
[2020-05-12 03:15:54] [INFO ] Deduced a trap composed of 102 places in 119 ms
[2020-05-12 03:15:54] [INFO ] Deduced a trap composed of 109 places in 117 ms
[2020-05-12 03:15:55] [INFO ] Deduced a trap composed of 36 places in 134 ms
[2020-05-12 03:15:55] [INFO ] Deduced a trap composed of 22 places in 117 ms
[2020-05-12 03:15:55] [INFO ] Deduced a trap composed of 32 places in 115 ms
[2020-05-12 03:15:55] [INFO ] Deduced a trap composed of 116 places in 129 ms
[2020-05-12 03:15:55] [INFO ] Deduced a trap composed of 25 places in 135 ms
[2020-05-12 03:15:55] [INFO ] Deduced a trap composed of 112 places in 129 ms
[2020-05-12 03:15:55] [INFO ] Deduced a trap composed of 30 places in 129 ms
[2020-05-12 03:15:56] [INFO ] Deduced a trap composed of 30 places in 133 ms
[2020-05-12 03:15:56] [INFO ] Deduced a trap composed of 29 places in 162 ms
[2020-05-12 03:15:56] [INFO ] Deduced a trap composed of 130 places in 110 ms
[2020-05-12 03:15:56] [INFO ] Deduced a trap composed of 35 places in 128 ms
[2020-05-12 03:15:56] [INFO ] Deduced a trap composed of 38 places in 107 ms
[2020-05-12 03:15:56] [INFO ] Deduced a trap composed of 33 places in 131 ms
[2020-05-12 03:15:57] [INFO ] Deduced a trap composed of 28 places in 136 ms
[2020-05-12 03:15:57] [INFO ] Deduced a trap composed of 41 places in 136 ms
[2020-05-12 03:15:57] [INFO ] Deduced a trap composed of 40 places in 132 ms
[2020-05-12 03:15:57] [INFO ] Deduced a trap composed of 41 places in 271 ms
[2020-05-12 03:15:58] [INFO ] Deduced a trap composed of 45 places in 425 ms
[2020-05-12 03:15:59] [INFO ] Deduced a trap composed of 30 places in 984 ms
[2020-05-12 03:16:00] [INFO ] Deduced a trap composed of 128 places in 895 ms
[2020-05-12 03:16:00] [INFO ] Deduced a trap composed of 31 places in 233 ms
[2020-05-12 03:16:00] [INFO ] Deduced a trap composed of 52 places in 232 ms
[2020-05-12 03:16:00] [INFO ] Deduced a trap composed of 38 places in 141 ms
[2020-05-12 03:16:01] [INFO ] Deduced a trap composed of 112 places in 246 ms
[2020-05-12 03:16:01] [INFO ] Deduced a trap composed of 43 places in 116 ms
[2020-05-12 03:16:01] [INFO ] Deduced a trap composed of 111 places in 121 ms
[2020-05-12 03:16:01] [INFO ] Deduced a trap composed of 117 places in 118 ms
[2020-05-12 03:16:01] [INFO ] Deduced a trap composed of 123 places in 129 ms
[2020-05-12 03:16:01] [INFO ] Deduced a trap composed of 115 places in 235 ms
[2020-05-12 03:16:02] [INFO ] Deduced a trap composed of 113 places in 164 ms
[2020-05-12 03:16:02] [INFO ] Deduced a trap composed of 114 places in 258 ms
[2020-05-12 03:16:02] [INFO ] Deduced a trap composed of 112 places in 268 ms
[2020-05-12 03:16:02] [INFO ] Deduced a trap composed of 116 places in 144 ms
[2020-05-12 03:16:03] [INFO ] Deduced a trap composed of 117 places in 281 ms
[2020-05-12 03:16:03] [INFO ] Deduced a trap composed of 24 places in 130 ms
[2020-05-12 03:16:03] [INFO ] Deduced a trap composed of 120 places in 275 ms
[2020-05-12 03:16:03] [INFO ] Deduced a trap composed of 21 places in 246 ms
[2020-05-12 03:16:04] [INFO ] Deduced a trap composed of 125 places in 124 ms
[2020-05-12 03:16:04] [INFO ] Deduced a trap composed of 35 places in 599 ms
[2020-05-12 03:16:05] [INFO ] Deduced a trap composed of 37 places in 333 ms
[2020-05-12 03:16:05] [INFO ] Deduced a trap composed of 44 places in 260 ms
[2020-05-12 03:16:06] [INFO ] Deduced a trap composed of 116 places in 671 ms
[2020-05-12 03:16:06] [INFO ] Deduced a trap composed of 131 places in 246 ms
[2020-05-12 03:16:07] [INFO ] Deduced a trap composed of 116 places in 667 ms
[2020-05-12 03:16:07] [INFO ] Deduced a trap composed of 108 places in 225 ms
[2020-05-12 03:16:07] [INFO ] Deduced a trap composed of 107 places in 267 ms
[2020-05-12 03:16:07] [INFO ] Deduced a trap composed of 43 places in 193 ms
[2020-05-12 03:16:08] [INFO ] Deduced a trap composed of 45 places in 227 ms
[2020-05-12 03:16:08] [INFO ] Deduced a trap composed of 32 places in 256 ms
[2020-05-12 03:16:08] [INFO ] Deduced a trap composed of 32 places in 245 ms
[2020-05-12 03:16:08] [INFO ] Deduced a trap composed of 45 places in 246 ms
[2020-05-12 03:16:09] [INFO ] Deduced a trap composed of 27 places in 268 ms
[2020-05-12 03:16:09] [INFO ] Deduced a trap composed of 41 places in 266 ms
[2020-05-12 03:16:09] [INFO ] Deduced a trap composed of 128 places in 239 ms
[2020-05-12 03:16:09] [INFO ] Deduced a trap composed of 117 places in 139 ms
[2020-05-12 03:16:10] [INFO ] Deduced a trap composed of 132 places in 142 ms
[2020-05-12 03:16:10] [INFO ] Deduced a trap composed of 34 places in 259 ms
[2020-05-12 03:16:10] [INFO ] Deduced a trap composed of 129 places in 150 ms
[2020-05-12 03:16:10] [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 (> (+ s0 s1 s2 s27 s28 s31 s32 s60 s61 s62 s73 s83 s86 s102 s120 s121 s122 s139 s140 s141 s145 s148 s149 s151 s152 s159 s160 s161 s171 s172 s173 s176 s177 s178 s179 s191 s192 s193 s236 s239 s270 s283 s285 s289 s294 s299 s304 s309 s334 s339 s344 s354 s369 s379 s384 s399 s413 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s439 s440 s441 s442 s443 s444 s451 s452 s454 s458 s460 s461 s462 s463 s470 s471 s472 s473 s478 s479 s480 s481 s482 s483 s484 s485 s486 s487 s494 s495 s500 s501 s502 s503 s517 s518 s519 s520 s521 s522 s525 s526 s527 s528 s529 s530 s531 s532 s535 s536 s537 s538 s539 s540 s541 s542 s543 s551 s563 s569) 0)") while checking expression at index 6
[2020-05-12 03:16:10] [INFO ] [Real]Absence check using 55 positive place invariants in 33 ms returned sat
[2020-05-12 03:16:10] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-05-12 03:16:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:11] [INFO ] [Real]Absence check using state equation in 693 ms returned sat
[2020-05-12 03:16:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:16:11] [INFO ] [Nat]Absence check using 55 positive place invariants in 101 ms returned sat
[2020-05-12 03:16:11] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:12] [INFO ] [Nat]Absence check using state equation in 722 ms returned sat
[2020-05-12 03:16:12] [INFO ] Deduced a trap composed of 107 places in 141 ms
[2020-05-12 03:16:12] [INFO ] Deduced a trap composed of 116 places in 138 ms
[2020-05-12 03:16:12] [INFO ] Deduced a trap composed of 13 places in 140 ms
[2020-05-12 03:16:13] [INFO ] Deduced a trap composed of 18 places in 252 ms
[2020-05-12 03:16:13] [INFO ] Deduced a trap composed of 117 places in 130 ms
[2020-05-12 03:16:13] [INFO ] Deduced a trap composed of 11 places in 141 ms
[2020-05-12 03:16:13] [INFO ] Deduced a trap composed of 14 places in 129 ms
[2020-05-12 03:16:13] [INFO ] Deduced a trap composed of 25 places in 142 ms
[2020-05-12 03:16:13] [INFO ] Deduced a trap composed of 17 places in 126 ms
[2020-05-12 03:16:13] [INFO ] Deduced a trap composed of 17 places in 131 ms
[2020-05-12 03:16:14] [INFO ] Deduced a trap composed of 107 places in 150 ms
[2020-05-12 03:16:14] [INFO ] Deduced a trap composed of 21 places in 129 ms
[2020-05-12 03:16:14] [INFO ] Deduced a trap composed of 27 places in 127 ms
[2020-05-12 03:16:14] [INFO ] Deduced a trap composed of 24 places in 123 ms
[2020-05-12 03:16:14] [INFO ] Deduced a trap composed of 106 places in 242 ms
[2020-05-12 03:16:15] [INFO ] Deduced a trap composed of 102 places in 268 ms
[2020-05-12 03:16:15] [INFO ] Deduced a trap composed of 109 places in 236 ms
[2020-05-12 03:16:15] [INFO ] Deduced a trap composed of 36 places in 227 ms
[2020-05-12 03:16:15] [INFO ] Deduced a trap composed of 22 places in 218 ms
[2020-05-12 03:16:16] [INFO ] Deduced a trap composed of 32 places in 148 ms
[2020-05-12 03:16:16] [INFO ] Deduced a trap composed of 116 places in 302 ms
[2020-05-12 03:16:16] [INFO ] Deduced a trap composed of 25 places in 253 ms
[2020-05-12 03:16:16] [INFO ] Deduced a trap composed of 112 places in 242 ms
[2020-05-12 03:16:17] [INFO ] Deduced a trap composed of 30 places in 143 ms
[2020-05-12 03:16:17] [INFO ] Deduced a trap composed of 30 places in 248 ms
[2020-05-12 03:16:17] [INFO ] Deduced a trap composed of 29 places in 263 ms
[2020-05-12 03:16:17] [INFO ] Deduced a trap composed of 130 places in 246 ms
[2020-05-12 03:16:18] [INFO ] Deduced a trap composed of 35 places in 290 ms
[2020-05-12 03:16:18] [INFO ] Deduced a trap composed of 38 places in 263 ms
[2020-05-12 03:16:18] [INFO ] Deduced a trap composed of 33 places in 167 ms
[2020-05-12 03:16:19] [INFO ] Deduced a trap composed of 28 places in 252 ms
[2020-05-12 03:16:19] [INFO ] Deduced a trap composed of 41 places in 125 ms
[2020-05-12 03:16:19] [INFO ] Deduced a trap composed of 40 places in 355 ms
[2020-05-12 03:16:19] [INFO ] Deduced a trap composed of 41 places in 162 ms
[2020-05-12 03:16:20] [INFO ] Deduced a trap composed of 45 places in 586 ms
[2020-05-12 03:16:20] [INFO ] Deduced a trap composed of 30 places in 125 ms
[2020-05-12 03:16:20] [INFO ] Deduced a trap composed of 128 places in 135 ms
[2020-05-12 03:16:20] [INFO ] Deduced a trap composed of 31 places in 113 ms
[2020-05-12 03:16:20] [INFO ] Deduced a trap composed of 52 places in 164 ms
[2020-05-12 03:16:21] [INFO ] Deduced a trap composed of 38 places in 140 ms
[2020-05-12 03:16:21] [INFO ] Deduced a trap composed of 112 places in 105 ms
[2020-05-12 03:16:21] [INFO ] Deduced a trap composed of 43 places in 189 ms
[2020-05-12 03:16:21] [INFO ] Deduced a trap composed of 111 places in 218 ms
[2020-05-12 03:16:21] [INFO ] Deduced a trap composed of 117 places in 160 ms
[2020-05-12 03:16:22] [INFO ] Deduced a trap composed of 123 places in 214 ms
[2020-05-12 03:16:22] [INFO ] Deduced a trap composed of 115 places in 229 ms
[2020-05-12 03:16:22] [INFO ] Deduced a trap composed of 113 places in 111 ms
[2020-05-12 03:16:22] [INFO ] Deduced a trap composed of 114 places in 180 ms
[2020-05-12 03:16:22] [INFO ] Deduced a trap composed of 112 places in 111 ms
[2020-05-12 03:16:23] [INFO ] Deduced a trap composed of 116 places in 162 ms
[2020-05-12 03:16:23] [INFO ] Deduced a trap composed of 117 places in 137 ms
[2020-05-12 03:16:23] [INFO ] Deduced a trap composed of 24 places in 443 ms
[2020-05-12 03:16:23] [INFO ] Deduced a trap composed of 120 places in 126 ms
[2020-05-12 03:16:23] [INFO ] Deduced a trap composed of 21 places in 113 ms
[2020-05-12 03:16:24] [INFO ] Deduced a trap composed of 125 places in 361 ms
[2020-05-12 03:16:24] [INFO ] Deduced a trap composed of 35 places in 143 ms
[2020-05-12 03:16:24] [INFO ] Deduced a trap composed of 37 places in 221 ms
[2020-05-12 03:16:25] [INFO ] Deduced a trap composed of 44 places in 547 ms
[2020-05-12 03:16:25] [INFO ] Deduced a trap composed of 116 places in 135 ms
[2020-05-12 03:16:25] [INFO ] Deduced a trap composed of 131 places in 142 ms
[2020-05-12 03:16:25] [INFO ] Deduced a trap composed of 116 places in 129 ms
[2020-05-12 03:16:26] [INFO ] Deduced a trap composed of 108 places in 759 ms
[2020-05-12 03:16:27] [INFO ] Deduced a trap composed of 107 places in 637 ms
[2020-05-12 03:16:27] [INFO ] Deduced a trap composed of 43 places in 222 ms
[2020-05-12 03:16:27] [INFO ] Deduced a trap composed of 45 places in 347 ms
[2020-05-12 03:16:28] [INFO ] Deduced a trap composed of 32 places in 196 ms
[2020-05-12 03:16:28] [INFO ] Deduced a trap composed of 32 places in 239 ms
[2020-05-12 03:16:28] [INFO ] Deduced a trap composed of 45 places in 247 ms
[2020-05-12 03:16:28] [INFO ] Deduced a trap composed of 27 places in 251 ms
[2020-05-12 03:16:29] [INFO ] Deduced a trap composed of 41 places in 239 ms
[2020-05-12 03:16:29] [INFO ] Deduced a trap composed of 128 places in 140 ms
[2020-05-12 03:16:29] [INFO ] Deduced a trap composed of 117 places in 228 ms
[2020-05-12 03:16:29] [INFO ] Deduced a trap composed of 132 places in 118 ms
[2020-05-12 03:16:29] [INFO ] Deduced a trap composed of 34 places in 123 ms
[2020-05-12 03:16:30] [INFO ] Deduced a trap composed of 129 places in 120 ms
[2020-05-12 03:16:30] [INFO ] Deduced a trap composed of 113 places in 290 ms
[2020-05-12 03:16:30] [INFO ] Deduced a trap composed of 120 places in 134 ms
[2020-05-12 03:16:30] [INFO ] Deduced a trap composed of 109 places in 244 ms
[2020-05-12 03:16:30] [INFO ] Deduced a trap composed of 121 places in 132 ms
[2020-05-12 03:16:31] [INFO ] Deduced a trap composed of 135 places in 136 ms
[2020-05-12 03:16:31] [INFO ] Deduced a trap composed of 123 places in 238 ms
[2020-05-12 03:16:31] [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 (> (+ s0 s7 s27 s28 s31 s32 s66 s67 s68 s71 s87 s88 s96 s126 s127 s128 s134 s135 s145 s148 s149 s165 s166 s167 s176 s177 s178 s182 s212 s223 s224 s270 s288 s289 s290 s294 s299 s304 s314 s324 s334 s359 s369 s374 s384 s389 s398 s399 s400 s404 s409 s412 s413 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s435 s436 s437 s438 s439 s440 s443 s444 s447 s448 s456 s458 s460 s461 s462 s463 s466 s469 s474 s475 s476 s477 s480 s481 s486 s487 s488 s489 s492 s493 s494 s495 s496 s497 s498 s499 s500 s501 s504 s505 s506 s507 s513 s514 s517 s518 s521 s522 s529 s530 s531 s532 s539 s540 s543 s557 s563 s569) 0)") while checking expression at index 7
Successfully simplified 3 atomic propositions for a total of 6 simplifications.
[2020-05-12 03:16:31] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-12 03:16:31] [INFO ] Flatten gal took : 152 ms
FORMULA BusinessProcesses-PT-12-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 03:16:31] [INFO ] Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 03:16:31] [INFO ] Applying decomposition
[2020-05-12 03:16:31] [INFO ] Flatten gal took : 45 ms
[2020-05-12 03:16:32] [INFO ] Input system was already deterministic with 521 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/graph9219100213956168760.txt, -o, /tmp/graph9219100213956168760.bin, -w, /tmp/graph9219100213956168760.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/graph9219100213956168760.bin, -l, -1, -v, -w, /tmp/graph9219100213956168760.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 03:16:32] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 521 rows 582 cols
[2020-05-12 03:16:32] [INFO ] Computed 98 place invariants in 23 ms
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p123 + p124 + p125 + p482 + p483 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p212 + p213 + p214 + p533 + p534 = 1
inv : p228 + p229 + p230 - p543 - p544 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p174 + p175 + p186 + p187 + p513 + p514 + p583 = 1
inv : -p105 - p106 - p107 + p108 + p109 + p110 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p351 + p352 + p353 + p354 + p355 = 1
inv : p576 + p577 + p578 + p579 - p583 - p584 - p585 = 0
inv : p0 + p1 + p243 + p411 + p412 + p413 + p414 + p415 = 1
inv : p126 + p127 + p128 - p482 - p483 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p33 + p34 + p35 + p441 + p442 = 1
inv : p66 + p67 + p68 - p455 - p456 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p306 + p307 + p308 + p309 + p310 = 1
inv : p0 + p1 + p2 + p3 + p235 + p236 + p237 + p238 = 1
inv : p176 + p177 + p178 + p179 - p513 - p514 + p578 + p579 - p583 - p584 - p585 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p346 + p347 + p348 + p349 + p350 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p296 + p297 + p298 + p299 + p300 = 1
inv : p209 + p210 + p211 - p529 - p530 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p386 + p387 + p388 + p389 + p390 = 1
inv : p203 + p204 + p205 - p525 - p526 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p142 + p143 + p144 + p145 + p146 + p147 + p154 + p155 + p254 + p256 + p257 + p341 + p342 + p344 + p345 - p351 - p352 - p354 - p355 + p356 + p357 + p359 + p360 - p361 - p362 - p364 - p365 - p502 - p503 + p506 + p507 + p578 + p579 - p581 - p582 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p218 + p219 + p220 + p221 + p222 + p539 + p540 = 1
inv : p139 + p140 + p141 - p492 - p493 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p63 + p64 + p65 + p455 + p456 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p376 + p377 + p378 + p379 + p380 = 1
inv : p0 + p1 + p2 + p3 + p4 + p231 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p331 + p332 + p333 + p334 + p335 = 1
inv : p71 + p73 + p75 + p80 + p89 + p90 - p100 - p101 + p102 + p103 + p104 + p105 - p458 - p460 - p462 - p467 + p550 + p551 - p555 - p556 - p557 + p559 + p560 - p561 - p562 - p563 + p565 + p566 - p567 - p568 - p569 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p136 + p137 + p138 + p492 + p493 = 1
inv : p548 + p549 + p550 + p551 - p555 - p556 - p557 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p286 + p287 + p288 + p289 + p290 = 1
inv : p215 + p216 + p217 - p533 - p534 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p69 + p70 + p72 + p74 + p76 + p77 + p78 + p79 + p81 + p82 + p83 + p84 + p85 + p86 + p91 + p92 + p100 + p101 + p106 + p107 + p114 + p115 + p116 - p416 - p417 - p418 - p419 - p420 - p421 - p422 - p423 - p424 - p425 - p426 - p427 - p428 - p429 - p430 - p431 - p432 - p433 - p434 - p435 - p436 - p437 - p438 - p439 - p440 - p441 - p442 - p443 - p444 - p445 - p446 - p447 - p448 - p449 - p450 - p451 - p452 - p453 - p454 - p455 - p456 - p457 - p459 - p461 - p463 - p464 - p465 - p466 - p468 - p469 - p470 - p471 - p472 - p473 - p476 - p477 - p478 - p479 - p480 - p481 - p482 - p483 - p484 - p485 - p486 - p487 - p488 - p489 - p490 - p491 - p492 - p493 - p494 - p495 - p496 - p497 - p498 - p499 - p500 - p501 - p502 - p503 - p504 - p505 - p506 - p507 - p508 - p509 - p510 - p511 - p512 - p513 - p514 - p515 - p516 - p517 - p518 - p519 - p520 - p521 - p522 - p523 - p524 - p525 - p526 - p527 - p528 - p529 - p530 - p531 - p532 - p533 - p534 - p535 - p536 - p537 - p538 - p539 - p540 - p541 - p542 - p543 - p544 - p545 - p546 - p547 - p550 - p551 - p559 - p560 - p565 - p566 - p573 - p574 - p575 - p583 - p584 - p585 = 0
inv : p120 + p121 + p122 - p478 - p479 = 0
inv : p576 + p580 + p581 + p582 - p583 - p584 - p585 = 0
inv : p0 + p1 + p243 + p244 + p406 + p407 + p408 + p409 + p410 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p206 + p207 + p208 + p529 + p530 = 1
inv : p570 + p571 + p572 - p573 - p574 - p575 = 0
inv : p176 + p177 + p185 - p513 - p514 - p583 = 0
inv : p71 + p75 + p77 + p86 + p96 + p105 + p106 + p107 - p109 - p110 + p114 - p458 - p462 - p464 - p473 - p555 - p567 - p573 = 0
inv : p71 + p73 + p77 + p83 + p89 + p93 + p102 - p112 - p113 + p114 + p115 + p116 - p458 - p460 - p464 - p470 + p553 + p554 - p555 - p556 - p557 - p561 - p570 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p142 + p143 + p144 + p145 + p153 + p154 + p155 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p341 + p342 + p343 + p344 + p345 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p174 + p175 + p183 + p184 + p513 + p514 - p581 - p582 + p583 + p584 + p585 = 1
inv : p191 + p192 + p193 - p517 - p518 = 0
inv : p0 + p1 + p2 + p239 + p240 + p241 + p242 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p291 + p292 + p293 + p294 + p295 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p336 + p337 + p338 + p339 + p340 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 = 1
inv : p558 + p559 + p560 - p561 - p562 - p563 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p301 + p302 + p303 + p304 + p305 = 1
inv : p548 + p552 + p553 + p554 - p555 - p556 - p557 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p200 + p201 + p202 + p525 + p526 = 1
inv : p0 + p1 + p243 + p244 + p245 + p401 + p402 + p403 + p404 + p405 = 1
inv : p36 + p37 + p38 - p441 - p442 = 0
inv : p159 + p160 + p161 - p502 - p503 = 0
inv : p0 + p87 + p88 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p555 + p556 + p557 + p561 + p562 + p563 + p567 + p568 + p569 + p573 + p574 + p575 + p583 + p584 + p585 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p316 + p317 + p318 + p319 + p320 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p57 + p58 + p59 + p451 + p452 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p381 + p382 + p383 + p384 + p385 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p174 + p175 + p180 + p181 + p513 + p514 - p578 - p579 + p583 + p584 + p585 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p356 + p357 + p358 + p359 + p360 = 1
inv : p197 + p198 + p199 - p521 - p522 = 0
inv : p165 + p166 + p167 - p506 - p507 = 0
inv : p151 + p152 - p154 - p155 + p253 - p256 - p346 - p347 - p349 - p350 + p351 + p352 + p354 + p355 + p361 + p362 + p364 + p365 - p366 - p367 - p369 - p370 - p506 - p507 + p510 + p511 + p581 + p582 - p584 - p585 = 0
inv : p134 + p135 - p488 - p489 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p162 + p163 + p164 + p506 + p507 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p194 + p195 + p196 + p521 + p522 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p156 + p157 + p158 + p502 + p503 = 1
inv : p171 + p172 + p173 - p510 - p511 = 0
inv : p0 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p555 + p556 + p557 + p561 + p562 + p563 + p567 + p568 + p569 + p573 + p574 + p575 + p583 + p584 + p585 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p366 + p367 + p368 + p369 + p370 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p391 + p392 + p393 + p394 + p395 = 1
inv : p60 + p61 + p62 - p451 - p452 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p281 + p283 + p284 + p285 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p396 + p397 + p398 + p399 + p400 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p326 + p327 + p328 + p329 + p330 = 1
inv : p27 + p28 + p31 + p32 - p432 - p433 - p436 - p437 - p438 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p276 + p277 + p278 + p279 + p280 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p371 + p372 + p373 + p374 + p375 = 1
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p69 + p70 + p72 + p74 + p75 + p76 + p78 + p79 + p80 + p81 + p82 + p84 + p85 + p86 + p94 + p95 + p103 + p104 + p105 + p106 + p107 + p112 + p113 - p416 - p417 - p418 - p419 - p420 - p421 - p422 - p423 - p424 - p425 - p426 - p427 - p428 - p429 - p430 - p431 - p432 - p433 - p434 - p435 - p436 - p437 - p438 - p439 - p440 - p441 - p442 - p443 - p444 - p445 - p446 - p447 - p448 - p449 - p450 - p451 - p452 - p453 - p454 - p455 - p456 - p457 - p459 - p461 - p462 - p463 - p465 - p466 - p467 - p468 - p469 - p471 - p472 - p473 - p476 - p477 - p478 - p479 - p480 - p481 - p482 - p483 - p484 - p485 - p486 - p487 - p488 - p489 - p490 - p491 - p492 - p493 - p494 - p495 - p496 - p497 - p498 - p499 - p500 - p501 - p502 - p503 - p504 - p505 - p506 - p507 - p508 - p509 - p510 - p511 - p512 - p513 - p514 - p515 - p516 - p517 - p518 - p519 - p520 - p521 - p522 - p523 - p524 - p525 - p526 - p527 - p528 - p529 - p530 - p531 - p532 - p533 - p534 - p535 - p536 - p537 - p538 - p539 - p540 - p541 - p542 - p543 - p544 - p545 - p546 - p547 - p553 - p554 - p562 - p563 - p567 - p568 - p569 + p570 - p573 - p574 - p575 - p583 - p584 - p585 = 0
inv : p176 + p177 + p178 + p182 - p513 - p514 + p581 + p582 - p583 - p584 - p585 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p117 + p118 + p119 + p478 + p479 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p129 + p130 + p131 + p132 + p133 + p488 + p489 = 1
inv : p223 + p224 - p539 - p540 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p69 + p70 + p72 + p73 + p74 + p76 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p97 + p98 + p102 + p103 + p104 + p109 + p110 + p115 + p116 - p416 - p417 - p418 - p419 - p420 - p421 - p422 - p423 - p424 - p425 - p426 - p427 - p428 - p429 - p430 - p431 - p432 - p433 - p434 - p435 - p436 - p437 - p438 - p439 - p440 - p441 - p442 - p443 - p444 - p445 - p446 - p447 - p448 - p449 - p450 - p451 - p452 - p453 - p454 - p455 - p456 - p457 - p459 - p460 - p461 - p463 - p465 - p466 - p467 - p468 - p469 - p470 - p471 - p472 - p476 - p477 - p478 - p479 - p480 - p481 - p482 - p483 - p484 - p485 - p486 - p487 - p488 - p489 - p490 - p491 - p492 - p493 - p494 - p495 - p496 - p497 - p498 - p499 - p500 - p501 - p502 - p503 - p504 - p505 - p506 - p507 - p508 - p509 - p510 - p511 - p512 - p513 - p514 - p515 - p516 - p517 - p518 - p519 - p520 - p521 - p522 - p523 - p524 - p525 - p526 - p527 - p528 - p529 - p530 - p531 - p532 - p533 - p534 - p535 - p536 - p537 - p538 - p539 - p540 - p541 - p542 - p543 - p544 - p545 - p546 - p547 - p556 - p557 - p561 - p562 - p563 - p568 - p569 - p574 - p575 - p583 - p584 - p585 = 0
inv : p111 + p112 + p113 - p114 - p115 - p116 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p311 + p312 + p313 + p314 + p315 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p361 + p362 + p363 + p364 + p365 = 1
inv : p564 + p565 + p566 - p567 - p568 - p569 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p321 + p322 + p323 + p324 + p325 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p168 + p169 + p170 + p510 + p511 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p142 + p143 + p144 + p145 + p146 + p150 + p154 + p155 - p253 + p256 + p346 + p347 + p349 + p350 - p351 - p352 - p354 - p355 - p361 - p362 - p364 - p365 + p366 + p367 + p369 + p370 + p506 + p507 - p510 - p511 - p581 - p582 + p584 + p585 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p29 + p30 + p432 + p433 + p436 + p437 + p438 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p225 + p226 + p227 + p543 + p544 = 1
inv : p148 + p149 - p154 - p155 - p254 - p256 - p257 - p341 - p342 - p344 - p345 + p351 + p352 + p354 + p355 - p356 - p357 - p359 - p360 + p361 + p362 + p364 + p365 + p502 + p503 - p506 - p507 - p578 - p579 + p581 + p582 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p188 + p189 + p190 + p517 + p518 = 1
inv : p99 + p100 + p101 - p102 - p103 - p104 = 0
Total of 98 invariants.
[2020-05-12 03:16:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 03:16:32] [INFO ] Computed 98 place invariants in 52 ms
[2020-05-12 03:16:32] [INFO ] Removed a total of 265 redundant transitions.
[2020-05-12 03:16:32] [INFO ] Flatten gal took : 188 ms
[2020-05-12 03:16:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 23 ms.
[2020-05-12 03:16:32] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 9 ms
[2020-05-12 03:16:32] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 11 LTL properties
Checking formula 0 : !((F(!(G(X(F(X(G(X(("(i5.i2.u146.p372==1)")U("((i2.i1.u138.p351==0)||(i4.i5.u162.p411==1))")))))))))))
Formula 0 simplified : !F!GXFXGX("(i5.i2.u146.p372==1)" U "((i2.i1.u138.p351==0)||(i4.i5.u162.p411==1))")
built 58 ordering constraints for composite.
built 18 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 12 ordering constraints for composite.
built 24 ordering constraints for composite.
built 21 ordering constraints for composite.
built 6 ordering constraints for composite.
built 22 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 16 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 22 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 26 ordering constraints for composite.
built 23 ordering constraints for composite.
built 37 ordering constraints for composite.
built 47 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 73 ordering constraints for composite.
built 21 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 20 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 28 ordering constraints for composite.
built 18 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 22 ordering constraints for composite.
built 19 ordering constraints for composite.
built 6 ordering constraints for composite.
built 20 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 29 ordering constraints for composite.
built 17 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
[2020-05-12 03:16:36] [INFO ] Proved 582 variables to be positive in 4301 ms
[2020-05-12 03:16:36] [INFO ] Computing symmetric may disable matrix : 521 transitions.
[2020-05-12 03:16:36] [INFO ] Computation of disable matrix completed :0/521 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 03:16:36] [INFO ] Computation of Complete disable matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 03:16:36] [INFO ] Computing symmetric may enable matrix : 521 transitions.
[2020-05-12 03:16:36] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 03:16:37] [INFO ] Computing symmetric co enabling matrix : 521 transitions.
[2020-05-12 03:16:42] [INFO ] Computation of co-enabling matrix(3/521) took 4921 ms. Total solver calls (SAT/UNSAT): 1052(1052/0)
[2020-05-12 03:16:47] [INFO ] Computation of co-enabling matrix(7/521) took 10233 ms. Total solver calls (SAT/UNSAT): 1690(1210/480)
[2020-05-12 03:16:51] [INFO ] Computation of co-enabling matrix(8/521) took 14116 ms. Total solver calls (SAT/UNSAT): 1962(1270/692)
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown' twice, overapproximating result to 1.
[2020-05-12 03:16:53] [INFO ] Computation of Finished co-enabling matrix. took 16138 ms. Total solver calls (SAT/UNSAT): 2037(1271/766)
[2020-05-12 03:16:53] [INFO ] Computing Do-Not-Accords matrix : 521 transitions.
[2020-05-12 03:17:00] [INFO ] Computation of Completed DNA matrix. took 6624 ms. Total solver calls (SAT/UNSAT): 3111(0/3111)
[2020-05-12 03:17:00] [INFO ] Built C files in 28734ms 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 5185 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 54 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(!( [](X(<>(X([](X(((LTLAP0==true))U((LTLAP1==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, <>(!( [](X(<>(X([](X(((LTLAP0==true))U((LTLAP1==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, <>(!( [](X(<>(X([](X(((LTLAP0==true))U((LTLAP1==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)
Reverse transition relation is NOT exact ! Due to transitions t78, t270, t282, i0.t374, i0.i0.t372, i0.i0.t387, i0.i1.t377, i0.i1.t379, i0.i1.t381, i0.i1.t383, i1.i0.t388, i1.i0.u13.t394, i1.i0.u15.t391, i1.i1.t396, i1.i1.u14.t392, i1.i2.u28.t365, i2.i0.u65.t305, i2.i0.u67.t301, i2.i0.u75.t289, i2.i1.t187, i2.i1.u139.t188, i3.i0.u69.t297, i3.i2.t179, i3.i2.u143.t180, i4.i1.u90.t256, i4.i3.t155, i4.i3.u154.t156, i4.i4.t147, i4.i4.u159.t148, i4.i5.t139, i4.i5.u163.t140, i5.i1.t175, i5.i1.u145.t176, i5.i2.t171, i5.i2.u146.t172, i5.i3.t167, i5.i3.u148.t168, i5.i4.t159, i5.i4.u152.t160, i6.i2.t211, i6.i2.u127.t212, i6.i3.t199, i6.i3.u133.t200, i6.i4.t191, i6.i4.u137.t192, i6.i5.t183, i6.i5.u141.t184, i7.i2.t250, i7.i2.u107.t251, i7.i3.t239, i7.i3.u112.t240, i7.i4.t231, i7.i4.u116.t232, i7.i5.t219, i7.i5.u122.t220, i8.t343, i8.t341, i8.i0.t247, i8.i0.u110.t248, i8.i1.t227, i8.i1.u118.t228, i8.i2.t223, i8.i2.t339, i8.i2.u30.t347, i8.i2.u30.t351, i8.i2.u30.t355, i8.i2.u30.t361, i8.i2.u121.t224, i9.i0.u26.t369, i9.i1.t235, i9.i1.u115.t236, i10.i0.u49.t335, i10.i1.t215, i10.i1.u124.t216, i11.i0.u51.t331, i11.i0.u56.t321, i11.i1.t325, i11.i1.u53.t327, i11.i2.t207, i11.i2.u129.t208, i11.i3.t203, i11.i3.u130.t204, i12.i0.u58.t317, i12.i0.u63.t309, i12.i2.t195, i12.i2.u135.t196, i13.t115, i13.u170.t119, i14.i0.t274, i14.i0.u77.t285, i14.i0.u79.t281, i14.i0.u81.t277, i14.i1.t163, i14.i1.u150.t164, i15.t264, i15.i0.t260, i15.i0.u83.t273, i15.i0.u88.t263, i15.i1.t267, i15.i1.u85.t269, i15.i2.t151, i15.i2.u156.t152, i15.i3.t143, i15.i3.u160.t144, i16.t133, i16.t126, i16.t121, i16.t117, i16.t113, i16.t110, i16.t108, i16.t106, i16.t104, i16.t101, i16.t73, i16.t70, i16.t67, i16.t65, i16.t62, i16.t59, i16.t57, i16.t55, i16.t53, i16.t50, i16.t47, i16.t37, i16.t34, i16.t31, i16.t28, i16.t25, i16.t22, i16.t20, i16.t17, i16.t14, i16.u164.t12, i16.u164.t44, i16.u164.t84, i16.u164.t88, i16.u164.t92, i16.u164.t98, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/343/140/519
Computing Next relation with stutter on 1232 deadlock states
126 unique states visited
126 strongly connected components in search stack
127 transitions explored
126 items max in DFS search stack
9533 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,95.4119,1938444,1,0,3.0724e+06,1166,9139,6.42932e+06,328,5533,7783712
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F("((i16.u223.p545==0)||(i16.u180.p454==1))"))))
Formula 1 simplified : !GF"((i16.u223.p545==0)||(i16.u180.p454==1))"
Computing Next relation with stutter on 1232 deadlock states
124 unique states visited
0 strongly connected components in search stack
246 transitions explored
124 items max in DFS search stack
93 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,96.3348,1969624,1,0,3.17515e+06,1166,9182,6.46685e+06,329,5533,7958428
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-12-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G((G("((i5.i1.u144.p366==0)||(i5.i4.u153.p386==1))"))U("((i5.i1.u144.p366!=0)&&(i5.i4.u153.p386!=1))")))&&(X("((i5.i2.u146.p374==0)||(i6.i2.u126.p321==1))"))))
Formula 2 simplified : !(G(G"((i5.i1.u144.p366==0)||(i5.i4.u153.p386==1))" U "((i5.i1.u144.p366!=0)&&(i5.i4.u153.p386!=1))") & X"((i5.i2.u146.p374==0)||(i6.i2.u126.p321==1))")
Computing Next relation with stutter on 1232 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3443 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,130.767,2405592,1,0,3.84049e+06,1166,4338,7.64899e+06,186,5577,953074
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F(G(!(F("((i8.i0.u35.p80!=0)&&(i15.i0.u89.p230!=1))")))))))
Formula 3 simplified : !XFG!F"((i8.i0.u35.p80!=0)&&(i15.i0.u89.p230!=1))"
Computing Next relation with stutter on 1232 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
5309 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,183.865,2405592,1,0,3.84049e+06,1166,5001,7.64899e+06,202,5577,5087376
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-12-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(((!(F(!(G(X("((i16.u210.p519==0)||(i15.i3.u161.p406==1))"))))))&&("(i3.i1.u70.p177!=0)"))&&("(i4.i1.u91.p238!=1)"))))
Formula 4 simplified : !F("(i3.i1.u70.p177!=0)" & "(i4.i1.u91.p238!=1)" & !F!GX"((i16.u210.p519==0)||(i15.i3.u161.p406==1))")
Computing Next relation with stutter on 1232 deadlock states
123 unique states visited
123 strongly connected components in search stack
123 transitions explored
123 items max in DFS search stack
257 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,186.435,2405976,1,0,3.84049e+06,1166,5099,7.64899e+06,204,5577,5319554
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(X(X(((F("((i16.u214.p528==0)||(i14.i0.u215.p529==1))"))&&("((i11.i3.u131.p335==0)||(i11.i1.u55.p134==1))"))&&("((i2.i0.u76.p192==0)||(i1.i2.u181.p456==1))"))))))
Formula 5 simplified : XX("((i2.i0.u76.p192==0)||(i1.i2.u181.p456==1))" & "((i11.i3.u131.p335==0)||(i11.i1.u55.p134==1))" & F"((i16.u214.p528==0)||(i14.i0.u215.p529==1))")
Computing Next relation with stutter on 1232 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
881 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,195.244,2405976,1,0,3.84049e+06,1166,5139,7.64899e+06,205,5577,6013199
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(X((G("((i11.i0.u8.p18==0)||(i8.i2.u188.p475==1))"))&&(((F(((F(G("((i11.i0.u8.p18==0)||(i8.i2.u188.p475==1))")))||("(i8.i1.u41.p95==0)"))||("(i8.i2.u33.p75==1)")))||("(i8.i1.u41.p95==0)"))||("(i8.i2.u33.p75==1)")))))))
Formula 6 simplified : !GXX(G"((i11.i0.u8.p18==0)||(i8.i2.u188.p475==1))" & ("(i8.i1.u41.p95==0)" | "(i8.i2.u33.p75==1)" | F("(i8.i1.u41.p95==0)" | "(i8.i2.u33.p75==1)" | FG"((i11.i0.u8.p18==0)||(i8.i2.u188.p475==1))")))
Computing Next relation with stutter on 1232 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
376 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,199.002,2405976,1,0,3.84049e+06,1166,5164,7.64899e+06,205,5577,6351381
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G(X("((i16.u219.p538==0)||(i9.i0.u27.p60==1))")))))
Formula 7 simplified : !XGX"((i16.u219.p538==0)||(i9.i0.u27.p60==1))"
Computing Next relation with stutter on 1232 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1209 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,211.094,2531252,1,0,3.92186e+06,1166,5204,7.64899e+06,205,5577,7721224
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(G("(i15.i0.u217.p533==1)"))))
Formula 8 simplified : !FG"(i15.i0.u217.p533==1)"
Computing Next relation with stutter on 1232 deadlock states
Detected timeout of ITS tools.
[2020-05-12 03:37:05] [INFO ] Applying decomposition
[2020-05-12 03:37:05] [INFO ] Flatten gal took : 48 ms
[2020-05-12 03:37:05] [INFO ] Decomposing Gal with order
[2020-05-12 03:37:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 03:37:05] [INFO ] Removed a total of 117 redundant transitions.
[2020-05-12 03:37:05] [INFO ] Flatten gal took : 50 ms
[2020-05-12 03:37:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 199 ms.
[2020-05-12 03:37:05] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 21 ms
[2020-05-12 03:37:05] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((F(G("(i1.u196.p533==1)"))))
Formula 0 simplified : !FG"(i1.u196.p533==1)"
built 2 ordering constraints for composite.
built 132 ordering constraints for composite.
built 75 ordering constraints for composite.
built 74 ordering constraints for composite.
built 73 ordering constraints for composite.
built 73 ordering constraints for composite.
built 71 ordering constraints for composite.
built 68 ordering constraints for composite.
built 66 ordering constraints for composite.
built 64 ordering constraints for composite.
built 62 ordering constraints for composite.
built 60 ordering constraints for composite.
built 58 ordering constraints for composite.
built 54 ordering constraints for composite.
built 52 ordering constraints for composite.
built 50 ordering constraints for composite.
built 48 ordering constraints for composite.
built 44 ordering constraints for composite.
built 42 ordering constraints for composite.
built 39 ordering constraints for composite.
built 37 ordering constraints for composite.
built 35 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 25 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 59 ordering constraints for composite.
built 57 ordering constraints for composite.
built 55 ordering constraints for composite.
built 53 ordering constraints for composite.
built 51 ordering constraints for composite.
built 49 ordering constraints for composite.
built 47 ordering constraints for composite.
built 45 ordering constraints for composite.
built 43 ordering constraints for composite.
built 41 ordering constraints for composite.
built 39 ordering constraints for composite.
built 37 ordering constraints for composite.
built 35 ordering constraints for composite.
built 33 ordering constraints for composite.
built 31 ordering constraints for composite.
built 29 ordering constraints for composite.
built 27 ordering constraints for composite.
built 25 ordering constraints for composite.
built 23 ordering constraints for composite.
built 21 ordering constraints for composite.
built 19 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 80 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-12 03:57:39] [INFO ] Flatten gal took : 503 ms
[2020-05-12 03:57:40] [INFO ] Input system was already deterministic with 521 transitions.
[2020-05-12 03:57:40] [INFO ] Transformed 582 places.
[2020-05-12 03:57:40] [INFO ] Transformed 521 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-12 03:58:10] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 10 ms
[2020-05-12 03:58:10] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], 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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(p533==1)"))))
Formula 0 simplified : !FG"(p533==1)"

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="BusinessProcesses-PT-12"
export BK_EXAMINATION="LTLCardinality"
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 BusinessProcesses-PT-12, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699200537"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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