About the Execution of ITS-Tools for Peterson-PT-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16240.451 | 3600000.00 | 2820896.00 | 467992.00 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128200626.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-5, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200626
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 562K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 612K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 52K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 165K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 60K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 201K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 69K Mar 27 07:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Mar 27 07:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 47K Mar 25 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 154K Mar 25 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 927K May 5 16:51 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 Peterson-PT-5-CTLFireability-00
FORMULA_NAME Peterson-PT-5-CTLFireability-01
FORMULA_NAME Peterson-PT-5-CTLFireability-02
FORMULA_NAME Peterson-PT-5-CTLFireability-03
FORMULA_NAME Peterson-PT-5-CTLFireability-04
FORMULA_NAME Peterson-PT-5-CTLFireability-05
FORMULA_NAME Peterson-PT-5-CTLFireability-06
FORMULA_NAME Peterson-PT-5-CTLFireability-07
FORMULA_NAME Peterson-PT-5-CTLFireability-08
FORMULA_NAME Peterson-PT-5-CTLFireability-09
FORMULA_NAME Peterson-PT-5-CTLFireability-10
FORMULA_NAME Peterson-PT-5-CTLFireability-11
FORMULA_NAME Peterson-PT-5-CTLFireability-12
FORMULA_NAME Peterson-PT-5-CTLFireability-13
FORMULA_NAME Peterson-PT-5-CTLFireability-14
FORMULA_NAME Peterson-PT-5-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1621022095121
Running Version 0
[2021-05-14 19:54:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 19:54:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:54:57] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2021-05-14 19:54:57] [INFO ] Transformed 834 places.
[2021-05-14 19:54:57] [INFO ] Transformed 1242 transitions.
[2021-05-14 19:54:57] [INFO ] Found NUPN structural information;
[2021-05-14 19:54:57] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 160 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 86 ms.
Support contains 834 out of 834 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 23 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2021-05-14 19:54:58] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2021-05-14 19:54:58] [INFO ] Computed 23 place invariants in 24 ms
[2021-05-14 19:54:58] [INFO ] Implicit Places using invariants in 315 ms returned []
[2021-05-14 19:54:58] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2021-05-14 19:54:58] [INFO ] Computed 23 place invariants in 9 ms
[2021-05-14 19:54:58] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 19:54:58] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2021-05-14 19:54:58] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2021-05-14 19:54:58] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-14 19:54:59] [INFO ] Dead Transitions using invariants and state equation in 669 ms returned []
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
[2021-05-14 19:55:00] [INFO ] Flatten gal took : 237 ms
[2021-05-14 19:55:02] [INFO ] Flatten gal took : 254 ms
[2021-05-14 19:55:04] [INFO ] Input system was already deterministic with 1242 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 2112 ms. (steps per millisecond=47 ) properties (out of 92) seen :76
Running SMT prover for 16 properties.
[2021-05-14 19:55:06] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2021-05-14 19:55:06] [INFO ] Computed 23 place invariants in 6 ms
[2021-05-14 19:55:06] [INFO ] [Real]Absence check using 17 positive place invariants in 45 ms returned sat
[2021-05-14 19:55:06] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 14 ms returned sat
[2021-05-14 19:55:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:55:07] [INFO ] [Real]Absence check using state equation in 1193 ms returned sat
[2021-05-14 19:55:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:55:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 49 ms returned sat
[2021-05-14 19:55:07] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 11 ms returned sat
[2021-05-14 19:55:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:55:09] [INFO ] [Nat]Absence check using state equation in 1222 ms returned sat
[2021-05-14 19:55:09] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 19:55:09] [INFO ] [Nat]Added 230 Read/Feed constraints in 59 ms returned sat
[2021-05-14 19:55:09] [INFO ] Deduced a trap composed of 37 places in 360 ms of which 5 ms to minimize.
[2021-05-14 19:55:10] [INFO ] Deduced a trap composed of 53 places in 387 ms of which 1 ms to minimize.
[2021-05-14 19:55:10] [INFO ] Deduced a trap composed of 11 places in 332 ms of which 2 ms to minimize.
[2021-05-14 19:55:10] [INFO ] Deduced a trap composed of 11 places in 365 ms of which 1 ms to minimize.
[2021-05-14 19:55:11] [INFO ] Deduced a trap composed of 11 places in 323 ms of which 2 ms to minimize.
[2021-05-14 19:55:11] [INFO ] Deduced a trap composed of 75 places in 252 ms of which 1 ms to minimize.
[2021-05-14 19:55:11] [INFO ] Deduced a trap composed of 63 places in 270 ms of which 1 ms to minimize.
[2021-05-14 19:55:12] [INFO ] Deduced a trap composed of 27 places in 294 ms of which 1 ms to minimize.
[2021-05-14 19:55:12] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 1 ms to minimize.
[2021-05-14 19:55:12] [INFO ] Deduced a trap composed of 82 places in 275 ms of which 1 ms to minimize.
[2021-05-14 19:55:13] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 1 ms to minimize.
[2021-05-14 19:55:13] [INFO ] Deduced a trap composed of 18 places in 327 ms of which 1 ms to minimize.
[2021-05-14 19:55:13] [INFO ] Deduced a trap composed of 74 places in 193 ms of which 1 ms to minimize.
[2021-05-14 19:55:14] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4750 ms
[2021-05-14 19:55:14] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 66 ms.
[2021-05-14 19:55:28] [INFO ] Deduced a trap composed of 2 places in 406 ms of which 1 ms to minimize.
[2021-05-14 19:55:28] [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 close... while checking expression at index 0
[2021-05-14 19:55:28] [INFO ] [Real]Absence check using 17 positive place invariants in 50 ms returned sat
[2021-05-14 19:55:28] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 11 ms returned sat
[2021-05-14 19:55:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:55:29] [INFO ] [Real]Absence check using state equation in 1048 ms returned sat
[2021-05-14 19:55:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:55:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 38 ms returned sat
[2021-05-14 19:55:29] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-14 19:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:55:30] [INFO ] [Nat]Absence check using state equation in 738 ms returned sat
[2021-05-14 19:55:30] [INFO ] [Nat]Added 230 Read/Feed constraints in 46 ms returned sat
[2021-05-14 19:55:30] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 1 ms to minimize.
[2021-05-14 19:55:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2021-05-14 19:55:30] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 81 ms.
[2021-05-14 19:55:44] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 0 ms to minimize.
[2021-05-14 19:55:45] [INFO ] Deduced a trap composed of 137 places in 260 ms of which 0 ms to minimize.
[2021-05-14 19:55:45] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 0 ms to minimize.
[2021-05-14 19:55:46] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 0 ms to minimize.
[2021-05-14 19:55:46] [INFO ] Deduced a trap composed of 85 places in 247 ms of which 1 ms to minimize.
[2021-05-14 19:55:46] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 1 ms to minimize.
[2021-05-14 19:55:47] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 1 ms to minimize.
[2021-05-14 19:55:47] [INFO ] Deduced a trap composed of 52 places in 248 ms of which 0 ms to minimize.
[2021-05-14 19:55:47] [INFO ] Deduced a trap composed of 127 places in 240 ms of which 1 ms to minimize.
[2021-05-14 19:55:48] [INFO ] Deduced a trap composed of 78 places in 220 ms of which 1 ms to minimize.
[2021-05-14 19:55:48] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 1 ms to minimize.
[2021-05-14 19:55:48] [INFO ] Deduced a trap composed of 56 places in 251 ms of which 1 ms to minimize.
[2021-05-14 19:55:49] [INFO ] Deduced a trap composed of 52 places in 225 ms of which 1 ms to minimize.
[2021-05-14 19:55:49] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 0 ms to minimize.
[2021-05-14 19:55: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: Stream close... while checking expression at index 1
[2021-05-14 19:55:49] [INFO ] [Real]Absence check using 17 positive place invariants in 47 ms returned sat
[2021-05-14 19:55:49] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 14 ms returned sat
[2021-05-14 19:55:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:55:51] [INFO ] [Real]Absence check using state equation in 1330 ms returned sat
[2021-05-14 19:55:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:55:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 81 ms returned sat
[2021-05-14 19:55:51] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 13 ms returned sat
[2021-05-14 19:55:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:55:52] [INFO ] [Nat]Absence check using state equation in 1072 ms returned sat
[2021-05-14 19:55:52] [INFO ] [Nat]Added 230 Read/Feed constraints in 56 ms returned sat
[2021-05-14 19:55:52] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 2 ms to minimize.
[2021-05-14 19:55:53] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 0 ms to minimize.
[2021-05-14 19:55:53] [INFO ] Deduced a trap composed of 62 places in 244 ms of which 1 ms to minimize.
[2021-05-14 19:55:53] [INFO ] Deduced a trap composed of 20 places in 269 ms of which 1 ms to minimize.
[2021-05-14 19:55:54] [INFO ] Deduced a trap composed of 30 places in 267 ms of which 1 ms to minimize.
[2021-05-14 19:55:54] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 5 ms to minimize.
[2021-05-14 19:55:54] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 0 ms to minimize.
[2021-05-14 19:55:54] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 1 ms to minimize.
[2021-05-14 19:55:55] [INFO ] Deduced a trap composed of 62 places in 271 ms of which 0 ms to minimize.
[2021-05-14 19:55:55] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 1 ms to minimize.
[2021-05-14 19:55:55] [INFO ] Deduced a trap composed of 20 places in 254 ms of which 1 ms to minimize.
[2021-05-14 19:55:56] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 1 ms to minimize.
[2021-05-14 19:55:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 3658 ms
[2021-05-14 19:55:56] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 19:55:56] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 19:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:55:56] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2021-05-14 19:55:56] [INFO ] [Real]Added 230 Read/Feed constraints in 41 ms returned sat
[2021-05-14 19:55:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:55:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 19:55:57] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 19:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:55:57] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2021-05-14 19:55:57] [INFO ] [Nat]Added 230 Read/Feed constraints in 49 ms returned sat
[2021-05-14 19:55:57] [INFO ] Deduced a trap composed of 28 places in 317 ms of which 0 ms to minimize.
[2021-05-14 19:55:58] [INFO ] Deduced a trap composed of 43 places in 344 ms of which 1 ms to minimize.
[2021-05-14 19:55:58] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 1 ms to minimize.
[2021-05-14 19:55:58] [INFO ] Deduced a trap composed of 98 places in 233 ms of which 0 ms to minimize.
[2021-05-14 19:55:59] [INFO ] Deduced a trap composed of 117 places in 214 ms of which 0 ms to minimize.
[2021-05-14 19:55:59] [INFO ] Deduced a trap composed of 117 places in 218 ms of which 1 ms to minimize.
[2021-05-14 19:55:59] [INFO ] Deduced a trap composed of 76 places in 192 ms of which 0 ms to minimize.
[2021-05-14 19:55:59] [INFO ] Deduced a trap composed of 79 places in 264 ms of which 1 ms to minimize.
[2021-05-14 19:56:00] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 1 ms to minimize.
[2021-05-14 19:56:00] [INFO ] Deduced a trap composed of 74 places in 227 ms of which 9 ms to minimize.
[2021-05-14 19:56:00] [INFO ] Deduced a trap composed of 49 places in 229 ms of which 0 ms to minimize.
[2021-05-14 19:56:00] [INFO ] Deduced a trap composed of 37 places in 240 ms of which 0 ms to minimize.
[2021-05-14 19:56:01] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 0 ms to minimize.
[2021-05-14 19:56:01] [INFO ] Deduced a trap composed of 63 places in 214 ms of which 1 ms to minimize.
[2021-05-14 19:56:01] [INFO ] Deduced a trap composed of 63 places in 222 ms of which 8 ms to minimize.
[2021-05-14 19:56:02] [INFO ] Deduced a trap composed of 63 places in 234 ms of which 0 ms to minimize.
[2021-05-14 19:56:02] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4565 ms
[2021-05-14 19:56:02] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 70 ms.
[2021-05-14 19:56:16] [INFO ] Deduced a trap composed of 66 places in 221 ms of which 0 ms to minimize.
[2021-05-14 19:56:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2021-05-14 19:56:16] [INFO ] Added : 1033 causal constraints over 207 iterations in 14607 ms. Result :sat
[2021-05-14 19:56:16] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 19:56:16] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 19:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:56:17] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2021-05-14 19:56:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:56:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2021-05-14 19:56:17] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 19:56:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:56:17] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2021-05-14 19:56:17] [INFO ] [Nat]Added 230 Read/Feed constraints in 59 ms returned sat
[2021-05-14 19:56:18] [INFO ] Deduced a trap composed of 56 places in 286 ms of which 1 ms to minimize.
[2021-05-14 19:56:18] [INFO ] Deduced a trap composed of 56 places in 301 ms of which 14 ms to minimize.
[2021-05-14 19:56:18] [INFO ] Deduced a trap composed of 28 places in 298 ms of which 0 ms to minimize.
[2021-05-14 19:56:19] [INFO ] Deduced a trap composed of 41 places in 298 ms of which 1 ms to minimize.
[2021-05-14 19:56:19] [INFO ] Deduced a trap composed of 11 places in 295 ms of which 1 ms to minimize.
[2021-05-14 19:56:19] [INFO ] Deduced a trap composed of 107 places in 263 ms of which 1 ms to minimize.
[2021-05-14 19:56:20] [INFO ] Deduced a trap composed of 115 places in 201 ms of which 1 ms to minimize.
[2021-05-14 19:56:20] [INFO ] Deduced a trap composed of 114 places in 200 ms of which 2 ms to minimize.
[2021-05-14 19:56:20] [INFO ] Deduced a trap composed of 114 places in 201 ms of which 2 ms to minimize.
[2021-05-14 19:56:20] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 8 ms to minimize.
[2021-05-14 19:56:21] [INFO ] Deduced a trap composed of 161 places in 269 ms of which 9 ms to minimize.
[2021-05-14 19:56:21] [INFO ] Deduced a trap composed of 111 places in 262 ms of which 1 ms to minimize.
[2021-05-14 19:56:21] [INFO ] Deduced a trap composed of 79 places in 261 ms of which 0 ms to minimize.
[2021-05-14 19:56:22] [INFO ] Deduced a trap composed of 100 places in 271 ms of which 0 ms to minimize.
[2021-05-14 19:56:22] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 1 ms to minimize.
[2021-05-14 19:56:22] [INFO ] Deduced a trap composed of 26 places in 260 ms of which 1 ms to minimize.
[2021-05-14 19:56:23] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 1 ms to minimize.
[2021-05-14 19:56:23] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 0 ms to minimize.
[2021-05-14 19:56:23] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 0 ms to minimize.
[2021-05-14 19:56:23] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 1 ms to minimize.
[2021-05-14 19:56:24] [INFO ] Deduced a trap composed of 118 places in 259 ms of which 1 ms to minimize.
[2021-05-14 19:56:24] [INFO ] Deduced a trap composed of 216 places in 267 ms of which 0 ms to minimize.
[2021-05-14 19:56:24] [INFO ] Deduced a trap composed of 100 places in 244 ms of which 1 ms to minimize.
[2021-05-14 19:56:25] [INFO ] Deduced a trap composed of 78 places in 229 ms of which 1 ms to minimize.
[2021-05-14 19:56:25] [INFO ] Deduced a trap composed of 82 places in 233 ms of which 1 ms to minimize.
[2021-05-14 19:56:25] [INFO ] Deduced a trap composed of 127 places in 223 ms of which 1 ms to minimize.
[2021-05-14 19:56:25] [INFO ] Deduced a trap composed of 135 places in 222 ms of which 1 ms to minimize.
[2021-05-14 19:56:26] [INFO ] Deduced a trap composed of 56 places in 224 ms of which 1 ms to minimize.
[2021-05-14 19:56:26] [INFO ] Deduced a trap composed of 53 places in 230 ms of which 0 ms to minimize.
[2021-05-14 19:56:26] [INFO ] Deduced a trap composed of 56 places in 223 ms of which 1 ms to minimize.
[2021-05-14 19:56:27] [INFO ] Deduced a trap composed of 82 places in 232 ms of which 1 ms to minimize.
[2021-05-14 19:56:27] [INFO ] Deduced a trap composed of 111 places in 235 ms of which 0 ms to minimize.
[2021-05-14 19:56:27] [INFO ] Deduced a trap composed of 82 places in 264 ms of which 1 ms to minimize.
[2021-05-14 19:56:27] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 0 ms to minimize.
[2021-05-14 19:56:28] [INFO ] Deduced a trap composed of 49 places in 224 ms of which 0 ms to minimize.
[2021-05-14 19:56:28] [INFO ] Deduced a trap composed of 48 places in 261 ms of which 0 ms to minimize.
[2021-05-14 19:56:28] [INFO ] Deduced a trap composed of 30 places in 250 ms of which 1 ms to minimize.
[2021-05-14 19:56:29] [INFO ] Deduced a trap composed of 70 places in 190 ms of which 0 ms to minimize.
[2021-05-14 19:56:29] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 0 ms to minimize.
[2021-05-14 19:56:29] [INFO ] Deduced a trap composed of 63 places in 208 ms of which 0 ms to minimize.
[2021-05-14 19:56:29] [INFO ] Deduced a trap composed of 63 places in 207 ms of which 1 ms to minimize.
[2021-05-14 19:56:30] [INFO ] Deduced a trap composed of 74 places in 221 ms of which 1 ms to minimize.
[2021-05-14 19:56:30] [INFO ] Deduced a trap composed of 82 places in 201 ms of which 1 ms to minimize.
[2021-05-14 19:56:30] [INFO ] Deduced a trap composed of 79 places in 204 ms of which 0 ms to minimize.
[2021-05-14 19:56:30] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 12950 ms
[2021-05-14 19:56:30] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 55 ms.
[2021-05-14 19:56:37] [INFO ] Deduced a trap composed of 2 places in 337 ms of which 0 ms to minimize.
[2021-05-14 19:56:37] [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 close... while checking expression at index 4
[2021-05-14 19:56:37] [INFO ] [Real]Absence check using 17 positive place invariants in 19 ms returned sat
[2021-05-14 19:56:37] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 19:56:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:56:38] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2021-05-14 19:56:38] [INFO ] [Real]Added 230 Read/Feed constraints in 73 ms returned sat
[2021-05-14 19:56:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:56:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 34 ms returned sat
[2021-05-14 19:56:38] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 19:56:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:56:39] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2021-05-14 19:56:39] [INFO ] [Nat]Added 230 Read/Feed constraints in 54 ms returned sat
[2021-05-14 19:56:39] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 1 ms to minimize.
[2021-05-14 19:56:39] [INFO ] Deduced a trap composed of 46 places in 265 ms of which 1 ms to minimize.
[2021-05-14 19:56:39] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 1 ms to minimize.
[2021-05-14 19:56:40] [INFO ] Deduced a trap composed of 62 places in 259 ms of which 0 ms to minimize.
[2021-05-14 19:56:40] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 0 ms to minimize.
[2021-05-14 19:56:40] [INFO ] Deduced a trap composed of 52 places in 233 ms of which 1 ms to minimize.
[2021-05-14 19:56:41] [INFO ] Deduced a trap composed of 142 places in 234 ms of which 0 ms to minimize.
[2021-05-14 19:56:41] [INFO ] Deduced a trap composed of 76 places in 232 ms of which 1 ms to minimize.
[2021-05-14 19:56:41] [INFO ] Deduced a trap composed of 52 places in 243 ms of which 1 ms to minimize.
[2021-05-14 19:56:41] [INFO ] Deduced a trap composed of 48 places in 244 ms of which 0 ms to minimize.
[2021-05-14 19:56:42] [INFO ] Deduced a trap composed of 79 places in 261 ms of which 0 ms to minimize.
[2021-05-14 19:56:42] [INFO ] Deduced a trap composed of 76 places in 251 ms of which 0 ms to minimize.
[2021-05-14 19:56:42] [INFO ] Deduced a trap composed of 125 places in 233 ms of which 1 ms to minimize.
[2021-05-14 19:56:43] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 1 ms to minimize.
[2021-05-14 19:56:43] [INFO ] Deduced a trap composed of 58 places in 202 ms of which 0 ms to minimize.
[2021-05-14 19:56:43] [INFO ] Deduced a trap composed of 55 places in 216 ms of which 0 ms to minimize.
[2021-05-14 19:56:43] [INFO ] Deduced a trap composed of 46 places in 213 ms of which 0 ms to minimize.
[2021-05-14 19:56:44] [INFO ] Deduced a trap composed of 53 places in 248 ms of which 1 ms to minimize.
[2021-05-14 19:56:44] [INFO ] Deduced a trap composed of 91 places in 193 ms of which 1 ms to minimize.
[2021-05-14 19:56:44] [INFO ] Deduced a trap composed of 63 places in 205 ms of which 1 ms to minimize.
[2021-05-14 19:56:44] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 1 ms to minimize.
[2021-05-14 19:56:45] [INFO ] Deduced a trap composed of 43 places in 208 ms of which 0 ms to minimize.
[2021-05-14 19:56:45] [INFO ] Deduced a trap composed of 89 places in 183 ms of which 1 ms to minimize.
[2021-05-14 19:56:45] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6376 ms
[2021-05-14 19:56:45] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 55 ms.
[2021-05-14 19:56:58] [INFO ] Added : 820 causal constraints over 164 iterations in 12924 ms. Result :unknown
[2021-05-14 19:56:58] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 19:56:58] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 19:56:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:56:58] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2021-05-14 19:56:58] [INFO ] [Real]Added 230 Read/Feed constraints in 41 ms returned sat
[2021-05-14 19:56:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:56:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 19:56:59] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 19:56:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:56:59] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2021-05-14 19:56:59] [INFO ] [Nat]Added 230 Read/Feed constraints in 45 ms returned sat
[2021-05-14 19:56:59] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 1 ms to minimize.
[2021-05-14 19:57:00] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 0 ms to minimize.
[2021-05-14 19:57:00] [INFO ] Deduced a trap composed of 54 places in 239 ms of which 1 ms to minimize.
[2021-05-14 19:57:00] [INFO ] Deduced a trap composed of 38 places in 237 ms of which 0 ms to minimize.
[2021-05-14 19:57:00] [INFO ] Deduced a trap composed of 71 places in 238 ms of which 1 ms to minimize.
[2021-05-14 19:57:01] [INFO ] Deduced a trap composed of 79 places in 238 ms of which 1 ms to minimize.
[2021-05-14 19:57:01] [INFO ] Deduced a trap composed of 107 places in 237 ms of which 1 ms to minimize.
[2021-05-14 19:57:01] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 1 ms to minimize.
[2021-05-14 19:57:01] [INFO ] Deduced a trap composed of 102 places in 236 ms of which 0 ms to minimize.
[2021-05-14 19:57:02] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 1 ms to minimize.
[2021-05-14 19:57:02] [INFO ] Deduced a trap composed of 28 places in 226 ms of which 0 ms to minimize.
[2021-05-14 19:57:02] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 1 ms to minimize.
[2021-05-14 19:57:03] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 0 ms to minimize.
[2021-05-14 19:57:03] [INFO ] Deduced a trap composed of 100 places in 196 ms of which 0 ms to minimize.
[2021-05-14 19:57:03] [INFO ] Deduced a trap composed of 115 places in 231 ms of which 0 ms to minimize.
[2021-05-14 19:57:03] [INFO ] Deduced a trap composed of 102 places in 217 ms of which 0 ms to minimize.
[2021-05-14 19:57:04] [INFO ] Deduced a trap composed of 99 places in 216 ms of which 1 ms to minimize.
[2021-05-14 19:57:04] [INFO ] Deduced a trap composed of 96 places in 199 ms of which 0 ms to minimize.
[2021-05-14 19:57:04] [INFO ] Deduced a trap composed of 49 places in 281 ms of which 1 ms to minimize.
[2021-05-14 19:57:04] [INFO ] Deduced a trap composed of 52 places in 270 ms of which 1 ms to minimize.
[2021-05-14 19:57:05] [INFO ] Deduced a trap composed of 49 places in 276 ms of which 1 ms to minimize.
[2021-05-14 19:57:05] [INFO ] Deduced a trap composed of 49 places in 284 ms of which 1 ms to minimize.
[2021-05-14 19:57:05] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
[2021-05-14 19:57:06] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 1 ms to minimize.
[2021-05-14 19:57:06] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6734 ms
[2021-05-14 19:57:06] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 76 ms.
[2021-05-14 19:57:18] [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 ... while checking expression at index 6
[2021-05-14 19:57:19] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 19:57:19] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 19:57:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:57:19] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2021-05-14 19:57:19] [INFO ] [Real]Added 230 Read/Feed constraints in 41 ms returned sat
[2021-05-14 19:57:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:57:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 19:57:19] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 19:57:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:57:19] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2021-05-14 19:57:19] [INFO ] [Nat]Added 230 Read/Feed constraints in 51 ms returned sat
[2021-05-14 19:57:20] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 0 ms to minimize.
[2021-05-14 19:57:20] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 0 ms to minimize.
[2021-05-14 19:57:20] [INFO ] Deduced a trap composed of 30 places in 269 ms of which 1 ms to minimize.
[2021-05-14 19:57:21] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 1 ms to minimize.
[2021-05-14 19:57:21] [INFO ] Deduced a trap composed of 11 places in 284 ms of which 0 ms to minimize.
[2021-05-14 19:57:21] [INFO ] Deduced a trap composed of 52 places in 268 ms of which 1 ms to minimize.
[2021-05-14 19:57:22] [INFO ] Deduced a trap composed of 52 places in 255 ms of which 1 ms to minimize.
[2021-05-14 19:57:22] [INFO ] Deduced a trap composed of 52 places in 269 ms of which 1 ms to minimize.
[2021-05-14 19:57:22] [INFO ] Deduced a trap composed of 52 places in 258 ms of which 1 ms to minimize.
[2021-05-14 19:57:23] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 0 ms to minimize.
[2021-05-14 19:57:23] [INFO ] Deduced a trap composed of 37 places in 254 ms of which 0 ms to minimize.
[2021-05-14 19:57:23] [INFO ] Deduced a trap composed of 37 places in 256 ms of which 1 ms to minimize.
[2021-05-14 19:57:23] [INFO ] Deduced a trap composed of 122 places in 232 ms of which 1 ms to minimize.
[2021-05-14 19:57:24] [INFO ] Deduced a trap composed of 89 places in 182 ms of which 0 ms to minimize.
[2021-05-14 19:57:24] [INFO ] Deduced a trap composed of 96 places in 188 ms of which 0 ms to minimize.
[2021-05-14 19:57:24] [INFO ] Deduced a trap composed of 63 places in 191 ms of which 0 ms to minimize.
[2021-05-14 19:57:24] [INFO ] Deduced a trap composed of 89 places in 186 ms of which 1 ms to minimize.
[2021-05-14 19:57:25] [INFO ] Deduced a trap composed of 97 places in 168 ms of which 0 ms to minimize.
[2021-05-14 19:57:25] [INFO ] Deduced a trap composed of 71 places in 205 ms of which 0 ms to minimize.
[2021-05-14 19:57:25] [INFO ] Deduced a trap composed of 84 places in 211 ms of which 0 ms to minimize.
[2021-05-14 19:57:25] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 1 ms to minimize.
[2021-05-14 19:57:26] [INFO ] Deduced a trap composed of 48 places in 271 ms of which 0 ms to minimize.
[2021-05-14 19:57:26] [INFO ] Deduced a trap composed of 91 places in 274 ms of which 0 ms to minimize.
[2021-05-14 19:57:26] [INFO ] Deduced a trap composed of 68 places in 254 ms of which 0 ms to minimize.
[2021-05-14 19:57:26] [INFO ] Deduced a trap composed of 96 places in 228 ms of which 1 ms to minimize.
[2021-05-14 19:57:27] [INFO ] Deduced a trap composed of 71 places in 245 ms of which 0 ms to minimize.
[2021-05-14 19:57:27] [INFO ] Deduced a trap composed of 63 places in 239 ms of which 1 ms to minimize.
[2021-05-14 19:57:27] [INFO ] Deduced a trap composed of 110 places in 202 ms of which 0 ms to minimize.
[2021-05-14 19:57:28] [INFO ] Deduced a trap composed of 104 places in 196 ms of which 0 ms to minimize.
[2021-05-14 19:57:28] [INFO ] Deduced a trap composed of 105 places in 184 ms of which 1 ms to minimize.
[2021-05-14 19:57:28] [INFO ] Deduced a trap composed of 131 places in 196 ms of which 1 ms to minimize.
[2021-05-14 19:57:28] [INFO ] Deduced a trap composed of 104 places in 151 ms of which 1 ms to minimize.
[2021-05-14 19:57:28] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 0 ms to minimize.
[2021-05-14 19:57:28] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 8991 ms
[2021-05-14 19:57:28] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 57 ms.
[2021-05-14 19:57:39] [INFO ] Deduced a trap composed of 2 places in 329 ms of which 1 ms to minimize.
[2021-05-14 19:57:39] [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 close... while checking expression at index 7
[2021-05-14 19:57:40] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 19:57:40] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 19:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:57:40] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2021-05-14 19:57:40] [INFO ] [Real]Added 230 Read/Feed constraints in 43 ms returned sat
[2021-05-14 19:57:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:57:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 19:57:40] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 19:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:57:40] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2021-05-14 19:57:40] [INFO ] [Nat]Added 230 Read/Feed constraints in 47 ms returned sat
[2021-05-14 19:57:41] [INFO ] Deduced a trap composed of 37 places in 254 ms of which 0 ms to minimize.
[2021-05-14 19:57:41] [INFO ] Deduced a trap composed of 53 places in 271 ms of which 1 ms to minimize.
[2021-05-14 19:57:41] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 0 ms to minimize.
[2021-05-14 19:57:42] [INFO ] Deduced a trap composed of 79 places in 270 ms of which 1 ms to minimize.
[2021-05-14 19:57:42] [INFO ] Deduced a trap composed of 36 places in 261 ms of which 1 ms to minimize.
[2021-05-14 19:57:42] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 1 ms to minimize.
[2021-05-14 19:57:42] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 1 ms to minimize.
[2021-05-14 19:57:43] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 0 ms to minimize.
[2021-05-14 19:57:43] [INFO ] Deduced a trap composed of 41 places in 254 ms of which 1 ms to minimize.
[2021-05-14 19:57:43] [INFO ] Deduced a trap composed of 41 places in 266 ms of which 0 ms to minimize.
[2021-05-14 19:57:44] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 1 ms to minimize.
[2021-05-14 19:57:44] [INFO ] Deduced a trap composed of 39 places in 238 ms of which 1 ms to minimize.
[2021-05-14 19:57:44] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 1 ms to minimize.
[2021-05-14 19:57:45] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 1 ms to minimize.
[2021-05-14 19:57:45] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 0 ms to minimize.
[2021-05-14 19:57:45] [INFO ] Deduced a trap composed of 37 places in 256 ms of which 1 ms to minimize.
[2021-05-14 19:57:45] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 1 ms to minimize.
[2021-05-14 19:57:46] [INFO ] Deduced a trap composed of 96 places in 233 ms of which 1 ms to minimize.
[2021-05-14 19:57:46] [INFO ] Deduced a trap composed of 90 places in 241 ms of which 0 ms to minimize.
[2021-05-14 19:57:46] [INFO ] Deduced a trap composed of 48 places in 262 ms of which 1 ms to minimize.
[2021-05-14 19:57:47] [INFO ] Deduced a trap composed of 122 places in 264 ms of which 1 ms to minimize.
[2021-05-14 19:57:47] [INFO ] Deduced a trap composed of 169 places in 262 ms of which 1 ms to minimize.
[2021-05-14 19:57:47] [INFO ] Deduced a trap composed of 281 places in 266 ms of which 0 ms to minimize.
[2021-05-14 19:57:47] [INFO ] Deduced a trap composed of 51 places in 250 ms of which 1 ms to minimize.
[2021-05-14 19:57:48] [INFO ] Deduced a trap composed of 51 places in 257 ms of which 1 ms to minimize.
[2021-05-14 19:57:48] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 1 ms to minimize.
[2021-05-14 19:57:48] [INFO ] Deduced a trap composed of 52 places in 239 ms of which 0 ms to minimize.
[2021-05-14 19:57:49] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 0 ms to minimize.
[2021-05-14 19:57:49] [INFO ] Deduced a trap composed of 90 places in 231 ms of which 1 ms to minimize.
[2021-05-14 19:57:49] [INFO ] Deduced a trap composed of 90 places in 233 ms of which 0 ms to minimize.
[2021-05-14 19:57:49] [INFO ] Deduced a trap composed of 89 places in 182 ms of which 1 ms to minimize.
[2021-05-14 19:57:50] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 1 ms to minimize.
[2021-05-14 19:57:50] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 1 ms to minimize.
[2021-05-14 19:57:50] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 1 ms to minimize.
[2021-05-14 19:57:50] [INFO ] Deduced a trap composed of 89 places in 187 ms of which 1 ms to minimize.
[2021-05-14 19:57:51] [INFO ] Deduced a trap composed of 96 places in 192 ms of which 0 ms to minimize.
[2021-05-14 19:57:51] [INFO ] Deduced a trap composed of 89 places in 188 ms of which 0 ms to minimize.
[2021-05-14 19:57:51] [INFO ] Deduced a trap composed of 70 places in 191 ms of which 1 ms to minimize.
[2021-05-14 19:57:51] [INFO ] Deduced a trap composed of 102 places in 189 ms of which 0 ms to minimize.
[2021-05-14 19:57:51] [INFO ] Deduced a trap composed of 102 places in 189 ms of which 0 ms to minimize.
[2021-05-14 19:57:52] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 1 ms to minimize.
[2021-05-14 19:57:52] [INFO ] Deduced a trap composed of 58 places in 210 ms of which 1 ms to minimize.
[2021-05-14 19:57:52] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 11619 ms
[2021-05-14 19:57:52] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 69 ms.
[2021-05-14 19:58:00] [INFO ] Deduced a trap composed of 2 places in 311 ms of which 0 ms to minimize.
[2021-05-14 19:58:00] [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 close... while checking expression at index 8
[2021-05-14 19:58:00] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 19:58:00] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 19:58:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:58:01] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2021-05-14 19:58:01] [INFO ] [Real]Added 230 Read/Feed constraints in 43 ms returned sat
[2021-05-14 19:58:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:58:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 19:58:01] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 19:58:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:58:01] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2021-05-14 19:58:01] [INFO ] [Nat]Added 230 Read/Feed constraints in 51 ms returned sat
[2021-05-14 19:58:01] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 1 ms to minimize.
[2021-05-14 19:58:02] [INFO ] Deduced a trap composed of 11 places in 296 ms of which 1 ms to minimize.
[2021-05-14 19:58:02] [INFO ] Deduced a trap composed of 11 places in 312 ms of which 1 ms to minimize.
[2021-05-14 19:58:03] [INFO ] Deduced a trap composed of 11 places in 302 ms of which 0 ms to minimize.
[2021-05-14 19:58:03] [INFO ] Deduced a trap composed of 41 places in 305 ms of which 16 ms to minimize.
[2021-05-14 19:58:03] [INFO ] Deduced a trap composed of 32 places in 312 ms of which 1 ms to minimize.
[2021-05-14 19:58:04] [INFO ] Deduced a trap composed of 78 places in 281 ms of which 0 ms to minimize.
[2021-05-14 19:58:04] [INFO ] Deduced a trap composed of 78 places in 286 ms of which 0 ms to minimize.
[2021-05-14 19:58:04] [INFO ] Deduced a trap composed of 104 places in 292 ms of which 1 ms to minimize.
[2021-05-14 19:58:04] [INFO ] Deduced a trap composed of 83 places in 276 ms of which 0 ms to minimize.
[2021-05-14 19:58:05] [INFO ] Deduced a trap composed of 52 places in 254 ms of which 1 ms to minimize.
[2021-05-14 19:58:05] [INFO ] Deduced a trap composed of 104 places in 209 ms of which 1 ms to minimize.
[2021-05-14 19:58:05] [INFO ] Deduced a trap composed of 104 places in 192 ms of which 1 ms to minimize.
[2021-05-14 19:58:06] [INFO ] Deduced a trap composed of 130 places in 193 ms of which 0 ms to minimize.
[2021-05-14 19:58:06] [INFO ] Deduced a trap composed of 101 places in 220 ms of which 1 ms to minimize.
[2021-05-14 19:58:06] [INFO ] Deduced a trap composed of 169 places in 213 ms of which 1 ms to minimize.
[2021-05-14 19:58:06] [INFO ] Deduced a trap composed of 105 places in 197 ms of which 1 ms to minimize.
[2021-05-14 19:58:07] [INFO ] Deduced a trap composed of 131 places in 196 ms of which 0 ms to minimize.
[2021-05-14 19:58:07] [INFO ] Deduced a trap composed of 130 places in 210 ms of which 0 ms to minimize.
[2021-05-14 19:58:07] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5632 ms
[2021-05-14 19:58:07] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 59 ms.
[2021-05-14 19:58:18] [INFO ] Deduced a trap composed of 28 places in 263 ms of which 1 ms to minimize.
[2021-05-14 19:58:19] [INFO ] Deduced a trap composed of 15 places in 261 ms of which 2 ms to minimize.
[2021-05-14 19:58:19] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 1 ms to minimize.
[2021-05-14 19:58:19] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 1 ms to minimize.
[2021-05-14 19:58:19] [INFO ] Deduced a trap composed of 193 places in 141 ms of which 0 ms to minimize.
[2021-05-14 19:58:20] [INFO ] Deduced a trap composed of 142 places in 146 ms of which 1 ms to minimize.
[2021-05-14 19:58:20] [INFO ] Deduced a trap composed of 113 places in 144 ms of which 0 ms to minimize.
[2021-05-14 19:58:20] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 1 ms to minimize.
[2021-05-14 19:58:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2192 ms
[2021-05-14 19:58:20] [INFO ] Added : 880 causal constraints over 177 iterations in 13491 ms. Result :sat
[2021-05-14 19:58:20] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 19:58:20] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 19:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:58:21] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2021-05-14 19:58:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:58:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 19:58:21] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 19:58:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:58:21] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2021-05-14 19:58:21] [INFO ] [Nat]Added 230 Read/Feed constraints in 49 ms returned sat
[2021-05-14 19:58:22] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 1 ms to minimize.
[2021-05-14 19:58:22] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 4 ms to minimize.
[2021-05-14 19:58:22] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 0 ms to minimize.
[2021-05-14 19:58:22] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 1 ms to minimize.
[2021-05-14 19:58:23] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 1 ms to minimize.
[2021-05-14 19:58:23] [INFO ] Deduced a trap composed of 74 places in 291 ms of which 1 ms to minimize.
[2021-05-14 19:58:23] [INFO ] Deduced a trap composed of 74 places in 274 ms of which 1 ms to minimize.
[2021-05-14 19:58:24] [INFO ] Deduced a trap composed of 75 places in 267 ms of which 1 ms to minimize.
[2021-05-14 19:58:24] [INFO ] Deduced a trap composed of 63 places in 265 ms of which 0 ms to minimize.
[2021-05-14 19:58:24] [INFO ] Deduced a trap composed of 75 places in 268 ms of which 0 ms to minimize.
[2021-05-14 19:58:25] [INFO ] Deduced a trap composed of 73 places in 224 ms of which 0 ms to minimize.
[2021-05-14 19:58:25] [INFO ] Deduced a trap composed of 73 places in 225 ms of which 0 ms to minimize.
[2021-05-14 19:58:25] [INFO ] Deduced a trap composed of 102 places in 214 ms of which 0 ms to minimize.
[2021-05-14 19:58:25] [INFO ] Deduced a trap composed of 73 places in 221 ms of which 1 ms to minimize.
[2021-05-14 19:58:26] [INFO ] Deduced a trap composed of 97 places in 216 ms of which 0 ms to minimize.
[2021-05-14 19:58:26] [INFO ] Deduced a trap composed of 97 places in 215 ms of which 0 ms to minimize.
[2021-05-14 19:58:26] [INFO ] Deduced a trap composed of 115 places in 224 ms of which 0 ms to minimize.
[2021-05-14 19:58:26] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 0 ms to minimize.
[2021-05-14 19:58:27] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 0 ms to minimize.
[2021-05-14 19:58:27] [INFO ] Deduced a trap composed of 115 places in 226 ms of which 0 ms to minimize.
[2021-05-14 19:58:27] [INFO ] Deduced a trap composed of 73 places in 215 ms of which 1 ms to minimize.
[2021-05-14 19:58:27] [INFO ] Deduced a trap composed of 69 places in 235 ms of which 1 ms to minimize.
[2021-05-14 19:58:28] [INFO ] Deduced a trap composed of 51 places in 264 ms of which 0 ms to minimize.
[2021-05-14 19:58:28] [INFO ] Deduced a trap composed of 73 places in 212 ms of which 0 ms to minimize.
[2021-05-14 19:58:28] [INFO ] Deduced a trap composed of 73 places in 229 ms of which 1 ms to minimize.
[2021-05-14 19:58:29] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 1 ms to minimize.
[2021-05-14 19:58:29] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 0 ms to minimize.
[2021-05-14 19:58:29] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 1 ms to minimize.
[2021-05-14 19:58:29] [INFO ] Deduced a trap composed of 56 places in 239 ms of which 1 ms to minimize.
[2021-05-14 19:58:30] [INFO ] Deduced a trap composed of 89 places in 187 ms of which 0 ms to minimize.
[2021-05-14 19:58:30] [INFO ] Deduced a trap composed of 115 places in 181 ms of which 1 ms to minimize.
[2021-05-14 19:58:30] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 0 ms to minimize.
[2021-05-14 19:58:30] [INFO ] Deduced a trap composed of 115 places in 197 ms of which 1 ms to minimize.
[2021-05-14 19:58:30] [INFO ] Deduced a trap composed of 115 places in 182 ms of which 0 ms to minimize.
[2021-05-14 19:58:31] [INFO ] Deduced a trap composed of 26 places in 232 ms of which 1 ms to minimize.
[2021-05-14 19:58:31] [INFO ] Deduced a trap composed of 74 places in 241 ms of which 1 ms to minimize.
[2021-05-14 19:58:31] [INFO ] Deduced a trap composed of 56 places in 224 ms of which 0 ms to minimize.
[2021-05-14 19:58:32] [INFO ] Deduced a trap composed of 48 places in 231 ms of which 0 ms to minimize.
[2021-05-14 19:58:32] [INFO ] Deduced a trap composed of 56 places in 225 ms of which 0 ms to minimize.
[2021-05-14 19:58:32] [INFO ] Deduced a trap composed of 89 places in 215 ms of which 0 ms to minimize.
[2021-05-14 19:58:33] [INFO ] Deduced a trap composed of 89 places in 224 ms of which 1 ms to minimize.
[2021-05-14 19:58:33] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 0 ms to minimize.
[2021-05-14 19:58:33] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 0 ms to minimize.
[2021-05-14 19:58:33] [INFO ] Deduced a trap composed of 75 places in 168 ms of which 1 ms to minimize.
[2021-05-14 19:58:33] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 0 ms to minimize.
[2021-05-14 19:58:34] [INFO ] Deduced a trap composed of 63 places in 169 ms of which 1 ms to minimize.
[2021-05-14 19:58:34] [INFO ] Deduced a trap composed of 94 places in 154 ms of which 1 ms to minimize.
[2021-05-14 19:58:34] [INFO ] Deduced a trap composed of 125 places in 142 ms of which 0 ms to minimize.
[2021-05-14 19:58:34] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 0 ms to minimize.
[2021-05-14 19:58:35] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 1 ms to minimize.
[2021-05-14 19:58:35] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 1 ms to minimize.
[2021-05-14 19:58:36] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 1 ms to minimize.
[2021-05-14 19:58:37] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 15268 ms
[2021-05-14 19:58:37] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 55 ms.
[2021-05-14 19:58:41] [INFO ] Added : 385 causal constraints over 77 iterations in 4235 ms. Result :unknown
[2021-05-14 19:58:41] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 19:58:41] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 19:58:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:58:41] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2021-05-14 19:58:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:58:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 19:58:41] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 19:58:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:58:42] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2021-05-14 19:58:42] [INFO ] [Nat]Added 230 Read/Feed constraints in 45 ms returned sat
[2021-05-14 19:58:42] [INFO ] Deduced a trap composed of 67 places in 238 ms of which 1 ms to minimize.
[2021-05-14 19:58:42] [INFO ] Deduced a trap composed of 67 places in 267 ms of which 1 ms to minimize.
[2021-05-14 19:58:43] [INFO ] Deduced a trap composed of 15 places in 249 ms of which 0 ms to minimize.
[2021-05-14 19:58:43] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 1 ms to minimize.
[2021-05-14 19:58:43] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 1 ms to minimize.
[2021-05-14 19:58:43] [INFO ] Deduced a trap composed of 15 places in 249 ms of which 1 ms to minimize.
[2021-05-14 19:58:44] [INFO ] Deduced a trap composed of 102 places in 250 ms of which 1 ms to minimize.
[2021-05-14 19:58:44] [INFO ] Deduced a trap composed of 67 places in 268 ms of which 1 ms to minimize.
[2021-05-14 19:58:44] [INFO ] Deduced a trap composed of 67 places in 267 ms of which 1 ms to minimize.
[2021-05-14 19:58:45] [INFO ] Deduced a trap composed of 14 places in 265 ms of which 0 ms to minimize.
[2021-05-14 19:58:45] [INFO ] Deduced a trap composed of 195 places in 222 ms of which 1 ms to minimize.
[2021-05-14 19:58:45] [INFO ] Deduced a trap composed of 100 places in 156 ms of which 0 ms to minimize.
[2021-05-14 19:58:45] [INFO ] Deduced a trap composed of 156 places in 136 ms of which 0 ms to minimize.
[2021-05-14 19:58:45] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 1 ms to minimize.
[2021-05-14 19:58:46] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 1 ms to minimize.
[2021-05-14 19:58:46] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 1 ms to minimize.
[2021-05-14 19:58:46] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 1 ms to minimize.
[2021-05-14 19:58:46] [INFO ] Deduced a trap composed of 74 places in 247 ms of which 0 ms to minimize.
[2021-05-14 19:58:47] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 1 ms to minimize.
[2021-05-14 19:58:47] [INFO ] Deduced a trap composed of 119 places in 192 ms of which 1 ms to minimize.
[2021-05-14 19:58:47] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 1 ms to minimize.
[2021-05-14 19:58:47] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5429 ms
[2021-05-14 19:58:47] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 57 ms.
[2021-05-14 19:58:59] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 1 ms to minimize.
[2021-05-14 19:59:00] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 1 ms to minimize.
[2021-05-14 19:59:00] [INFO ] Deduced a trap composed of 75 places in 163 ms of which 1 ms to minimize.
[2021-05-14 19:59:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 927 ms
[2021-05-14 19:59:00] [INFO ] Added : 944 causal constraints over 189 iterations in 13055 ms. Result :sat
[2021-05-14 19:59:00] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 19:59:00] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 19:59:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:01] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2021-05-14 19:59:01] [INFO ] [Real]Added 230 Read/Feed constraints in 39 ms returned sat
[2021-05-14 19:59:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:59:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 19:59:01] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 19:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:01] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2021-05-14 19:59:01] [INFO ] [Nat]Added 230 Read/Feed constraints in 47 ms returned sat
[2021-05-14 19:59:01] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 0 ms to minimize.
[2021-05-14 19:59:02] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 1 ms to minimize.
[2021-05-14 19:59:02] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 1 ms to minimize.
[2021-05-14 19:59:02] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 0 ms to minimize.
[2021-05-14 19:59:02] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 0 ms to minimize.
[2021-05-14 19:59:03] [INFO ] Deduced a trap composed of 50 places in 229 ms of which 0 ms to minimize.
[2021-05-14 19:59:03] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 0 ms to minimize.
[2021-05-14 19:59:03] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 1 ms to minimize.
[2021-05-14 19:59:04] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 1 ms to minimize.
[2021-05-14 19:59:04] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2021-05-14 19:59:04] [INFO ] Deduced a trap composed of 68 places in 213 ms of which 0 ms to minimize.
[2021-05-14 19:59:04] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 1 ms to minimize.
[2021-05-14 19:59:05] [INFO ] Deduced a trap composed of 28 places in 783 ms of which 0 ms to minimize.
[2021-05-14 19:59:05] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 0 ms to minimize.
[2021-05-14 19:59:06] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 1 ms to minimize.
[2021-05-14 19:59:06] [INFO ] Deduced a trap composed of 181 places in 264 ms of which 1 ms to minimize.
[2021-05-14 19:59:06] [INFO ] Deduced a trap composed of 58 places in 197 ms of which 0 ms to minimize.
[2021-05-14 19:59:06] [INFO ] Deduced a trap composed of 70 places in 205 ms of which 1 ms to minimize.
[2021-05-14 19:59:07] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 1 ms to minimize.
[2021-05-14 19:59:07] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 1 ms to minimize.
[2021-05-14 19:59:07] [INFO ] Deduced a trap composed of 43 places in 205 ms of which 1 ms to minimize.
[2021-05-14 19:59:07] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 1 ms to minimize.
[2021-05-14 19:59:08] [INFO ] Deduced a trap composed of 119 places in 204 ms of which 0 ms to minimize.
[2021-05-14 19:59:08] [INFO ] Deduced a trap composed of 119 places in 207 ms of which 0 ms to minimize.
[2021-05-14 19:59:08] [INFO ] Deduced a trap composed of 58 places in 142 ms of which 0 ms to minimize.
[2021-05-14 19:59:08] [INFO ] Deduced a trap composed of 58 places in 141 ms of which 0 ms to minimize.
[2021-05-14 19:59:08] [INFO ] Deduced a trap composed of 58 places in 149 ms of which 0 ms to minimize.
[2021-05-14 19:59:09] [INFO ] Deduced a trap composed of 76 places in 146 ms of which 1 ms to minimize.
[2021-05-14 19:59:09] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 0 ms to minimize.
[2021-05-14 19:59:09] [INFO ] Deduced a trap composed of 73 places in 231 ms of which 1 ms to minimize.
[2021-05-14 19:59:09] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 0 ms to minimize.
[2021-05-14 19:59:09] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 8320 ms
[2021-05-14 19:59:10] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 54 ms.
[2021-05-14 19:59:21] [INFO ] Added : 895 causal constraints over 179 iterations in 11244 ms. Result :unknown
[2021-05-14 19:59:21] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 19:59:21] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 19:59:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:21] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2021-05-14 19:59:21] [INFO ] [Real]Added 230 Read/Feed constraints in 42 ms returned sat
[2021-05-14 19:59:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:59:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2021-05-14 19:59:22] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 19:59:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:22] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2021-05-14 19:59:22] [INFO ] [Nat]Added 230 Read/Feed constraints in 49 ms returned sat
[2021-05-14 19:59:22] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 0 ms to minimize.
[2021-05-14 19:59:23] [INFO ] Deduced a trap composed of 36 places in 262 ms of which 0 ms to minimize.
[2021-05-14 19:59:23] [INFO ] Deduced a trap composed of 36 places in 256 ms of which 1 ms to minimize.
[2021-05-14 19:59:23] [INFO ] Deduced a trap composed of 36 places in 265 ms of which 0 ms to minimize.
[2021-05-14 19:59:23] [INFO ] Deduced a trap composed of 36 places in 282 ms of which 1 ms to minimize.
[2021-05-14 19:59:24] [INFO ] Deduced a trap composed of 181 places in 252 ms of which 1 ms to minimize.
[2021-05-14 19:59:24] [INFO ] Deduced a trap composed of 71 places in 270 ms of which 0 ms to minimize.
[2021-05-14 19:59:24] [INFO ] Deduced a trap composed of 107 places in 264 ms of which 1 ms to minimize.
[2021-05-14 19:59:25] [INFO ] Deduced a trap composed of 94 places in 272 ms of which 0 ms to minimize.
[2021-05-14 19:59:25] [INFO ] Deduced a trap composed of 56 places in 286 ms of which 0 ms to minimize.
[2021-05-14 19:59:25] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 0 ms to minimize.
[2021-05-14 19:59:26] [INFO ] Deduced a trap composed of 56 places in 217 ms of which 1 ms to minimize.
[2021-05-14 19:59:26] [INFO ] Deduced a trap composed of 56 places in 217 ms of which 0 ms to minimize.
[2021-05-14 19:59:26] [INFO ] Deduced a trap composed of 82 places in 219 ms of which 0 ms to minimize.
[2021-05-14 19:59:26] [INFO ] Deduced a trap composed of 45 places in 227 ms of which 1 ms to minimize.
[2021-05-14 19:59:27] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 1 ms to minimize.
[2021-05-14 19:59:27] [INFO ] Deduced a trap composed of 82 places in 215 ms of which 1 ms to minimize.
[2021-05-14 19:59:27] [INFO ] Deduced a trap composed of 57 places in 204 ms of which 1 ms to minimize.
[2021-05-14 19:59:28] [INFO ] Deduced a trap composed of 30 places in 265 ms of which 1 ms to minimize.
[2021-05-14 19:59:28] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 0 ms to minimize.
[2021-05-14 19:59:28] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 1 ms to minimize.
[2021-05-14 19:59:28] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 1 ms to minimize.
[2021-05-14 19:59:29] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 1 ms to minimize.
[2021-05-14 19:59:29] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 1 ms to minimize.
[2021-05-14 19:59:29] [INFO ] Deduced a trap composed of 193 places in 194 ms of which 1 ms to minimize.
[2021-05-14 19:59:29] [INFO ] Deduced a trap composed of 70 places in 196 ms of which 0 ms to minimize.
[2021-05-14 19:59:29] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 7565 ms
[2021-05-14 19:59:30] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 56 ms.
[2021-05-14 19:59:41] [INFO ] Added : 920 causal constraints over 184 iterations in 11895 ms. Result :unknown
[2021-05-14 19:59:42] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 19:59:42] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 19:59:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:42] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2021-05-14 19:59:42] [INFO ] [Real]Added 230 Read/Feed constraints in 37 ms returned sat
[2021-05-14 19:59:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:59:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 19:59:42] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 19:59:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:42] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2021-05-14 19:59:42] [INFO ] [Nat]Added 230 Read/Feed constraints in 40 ms returned sat
[2021-05-14 19:59:43] [INFO ] Deduced a trap composed of 58 places in 266 ms of which 0 ms to minimize.
[2021-05-14 19:59:43] [INFO ] Deduced a trap composed of 98 places in 278 ms of which 1 ms to minimize.
[2021-05-14 19:59:43] [INFO ] Deduced a trap composed of 98 places in 271 ms of which 1 ms to minimize.
[2021-05-14 19:59:44] [INFO ] Deduced a trap composed of 11 places in 281 ms of which 1 ms to minimize.
[2021-05-14 19:59:44] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 0 ms to minimize.
[2021-05-14 19:59:44] [INFO ] Deduced a trap composed of 56 places in 278 ms of which 1 ms to minimize.
[2021-05-14 19:59:45] [INFO ] Deduced a trap composed of 72 places in 287 ms of which 1 ms to minimize.
[2021-05-14 19:59:45] [INFO ] Deduced a trap composed of 72 places in 287 ms of which 1 ms to minimize.
[2021-05-14 19:59:45] [INFO ] Deduced a trap composed of 72 places in 322 ms of which 1 ms to minimize.
[2021-05-14 19:59:46] [INFO ] Deduced a trap composed of 72 places in 269 ms of which 1 ms to minimize.
[2021-05-14 19:59:46] [INFO ] Deduced a trap composed of 72 places in 311 ms of which 1 ms to minimize.
[2021-05-14 19:59:46] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 1 ms to minimize.
[2021-05-14 19:59:47] [INFO ] Deduced a trap composed of 123 places in 251 ms of which 0 ms to minimize.
[2021-05-14 19:59:47] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 0 ms to minimize.
[2021-05-14 19:59:47] [INFO ] Deduced a trap composed of 139 places in 243 ms of which 0 ms to minimize.
[2021-05-14 19:59:47] [INFO ] Deduced a trap composed of 88 places in 257 ms of which 0 ms to minimize.
[2021-05-14 19:59:48] [INFO ] Deduced a trap composed of 48 places in 245 ms of which 0 ms to minimize.
[2021-05-14 19:59:48] [INFO ] Deduced a trap composed of 37 places in 252 ms of which 1 ms to minimize.
[2021-05-14 19:59:48] [INFO ] Deduced a trap composed of 49 places in 238 ms of which 1 ms to minimize.
[2021-05-14 19:59:49] [INFO ] Deduced a trap composed of 70 places in 240 ms of which 0 ms to minimize.
[2021-05-14 19:59:49] [INFO ] Deduced a trap composed of 56 places in 256 ms of which 1 ms to minimize.
[2021-05-14 19:59:49] [INFO ] Deduced a trap composed of 52 places in 252 ms of which 1 ms to minimize.
[2021-05-14 19:59:49] [INFO ] Deduced a trap composed of 145 places in 176 ms of which 1 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 101 places in 174 ms of which 0 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 128 places in 173 ms of which 1 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 7354 ms
[2021-05-14 19:59:50] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 64 ms.
[2021-05-14 20:00:01] [INFO ] Deduced a trap composed of 144 places in 257 ms of which 1 ms to minimize.
[2021-05-14 20:00:01] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 0 ms to minimize.
[2021-05-14 20:00:01] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 0 ms to minimize.
[2021-05-14 20:00:02] [INFO ] Deduced a trap composed of 55 places in 248 ms of which 1 ms to minimize.
[2021-05-14 20:00:02] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 1 ms to minimize.
[2021-05-14 20:00:02] [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 close... while checking expression at index 14
[2021-05-14 20:00:02] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:00:02] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:00:03] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2021-05-14 20:00:03] [INFO ] [Real]Added 230 Read/Feed constraints in 41 ms returned sat
[2021-05-14 20:00:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:00:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2021-05-14 20:00:03] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:00:03] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2021-05-14 20:00:03] [INFO ] [Nat]Added 230 Read/Feed constraints in 53 ms returned sat
[2021-05-14 20:00:04] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 1 ms to minimize.
[2021-05-14 20:00:04] [INFO ] Deduced a trap composed of 37 places in 281 ms of which 1 ms to minimize.
[2021-05-14 20:00:04] [INFO ] Deduced a trap composed of 37 places in 286 ms of which 1 ms to minimize.
[2021-05-14 20:00:04] [INFO ] Deduced a trap composed of 37 places in 279 ms of which 1 ms to minimize.
[2021-05-14 20:00:05] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 1 ms to minimize.
[2021-05-14 20:00:05] [INFO ] Deduced a trap composed of 66 places in 275 ms of which 1 ms to minimize.
[2021-05-14 20:00:05] [INFO ] Deduced a trap composed of 11 places in 287 ms of which 1 ms to minimize.
[2021-05-14 20:00:06] [INFO ] Deduced a trap composed of 18 places in 284 ms of which 1 ms to minimize.
[2021-05-14 20:00:06] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 1 ms to minimize.
[2021-05-14 20:00:06] [INFO ] Deduced a trap composed of 113 places in 284 ms of which 1 ms to minimize.
[2021-05-14 20:00:07] [INFO ] Deduced a trap composed of 63 places in 272 ms of which 1 ms to minimize.
[2021-05-14 20:00:07] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 1 ms to minimize.
[2021-05-14 20:00:07] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 1 ms to minimize.
[2021-05-14 20:00:08] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 1 ms to minimize.
[2021-05-14 20:00:08] [INFO ] Deduced a trap composed of 84 places in 247 ms of which 0 ms to minimize.
[2021-05-14 20:00:08] [INFO ] Deduced a trap composed of 127 places in 226 ms of which 1 ms to minimize.
[2021-05-14 20:00:08] [INFO ] Deduced a trap composed of 76 places in 232 ms of which 1 ms to minimize.
[2021-05-14 20:00:09] [INFO ] Deduced a trap composed of 94 places in 240 ms of which 0 ms to minimize.
[2021-05-14 20:00:09] [INFO ] Deduced a trap composed of 84 places in 238 ms of which 1 ms to minimize.
[2021-05-14 20:00:09] [INFO ] Deduced a trap composed of 37 places in 237 ms of which 1 ms to minimize.
[2021-05-14 20:00:09] [INFO ] Deduced a trap composed of 110 places in 240 ms of which 1 ms to minimize.
[2021-05-14 20:00:10] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 1 ms to minimize.
[2021-05-14 20:00:10] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 0 ms to minimize.
[2021-05-14 20:00:10] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 0 ms to minimize.
[2021-05-14 20:00:11] [INFO ] Deduced a trap composed of 70 places in 188 ms of which 0 ms to minimize.
[2021-05-14 20:00:11] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 7384 ms
[2021-05-14 20:00:11] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 66 ms.
[2021-05-14 20:00:22] [INFO ] Deduced a trap composed of 14 places in 250 ms of which 1 ms to minimize.
[2021-05-14 20:00:22] [INFO ] Deduced a trap composed of 108 places in 256 ms of which 1 ms to minimize.
[2021-05-14 20:00:23] [INFO ] Deduced a trap composed of 47 places in 252 ms of which 0 ms to minimize.
[2021-05-14 20:00:23] [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 close... while checking expression at index 15
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 834 transition count 1241
Reduce places removed 1 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 31 rules applied. Total rules applied 32 place count 833 transition count 1211
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 62 place count 803 transition count 1211
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 72 place count 798 transition count 1206
Applied a total of 72 rules in 96 ms. Remains 798 /834 variables (removed 36) and now considering 1206/1242 (removed 36) transitions.
[2021-05-14 20:00:23] [INFO ] Flatten gal took : 48 ms
[2021-05-14 20:00:23] [INFO ] Flatten gal took : 52 ms
[2021-05-14 20:00:23] [INFO ] Input system was already deterministic with 1206 transitions.
[2021-05-14 20:00:24] [INFO ] Flatten gal took : 44 ms
[2021-05-14 20:00:24] [INFO ] Flatten gal took : 42 ms
[2021-05-14 20:00:24] [INFO ] Time to serialize gal into /tmp/CTLFireability11260158186414544305.gal : 9 ms
[2021-05-14 20:00:24] [INFO ] Time to serialize properties into /tmp/CTLFireability17108169511537097634.ctl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11260158186414544305.gal, -t, CGAL, -ctl, /tmp/CTLFireability17108169511537097634.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11260158186414544305.gal -t CGAL -ctl /tmp/CTLFireability17108169511537097634.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 20:00:54] [INFO ] Flatten gal took : 78 ms
[2021-05-14 20:00:54] [INFO ] Applying decomposition
[2021-05-14 20:00:54] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3957267113751429899.txt, -o, /tmp/graph3957267113751429899.bin, -w, /tmp/graph3957267113751429899.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3957267113751429899.bin, -l, -1, -v, -w, /tmp/graph3957267113751429899.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 20:00:54] [INFO ] Decomposing Gal with order
[2021-05-14 20:00:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:00:54] [INFO ] Removed a total of 1033 redundant transitions.
[2021-05-14 20:00:54] [INFO ] Flatten gal took : 132 ms
[2021-05-14 20:00:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-05-14 20:00:55] [INFO ] Time to serialize gal into /tmp/CTLFireability12680184450953924306.gal : 14 ms
[2021-05-14 20:00:55] [INFO ] Time to serialize properties into /tmp/CTLFireability18009978777888398588.ctl : 9 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability12680184450953924306.gal, -t, CGAL, -ctl, /tmp/CTLFireability18009978777888398588.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability12680184450953924306.gal -t CGAL -ctl /tmp/CTLFireability18009978777888398588.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Applied a total of 0 rules in 18 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2021-05-14 20:01:25] [INFO ] Flatten gal took : 44 ms
[2021-05-14 20:01:25] [INFO ] Flatten gal took : 48 ms
[2021-05-14 20:01:25] [INFO ] Input system was already deterministic with 1242 transitions.
[2021-05-14 20:01:25] [INFO ] Flatten gal took : 46 ms
[2021-05-14 20:01:25] [INFO ] Flatten gal took : 45 ms
[2021-05-14 20:01:25] [INFO ] Time to serialize gal into /tmp/CTLFireability17791969743893343368.gal : 5 ms
[2021-05-14 20:01:25] [INFO ] Time to serialize properties into /tmp/CTLFireability2402710191233100072.ctl : 132 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability17791969743893343368.gal, -t, CGAL, -ctl, /tmp/CTLFireability2402710191233100072.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability17791969743893343368.gal -t CGAL -ctl /tmp/CTLFireability2402710191233100072.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 20:01:55] [INFO ] Flatten gal took : 44 ms
[2021-05-14 20:01:55] [INFO ] Applying decomposition
[2021-05-14 20:01:55] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9221006986463630231.txt, -o, /tmp/graph9221006986463630231.bin, -w, /tmp/graph9221006986463630231.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9221006986463630231.bin, -l, -1, -v, -w, /tmp/graph9221006986463630231.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 20:01:56] [INFO ] Decomposing Gal with order
[2021-05-14 20:01:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:01:56] [INFO ] Removed a total of 1033 redundant transitions.
[2021-05-14 20:01:56] [INFO ] Flatten gal took : 88 ms
[2021-05-14 20:01:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-14 20:01:57] [INFO ] Time to serialize gal into /tmp/CTLFireability5017982605443383050.gal : 6 ms
[2021-05-14 20:01:57] [INFO ] Time to serialize properties into /tmp/CTLFireability11117054034138851650.ctl : 117 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability5017982605443383050.gal, -t, CGAL, -ctl, /tmp/CTLFireability11117054034138851650.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability5017982605443383050.gal -t CGAL -ctl /tmp/CTLFireability11117054034138851650.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Drop transitions removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 321 rules applied. Total rules applied 321 place count 834 transition count 921
Reduce places removed 321 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 332 rules applied. Total rules applied 653 place count 513 transition count 910
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 664 place count 502 transition count 910
Performed 166 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 166 Pre rules applied. Total rules applied 664 place count 502 transition count 744
Deduced a syphon composed of 166 places in 1 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 3 with 332 rules applied. Total rules applied 996 place count 336 transition count 744
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 1048 place count 310 transition count 718
Applied a total of 1048 rules in 64 ms. Remains 310 /834 variables (removed 524) and now considering 718/1242 (removed 524) transitions.
[2021-05-14 20:02:27] [INFO ] Flatten gal took : 18 ms
[2021-05-14 20:02:27] [INFO ] Flatten gal took : 19 ms
[2021-05-14 20:02:27] [INFO ] Input system was already deterministic with 718 transitions.
[2021-05-14 20:02:27] [INFO ] Flatten gal took : 19 ms
[2021-05-14 20:02:27] [INFO ] Flatten gal took : 19 ms
[2021-05-14 20:02:27] [INFO ] Time to serialize gal into /tmp/CTLFireability10848761630959391940.gal : 2 ms
[2021-05-14 20:02:27] [INFO ] Time to serialize properties into /tmp/CTLFireability991278514090968932.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability10848761630959391940.gal, -t, CGAL, -ctl, /tmp/CTLFireability991278514090968932.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability10848761630959391940.gal -t CGAL -ctl /tmp/CTLFireability991278514090968932.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 20:02:57] [INFO ] Flatten gal took : 19 ms
[2021-05-14 20:02:57] [INFO ] Applying decomposition
[2021-05-14 20:02:57] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12901273536535330923.txt, -o, /tmp/graph12901273536535330923.bin, -w, /tmp/graph12901273536535330923.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12901273536535330923.bin, -l, -1, -v, -w, /tmp/graph12901273536535330923.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 20:02:57] [INFO ] Decomposing Gal with order
[2021-05-14 20:02:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:02:57] [INFO ] Removed a total of 885 redundant transitions.
[2021-05-14 20:02:57] [INFO ] Flatten gal took : 137 ms
[2021-05-14 20:02:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 302 labels/synchronizations in 48 ms.
[2021-05-14 20:02:58] [INFO ] Time to serialize gal into /tmp/CTLFireability11645510510797031460.gal : 16 ms
[2021-05-14 20:02:58] [INFO ] Time to serialize properties into /tmp/CTLFireability17086205117521616664.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11645510510797031460.gal, -t, CGAL, -ctl, /tmp/CTLFireability17086205117521616664.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11645510510797031460.gal -t CGAL -ctl /tmp/CTLFireability17086205117521616664.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Drop transitions removed 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 834 transition count 887
Reduce places removed 355 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 356 rules applied. Total rules applied 711 place count 479 transition count 886
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 712 place count 478 transition count 886
Performed 176 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 176 Pre rules applied. Total rules applied 712 place count 478 transition count 710
Deduced a syphon composed of 176 places in 0 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 3 with 352 rules applied. Total rules applied 1064 place count 302 transition count 710
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1122 place count 273 transition count 681
Applied a total of 1122 rules in 160 ms. Remains 273 /834 variables (removed 561) and now considering 681/1242 (removed 561) transitions.
[2021-05-14 20:03:28] [INFO ] Flatten gal took : 16 ms
[2021-05-14 20:03:28] [INFO ] Flatten gal took : 47 ms
[2021-05-14 20:03:28] [INFO ] Input system was already deterministic with 681 transitions.
[2021-05-14 20:03:28] [INFO ] Flatten gal took : 34 ms
[2021-05-14 20:03:28] [INFO ] Flatten gal took : 43 ms
[2021-05-14 20:03:28] [INFO ] Time to serialize gal into /tmp/CTLFireability12497162874417877307.gal : 11 ms
[2021-05-14 20:03:28] [INFO ] Time to serialize properties into /tmp/CTLFireability6408546221342576058.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability12497162874417877307.gal, -t, CGAL, -ctl, /tmp/CTLFireability6408546221342576058.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability12497162874417877307.gal -t CGAL -ctl /tmp/CTLFireability6408546221342576058.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 20:03:58] [INFO ] Flatten gal took : 44 ms
[2021-05-14 20:03:58] [INFO ] Applying decomposition
[2021-05-14 20:03:58] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3358501697954426244.txt, -o, /tmp/graph3358501697954426244.bin, -w, /tmp/graph3358501697954426244.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3358501697954426244.bin, -l, -1, -v, -w, /tmp/graph3358501697954426244.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 20:03:58] [INFO ] Decomposing Gal with order
[2021-05-14 20:03:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:03:58] [INFO ] Removed a total of 904 redundant transitions.
[2021-05-14 20:03:58] [INFO ] Flatten gal took : 38 ms
[2021-05-14 20:03:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 254 labels/synchronizations in 17 ms.
[2021-05-14 20:03:58] [INFO ] Time to serialize gal into /tmp/CTLFireability166956090947459922.gal : 4 ms
[2021-05-14 20:03:58] [INFO ] Time to serialize properties into /tmp/CTLFireability17399001837803226294.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability166956090947459922.gal, -t, CGAL, -ctl, /tmp/CTLFireability17399001837803226294.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability166956090947459922.gal -t CGAL -ctl /tmp/CTLFireability17399001837803226294.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 179 Pre rules applied. Total rules applied 720 place count 474 transition count 703
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 1078 place count 295 transition count 703
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1138 place count 265 transition count 673
Applied a total of 1138 rules in 44 ms. Remains 265 /834 variables (removed 569) and now considering 673/1242 (removed 569) transitions.
[2021-05-14 20:04:29] [INFO ] Flatten gal took : 33 ms
[2021-05-14 20:04:29] [INFO ] Flatten gal took : 30 ms
[2021-05-14 20:04:29] [INFO ] Input system was already deterministic with 673 transitions.
[2021-05-14 20:04:29] [INFO ] Flatten gal took : 46 ms
[2021-05-14 20:04:29] [INFO ] Flatten gal took : 42 ms
[2021-05-14 20:04:29] [INFO ] Time to serialize gal into /tmp/CTLFireability7940300638270859927.gal : 2 ms
[2021-05-14 20:04:29] [INFO ] Time to serialize properties into /tmp/CTLFireability18349860396071121002.ctl : 188 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7940300638270859927.gal, -t, CGAL, -ctl, /tmp/CTLFireability18349860396071121002.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7940300638270859927.gal -t CGAL -ctl /tmp/CTLFireability18349860396071121002.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 20:04:59] [INFO ] Flatten gal took : 29 ms
[2021-05-14 20:04:59] [INFO ] Applying decomposition
[2021-05-14 20:04:59] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14124772369100215265.txt, -o, /tmp/graph14124772369100215265.bin, -w, /tmp/graph14124772369100215265.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14124772369100215265.bin, -l, -1, -v, -w, /tmp/graph14124772369100215265.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 20:04:59] [INFO ] Decomposing Gal with order
[2021-05-14 20:04:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:04:59] [INFO ] Removed a total of 906 redundant transitions.
[2021-05-14 20:04:59] [INFO ] Flatten gal took : 37 ms
[2021-05-14 20:04:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 12 ms.
[2021-05-14 20:04:59] [INFO ] Time to serialize gal into /tmp/CTLFireability6412098192694653956.gal : 4 ms
[2021-05-14 20:04:59] [INFO ] Time to serialize properties into /tmp/CTLFireability11547963327749571919.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6412098192694653956.gal, -t, CGAL, -ctl, /tmp/CTLFireability11547963327749571919.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6412098192694653956.gal -t CGAL -ctl /tmp/CTLFireability11547963327749571919.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Drop transitions removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 834 transition count 920
Reduce places removed 322 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 330 rules applied. Total rules applied 652 place count 512 transition count 912
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 660 place count 504 transition count 912
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 660 place count 504 transition count 753
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 978 place count 345 transition count 753
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1038 place count 315 transition count 723
Applied a total of 1038 rules in 56 ms. Remains 315 /834 variables (removed 519) and now considering 723/1242 (removed 519) transitions.
[2021-05-14 20:05:30] [INFO ] Flatten gal took : 16 ms
[2021-05-14 20:05:30] [INFO ] Flatten gal took : 19 ms
[2021-05-14 20:05:30] [INFO ] Input system was already deterministic with 723 transitions.
[2021-05-14 20:05:30] [INFO ] Flatten gal took : 18 ms
[2021-05-14 20:05:30] [INFO ] Flatten gal took : 87 ms
[2021-05-14 20:05:30] [INFO ] Time to serialize gal into /tmp/CTLFireability16364598851631375642.gal : 7 ms
[2021-05-14 20:05:30] [INFO ] Time to serialize properties into /tmp/CTLFireability6876902997895089864.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability16364598851631375642.gal, -t, CGAL, -ctl, /tmp/CTLFireability6876902997895089864.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability16364598851631375642.gal -t CGAL -ctl /tmp/CTLFireability6876902997895089864.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 20:06:00] [INFO ] Flatten gal took : 18 ms
[2021-05-14 20:06:00] [INFO ] Applying decomposition
[2021-05-14 20:06:00] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12294352704964803281.txt, -o, /tmp/graph12294352704964803281.bin, -w, /tmp/graph12294352704964803281.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12294352704964803281.bin, -l, -1, -v, -w, /tmp/graph12294352704964803281.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 20:06:00] [INFO ] Decomposing Gal with order
[2021-05-14 20:06:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:06:00] [INFO ] Removed a total of 814 redundant transitions.
[2021-05-14 20:06:00] [INFO ] Flatten gal took : 47 ms
[2021-05-14 20:06:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 404 labels/synchronizations in 16 ms.
[2021-05-14 20:06:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8165861826604736147.gal : 12 ms
[2021-05-14 20:06:00] [INFO ] Time to serialize properties into /tmp/CTLFireability12521282474519108608.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8165861826604736147.gal, -t, CGAL, -ctl, /tmp/CTLFireability12521282474519108608.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8165861826604736147.gal -t CGAL -ctl /tmp/CTLFireability12521282474519108608.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Drop transitions removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 349 rules applied. Total rules applied 349 place count 834 transition count 893
Reduce places removed 349 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 352 rules applied. Total rules applied 701 place count 485 transition count 890
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 704 place count 482 transition count 890
Performed 176 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 176 Pre rules applied. Total rules applied 704 place count 482 transition count 714
Deduced a syphon composed of 176 places in 0 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 3 with 352 rules applied. Total rules applied 1056 place count 306 transition count 714
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1116 place count 276 transition count 684
Applied a total of 1116 rules in 58 ms. Remains 276 /834 variables (removed 558) and now considering 684/1242 (removed 558) transitions.
[2021-05-14 20:06:30] [INFO ] Flatten gal took : 16 ms
[2021-05-14 20:06:30] [INFO ] Flatten gal took : 18 ms
[2021-05-14 20:06:31] [INFO ] Input system was already deterministic with 684 transitions.
[2021-05-14 20:06:31] [INFO ] Flatten gal took : 30 ms
[2021-05-14 20:06:31] [INFO ] Flatten gal took : 43 ms
[2021-05-14 20:06:31] [INFO ] Time to serialize gal into /tmp/CTLFireability3987249520912445851.gal : 1 ms
[2021-05-14 20:06:33] [INFO ] Time to serialize properties into /tmp/CTLFireability1587723414920462888.ctl : 1781 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability3987249520912445851.gal, -t, CGAL, -ctl, /tmp/CTLFireability1587723414920462888.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability3987249520912445851.gal -t CGAL -ctl /tmp/CTLFireability1587723414920462888.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 20:07:07] [INFO ] Flatten gal took : 47 ms
[2021-05-14 20:07:07] [INFO ] Applying decomposition
[2021-05-14 20:07:07] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12733036684067498177.txt, -o, /tmp/graph12733036684067498177.bin, -w, /tmp/graph12733036684067498177.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12733036684067498177.bin, -l, -1, -v, -w, /tmp/graph12733036684067498177.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 20:07:07] [INFO ] Decomposing Gal with order
[2021-05-14 20:07:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:07:07] [INFO ] Removed a total of 879 redundant transitions.
[2021-05-14 20:07:07] [INFO ] Flatten gal took : 39 ms
[2021-05-14 20:07:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 295 labels/synchronizations in 10 ms.
[2021-05-14 20:07:09] [INFO ] Time to serialize gal into /tmp/CTLFireability4935468321198380728.gal : 1660 ms
[2021-05-14 20:07:09] [INFO ] Time to serialize properties into /tmp/CTLFireability15737367656920858192.ctl : 142 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability4935468321198380728.gal, -t, CGAL, -ctl, /tmp/CTLFireability15737367656920858192.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability4935468321198380728.gal -t CGAL -ctl /tmp/CTLFireability15737367656920858192.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 20:07:39] [INFO ] Flatten gal took : 175 ms
[2021-05-14 20:07:41] [INFO ] Flatten gal took : 166 ms
[2021-05-14 20:07:43] [INFO ] Applying decomposition
[2021-05-14 20:07:43] [INFO ] Flatten gal took : 199 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11922048867226904440.txt, -o, /tmp/graph11922048867226904440.bin, -w, /tmp/graph11922048867226904440.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11922048867226904440.bin, -l, -1, -v, -w, /tmp/graph11922048867226904440.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 20:07:44] [INFO ] Decomposing Gal with order
[2021-05-14 20:07:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:07:46] [INFO ] Removed a total of 1034 redundant transitions.
[2021-05-14 20:07:46] [INFO ] Flatten gal took : 261 ms
[2021-05-14 20:07:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-14 20:07:54] [INFO ] Time to serialize gal into /tmp/CTLFireability12524712403987191418.gal : 5 ms
[2021-05-14 20:08:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14301314003510608114.ctl : 11648 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability12524712403987191418.gal, -t, CGAL, -ctl, /tmp/CTLFireability14301314003510608114.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability12524712403987191418.gal -t CGAL -ctl /tmp/CTLFireability14301314003510608114.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 20:32:30] [INFO ] Applying decomposition
[2021-05-14 20:32:30] [INFO ] Flatten gal took : 290 ms
[2021-05-14 20:32:31] [INFO ] Decomposing Gal with order
[2021-05-14 20:32:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:32:33] [INFO ] Removed a total of 768 redundant transitions.
[2021-05-14 20:32:33] [INFO ] Flatten gal took : 372 ms
[2021-05-14 20:32:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 390 labels/synchronizations in 26 ms.
[2021-05-14 20:32:34] [INFO ] Time to serialize gal into /tmp/CTLFireability18126328538890434778.gal : 55 ms
[2021-05-14 20:32:36] [INFO ] Time to serialize properties into /tmp/CTLFireability9705754739725386126.ctl : 1961 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability18126328538890434778.gal, -t, CGAL, -ctl, /tmp/CTLFireability9705754739725386126.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability18126328538890434778.gal -t CGAL -ctl /tmp/CTLFireability9705754739725386126.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-5"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-5, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089128200626"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;