About the Execution of ITS-Tools for Peterson-PT-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9974.027 | 3600000.00 | 9694799.00 | 84184.80 | ?FTFTTFF?FTTFFT? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128200639.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-6, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200639
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 1.1M May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.2M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.8M 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 48K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 148K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 105K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 351K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 86K Mar 27 07:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 234K Mar 27 07:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 33K Mar 25 08:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Mar 25 08:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 28K 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 1.5M 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-6-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1621027585222
Running Version 0
[2021-05-14 21:26:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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 21:26:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 21:26:39] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2021-05-14 21:26:39] [INFO ] Transformed 1330 places.
[2021-05-14 21:26:39] [INFO ] Transformed 2030 transitions.
[2021-05-14 21:26:39] [INFO ] Found NUPN structural information;
[2021-05-14 21:26:39] [INFO ] Parsed PT model containing 1330 places and 2030 transitions in 208 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-6-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 15) seen :6
FORMULA Peterson-PT-6-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :1
FORMULA Peterson-PT-6-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2021-05-14 21:26:40] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2021-05-14 21:26:40] [INFO ] Computed 27 place invariants in 39 ms
[2021-05-14 21:26:41] [INFO ] [Real]Absence check using 20 positive place invariants in 35 ms returned sat
[2021-05-14 21:26:41] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-14 21:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:26:42] [INFO ] [Real]Absence check using state equation in 1500 ms returned sat
[2021-05-14 21:26:42] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:26:42] [INFO ] [Real]Added 366 Read/Feed constraints in 72 ms returned sat
[2021-05-14 21:26:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:26:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 43 ms returned sat
[2021-05-14 21:26:43] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-14 21:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:26:44] [INFO ] [Nat]Absence check using state equation in 1449 ms returned sat
[2021-05-14 21:26:44] [INFO ] [Nat]Added 366 Read/Feed constraints in 107 ms returned sat
[2021-05-14 21:26:45] [INFO ] Deduced a trap composed of 12 places in 545 ms of which 6 ms to minimize.
[2021-05-14 21:26:46] [INFO ] Deduced a trap composed of 16 places in 552 ms of which 13 ms to minimize.
[2021-05-14 21:26:46] [INFO ] Deduced a trap composed of 25 places in 554 ms of which 1 ms to minimize.
[2021-05-14 21:26:47] [INFO ] Deduced a trap composed of 60 places in 517 ms of which 2 ms to minimize.
[2021-05-14 21:26:47] [INFO ] Deduced a trap composed of 31 places in 478 ms of which 1 ms to minimize.
[2021-05-14 21:26:48] [INFO ] Deduced a trap composed of 2 places in 636 ms of which 3 ms to minimize.
[2021-05-14 21:26:48] [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 21:26:48] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-14 21:26:48] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-14 21:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:26:49] [INFO ] [Real]Absence check using state equation in 1108 ms returned sat
[2021-05-14 21:26:49] [INFO ] [Real]Added 366 Read/Feed constraints in 70 ms returned sat
[2021-05-14 21:26:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:26:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 34 ms returned sat
[2021-05-14 21:26:50] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-14 21:26:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:26:51] [INFO ] [Nat]Absence check using state equation in 1175 ms returned sat
[2021-05-14 21:26:51] [INFO ] [Nat]Added 366 Read/Feed constraints in 118 ms returned sat
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 145 places in 576 ms of which 2 ms to minimize.
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 222 places in 574 ms of which 1 ms to minimize.
[2021-05-14 21:26:53] [INFO ] Deduced a trap composed of 264 places in 571 ms of which 1 ms to minimize.
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 241 places in 576 ms of which 1 ms to minimize.
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 336 places in 569 ms of which 2 ms to minimize.
[2021-05-14 21:26:55] [INFO ] Deduced a trap composed of 306 places in 569 ms of which 1 ms to minimize.
[2021-05-14 21:26:55] [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 21:26:55] [INFO ] [Real]Absence check using 20 positive place invariants in 30 ms returned sat
[2021-05-14 21:26:55] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-14 21:26:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:26:57] [INFO ] [Real]Absence check using state equation in 1770 ms returned sat
[2021-05-14 21:26:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:26:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2021-05-14 21:26:57] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-14 21:26:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:26:58] [INFO ] [Nat]Absence check using state equation in 1099 ms returned sat
[2021-05-14 21:26:58] [INFO ] [Nat]Added 366 Read/Feed constraints in 98 ms returned sat
[2021-05-14 21:26:59] [INFO ] Deduced a trap composed of 133 places in 582 ms of which 1 ms to minimize.
[2021-05-14 21:27:00] [INFO ] Deduced a trap composed of 315 places in 576 ms of which 1 ms to minimize.
[2021-05-14 21:27:00] [INFO ] Deduced a trap composed of 133 places in 574 ms of which 1 ms to minimize.
[2021-05-14 21:27:01] [INFO ] Deduced a trap composed of 133 places in 573 ms of which 1 ms to minimize.
[2021-05-14 21:27:02] [INFO ] Deduced a trap composed of 133 places in 580 ms of which 2 ms to minimize.
[2021-05-14 21:27:02] [INFO ] Deduced a trap composed of 213 places in 600 ms of which 2 ms to minimize.
[2021-05-14 21:27: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 2
[2021-05-14 21:27:02] [INFO ] [Real]Absence check using 20 positive place invariants in 32 ms returned sat
[2021-05-14 21:27:02] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 21:27:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:03] [INFO ] [Real]Absence check using state equation in 677 ms returned sat
[2021-05-14 21:27:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:27:03] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-14 21:27:04] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-14 21:27:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:04] [INFO ] [Nat]Absence check using state equation in 761 ms returned sat
[2021-05-14 21:27:04] [INFO ] [Nat]Added 366 Read/Feed constraints in 103 ms returned sat
[2021-05-14 21:27:05] [INFO ] Deduced a trap composed of 34 places in 446 ms of which 1 ms to minimize.
[2021-05-14 21:27:05] [INFO ] Deduced a trap composed of 54 places in 456 ms of which 1 ms to minimize.
[2021-05-14 21:27:06] [INFO ] Deduced a trap composed of 54 places in 440 ms of which 1 ms to minimize.
[2021-05-14 21:27:06] [INFO ] Deduced a trap composed of 34 places in 437 ms of which 1 ms to minimize.
[2021-05-14 21:27:07] [INFO ] Deduced a trap composed of 34 places in 442 ms of which 1 ms to minimize.
[2021-05-14 21:27:07] [INFO ] Deduced a trap composed of 54 places in 444 ms of which 1 ms to minimize.
[2021-05-14 21:27:08] [INFO ] Deduced a trap composed of 29 places in 473 ms of which 1 ms to minimize.
[2021-05-14 21:27:08] [INFO ] Deduced a trap composed of 34 places in 435 ms of which 1 ms to minimize.
[2021-05-14 21:27:08] [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 3
[2021-05-14 21:27:09] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2021-05-14 21:27:09] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:27:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:09] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2021-05-14 21:27:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:27:14] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2021-05-14 21:27:14] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:27:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:15] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2021-05-14 21:27:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:27:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 21:27:15] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:27:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:16] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2021-05-14 21:27:16] [INFO ] [Nat]Added 366 Read/Feed constraints in 98 ms returned sat
[2021-05-14 21:27:17] [INFO ] Deduced a trap composed of 27 places in 542 ms of which 5 ms to minimize.
[2021-05-14 21:27:17] [INFO ] Deduced a trap composed of 12 places in 559 ms of which 1 ms to minimize.
[2021-05-14 21:27:18] [INFO ] Deduced a trap composed of 27 places in 542 ms of which 1 ms to minimize.
[2021-05-14 21:27:18] [INFO ] Deduced a trap composed of 12 places in 541 ms of which 0 ms to minimize.
[2021-05-14 21:27:19] [INFO ] Deduced a trap composed of 27 places in 528 ms of which 1 ms to minimize.
[2021-05-14 21:27:19] [INFO ] Deduced a trap composed of 42 places in 467 ms of which 1 ms to minimize.
[2021-05-14 21:27:20] [INFO ] Deduced a trap composed of 42 places in 471 ms of which 1 ms to minimize.
[2021-05-14 21:27:20] [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 5
[2021-05-14 21:27:20] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2021-05-14 21:27:20] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:21] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2021-05-14 21:27:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:27:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 25 ms returned sat
[2021-05-14 21:27:21] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:21] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2021-05-14 21:27:21] [INFO ] [Nat]Added 366 Read/Feed constraints in 97 ms returned sat
[2021-05-14 21:27:22] [INFO ] Deduced a trap composed of 12 places in 485 ms of which 2 ms to minimize.
[2021-05-14 21:27:23] [INFO ] Deduced a trap composed of 40 places in 482 ms of which 4 ms to minimize.
[2021-05-14 21:27:23] [INFO ] Deduced a trap composed of 16 places in 491 ms of which 1 ms to minimize.
[2021-05-14 21:27:24] [INFO ] Deduced a trap composed of 39 places in 481 ms of which 1 ms to minimize.
[2021-05-14 21:27:24] [INFO ] Deduced a trap composed of 12 places in 478 ms of which 1 ms to minimize.
[2021-05-14 21:27:25] [INFO ] Deduced a trap composed of 12 places in 478 ms of which 0 ms to minimize.
[2021-05-14 21:27:25] [INFO ] Deduced a trap composed of 46 places in 485 ms of which 1 ms to minimize.
[2021-05-14 21:27:26] [INFO ] Deduced a trap composed of 12 places in 482 ms of which 1 ms to minimize.
[2021-05-14 21:27:26] [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 6
[2021-05-14 21:27:26] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-14 21:27:26] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:27] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2021-05-14 21:27:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:27:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-14 21:27:27] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:27:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:27] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2021-05-14 21:27:27] [INFO ] [Nat]Added 366 Read/Feed constraints in 100 ms returned sat
[2021-05-14 21:27:28] [INFO ] Deduced a trap composed of 162 places in 494 ms of which 1 ms to minimize.
[2021-05-14 21:27:29] [INFO ] Deduced a trap composed of 162 places in 479 ms of which 2 ms to minimize.
[2021-05-14 21:27:29] [INFO ] Deduced a trap composed of 162 places in 483 ms of which 1 ms to minimize.
[2021-05-14 21:27:30] [INFO ] Deduced a trap composed of 162 places in 479 ms of which 1 ms to minimize.
[2021-05-14 21:27:30] [INFO ] Deduced a trap composed of 75 places in 493 ms of which 1 ms to minimize.
[2021-05-14 21:27:31] [INFO ] Deduced a trap composed of 21 places in 498 ms of which 3 ms to minimize.
[2021-05-14 21:27:31] [INFO ] Deduced a trap composed of 12 places in 478 ms of which 1 ms to minimize.
[2021-05-14 21:27:32] [INFO ] Deduced a trap composed of 12 places in 485 ms of which 1 ms to minimize.
[2021-05-14 21:27:32] [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
Fused 8 Parikh solutions to 1 different solutions.
Support contains 200 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 552 transitions
Trivial Post-agglo rules discarded 552 transitions
Performed 552 trivial Post agglomeration. Transition count delta: 552
Iterating post reduction 0 with 552 rules applied. Total rules applied 552 place count 1330 transition count 1478
Reduce places removed 552 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 560 rules applied. Total rules applied 1112 place count 778 transition count 1470
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1120 place count 770 transition count 1470
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 251 Pre rules applied. Total rules applied 1120 place count 770 transition count 1219
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 1622 place count 519 transition count 1219
Applied a total of 1622 rules in 1110 ms. Remains 519 /1330 variables (removed 811) and now considering 1219/2030 (removed 811) transitions.
Finished structural reductions, in 1 iterations. Remains : 519/1330 places, 1219/2030 transitions.
[2021-05-14 21:27:33] [INFO ] Flatten gal took : 143 ms
[2021-05-14 21:27:33] [INFO ] Flatten gal took : 72 ms
[2021-05-14 21:27:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4399744804123648552.gal : 51 ms
[2021-05-14 21:27:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10301189084350356816.prop : 3 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4399744804123648552.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10301189084350356816.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4399744804123648552.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10301189084350356816.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10301189084350356816.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :6 after 14
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :14 after 31
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :31 after 73
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :73 after 194
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :194 after 397
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :397 after 1805
Invariant property Peterson-PT-6-ReachabilityFireability-09 does not hold.
FORMULA Peterson-PT-6-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :1805 after 4554
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :4554 after 8138
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :8138 after 16044
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :16044 after 81814
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :81814 after 202970
Detected timeout of ITS tools.
[2021-05-14 21:27:50] [INFO ] Flatten gal took : 55 ms
[2021-05-14 21:27:50] [INFO ] Applying decomposition
[2021-05-14 21:27:50] [INFO ] Flatten gal took : 62 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/graph6056394512587287897.txt, -o, /tmp/graph6056394512587287897.bin, -w, /tmp/graph6056394512587287897.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/graph6056394512587287897.bin, -l, -1, -v, -w, /tmp/graph6056394512587287897.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:27:50] [INFO ] Decomposing Gal with order
[2021-05-14 21:27:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:27:51] [INFO ] Removed a total of 1361 redundant transitions.
[2021-05-14 21:27:51] [INFO ] Flatten gal took : 181 ms
[2021-05-14 21:27:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 412 labels/synchronizations in 42 ms.
[2021-05-14 21:27:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10292494060986432598.gal : 11 ms
[2021-05-14 21:27:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13296000430390456429.prop : 2 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality10292494060986432598.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13296000430390456429.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality10292494060986432598.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13296000430390456429.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13296000430390456429.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :1 after 8216
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :8216 after 301504
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :301504 after 643871
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16757808296710944753
[2021-05-14 21:28:07] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16757808296710944753
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16757808296710944753]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16757808296710944753] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16757808296710944753] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 18753 ms. (steps per millisecond=53 ) properties (out of 7) seen :0
Interrupted Best-First random walk after 249680 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=49 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3400 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3343 ms. (steps per millisecond=299 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3158 ms. (steps per millisecond=316 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2854 ms. (steps per millisecond=350 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2866 ms. (steps per millisecond=348 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1862 ms. (steps per millisecond=537 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 4808352 steps, run timeout after 30001 ms. (steps per millisecond=160 ) properties seen :{5=1}
Probabilistic random walk after 4808352 steps, saw 607535 distinct states, run finished after 30001 ms. (steps per millisecond=160 ) properties seen :{5=1}
FORMULA Peterson-PT-6-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
[2021-05-14 21:29:30] [INFO ] Flow matrix only has 1009 transitions (discarded 210 similar events)
// Phase 1: matrix 1009 rows 519 cols
[2021-05-14 21:29:30] [INFO ] Computed 27 place invariants in 4 ms
[2021-05-14 21:29:30] [INFO ] [Real]Absence check using 20 positive place invariants in 17 ms returned sat
[2021-05-14 21:29:30] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 21:29:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:29:30] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2021-05-14 21:29:30] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:29:30] [INFO ] [Real]Added 366 Read/Feed constraints in 38 ms returned sat
[2021-05-14 21:29:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:29:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2021-05-14 21:29:31] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 21:29:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:29:31] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2021-05-14 21:29:31] [INFO ] [Nat]Added 366 Read/Feed constraints in 49 ms returned sat
[2021-05-14 21:29:31] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 1 ms to minimize.
[2021-05-14 21:29:31] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:29:32] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:29:32] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:29:32] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:29:32] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:29:32] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:29:32] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 1 ms to minimize.
[2021-05-14 21:29:33] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:29:33] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:29:33] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:29:33] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:29:33] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:29:33] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:29:34] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:29:34] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:29:34] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:29:34] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:29:34] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 0 ms to minimize.
[2021-05-14 21:29:34] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 2 ms to minimize.
[2021-05-14 21:29:35] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:29:35] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:29:35] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:29:35] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:29:35] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:29:35] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:29:36] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 1 ms to minimize.
[2021-05-14 21:29:36] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:29:36] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:29:36] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:29:36] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:29:36] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 1 ms to minimize.
[2021-05-14 21:29:37] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:29:37] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:29:37] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 0 ms to minimize.
[2021-05-14 21:29:37] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:29:37] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 1 ms to minimize.
[2021-05-14 21:29:37] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:29:38] [INFO ] Deduced a trap composed of 63 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:29:38] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2021-05-14 21:29:38] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:29:38] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 6882 ms
[2021-05-14 21:29:38] [INFO ] Computed and/alt/rep : 918/2731/918 causal constraints (skipped 84 transitions) in 73 ms.
[2021-05-14 21:29:49] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 1 ms to minimize.
[2021-05-14 21:29:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2021-05-14 21:29:50] [INFO ] Added : 908 causal constraints over 182 iterations in 11581 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-14 21:29:50] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2021-05-14 21:29:50] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:29:50] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2021-05-14 21:29:50] [INFO ] [Real]Added 366 Read/Feed constraints in 38 ms returned sat
[2021-05-14 21:29:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:29:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2021-05-14 21:29:50] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 21:29:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:29:50] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2021-05-14 21:29:50] [INFO ] [Nat]Added 366 Read/Feed constraints in 40 ms returned sat
[2021-05-14 21:29:51] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 0 ms to minimize.
[2021-05-14 21:29:51] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 0 ms to minimize.
[2021-05-14 21:29:51] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 0 ms to minimize.
[2021-05-14 21:29:51] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 0 ms to minimize.
[2021-05-14 21:29:51] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2021-05-14 21:29:52] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 0 ms to minimize.
[2021-05-14 21:29:52] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 0 ms to minimize.
[2021-05-14 21:29:52] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 1 ms to minimize.
[2021-05-14 21:29:52] [INFO ] Deduced a trap composed of 126 places in 179 ms of which 0 ms to minimize.
[2021-05-14 21:29:52] [INFO ] Deduced a trap composed of 85 places in 181 ms of which 0 ms to minimize.
[2021-05-14 21:29:53] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 0 ms to minimize.
[2021-05-14 21:29:53] [INFO ] Deduced a trap composed of 33 places in 266 ms of which 1 ms to minimize.
[2021-05-14 21:29:53] [INFO ] Deduced a trap composed of 27 places in 266 ms of which 0 ms to minimize.
[2021-05-14 21:29:54] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 0 ms to minimize.
[2021-05-14 21:29:54] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 0 ms to minimize.
[2021-05-14 21:29:54] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 0 ms to minimize.
[2021-05-14 21:29:54] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 0 ms to minimize.
[2021-05-14 21:29:54] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 0 ms to minimize.
[2021-05-14 21:29:55] [INFO ] Deduced a trap composed of 129 places in 170 ms of which 0 ms to minimize.
[2021-05-14 21:29:55] [INFO ] Deduced a trap composed of 140 places in 180 ms of which 0 ms to minimize.
[2021-05-14 21:29:55] [INFO ] Deduced a trap composed of 114 places in 174 ms of which 1 ms to minimize.
[2021-05-14 21:29:55] [INFO ] Deduced a trap composed of 128 places in 175 ms of which 0 ms to minimize.
[2021-05-14 21:29:55] [INFO ] Deduced a trap composed of 114 places in 176 ms of which 0 ms to minimize.
[2021-05-14 21:29:56] [INFO ] Deduced a trap composed of 134 places in 175 ms of which 0 ms to minimize.
[2021-05-14 21:29:56] [INFO ] Deduced a trap composed of 147 places in 169 ms of which 0 ms to minimize.
[2021-05-14 21:29:56] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 1 ms to minimize.
[2021-05-14 21:29:56] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 0 ms to minimize.
[2021-05-14 21:29:56] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 0 ms to minimize.
[2021-05-14 21:29:57] [INFO ] Deduced a trap composed of 74 places in 180 ms of which 0 ms to minimize.
[2021-05-14 21:29:57] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 0 ms to minimize.
[2021-05-14 21:29:57] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 0 ms to minimize.
[2021-05-14 21:29:57] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 1 ms to minimize.
[2021-05-14 21:29:58] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 1 ms to minimize.
[2021-05-14 21:29:58] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 0 ms to minimize.
[2021-05-14 21:29:58] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 1 ms to minimize.
[2021-05-14 21:29:58] [INFO ] Deduced a trap composed of 69 places in 169 ms of which 0 ms to minimize.
[2021-05-14 21:29:58] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 1 ms to minimize.
[2021-05-14 21:29:59] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 1 ms to minimize.
[2021-05-14 21:29:59] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 1 ms to minimize.
[2021-05-14 21:29:59] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 0 ms to minimize.
[2021-05-14 21:29:59] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 1 ms to minimize.
[2021-05-14 21:29:59] [INFO ] Deduced a trap composed of 76 places in 168 ms of which 0 ms to minimize.
[2021-05-14 21:30:00] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 0 ms to minimize.
[2021-05-14 21:30:00] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 1 ms to minimize.
[2021-05-14 21:30:00] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 0 ms to minimize.
[2021-05-14 21:30:00] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 1 ms to minimize.
[2021-05-14 21:30:00] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 0 ms to minimize.
[2021-05-14 21:30:01] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 0 ms to minimize.
[2021-05-14 21:30:01] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:30:01] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:30:01] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:30:01] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:30:01] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 1 ms to minimize.
[2021-05-14 21:30:02] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 1 ms to minimize.
[2021-05-14 21:30:02] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 0 ms to minimize.
[2021-05-14 21:30:02] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 1 ms to minimize.
[2021-05-14 21:30:02] [INFO ] Deduced a trap composed of 55 places in 148 ms of which 1 ms to minimize.
[2021-05-14 21:30:02] [INFO ] Deduced a trap composed of 80 places in 149 ms of which 1 ms to minimize.
[2021-05-14 21:30:03] [INFO ] Deduced a trap composed of 72 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:30:03] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:30:03] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 1 ms to minimize.
[2021-05-14 21:30:03] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 0 ms to minimize.
[2021-05-14 21:30:03] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 1 ms to minimize.
[2021-05-14 21:30:03] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 1 ms to minimize.
[2021-05-14 21:30:04] [INFO ] Deduced a trap composed of 127 places in 157 ms of which 0 ms to minimize.
[2021-05-14 21:30:04] [INFO ] Deduced a trap composed of 114 places in 155 ms of which 1 ms to minimize.
[2021-05-14 21:30:04] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:30:04] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 1 ms to minimize.
[2021-05-14 21:30:04] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 1 ms to minimize.
[2021-05-14 21:30:05] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:30:05] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:30:05] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 0 ms to minimize.
[2021-05-14 21:30:05] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 1 ms to minimize.
[2021-05-14 21:30:05] [INFO ] Deduced a trap composed of 148 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:30:05] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:30:05] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:30:06] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:30:06] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 1 ms to minimize.
[2021-05-14 21:30:06] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 1 ms to minimize.
[2021-05-14 21:30:06] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 0 ms to minimize.
[2021-05-14 21:30:06] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 1 ms to minimize.
[2021-05-14 21:30:06] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:30:07] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 1 ms to minimize.
[2021-05-14 21:30:07] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:30:07] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:30:07] [INFO ] Deduced a trap composed of 62 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:30:07] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:30:07] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2021-05-14 21:30:07] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 0 ms to minimize.
[2021-05-14 21:30:08] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 1 ms to minimize.
[2021-05-14 21:30:08] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 0 ms to minimize.
[2021-05-14 21:30:08] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 1 ms to minimize.
[2021-05-14 21:30:08] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 0 ms to minimize.
[2021-05-14 21:30:08] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:30:08] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:30:08] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 1 ms to minimize.
[2021-05-14 21:30:09] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:30:09] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 0 ms to minimize.
[2021-05-14 21:30:09] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:30:09] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 0 ms to minimize.
[2021-05-14 21:30:35] [INFO ] Deduced a trap composed of 2 places in 192 ms of which 0 ms to minimize.
[2021-05-14 21:30:35] [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 21:30:35] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2021-05-14 21:30:35] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 21:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:30:36] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2021-05-14 21:30:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:30:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2021-05-14 21:30:36] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:30:36] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2021-05-14 21:30:36] [INFO ] [Nat]Added 366 Read/Feed constraints in 42 ms returned sat
[2021-05-14 21:30:36] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 0 ms to minimize.
[2021-05-14 21:30:36] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 1 ms to minimize.
[2021-05-14 21:30:37] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 0 ms to minimize.
[2021-05-14 21:30:37] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 1 ms to minimize.
[2021-05-14 21:30:37] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 1 ms to minimize.
[2021-05-14 21:30:37] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 1 ms to minimize.
[2021-05-14 21:30:38] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 0 ms to minimize.
[2021-05-14 21:30:38] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 1 ms to minimize.
[2021-05-14 21:30:38] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 0 ms to minimize.
[2021-05-14 21:30:38] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 1 ms to minimize.
[2021-05-14 21:30:38] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 1 ms to minimize.
[2021-05-14 21:30:39] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 0 ms to minimize.
[2021-05-14 21:30:39] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 1 ms to minimize.
[2021-05-14 21:30:39] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 0 ms to minimize.
[2021-05-14 21:30:39] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 0 ms to minimize.
[2021-05-14 21:30:39] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 1 ms to minimize.
[2021-05-14 21:30:40] [INFO ] Deduced a trap composed of 63 places in 171 ms of which 1 ms to minimize.
[2021-05-14 21:30:40] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 0 ms to minimize.
[2021-05-14 21:30:40] [INFO ] Deduced a trap composed of 101 places in 166 ms of which 1 ms to minimize.
[2021-05-14 21:30:40] [INFO ] Deduced a trap composed of 89 places in 167 ms of which 1 ms to minimize.
[2021-05-14 21:30:40] [INFO ] Deduced a trap composed of 95 places in 168 ms of which 1 ms to minimize.
[2021-05-14 21:30:41] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 1 ms to minimize.
[2021-05-14 21:30:41] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 0 ms to minimize.
[2021-05-14 21:30:41] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 1 ms to minimize.
[2021-05-14 21:30:41] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 1 ms to minimize.
[2021-05-14 21:30:41] [INFO ] Deduced a trap composed of 87 places in 167 ms of which 1 ms to minimize.
[2021-05-14 21:30:42] [INFO ] Deduced a trap composed of 91 places in 167 ms of which 1 ms to minimize.
[2021-05-14 21:30:42] [INFO ] Deduced a trap composed of 101 places in 169 ms of which 0 ms to minimize.
[2021-05-14 21:30:42] [INFO ] Deduced a trap composed of 91 places in 166 ms of which 1 ms to minimize.
[2021-05-14 21:30:42] [INFO ] Deduced a trap composed of 123 places in 165 ms of which 1 ms to minimize.
[2021-05-14 21:30:42] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 0 ms to minimize.
[2021-05-14 21:30:43] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 0 ms to minimize.
[2021-05-14 21:30:43] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 0 ms to minimize.
[2021-05-14 21:30:43] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2021-05-14 21:30:43] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 1 ms to minimize.
[2021-05-14 21:30:43] [INFO ] Deduced a trap composed of 68 places in 171 ms of which 0 ms to minimize.
[2021-05-14 21:30:43] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 0 ms to minimize.
[2021-05-14 21:30:44] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 0 ms to minimize.
[2021-05-14 21:30:44] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 0 ms to minimize.
[2021-05-14 21:30:44] [INFO ] Deduced a trap composed of 69 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:30:44] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 1 ms to minimize.
[2021-05-14 21:30:44] [INFO ] Deduced a trap composed of 119 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:30:45] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 0 ms to minimize.
[2021-05-14 21:30:45] [INFO ] Deduced a trap composed of 96 places in 172 ms of which 0 ms to minimize.
[2021-05-14 21:30:45] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 0 ms to minimize.
[2021-05-14 21:30:45] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 0 ms to minimize.
[2021-05-14 21:30:45] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 0 ms to minimize.
[2021-05-14 21:30:46] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:30:46] [INFO ] Deduced a trap composed of 69 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:30:46] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 0 ms to minimize.
[2021-05-14 21:30:46] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 1 ms to minimize.
[2021-05-14 21:30:46] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:30:47] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:30:47] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 2 ms to minimize.
[2021-05-14 21:30:47] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 1 ms to minimize.
[2021-05-14 21:30:47] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 0 ms to minimize.
[2021-05-14 21:30:47] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 1 ms to minimize.
[2021-05-14 21:30:47] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 0 ms to minimize.
[2021-05-14 21:30:48] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 0 ms to minimize.
[2021-05-14 21:30:48] [INFO ] Deduced a trap composed of 72 places in 158 ms of which 0 ms to minimize.
[2021-05-14 21:30:48] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 1 ms to minimize.
[2021-05-14 21:30:48] [INFO ] Deduced a trap composed of 105 places in 158 ms of which 1 ms to minimize.
[2021-05-14 21:30:48] [INFO ] Deduced a trap composed of 104 places in 160 ms of which 2 ms to minimize.
[2021-05-14 21:30:49] [INFO ] Deduced a trap composed of 85 places in 158 ms of which 1 ms to minimize.
[2021-05-14 21:30:49] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 0 ms to minimize.
[2021-05-14 21:30:49] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2021-05-14 21:30:49] [INFO ] Deduced a trap composed of 77 places in 166 ms of which 1 ms to minimize.
[2021-05-14 21:30:49] [INFO ] Deduced a trap composed of 149 places in 166 ms of which 1 ms to minimize.
[2021-05-14 21:30:50] [INFO ] Deduced a trap composed of 96 places in 166 ms of which 1 ms to minimize.
[2021-05-14 21:30:50] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 0 ms to minimize.
[2021-05-14 21:30:50] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 1 ms to minimize.
[2021-05-14 21:30:50] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 1 ms to minimize.
[2021-05-14 21:30:50] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 1 ms to minimize.
[2021-05-14 21:30:51] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:30:51] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:30:51] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 0 ms to minimize.
[2021-05-14 21:30:51] [INFO ] Deduced a trap composed of 86 places in 150 ms of which 1 ms to minimize.
[2021-05-14 21:30:51] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 1 ms to minimize.
[2021-05-14 21:30:51] [INFO ] Deduced a trap composed of 70 places in 148 ms of which 0 ms to minimize.
[2021-05-14 21:30:52] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 1 ms to minimize.
[2021-05-14 21:30:52] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:30:52] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 1 ms to minimize.
[2021-05-14 21:30:52] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:30:52] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:30:53] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 1 ms to minimize.
[2021-05-14 21:30:53] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:30:53] [INFO ] Deduced a trap composed of 70 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:30:53] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:30:53] [INFO ] Deduced a trap composed of 70 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:30:53] [INFO ] Deduced a trap composed of 69 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:30:54] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:30:54] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:30:54] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:30:54] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:30:54] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:30:55] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:30:55] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:30:55] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 1 ms to minimize.
[2021-05-14 21:30:55] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:30:55] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:30:55] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:30:55] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
[2021-05-14 21:30:56] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:30:56] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:30:56] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:30:56] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:30:56] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:30:56] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 1 ms to minimize.
[2021-05-14 21:30:56] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 1 ms to minimize.
[2021-05-14 21:30:57] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 1 ms to minimize.
[2021-05-14 21:30:57] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 0 ms to minimize.
[2021-05-14 21:30:57] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:30:57] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 1 ms to minimize.
[2021-05-14 21:30:57] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:30:57] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:30:57] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:30:58] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:30:58] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:30:58] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 0 ms to minimize.
[2021-05-14 21:30:58] [INFO ] Deduced a trap composed of 71 places in 157 ms of which 0 ms to minimize.
[2021-05-14 21:30:58] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
[2021-05-14 21:30:58] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
[2021-05-14 21:30:59] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:30:59] [INFO ] Trap strengthening (SAT) tested/added 124/123 trap constraints in 22517 ms
[2021-05-14 21:30:59] [INFO ] Computed and/alt/rep : 918/2731/918 causal constraints (skipped 84 transitions) in 55 ms.
[2021-05-14 21:31:08] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:31:08] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:31:08] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:31:09] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:31:09] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:31:09] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:31:09] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:31:09] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:31:10] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 1 ms to minimize.
[2021-05-14 21:31:10] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:31:10] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 0 ms to minimize.
[2021-05-14 21:31:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2269 ms
[2021-05-14 21:31:10] [INFO ] Added : 746 causal constraints over 150 iterations in 11650 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2021-05-14 21:31:10] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2021-05-14 21:31:10] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:31:11] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2021-05-14 21:31:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:31:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2021-05-14 21:31:11] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:31:11] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2021-05-14 21:31:11] [INFO ] [Nat]Added 366 Read/Feed constraints in 49 ms returned sat
[2021-05-14 21:31:11] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 1 ms to minimize.
[2021-05-14 21:31:11] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:31:12] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 0 ms to minimize.
[2021-05-14 21:31:12] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 0 ms to minimize.
[2021-05-14 21:31:12] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 0 ms to minimize.
[2021-05-14 21:31:12] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2021-05-14 21:31:12] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2021-05-14 21:31:13] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2021-05-14 21:31:13] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:31:13] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:31:13] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:31:13] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 0 ms to minimize.
[2021-05-14 21:31:13] [INFO ] Deduced a trap composed of 73 places in 154 ms of which 0 ms to minimize.
[2021-05-14 21:31:14] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2021-05-14 21:31:14] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 0 ms to minimize.
[2021-05-14 21:31:14] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:31:14] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 0 ms to minimize.
[2021-05-14 21:31:14] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 1 ms to minimize.
[2021-05-14 21:31:15] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2021-05-14 21:31:15] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 1 ms to minimize.
[2021-05-14 21:31:15] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:31:15] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:31:15] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 1 ms to minimize.
[2021-05-14 21:31:15] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 1 ms to minimize.
[2021-05-14 21:31:16] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 0 ms to minimize.
[2021-05-14 21:31:16] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:31:16] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:31:16] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 1 ms to minimize.
[2021-05-14 21:31:16] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 1 ms to minimize.
[2021-05-14 21:31:17] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 0 ms to minimize.
[2021-05-14 21:31:17] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:31:17] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 1 ms to minimize.
[2021-05-14 21:31:17] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 0 ms to minimize.
[2021-05-14 21:31:17] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 1 ms to minimize.
[2021-05-14 21:31:17] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:31:18] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:31:18] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 0 ms to minimize.
[2021-05-14 21:31:18] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:31:18] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 1 ms to minimize.
[2021-05-14 21:31:18] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 0 ms to minimize.
[2021-05-14 21:31:18] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 0 ms to minimize.
[2021-05-14 21:31:19] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 1 ms to minimize.
[2021-05-14 21:31:19] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 1 ms to minimize.
[2021-05-14 21:31:19] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:31:19] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 0 ms to minimize.
[2021-05-14 21:31:19] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 1 ms to minimize.
[2021-05-14 21:31:20] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 1 ms to minimize.
[2021-05-14 21:31:20] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:31:20] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:31:20] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:31:20] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:31:21] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:31:21] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:31:21] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:31:21] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 1 ms to minimize.
[2021-05-14 21:31:21] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:31:21] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:31:22] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:31:22] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:31:22] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:31:22] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:31:22] [INFO ] Deduced a trap composed of 107 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:31:22] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 1 ms to minimize.
[2021-05-14 21:31:22] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 0 ms to minimize.
[2021-05-14 21:31:23] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2021-05-14 21:31:23] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 0 ms to minimize.
[2021-05-14 21:31:23] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2021-05-14 21:31:23] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 0 ms to minimize.
[2021-05-14 21:31:23] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 1 ms to minimize.
[2021-05-14 21:31:23] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 0 ms to minimize.
[2021-05-14 21:31:25] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:31:26] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2021-05-14 21:31:26] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 0 ms to minimize.
[2021-05-14 21:31:26] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2021-05-14 21:31:26] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 0 ms to minimize.
[2021-05-14 21:31:26] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 0 ms to minimize.
[2021-05-14 21:31:27] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2021-05-14 21:31:27] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:31:27] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:31:27] [INFO ] Deduced a trap composed of 100 places in 75 ms of which 0 ms to minimize.
[2021-05-14 21:31:27] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2021-05-14 21:31:27] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 0 ms to minimize.
[2021-05-14 21:31:27] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2021-05-14 21:31:27] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 0 ms to minimize.
[2021-05-14 21:31:28] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 0 ms to minimize.
[2021-05-14 21:31:28] [INFO ] Trap strengthening (SAT) tested/added 86/85 trap constraints in 16526 ms
[2021-05-14 21:31:28] [INFO ] Computed and/alt/rep : 918/2731/918 causal constraints (skipped 84 transitions) in 52 ms.
[2021-05-14 21:31:39] [INFO ] Added : 883 causal constraints over 177 iterations in 10909 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2021-05-14 21:31:39] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2021-05-14 21:31:39] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:31:39] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2021-05-14 21:31:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:31:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2021-05-14 21:31:39] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:31:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:31:39] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2021-05-14 21:31:39] [INFO ] [Nat]Added 366 Read/Feed constraints in 41 ms returned sat
[2021-05-14 21:31:39] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:31:40] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 0 ms to minimize.
[2021-05-14 21:31:40] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 1 ms to minimize.
[2021-05-14 21:31:40] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:31:40] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:31:40] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:31:40] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2021-05-14 21:31:41] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:31:41] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2021-05-14 21:31:41] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:31:41] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 0 ms to minimize.
[2021-05-14 21:31:41] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2021-05-14 21:31:41] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2021-05-14 21:31:42] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2021-05-14 21:31:42] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 1 ms to minimize.
[2021-05-14 21:31:42] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 1 ms to minimize.
[2021-05-14 21:31:42] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:31:42] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:31:42] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:31:43] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:31:43] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:31:43] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2021-05-14 21:31:43] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 1 ms to minimize.
[2021-05-14 21:31:43] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 1 ms to minimize.
[2021-05-14 21:31:44] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 0 ms to minimize.
[2021-05-14 21:31:44] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:31:44] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 1 ms to minimize.
[2021-05-14 21:31:44] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:31:44] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:31:44] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:31:45] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 0 ms to minimize.
[2021-05-14 21:31:45] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:31:45] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:31:45] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:31:45] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:31:45] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:31:46] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:31:46] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:31:46] [INFO ] Deduced a trap composed of 75 places in 158 ms of which 1 ms to minimize.
[2021-05-14 21:31:46] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 0 ms to minimize.
[2021-05-14 21:31:46] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 1 ms to minimize.
[2021-05-14 21:31:46] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 0 ms to minimize.
[2021-05-14 21:31:47] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 1 ms to minimize.
[2021-05-14 21:31:47] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 0 ms to minimize.
[2021-05-14 21:31:47] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 1 ms to minimize.
[2021-05-14 21:31:47] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 1 ms to minimize.
[2021-05-14 21:31:47] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 1 ms to minimize.
[2021-05-14 21:31:48] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 0 ms to minimize.
[2021-05-14 21:31:48] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2021-05-14 21:31:48] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 1 ms to minimize.
[2021-05-14 21:31:48] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
[2021-05-14 21:31:48] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 8951 ms
[2021-05-14 21:31:48] [INFO ] Computed and/alt/rep : 918/2731/918 causal constraints (skipped 84 transitions) in 59 ms.
[2021-05-14 21:31:53] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 0 ms to minimize.
[2021-05-14 21:31:54] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 1 ms to minimize.
[2021-05-14 21:31:54] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 1 ms to minimize.
[2021-05-14 21:31:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 630 ms
[2021-05-14 21:31:54] [INFO ] Added : 499 causal constraints over 101 iterations in 5814 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-14 21:31:54] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-14 21:31:54] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:31:54] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2021-05-14 21:31:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:31:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2021-05-14 21:31:54] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:31:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:31:55] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2021-05-14 21:31:55] [INFO ] [Nat]Added 366 Read/Feed constraints in 41 ms returned sat
[2021-05-14 21:31:55] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 1 ms to minimize.
[2021-05-14 21:31:55] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 0 ms to minimize.
[2021-05-14 21:31:55] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 0 ms to minimize.
[2021-05-14 21:31:55] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 0 ms to minimize.
[2021-05-14 21:31:56] [INFO ] Deduced a trap composed of 56 places in 155 ms of which 1 ms to minimize.
[2021-05-14 21:31:56] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 0 ms to minimize.
[2021-05-14 21:31:56] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 0 ms to minimize.
[2021-05-14 21:31:56] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 0 ms to minimize.
[2021-05-14 21:31:56] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 0 ms to minimize.
[2021-05-14 21:31:57] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 0 ms to minimize.
[2021-05-14 21:31:57] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 0 ms to minimize.
[2021-05-14 21:31:57] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 0 ms to minimize.
[2021-05-14 21:31:57] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 1 ms to minimize.
[2021-05-14 21:31:57] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 0 ms to minimize.
[2021-05-14 21:31:57] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2021-05-14 21:31:58] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2021-05-14 21:31:58] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 1 ms to minimize.
[2021-05-14 21:31:58] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 1 ms to minimize.
[2021-05-14 21:31:58] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 1 ms to minimize.
[2021-05-14 21:31:58] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:31:58] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 1 ms to minimize.
[2021-05-14 21:31:59] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 1 ms to minimize.
[2021-05-14 21:31:59] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2021-05-14 21:31:59] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:31:59] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:31:59] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4440 ms
[2021-05-14 21:31:59] [INFO ] Computed and/alt/rep : 918/2731/918 causal constraints (skipped 84 transitions) in 50 ms.
[2021-05-14 21:32:06] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 0 ms to minimize.
[2021-05-14 21:32:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2021-05-14 21:32:06] [INFO ] Added : 626 causal constraints over 126 iterations in 6807 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
Incomplete Parikh walk after 310400 steps, including 1000 resets, run finished after 4408 ms. (steps per millisecond=70 ) properties (out of 6) seen :2 could not realise parikh vector
FORMULA Peterson-PT-6-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 244100 steps, including 1000 resets, run finished after 1833 ms. (steps per millisecond=133 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 298200 steps, including 1000 resets, run finished after 4113 ms. (steps per millisecond=72 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 148300 steps, including 1000 resets, run finished after 1854 ms. (steps per millisecond=79 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 190800 steps, including 1000 resets, run finished after 2067 ms. (steps per millisecond=92 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 155 out of 519 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 519/519 places, 1219/1219 transitions.
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 519 transition count 1218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 518 transition count 1218
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2 place count 518 transition count 1210
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 510 transition count 1210
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 32 place count 503 transition count 1203
Applied a total of 32 rules in 64 ms. Remains 503 /519 variables (removed 16) and now considering 1203/1219 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/519 places, 1203/1219 transitions.
[2021-05-14 21:32:20] [INFO ] Flatten gal took : 41 ms
[2021-05-14 21:32:20] [INFO ] Flatten gal took : 41 ms
[2021-05-14 21:32:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2612623676998651128.gal : 5 ms
[2021-05-14 21:32:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4790310410060596972.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2612623676998651128.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4790310410060596972.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality2612623676998651128.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4790310410060596972.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4790310410060596972.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :6 after 14
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :14 after 38
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :38 after 74
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :74 after 212
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :212 after 597
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :597 after 2353
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2353 after 5432
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :5432 after 15399
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :15399 after 81304
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :81304 after 284104
Detected timeout of ITS tools.
[2021-05-14 21:32:36] [INFO ] Flatten gal took : 39 ms
[2021-05-14 21:32:36] [INFO ] Applying decomposition
[2021-05-14 21:32:36] [INFO ] Flatten gal took : 42 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/graph14257253512683799144.txt, -o, /tmp/graph14257253512683799144.bin, -w, /tmp/graph14257253512683799144.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/graph14257253512683799144.bin, -l, -1, -v, -w, /tmp/graph14257253512683799144.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:32:36] [INFO ] Decomposing Gal with order
[2021-05-14 21:32:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:32:36] [INFO ] Removed a total of 1350 redundant transitions.
[2021-05-14 21:32:36] [INFO ] Flatten gal took : 76 ms
[2021-05-14 21:32:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 435 labels/synchronizations in 34 ms.
[2021-05-14 21:32:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5145728378905899866.gal : 6 ms
[2021-05-14 21:32:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11868954994813453416.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality5145728378905899866.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11868954994813453416.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality5145728378905899866.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11868954994813453416.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11868954994813453416.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1280
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1280 after 39982
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :39982 after 57369
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :57369 after 308365
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :308365 after 509000
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17944022974418967740
[2021-05-14 21:32:51] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17944022974418967740
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17944022974418967740]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17944022974418967740] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17944022974418967740] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 14405 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 247160 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=49 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2574 ms. (steps per millisecond=388 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2373 ms. (steps per millisecond=421 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1117 ms. (steps per millisecond=895 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 4873160 steps, run timeout after 30001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 4873160 steps, saw 617323 distinct states, run finished after 30001 ms. (steps per millisecond=162 ) properties seen :{}
Running SMT prover for 4 properties.
[2021-05-14 21:33:47] [INFO ] Flow matrix only has 993 transitions (discarded 210 similar events)
// Phase 1: matrix 993 rows 503 cols
[2021-05-14 21:33:47] [INFO ] Computed 27 place invariants in 4 ms
[2021-05-14 21:33:47] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2021-05-14 21:33:47] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 21:33:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:33:48] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2021-05-14 21:33:48] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:33:48] [INFO ] [Real]Added 366 Read/Feed constraints in 40 ms returned sat
[2021-05-14 21:33:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:33:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2021-05-14 21:33:48] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:33:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:33:48] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2021-05-14 21:33:48] [INFO ] [Nat]Added 366 Read/Feed constraints in 43 ms returned sat
[2021-05-14 21:33:49] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 0 ms to minimize.
[2021-05-14 21:33:49] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 0 ms to minimize.
[2021-05-14 21:33:49] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2021-05-14 21:33:49] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:33:49] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:33:49] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:33:50] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:33:50] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:33:50] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:33:50] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:33:50] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:33:50] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:33:51] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:33:51] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:33:51] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:33:51] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:33:51] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 0 ms to minimize.
[2021-05-14 21:33:51] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:33:51] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 0 ms to minimize.
[2021-05-14 21:33:52] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 0 ms to minimize.
[2021-05-14 21:33:52] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:33:52] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:33:52] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:33:52] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:33:52] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:33:52] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:33:53] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:33:53] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:33:53] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:33:53] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:33:53] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 1 ms to minimize.
[2021-05-14 21:33:53] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:33:54] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:33:54] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:33:54] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2021-05-14 21:33:54] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:33:54] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:33:54] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:33:54] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:33:55] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:33:55] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:33:55] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:33:55] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:33:55] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 0 ms to minimize.
[2021-05-14 21:33:55] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 0 ms to minimize.
[2021-05-14 21:33:56] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 1 ms to minimize.
[2021-05-14 21:33:56] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 0 ms to minimize.
[2021-05-14 21:33:56] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 1 ms to minimize.
[2021-05-14 21:33:56] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 1 ms to minimize.
[2021-05-14 21:33:56] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 1 ms to minimize.
[2021-05-14 21:33:56] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:33:56] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:33:57] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:33:57] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:33:57] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:33:57] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:33:57] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2021-05-14 21:33:58] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:33:58] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:33:58] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:33:58] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:33:58] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:33:59] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2021-05-14 21:33:59] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:33:59] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 0 ms to minimize.
[2021-05-14 21:33:59] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:33:59] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2021-05-14 21:34:00] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:34:00] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:34:00] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 0 ms to minimize.
[2021-05-14 21:34:00] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 0 ms to minimize.
[2021-05-14 21:34:01] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 1 ms to minimize.
[2021-05-14 21:34:01] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 1 ms to minimize.
[2021-05-14 21:34:01] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 1 ms to minimize.
[2021-05-14 21:34:01] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 0 ms to minimize.
[2021-05-14 21:34:01] [INFO ] Deduced a trap composed of 143 places in 151 ms of which 0 ms to minimize.
[2021-05-14 21:34:01] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 0 ms to minimize.
[2021-05-14 21:34:02] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 1 ms to minimize.
[2021-05-14 21:34:02] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 0 ms to minimize.
[2021-05-14 21:34:02] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 1 ms to minimize.
[2021-05-14 21:34:02] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 0 ms to minimize.
[2021-05-14 21:34:02] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:34:03] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:34:03] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:34:03] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:34:03] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:34:03] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:34:03] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:34:04] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:34:04] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:34:04] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:34:04] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:34:04] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:34:04] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:34:05] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:34:05] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:34:05] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:34:05] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:34:05] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 1 ms to minimize.
[2021-05-14 21:34:05] [INFO ] Trap strengthening (SAT) tested/added 100/99 trap constraints in 16719 ms
[2021-05-14 21:34:05] [INFO ] Computed and/alt/rep : 902/2715/902 causal constraints (skipped 84 transitions) in 50 ms.
[2021-05-14 21:34:17] [INFO ] Added : 885 causal constraints over 177 iterations in 12052 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2021-05-14 21:34:17] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-14 21:34:17] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:34:18] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2021-05-14 21:34:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:34:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2021-05-14 21:34:18] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:34:18] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2021-05-14 21:34:18] [INFO ] [Nat]Added 366 Read/Feed constraints in 41 ms returned sat
[2021-05-14 21:34:18] [INFO ] Deduced a trap composed of 139 places in 159 ms of which 1 ms to minimize.
[2021-05-14 21:34:18] [INFO ] Deduced a trap composed of 125 places in 161 ms of which 0 ms to minimize.
[2021-05-14 21:34:19] [INFO ] Deduced a trap composed of 119 places in 159 ms of which 0 ms to minimize.
[2021-05-14 21:34:19] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:34:19] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 1 ms to minimize.
[2021-05-14 21:34:19] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:34:19] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:34:19] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:34:20] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:34:20] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:34:20] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 1 ms to minimize.
[2021-05-14 21:34:20] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:34:20] [INFO ] Deduced a trap composed of 126 places in 160 ms of which 0 ms to minimize.
[2021-05-14 21:34:20] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 1 ms to minimize.
[2021-05-14 21:34:21] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 0 ms to minimize.
[2021-05-14 21:34:21] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 0 ms to minimize.
[2021-05-14 21:34:21] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 1 ms to minimize.
[2021-05-14 21:34:21] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 0 ms to minimize.
[2021-05-14 21:34:21] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 0 ms to minimize.
[2021-05-14 21:34:21] [INFO ] Deduced a trap composed of 60 places in 155 ms of which 0 ms to minimize.
[2021-05-14 21:34:22] [INFO ] Deduced a trap composed of 61 places in 154 ms of which 1 ms to minimize.
[2021-05-14 21:34:22] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 0 ms to minimize.
[2021-05-14 21:34:22] [INFO ] Deduced a trap composed of 60 places in 154 ms of which 1 ms to minimize.
[2021-05-14 21:34:22] [INFO ] Deduced a trap composed of 66 places in 156 ms of which 0 ms to minimize.
[2021-05-14 21:34:22] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 1 ms to minimize.
[2021-05-14 21:34:23] [INFO ] Deduced a trap composed of 59 places in 155 ms of which 0 ms to minimize.
[2021-05-14 21:34:23] [INFO ] Deduced a trap composed of 60 places in 154 ms of which 1 ms to minimize.
[2021-05-14 21:34:23] [INFO ] Deduced a trap composed of 59 places in 155 ms of which 1 ms to minimize.
[2021-05-14 21:34:23] [INFO ] Deduced a trap composed of 60 places in 154 ms of which 0 ms to minimize.
[2021-05-14 21:34:23] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:34:23] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 1 ms to minimize.
[2021-05-14 21:34:24] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 1 ms to minimize.
[2021-05-14 21:34:24] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 1 ms to minimize.
[2021-05-14 21:34:24] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 1 ms to minimize.
[2021-05-14 21:34:24] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 1 ms to minimize.
[2021-05-14 21:34:24] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 1 ms to minimize.
[2021-05-14 21:34:25] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 1 ms to minimize.
[2021-05-14 21:34:25] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:34:25] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:34:25] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:34:25] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:34:25] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:34:25] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:34:26] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:34:26] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2021-05-14 21:34:26] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:34:26] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:34:26] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:34:27] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:34:27] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:34:27] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:34:27] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:34:27] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:34:27] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:34:28] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:34:28] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 1 ms to minimize.
[2021-05-14 21:34:28] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:34:28] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:34:28] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:34:28] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2021-05-14 21:34:28] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2021-05-14 21:34:29] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:34:29] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:34:30] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:34:30] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:34:30] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:34:30] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:34:30] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:34:30] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:34:31] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:34:31] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:34:31] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:34:31] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:34:31] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:34:32] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 0 ms to minimize.
[2021-05-14 21:34:32] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:34:32] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:34:32] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:34:32] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:34:32] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:34:33] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2021-05-14 21:34:33] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:34:33] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:34:33] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:34:33] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:34:33] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:34:33] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2021-05-14 21:34:34] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 0 ms to minimize.
[2021-05-14 21:34:34] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:34:34] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2021-05-14 21:34:34] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:34:34] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:34:34] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 1 ms to minimize.
[2021-05-14 21:34:35] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 0 ms to minimize.
[2021-05-14 21:34:35] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 1 ms to minimize.
[2021-05-14 21:34:35] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 1 ms to minimize.
[2021-05-14 21:34:35] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 0 ms to minimize.
[2021-05-14 21:34:35] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 0 ms to minimize.
[2021-05-14 21:34:35] [INFO ] Trap strengthening (SAT) tested/added 99/98 trap constraints in 17095 ms
[2021-05-14 21:34:35] [INFO ] Computed and/alt/rep : 902/2715/902 causal constraints (skipped 84 transitions) in 51 ms.
[2021-05-14 21:34:51] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 0 ms to minimize.
[2021-05-14 21:34:51] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 0 ms to minimize.
[2021-05-14 21:34:51] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 1 ms to minimize.
[2021-05-14 21:34:51] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 1 ms to minimize.
[2021-05-14 21:34:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 682 ms
[2021-05-14 21:34:51] [INFO ] Added : 747 causal constraints over 150 iterations in 16137 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-14 21:34:51] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-14 21:34:51] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:34:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:34:52] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2021-05-14 21:34:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:34:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2021-05-14 21:34:52] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:34:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:34:52] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-14 21:34:52] [INFO ] [Nat]Added 366 Read/Feed constraints in 40 ms returned sat
[2021-05-14 21:34:52] [INFO ] Deduced a trap composed of 79 places in 157 ms of which 1 ms to minimize.
[2021-05-14 21:34:52] [INFO ] Deduced a trap composed of 90 places in 158 ms of which 1 ms to minimize.
[2021-05-14 21:34:52] [INFO ] Deduced a trap composed of 90 places in 174 ms of which 1 ms to minimize.
[2021-05-14 21:34:53] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 0 ms to minimize.
[2021-05-14 21:34:53] [INFO ] Deduced a trap composed of 79 places in 159 ms of which 1 ms to minimize.
[2021-05-14 21:34:53] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 1 ms to minimize.
[2021-05-14 21:34:53] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 1 ms to minimize.
[2021-05-14 21:34:53] [INFO ] Deduced a trap composed of 123 places in 158 ms of which 0 ms to minimize.
[2021-05-14 21:34:54] [INFO ] Deduced a trap composed of 118 places in 159 ms of which 1 ms to minimize.
[2021-05-14 21:34:54] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 0 ms to minimize.
[2021-05-14 21:34:54] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 1 ms to minimize.
[2021-05-14 21:34:54] [INFO ] Deduced a trap composed of 107 places in 170 ms of which 0 ms to minimize.
[2021-05-14 21:34:54] [INFO ] Deduced a trap composed of 126 places in 169 ms of which 1 ms to minimize.
[2021-05-14 21:34:55] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 0 ms to minimize.
[2021-05-14 21:34:55] [INFO ] Deduced a trap composed of 81 places in 171 ms of which 0 ms to minimize.
[2021-05-14 21:34:55] [INFO ] Deduced a trap composed of 107 places in 170 ms of which 1 ms to minimize.
[2021-05-14 21:34:55] [INFO ] Deduced a trap composed of 128 places in 175 ms of which 0 ms to minimize.
[2021-05-14 21:34:55] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 1 ms to minimize.
[2021-05-14 21:34:56] [INFO ] Deduced a trap composed of 143 places in 168 ms of which 0 ms to minimize.
[2021-05-14 21:34:56] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 0 ms to minimize.
[2021-05-14 21:34:56] [INFO ] Deduced a trap composed of 129 places in 168 ms of which 0 ms to minimize.
[2021-05-14 21:34:56] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2021-05-14 21:34:56] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 1 ms to minimize.
[2021-05-14 21:34:57] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 1 ms to minimize.
[2021-05-14 21:34:57] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 1 ms to minimize.
[2021-05-14 21:34:57] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 1 ms to minimize.
[2021-05-14 21:34:57] [INFO ] Deduced a trap composed of 128 places in 165 ms of which 0 ms to minimize.
[2021-05-14 21:34:57] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 1 ms to minimize.
[2021-05-14 21:34:57] [INFO ] Deduced a trap composed of 80 places in 170 ms of which 1 ms to minimize.
[2021-05-14 21:34:58] [INFO ] Deduced a trap composed of 125 places in 170 ms of which 0 ms to minimize.
[2021-05-14 21:34:58] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 1 ms to minimize.
[2021-05-14 21:34:58] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 1 ms to minimize.
[2021-05-14 21:34:58] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 1 ms to minimize.
[2021-05-14 21:34:58] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 1 ms to minimize.
[2021-05-14 21:34:59] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:34:59] [INFO ] Deduced a trap composed of 66 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:34:59] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 0 ms to minimize.
[2021-05-14 21:34:59] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:34:59] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:34:59] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:35:00] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2021-05-14 21:35:00] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 1 ms to minimize.
[2021-05-14 21:35:00] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 1 ms to minimize.
[2021-05-14 21:35:08] [INFO ] Deduced a trap composed of 28 places in 8310 ms of which 0 ms to minimize.
[2021-05-14 21:35:08] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 0 ms to minimize.
[2021-05-14 21:35:09] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:35:09] [INFO ] Deduced a trap composed of 115 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:35:09] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:35:09] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 1 ms to minimize.
[2021-05-14 21:35:09] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 0 ms to minimize.
[2021-05-14 21:35:10] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 1 ms to minimize.
[2021-05-14 21:35:10] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 1 ms to minimize.
[2021-05-14 21:35:10] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 0 ms to minimize.
[2021-05-14 21:35:10] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 1 ms to minimize.
[2021-05-14 21:35:10] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 0 ms to minimize.
[2021-05-14 21:35:10] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 0 ms to minimize.
[2021-05-14 21:35:11] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 0 ms to minimize.
[2021-05-14 21:35:11] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 1 ms to minimize.
[2021-05-14 21:35:11] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 1 ms to minimize.
[2021-05-14 21:35:11] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 0 ms to minimize.
[2021-05-14 21:35:11] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 0 ms to minimize.
[2021-05-14 21:35:12] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 1 ms to minimize.
[2021-05-14 21:35:12] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 0 ms to minimize.
[2021-05-14 21:35:12] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 1 ms to minimize.
[2021-05-14 21:35:12] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:35:12] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:35:13] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:35:13] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:35:13] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:35:13] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:35:13] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:35:13] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 0 ms to minimize.
[2021-05-14 21:35:14] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 1 ms to minimize.
[2021-05-14 21:35:14] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 0 ms to minimize.
[2021-05-14 21:35:14] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 1 ms to minimize.
[2021-05-14 21:35:14] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 0 ms to minimize.
[2021-05-14 21:35:14] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:35:14] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 0 ms to minimize.
[2021-05-14 21:35:15] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:35:15] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:35:15] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:35:15] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:35:15] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2021-05-14 21:35:15] [INFO ] Trap strengthening (SAT) tested/added 84/83 trap constraints in 23312 ms
[2021-05-14 21:35:15] [INFO ] Computed and/alt/rep : 902/2715/902 causal constraints (skipped 84 transitions) in 51 ms.
[2021-05-14 21:35:20] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 0 ms to minimize.
[2021-05-14 21:35:20] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 0 ms to minimize.
[2021-05-14 21:35:20] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:35:21] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:35:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 799 ms
[2021-05-14 21:35:21] [INFO ] Added : 466 causal constraints over 94 iterations in 5608 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-14 21:35:21] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-14 21:35:21] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:35:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:35:21] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2021-05-14 21:35:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:35:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 24 ms returned sat
[2021-05-14 21:35:21] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:35:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:35:21] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2021-05-14 21:35:21] [INFO ] [Nat]Added 366 Read/Feed constraints in 40 ms returned sat
[2021-05-14 21:35:22] [INFO ] Deduced a trap composed of 104 places in 157 ms of which 0 ms to minimize.
[2021-05-14 21:35:22] [INFO ] Deduced a trap composed of 75 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:35:22] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 1 ms to minimize.
[2021-05-14 21:35:22] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 0 ms to minimize.
[2021-05-14 21:35:22] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:35:23] [INFO ] Deduced a trap composed of 115 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:35:23] [INFO ] Deduced a trap composed of 86 places in 154 ms of which 1 ms to minimize.
[2021-05-14 21:35:23] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:35:23] [INFO ] Deduced a trap composed of 92 places in 157 ms of which 0 ms to minimize.
[2021-05-14 21:35:23] [INFO ] Deduced a trap composed of 91 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:35:23] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 0 ms to minimize.
[2021-05-14 21:35:24] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 0 ms to minimize.
[2021-05-14 21:35:24] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 1 ms to minimize.
[2021-05-14 21:35:24] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 1 ms to minimize.
[2021-05-14 21:35:24] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:35:24] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:35:24] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:35:24] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:35:25] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:35:25] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:35:25] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:35:25] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:35:25] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 1 ms to minimize.
[2021-05-14 21:35:25] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:35:26] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:35:26] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 1 ms to minimize.
[2021-05-14 21:35:26] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2021-05-14 21:35:26] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 1 ms to minimize.
[2021-05-14 21:35:26] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:35:26] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2021-05-14 21:35:27] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2021-05-14 21:35:27] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:35:27] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:35:27] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:35:27] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:35:27] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:35:27] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:35:28] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:35:28] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:35:28] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:35:28] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:35:28] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:35:28] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:35:28] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:35:28] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:35:29] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:35:29] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 0 ms to minimize.
[2021-05-14 21:35:29] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 7325 ms
[2021-05-14 21:35:29] [INFO ] Computed and/alt/rep : 902/2715/902 causal constraints (skipped 84 transitions) in 50 ms.
[2021-05-14 21:35:37] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:35:37] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:35:38] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:35:38] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:35:38] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:35:38] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:35:38] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2021-05-14 21:35:38] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 1 ms to minimize.
[2021-05-14 21:35:39] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:35:39] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 0 ms to minimize.
[2021-05-14 21:35:39] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:35:39] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 0 ms to minimize.
[2021-05-14 21:35:39] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 1 ms to minimize.
[2021-05-14 21:35:39] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
[2021-05-14 21:35:40] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 0 ms to minimize.
[2021-05-14 21:35:40] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 0 ms to minimize.
[2021-05-14 21:35:40] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2959 ms
[2021-05-14 21:35:40] [INFO ] Added : 744 causal constraints over 149 iterations in 11226 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
Incomplete Parikh walk after 295400 steps, including 1000 resets, run finished after 2198 ms. (steps per millisecond=134 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 286900 steps, including 1000 resets, run finished after 3803 ms. (steps per millisecond=75 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 137700 steps, including 1000 resets, run finished after 1378 ms. (steps per millisecond=99 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 265900 steps, including 1000 resets, run finished after 1944 ms. (steps per millisecond=136 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA Peterson-PT-6-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 148 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 1203/1203 transitions.
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 503 transition count 1202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 502 transition count 1202
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 502 transition count 1197
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 497 transition count 1197
Applied a total of 12 rules in 37 ms. Remains 497 /503 variables (removed 6) and now considering 1197/1203 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 497/503 places, 1197/1203 transitions.
[2021-05-14 21:35:50] [INFO ] Flatten gal took : 36 ms
[2021-05-14 21:35:50] [INFO ] Flatten gal took : 36 ms
[2021-05-14 21:35:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13592548313291550257.gal : 4 ms
[2021-05-14 21:35:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9982663015712321958.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality13592548313291550257.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9982663015712321958.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality13592548313291550257.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9982663015712321958.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9982663015712321958.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 14
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :14 after 15
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :15 after 36
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :36 after 69
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :69 after 151
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :151 after 271
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :271 after 766
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :766 after 4203
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :4203 after 11246
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :11246 after 22599
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :22599 after 163986
Detected timeout of ITS tools.
[2021-05-14 21:36:05] [INFO ] Flatten gal took : 34 ms
[2021-05-14 21:36:05] [INFO ] Applying decomposition
[2021-05-14 21:36:05] [INFO ] Flatten gal took : 35 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/graph4246410913742534374.txt, -o, /tmp/graph4246410913742534374.bin, -w, /tmp/graph4246410913742534374.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/graph4246410913742534374.bin, -l, -1, -v, -w, /tmp/graph4246410913742534374.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:36:05] [INFO ] Decomposing Gal with order
[2021-05-14 21:36:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:36:05] [INFO ] Removed a total of 1341 redundant transitions.
[2021-05-14 21:36:05] [INFO ] Flatten gal took : 63 ms
[2021-05-14 21:36:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 376 labels/synchronizations in 15 ms.
[2021-05-14 21:36:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8998615784870165662.gal : 6 ms
[2021-05-14 21:36:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6204722343606571596.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8998615784870165662.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6204722343606571596.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality8998615784870165662.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6204722343606571596.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6204722343606571596.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 3840
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15168025068979351437
[2021-05-14 21:36:23] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15168025068979351437
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15168025068979351437]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15168025068979351437] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15168025068979351437] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 26656 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 243568 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=48 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2549 ms. (steps per millisecond=392 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1202 ms. (steps per millisecond=831 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 5118776 steps, run timeout after 30001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 5118776 steps, saw 651015 distinct states, run finished after 30001 ms. (steps per millisecond=170 ) properties seen :{}
Running SMT prover for 3 properties.
[2021-05-14 21:37:30] [INFO ] Flow matrix only has 987 transitions (discarded 210 similar events)
// Phase 1: matrix 987 rows 497 cols
[2021-05-14 21:37:30] [INFO ] Computed 27 place invariants in 3 ms
[2021-05-14 21:37:30] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2021-05-14 21:37:30] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 21:37:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:37:30] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2021-05-14 21:37:30] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:37:30] [INFO ] [Real]Added 366 Read/Feed constraints in 36 ms returned sat
[2021-05-14 21:37:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:37:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2021-05-14 21:37:30] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 21:37:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:37:31] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2021-05-14 21:37:31] [INFO ] [Nat]Added 366 Read/Feed constraints in 44 ms returned sat
[2021-05-14 21:37:31] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 1 ms to minimize.
[2021-05-14 21:37:31] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 0 ms to minimize.
[2021-05-14 21:37:31] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 1 ms to minimize.
[2021-05-14 21:37:32] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 0 ms to minimize.
[2021-05-14 21:37:32] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:37:32] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:37:32] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:37:32] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:37:32] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:37:33] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:37:33] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:37:33] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:37:33] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:37:33] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:37:33] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:37:33] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:37:34] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:37:34] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:37:34] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:37:34] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:37:34] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:37:34] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:37:35] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:37:35] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:37:35] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:37:35] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:37:35] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:37:35] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2021-05-14 21:37:35] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2021-05-14 21:37:35] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2021-05-14 21:37:35] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 4631 ms
[2021-05-14 21:37:35] [INFO ] Computed and/alt/rep : 896/2709/896 causal constraints (skipped 84 transitions) in 50 ms.
[2021-05-14 21:37:46] [INFO ] Added : 868 causal constraints over 174 iterations in 10723 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-14 21:37:46] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-14 21:37:46] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:37:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:37:47] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2021-05-14 21:37:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:37:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2021-05-14 21:37:47] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 21:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:37:47] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2021-05-14 21:37:47] [INFO ] [Nat]Added 366 Read/Feed constraints in 40 ms returned sat
[2021-05-14 21:37:47] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 1 ms to minimize.
[2021-05-14 21:37:47] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:37:47] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 1 ms to minimize.
[2021-05-14 21:37:48] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 11 ms to minimize.
[2021-05-14 21:37:48] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 0 ms to minimize.
[2021-05-14 21:37:48] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 1 ms to minimize.
[2021-05-14 21:37:48] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:37:48] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 0 ms to minimize.
[2021-05-14 21:37:49] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 0 ms to minimize.
[2021-05-14 21:37:49] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2021-05-14 21:37:49] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 1 ms to minimize.
[2021-05-14 21:37:49] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2021-05-14 21:37:49] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 1 ms to minimize.
[2021-05-14 21:37:49] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:37:50] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:37:50] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:37:50] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:37:50] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:37:50] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:37:50] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 1 ms to minimize.
[2021-05-14 21:37:50] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:37:51] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:37:51] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:37:51] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:37:51] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:37:51] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:37:51] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:37:52] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:37:52] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:37:52] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 1 ms to minimize.
[2021-05-14 21:37:52] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:37:52] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:37:52] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:37:53] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:37:53] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:37:53] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:37:53] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
[2021-05-14 21:37:53] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 0 ms to minimize.
[2021-05-14 21:37:53] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 1 ms to minimize.
[2021-05-14 21:37:53] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:37:54] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 1 ms to minimize.
[2021-05-14 21:37:54] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:37:54] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 1 ms to minimize.
[2021-05-14 21:37:54] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2021-05-14 21:37:54] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:37:54] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:37:55] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:37:55] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:37:55] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:37:55] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 1 ms to minimize.
[2021-05-14 21:37:55] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 0 ms to minimize.
[2021-05-14 21:37:56] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 0 ms to minimize.
[2021-05-14 21:37:56] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:37:56] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 0 ms to minimize.
[2021-05-14 21:37:56] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:37:56] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:37:57] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:37:57] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:37:57] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2021-05-14 21:37:57] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:37:57] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:37:57] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 1 ms to minimize.
[2021-05-14 21:37:57] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 1 ms to minimize.
[2021-05-14 21:37:58] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 0 ms to minimize.
[2021-05-14 21:37:58] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2021-05-14 21:37:58] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 0 ms to minimize.
[2021-05-14 21:37:58] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 0 ms to minimize.
[2021-05-14 21:37:58] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 0 ms to minimize.
[2021-05-14 21:37:58] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:37:58] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:37:59] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 0 ms to minimize.
[2021-05-14 21:37:59] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 0 ms to minimize.
[2021-05-14 21:37:59] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 0 ms to minimize.
[2021-05-14 21:37:59] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:37:59] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:37:59] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 0 ms to minimize.
[2021-05-14 21:37:59] [INFO ] Trap strengthening (SAT) tested/added 77/76 trap constraints in 12325 ms
[2021-05-14 21:37:59] [INFO ] Computed and/alt/rep : 896/2709/896 causal constraints (skipped 84 transitions) in 54 ms.
[2021-05-14 21:38:10] [INFO ] Added : 860 causal constraints over 172 iterations in 10594 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-14 21:38:10] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-14 21:38:10] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:38:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:38:10] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2021-05-14 21:38:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:38:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-14 21:38:10] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:38:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:38:10] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2021-05-14 21:38:10] [INFO ] [Nat]Added 366 Read/Feed constraints in 41 ms returned sat
[2021-05-14 21:38:11] [INFO ] Deduced a trap composed of 119 places in 150 ms of which 0 ms to minimize.
[2021-05-14 21:38:11] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:38:11] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 1 ms to minimize.
[2021-05-14 21:38:11] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 0 ms to minimize.
[2021-05-14 21:38:11] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 0 ms to minimize.
[2021-05-14 21:38:12] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 1 ms to minimize.
[2021-05-14 21:38:12] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:38:12] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:38:12] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:38:12] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 1 ms to minimize.
[2021-05-14 21:38:12] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 1 ms to minimize.
[2021-05-14 21:38:13] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 0 ms to minimize.
[2021-05-14 21:38:13] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 1 ms to minimize.
[2021-05-14 21:38:13] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2021-05-14 21:38:13] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 1 ms to minimize.
[2021-05-14 21:38:13] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 1 ms to minimize.
[2021-05-14 21:38:13] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:38:14] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 1 ms to minimize.
[2021-05-14 21:38:14] [INFO ] Deduced a trap composed of 117 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:38:14] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 1 ms to minimize.
[2021-05-14 21:38:14] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2021-05-14 21:38:14] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:38:14] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:38:15] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:38:15] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:38:15] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:38:15] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:38:15] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:38:15] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:38:15] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:38:16] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:38:16] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 1 ms to minimize.
[2021-05-14 21:38:16] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:38:16] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 0 ms to minimize.
[2021-05-14 21:38:16] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:38:16] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:38:16] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:38:17] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 0 ms to minimize.
[2021-05-14 21:38:17] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 6131 ms
[2021-05-14 21:38:17] [INFO ] Computed and/alt/rep : 896/2709/896 causal constraints (skipped 84 transitions) in 50 ms.
[2021-05-14 21:38:24] [INFO ] Deduced a trap composed of 86 places in 162 ms of which 1 ms to minimize.
[2021-05-14 21:38:25] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2021-05-14 21:38:25] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:38:25] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:38:25] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:38:25] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:38:26] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:38:26] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:38:26] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:38:26] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2021-05-14 21:38:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2080 ms
[2021-05-14 21:38:26] [INFO ] Added : 706 causal constraints over 142 iterations in 9851 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Incomplete Parikh walk after 322000 steps, including 1000 resets, run finished after 2372 ms. (steps per millisecond=135 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 341700 steps, including 1000 resets, run finished after 2164 ms. (steps per millisecond=157 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 252200 steps, including 1000 resets, run finished after 3318 ms. (steps per millisecond=76 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 148 out of 497 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 497/497 places, 1197/1197 transitions.
Applied a total of 0 rules in 19 ms. Remains 497 /497 variables (removed 0) and now considering 1197/1197 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 497/497 places, 1197/1197 transitions.
Starting structural reductions, iteration 0 : 497/497 places, 1197/1197 transitions.
Applied a total of 0 rules in 19 ms. Remains 497 /497 variables (removed 0) and now considering 1197/1197 (removed 0) transitions.
[2021-05-14 21:38:34] [INFO ] Flow matrix only has 987 transitions (discarded 210 similar events)
// Phase 1: matrix 987 rows 497 cols
[2021-05-14 21:38:34] [INFO ] Computed 27 place invariants in 7 ms
[2021-05-14 21:38:35] [INFO ] Implicit Places using invariants in 241 ms returned [436, 437, 439, 468, 469, 470, 471]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 244 ms to find 7 implicit places.
[2021-05-14 21:38:35] [INFO ] Redundant transitions in 77 ms returned []
[2021-05-14 21:38:35] [INFO ] Flow matrix only has 987 transitions (discarded 210 similar events)
// Phase 1: matrix 987 rows 490 cols
[2021-05-14 21:38:35] [INFO ] Computed 20 place invariants in 5 ms
[2021-05-14 21:38:35] [INFO ] Dead Transitions using invariants and state equation in 460 ms returned []
Starting structural reductions, iteration 1 : 490/497 places, 1197/1197 transitions.
Applied a total of 0 rules in 18 ms. Remains 490 /490 variables (removed 0) and now considering 1197/1197 (removed 0) transitions.
[2021-05-14 21:38:35] [INFO ] Redundant transitions in 230 ms returned []
[2021-05-14 21:38:35] [INFO ] Flow matrix only has 987 transitions (discarded 210 similar events)
// Phase 1: matrix 987 rows 490 cols
[2021-05-14 21:38:35] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:38:36] [INFO ] Dead Transitions using invariants and state equation in 486 ms returned []
Finished structural reductions, in 2 iterations. Remains : 490/497 places, 1197/1197 transitions.
[2021-05-14 21:38:36] [INFO ] Flatten gal took : 32 ms
[2021-05-14 21:38:36] [INFO ] Flatten gal took : 31 ms
[2021-05-14 21:38:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7257949796340181379.gal : 4 ms
[2021-05-14 21:38:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9801359819741259426.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality7257949796340181379.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9801359819741259426.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality7257949796340181379.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9801359819741259426.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9801359819741259426.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :6 after 14
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :14 after 38
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :38 after 74
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :74 after 212
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :212 after 565
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :565 after 2343
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :2343 after 5420
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :5420 after 15319
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :15319 after 93618
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :93618 after 274738
Detected timeout of ITS tools.
[2021-05-14 21:38:56] [INFO ] Flatten gal took : 32 ms
[2021-05-14 21:38:56] [INFO ] Applying decomposition
[2021-05-14 21:38:56] [INFO ] Flatten gal took : 31 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/graph9383847531683036261.txt, -o, /tmp/graph9383847531683036261.bin, -w, /tmp/graph9383847531683036261.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/graph9383847531683036261.bin, -l, -1, -v, -w, /tmp/graph9383847531683036261.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:38:56] [INFO ] Decomposing Gal with order
[2021-05-14 21:38:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:38:56] [INFO ] Removed a total of 1346 redundant transitions.
[2021-05-14 21:38:56] [INFO ] Flatten gal took : 60 ms
[2021-05-14 21:38:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 369 labels/synchronizations in 9 ms.
[2021-05-14 21:38:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3785019628935368954.gal : 7 ms
[2021-05-14 21:38:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10348297596610034880.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3785019628935368954.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10348297596610034880.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality3785019628935368954.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10348297596610034880.prop --nowitness
Loading property file /tmp/ReachabilityCardinality10348297596610034880.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 18
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :18 after 2712
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :2712 after 5216
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :5216 after 1.30093e+06
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.30093e+06 after 1.37898e+06
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.37898e+06 after 1.44528e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4782202631609088612
[2021-05-14 21:39:16] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4782202631609088612
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4782202631609088612]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4782202631609088612] killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4782202631609088612] killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 14535 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 253112 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=50 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2621 ms. (steps per millisecond=381 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1044 ms. (steps per millisecond=957 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 5108624 steps, run timeout after 30001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 5108624 steps, saw 649505 distinct states, run finished after 30001 ms. (steps per millisecond=170 ) properties seen :{}
Running SMT prover for 3 properties.
[2021-05-14 21:40:12] [INFO ] Flow matrix only has 987 transitions (discarded 210 similar events)
// Phase 1: matrix 987 rows 490 cols
[2021-05-14 21:40:12] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:40:12] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2021-05-14 21:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:40:12] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2021-05-14 21:40:12] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:40:12] [INFO ] [Real]Added 366 Read/Feed constraints in 40 ms returned sat
[2021-05-14 21:40:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:40:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2021-05-14 21:40:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:40:13] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2021-05-14 21:40:13] [INFO ] [Nat]Added 366 Read/Feed constraints in 45 ms returned sat
[2021-05-14 21:40:13] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:40:13] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:40:13] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 1 ms to minimize.
[2021-05-14 21:40:13] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2021-05-14 21:40:14] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:40:14] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 1 ms to minimize.
[2021-05-14 21:40:14] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:40:14] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:40:14] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:40:14] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:40:14] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:40:15] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:40:15] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:40:15] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:40:15] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:40:15] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:40:15] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:40:16] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:40:16] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:40:16] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:40:16] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:40:16] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:40:16] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:40:16] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:40:17] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:40:17] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:40:17] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:40:17] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:40:17] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:40:17] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:40:18] [INFO ] Deduced a trap composed of 60 places in 131 ms of which 1 ms to minimize.
[2021-05-14 21:40:18] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:40:18] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:40:18] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:40:18] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 0 ms to minimize.
[2021-05-14 21:40:18] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 0 ms to minimize.
[2021-05-14 21:40:18] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 0 ms to minimize.
[2021-05-14 21:40:19] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 0 ms to minimize.
[2021-05-14 21:40:19] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 1 ms to minimize.
[2021-05-14 21:40:19] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2021-05-14 21:40:19] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 0 ms to minimize.
[2021-05-14 21:40:19] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2021-05-14 21:40:19] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2021-05-14 21:40:19] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:40:20] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:40:20] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:40:20] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:40:20] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:40:20] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:40:20] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:40:21] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:40:21] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:40:21] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:40:21] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:40:21] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 0 ms to minimize.
[2021-05-14 21:40:21] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:40:21] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:40:22] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 0 ms to minimize.
[2021-05-14 21:40:22] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2021-05-14 21:40:22] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:40:22] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:40:23] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:40:23] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:40:23] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
[2021-05-14 21:40:23] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 0 ms to minimize.
[2021-05-14 21:40:23] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:40:23] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:40:24] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 0 ms to minimize.
[2021-05-14 21:40:24] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 0 ms to minimize.
[2021-05-14 21:40:24] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:40:24] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:40:24] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 0 ms to minimize.
[2021-05-14 21:40:25] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 0 ms to minimize.
[2021-05-14 21:40:25] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2021-05-14 21:40:25] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:40:25] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 0 ms to minimize.
[2021-05-14 21:40:25] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 0 ms to minimize.
[2021-05-14 21:40:25] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:40:26] [INFO ] Deduced a trap composed of 68 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:40:26] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 0 ms to minimize.
[2021-05-14 21:40:26] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:40:26] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:40:26] [INFO ] Deduced a trap composed of 52 places in 144 ms of which 0 ms to minimize.
[2021-05-14 21:40:27] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2021-05-14 21:40:27] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:40:27] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 1 ms to minimize.
[2021-05-14 21:40:27] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 0 ms to minimize.
[2021-05-14 21:40:27] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 0 ms to minimize.
[2021-05-14 21:40:28] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:40:28] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:40:28] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:40:28] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:40:28] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:40:28] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:40:29] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:40:29] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:40:29] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:40:29] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:40:29] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:40:29] [INFO ] Trap strengthening (SAT) tested/added 100/99 trap constraints in 16669 ms
[2021-05-14 21:40:29] [INFO ] Computed and/alt/rep : 896/2709/896 causal constraints (skipped 84 transitions) in 53 ms.
[2021-05-14 21:40:41] [INFO ] Added : 864 causal constraints over 173 iterations in 12141 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2021-05-14 21:40:42] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2021-05-14 21:40:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:40:42] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2021-05-14 21:40:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:40:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-14 21:40:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:40:42] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2021-05-14 21:40:42] [INFO ] [Nat]Added 366 Read/Feed constraints in 42 ms returned sat
[2021-05-14 21:40:42] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 0 ms to minimize.
[2021-05-14 21:40:42] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 0 ms to minimize.
[2021-05-14 21:40:43] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 0 ms to minimize.
[2021-05-14 21:40:43] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 1 ms to minimize.
[2021-05-14 21:40:43] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 1 ms to minimize.
[2021-05-14 21:40:43] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 1 ms to minimize.
[2021-05-14 21:40:43] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 1 ms to minimize.
[2021-05-14 21:40:44] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 0 ms to minimize.
[2021-05-14 21:40:44] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2021-05-14 21:40:44] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2021-05-14 21:40:44] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 1 ms to minimize.
[2021-05-14 21:40:44] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:40:44] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 0 ms to minimize.
[2021-05-14 21:40:45] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:40:45] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 0 ms to minimize.
[2021-05-14 21:40:45] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:40:45] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:40:45] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2021-05-14 21:40:45] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:40:46] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 1 ms to minimize.
[2021-05-14 21:40:46] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:40:46] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 1 ms to minimize.
[2021-05-14 21:40:46] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 0 ms to minimize.
[2021-05-14 21:40:46] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 1 ms to minimize.
[2021-05-14 21:40:47] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 0 ms to minimize.
[2021-05-14 21:40:47] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 0 ms to minimize.
[2021-05-14 21:40:47] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:40:47] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:40:47] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2021-05-14 21:40:47] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:40:48] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 1 ms to minimize.
[2021-05-14 21:40:48] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:40:48] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:40:48] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2021-05-14 21:40:48] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:40:48] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:40:48] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:40:49] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:40:49] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:40:49] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:40:49] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:40:49] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:40:49] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:40:50] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:40:50] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:40:50] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:40:50] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:40:50] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:40:50] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:40:50] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:40:51] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:40:51] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:40:51] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:40:51] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:40:51] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:40:51] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:40:52] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:40:52] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 1 ms to minimize.
[2021-05-14 21:40:52] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:40:52] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:40:52] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 1 ms to minimize.
[2021-05-14 21:40:52] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:40:53] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:40:53] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 1 ms to minimize.
[2021-05-14 21:40:53] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 1 ms to minimize.
[2021-05-14 21:40:53] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:40:53] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 0 ms to minimize.
[2021-05-14 21:40:53] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 0 ms to minimize.
[2021-05-14 21:40:53] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:40:53] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2021-05-14 21:40:54] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 0 ms to minimize.
[2021-05-14 21:40:54] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2021-05-14 21:40:54] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 0 ms to minimize.
[2021-05-14 21:40:54] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2021-05-14 21:40:54] [INFO ] Deduced a trap composed of 91 places in 72 ms of which 1 ms to minimize.
[2021-05-14 21:40:54] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2021-05-14 21:40:54] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2021-05-14 21:40:54] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2021-05-14 21:40:54] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2021-05-14 21:40:54] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 0 ms to minimize.
[2021-05-14 21:40:55] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2021-05-14 21:40:55] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 0 ms to minimize.
[2021-05-14 21:40:55] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:40:55] [INFO ] Trap strengthening (SAT) tested/added 84/83 trap constraints in 12728 ms
[2021-05-14 21:40:55] [INFO ] Computed and/alt/rep : 896/2709/896 causal constraints (skipped 84 transitions) in 50 ms.
[2021-05-14 21:41:06] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
[2021-05-14 21:41:06] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:41:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 421 ms
[2021-05-14 21:41:06] [INFO ] Added : 855 causal constraints over 171 iterations in 11364 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-14 21:41:06] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-14 21:41:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:41:07] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-14 21:41:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:41:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-14 21:41:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:41:07] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2021-05-14 21:41:07] [INFO ] [Nat]Added 366 Read/Feed constraints in 41 ms returned sat
[2021-05-14 21:41:07] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:41:07] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 1 ms to minimize.
[2021-05-14 21:41:07] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:41:08] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 1 ms to minimize.
[2021-05-14 21:41:08] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 1 ms to minimize.
[2021-05-14 21:41:08] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:41:08] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:41:08] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:41:08] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:41:09] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:41:09] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:41:09] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2021-05-14 21:41:09] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:41:09] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:41:09] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2021-05-14 21:41:09] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:41:09] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2478 ms
[2021-05-14 21:41:09] [INFO ] Computed and/alt/rep : 896/2709/896 causal constraints (skipped 84 transitions) in 50 ms.
[2021-05-14 21:41:18] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:41:18] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:41:19] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 0 ms to minimize.
[2021-05-14 21:41:19] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:41:19] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:41:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 926 ms
[2021-05-14 21:41:19] [INFO ] Added : 736 causal constraints over 148 iterations in 9621 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Incomplete Parikh walk after 301700 steps, including 1000 resets, run finished after 4240 ms. (steps per millisecond=71 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 326100 steps, including 1000 resets, run finished after 4253 ms. (steps per millisecond=76 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 252100 steps, including 1000 resets, run finished after 1733 ms. (steps per millisecond=145 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 148 out of 490 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 490/490 places, 1197/1197 transitions.
Applied a total of 0 rules in 25 ms. Remains 490 /490 variables (removed 0) and now considering 1197/1197 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 490/490 places, 1197/1197 transitions.
Starting structural reductions, iteration 0 : 490/490 places, 1197/1197 transitions.
Applied a total of 0 rules in 14 ms. Remains 490 /490 variables (removed 0) and now considering 1197/1197 (removed 0) transitions.
[2021-05-14 21:41:29] [INFO ] Flow matrix only has 987 transitions (discarded 210 similar events)
// Phase 1: matrix 987 rows 490 cols
[2021-05-14 21:41:29] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:41:30] [INFO ] Implicit Places using invariants in 231 ms returned []
[2021-05-14 21:41:30] [INFO ] Flow matrix only has 987 transitions (discarded 210 similar events)
// Phase 1: matrix 987 rows 490 cols
[2021-05-14 21:41:30] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:41:30] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:41:31] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
[2021-05-14 21:41:31] [INFO ] Redundant transitions in 12 ms returned []
[2021-05-14 21:41:31] [INFO ] Flow matrix only has 987 transitions (discarded 210 similar events)
// Phase 1: matrix 987 rows 490 cols
[2021-05-14 21:41:31] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-14 21:41:32] [INFO ] Dead Transitions using invariants and state equation in 452 ms returned []
Finished structural reductions, in 1 iterations. Remains : 490/490 places, 1197/1197 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1505 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2021-05-14 21:41:33] [INFO ] Flow matrix only has 987 transitions (discarded 210 similar events)
// Phase 1: matrix 987 rows 490 cols
[2021-05-14 21:41:33] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-14 21:41:33] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2021-05-14 21:41:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:41:34] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2021-05-14 21:41:34] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:41:34] [INFO ] [Real]Added 366 Read/Feed constraints in 40 ms returned sat
[2021-05-14 21:41:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:41:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2021-05-14 21:41:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:41:34] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2021-05-14 21:41:34] [INFO ] [Nat]Added 366 Read/Feed constraints in 42 ms returned sat
[2021-05-14 21:41:34] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:41:35] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2021-05-14 21:41:35] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:41:35] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2021-05-14 21:41:35] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 1 ms to minimize.
[2021-05-14 21:41:35] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:41:35] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:41:36] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:41:36] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:41:36] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:41:36] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:41:36] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:41:37] [INFO ] Deduced a trap composed of 21 places in 378 ms of which 0 ms to minimize.
[2021-05-14 21:41:37] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:41:37] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:41:37] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:41:37] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:41:37] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:41:38] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:41:38] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:41:38] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:41:38] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:41:38] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:41:38] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:41:38] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:41:39] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:41:39] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:41:39] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:41:39] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:41:39] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:41:39] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 1 ms to minimize.
[2021-05-14 21:41:40] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:41:40] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 1 ms to minimize.
[2021-05-14 21:41:40] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:41:40] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:41:40] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 0 ms to minimize.
[2021-05-14 21:41:40] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 1 ms to minimize.
[2021-05-14 21:41:40] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 1 ms to minimize.
[2021-05-14 21:41:41] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 1 ms to minimize.
[2021-05-14 21:41:41] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:41:41] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 0 ms to minimize.
[2021-05-14 21:41:41] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2021-05-14 21:41:41] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2021-05-14 21:41:41] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:41:42] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:41:42] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:41:42] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:41:42] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:41:42] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:41:42] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:41:43] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:41:43] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:41:43] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:41:43] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:41:43] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 0 ms to minimize.
[2021-05-14 21:41:43] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:41:43] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
[2021-05-14 21:41:44] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2021-05-14 21:41:44] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2021-05-14 21:41:44] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:41:44] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:41:44] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:41:45] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:41:45] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 0 ms to minimize.
[2021-05-14 21:41:45] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 1 ms to minimize.
[2021-05-14 21:41:45] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 0 ms to minimize.
[2021-05-14 21:41:45] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 1 ms to minimize.
[2021-05-14 21:41:46] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 0 ms to minimize.
[2021-05-14 21:41:46] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 1 ms to minimize.
[2021-05-14 21:41:46] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 1 ms to minimize.
[2021-05-14 21:41:46] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 0 ms to minimize.
[2021-05-14 21:41:47] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 1 ms to minimize.
[2021-05-14 21:41:47] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2021-05-14 21:41:47] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2021-05-14 21:41:47] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 1 ms to minimize.
[2021-05-14 21:41:47] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 1 ms to minimize.
[2021-05-14 21:41:48] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 1 ms to minimize.
[2021-05-14 21:41:48] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 1 ms to minimize.
[2021-05-14 21:41:48] [INFO ] Deduced a trap composed of 68 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:41:48] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 0 ms to minimize.
[2021-05-14 21:41:48] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 0 ms to minimize.
[2021-05-14 21:41:48] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 1 ms to minimize.
[2021-05-14 21:41:49] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 0 ms to minimize.
[2021-05-14 21:41:49] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 1 ms to minimize.
[2021-05-14 21:41:49] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2021-05-14 21:41:49] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2021-05-14 21:41:49] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 1 ms to minimize.
[2021-05-14 21:41:50] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 1 ms to minimize.
[2021-05-14 21:41:50] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:41:50] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 1 ms to minimize.
[2021-05-14 21:41:50] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:41:50] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:41:50] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:41:51] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:41:51] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:41:51] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:41:51] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:41:51] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:41:51] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:41:52] [INFO ] Trap strengthening (SAT) tested/added 100/99 trap constraints in 17321 ms
[2021-05-14 21:41:52] [INFO ] Computed and/alt/rep : 896/2709/896 causal constraints (skipped 84 transitions) in 64 ms.
[2021-05-14 21:41:54] [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 21:41:54] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-14 21:41:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:41:54] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2021-05-14 21:41:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:41:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-14 21:41:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:41:54] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2021-05-14 21:41:54] [INFO ] [Nat]Added 366 Read/Feed constraints in 42 ms returned sat
[2021-05-14 21:41:55] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 0 ms to minimize.
[2021-05-14 21:41:55] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 0 ms to minimize.
[2021-05-14 21:41:55] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 1 ms to minimize.
[2021-05-14 21:41:55] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2021-05-14 21:41:55] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 0 ms to minimize.
[2021-05-14 21:41:55] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 1 ms to minimize.
[2021-05-14 21:41:56] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 1 ms to minimize.
[2021-05-14 21:41:56] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 0 ms to minimize.
[2021-05-14 21:41:56] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2021-05-14 21:41:56] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2021-05-14 21:41:56] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:41:57] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 1 ms to minimize.
[2021-05-14 21:41:57] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 0 ms to minimize.
[2021-05-14 21:41:57] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:41:57] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:41:57] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2021-05-14 21:41:57] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 0 ms to minimize.
[2021-05-14 21:41:58] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:41:58] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:41:58] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:41:58] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:41:58] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 1 ms to minimize.
[2021-05-14 21:41:58] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 1 ms to minimize.
[2021-05-14 21:41:59] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 1 ms to minimize.
[2021-05-14 21:41:59] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 0 ms to minimize.
[2021-05-14 21:41:59] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 0 ms to minimize.
[2021-05-14 21:41:59] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 0 ms to minimize.
[2021-05-14 21:41:59] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 1 ms to minimize.
[2021-05-14 21:42:00] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:42:00] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:42:00] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:42:00] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:42:00] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:42:00] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2021-05-14 21:42:00] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:42:01] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:42:01] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:42:01] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:42:01] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2021-05-14 21:42:01] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:42:01] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 1 ms to minimize.
[2021-05-14 21:42:02] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:42:02] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 1 ms to minimize.
[2021-05-14 21:42:02] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 0 ms to minimize.
[2021-05-14 21:42:02] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:42:02] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:42:02] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:42:03] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 1 ms to minimize.
[2021-05-14 21:42:03] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:42:03] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:42:03] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:42:03] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:42:03] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:42:03] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:42:04] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:42:04] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:42:04] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:42:04] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:42:04] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 1 ms to minimize.
[2021-05-14 21:42:04] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:42:05] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 1 ms to minimize.
[2021-05-14 21:42:05] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:42:05] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:42:05] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:42:05] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 0 ms to minimize.
[2021-05-14 21:42:05] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:42:05] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:42:06] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 1 ms to minimize.
[2021-05-14 21:42:06] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 1 ms to minimize.
[2021-05-14 21:42:06] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 0 ms to minimize.
[2021-05-14 21:42:06] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 0 ms to minimize.
[2021-05-14 21:42:06] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 0 ms to minimize.
[2021-05-14 21:42:06] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 0 ms to minimize.
[2021-05-14 21:42:06] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 0 ms to minimize.
[2021-05-14 21:42:06] [INFO ] Deduced a trap composed of 91 places in 72 ms of which 0 ms to minimize.
[2021-05-14 21:42:06] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2021-05-14 21:42:07] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2021-05-14 21:42:07] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2021-05-14 21:42:07] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2021-05-14 21:42:07] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 0 ms to minimize.
[2021-05-14 21:42:07] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 0 ms to minimize.
[2021-05-14 21:42:07] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 0 ms to minimize.
[2021-05-14 21:42:07] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:42:07] [INFO ] Trap strengthening (SAT) tested/added 84/83 trap constraints in 12836 ms
[2021-05-14 21:42:07] [INFO ] Computed and/alt/rep : 896/2709/896 causal constraints (skipped 84 transitions) in 50 ms.
[2021-05-14 21:42:14] [INFO ] Deduced a trap composed of 2 places in 200 ms of which 1 ms to minimize.
[2021-05-14 21:42:14] [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 21:42:14] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-14 21:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:42:15] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-14 21:42:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:42:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-14 21:42:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:42:15] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2021-05-14 21:42:15] [INFO ] [Nat]Added 366 Read/Feed constraints in 41 ms returned sat
[2021-05-14 21:42:15] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2021-05-14 21:42:15] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 1 ms to minimize.
[2021-05-14 21:42:15] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:42:16] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:42:16] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:42:16] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:42:16] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 1 ms to minimize.
[2021-05-14 21:42:16] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 1 ms to minimize.
[2021-05-14 21:42:16] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 1 ms to minimize.
[2021-05-14 21:42:17] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:42:17] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:42:17] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:42:17] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:42:17] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2021-05-14 21:42:17] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:42:17] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2021-05-14 21:42:17] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2556 ms
[2021-05-14 21:42:18] [INFO ] Computed and/alt/rep : 896/2709/896 causal constraints (skipped 84 transitions) in 49 ms.
[2021-05-14 21:42:26] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:42:26] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:42:26] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 1 ms to minimize.
[2021-05-14 21:42:26] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:42:26] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:42:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 930 ms
[2021-05-14 21:42:27] [INFO ] Added : 736 causal constraints over 148 iterations in 9089 ms. Result :sat
[2021-05-14 21:42:27] [INFO ] Flatten gal took : 31 ms
[2021-05-14 21:42:27] [INFO ] Flatten gal took : 32 ms
[2021-05-14 21:42:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18427834738362463177.gal : 3 ms
[2021-05-14 21:42:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17100811236403136435.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality18427834738362463177.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17100811236403136435.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality18427834738362463177.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17100811236403136435.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17100811236403136435.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :6 after 14
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :14 after 38
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :38 after 74
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :74 after 212
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :212 after 565
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :565 after 2343
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :2343 after 5420
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :5420 after 15319
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :15319 after 93618
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :93618 after 274738
Detected timeout of ITS tools.
[2021-05-14 21:42:54] [INFO ] Flatten gal took : 31 ms
[2021-05-14 21:42:54] [INFO ] Applying decomposition
[2021-05-14 21:42:54] [INFO ] Flatten gal took : 30 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/graph6546264146597610422.txt, -o, /tmp/graph6546264146597610422.bin, -w, /tmp/graph6546264146597610422.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/graph6546264146597610422.bin, -l, -1, -v, -w, /tmp/graph6546264146597610422.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:42:54] [INFO ] Decomposing Gal with order
[2021-05-14 21:42:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:42:54] [INFO ] Removed a total of 1346 redundant transitions.
[2021-05-14 21:42:54] [INFO ] Flatten gal took : 62 ms
[2021-05-14 21:42:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 364 labels/synchronizations in 9 ms.
[2021-05-14 21:42:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11557341976681861632.gal : 643 ms
[2021-05-14 21:42:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality480323234443514339.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11557341976681861632.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality480323234443514339.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality11557341976681861632.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality480323234443514339.prop --nowitness
Loading property file /tmp/ReachabilityCardinality480323234443514339.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 29
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :29 after 3562
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3562 after 8318
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :8318 after 17374
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :17374 after 496774
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17582926450489897877
[2021-05-14 21:43:20] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17582926450489897877
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17582926450489897877]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17582926450489897877] killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17582926450489897877] killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Graph (trivial) has 562 edges and 490 vertex of which 256 / 490 are part of one of the 40 SCC in 3850 ms
Free SCC test removed 216 places
Drop transitions removed 432 transitions
Ensure Unique test removed 214 transitions
Reduce isomorphic transitions removed 646 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 274 transition count 547
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 270 transition count 547
Performed 24 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 57 place count 246 transition count 513
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 66 place count 246 transition count 504
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 244 transition count 516
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 72 place count 244 transition count 514
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 2 with 34 rules applied. Total rules applied 106 place count 244 transition count 480
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 109 place count 244 transition count 477
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 113 place count 241 transition count 476
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 240 transition count 476
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 28 Pre rules applied. Total rules applied 114 place count 240 transition count 448
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 170 place count 212 transition count 448
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 171 place count 212 transition count 447
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 172 place count 212 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 173 place count 211 transition count 446
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 178 place count 211 transition count 441
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 183 place count 206 transition count 441
Applied a total of 183 rules in 3942 ms. Remains 206 /490 variables (removed 284) and now considering 441/1197 (removed 756) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 441 rows 206 cols
[2021-05-14 21:43:26] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-14 21:43:26] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2021-05-14 21:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:43:26] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-14 21:43:26] [INFO ] Computed and/alt/rep : 420/2040/420 causal constraints (skipped 14 transitions) in 21 ms.
[2021-05-14 21:43:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:43:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:43:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:43:26] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-14 21:43:26] [INFO ] Computed and/alt/rep : 420/2040/420 causal constraints (skipped 14 transitions) in 29 ms.
[2021-05-14 21:43:29] [INFO ] Added : 381 causal constraints over 77 iterations in 2301 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-14 21:43:29] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2021-05-14 21:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:43:29] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2021-05-14 21:43:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:43:29] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2021-05-14 21:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:43:29] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-14 21:43:29] [INFO ] Computed and/alt/rep : 420/2040/420 causal constraints (skipped 14 transitions) in 27 ms.
[2021-05-14 21:43:31] [INFO ] Added : 382 causal constraints over 77 iterations in 2283 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2021-05-14 21:43:31] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2021-05-14 21:43:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:43:31] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-14 21:43:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:43:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2021-05-14 21:43:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:43:31] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2021-05-14 21:43:32] [INFO ] Computed and/alt/rep : 420/2040/420 causal constraints (skipped 14 transitions) in 27 ms.
[2021-05-14 21:43:34] [INFO ] Added : 368 causal constraints over 74 iterations in 2024 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-14 21:43:34] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7329598598391071389
[2021-05-14 21:43:34] [INFO ] Computing symmetric may disable matrix : 1197 transitions.
[2021-05-14 21:43:34] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 21:43:34] [INFO ] Computing symmetric may enable matrix : 1197 transitions.
[2021-05-14 21:43:34] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 21:43:34] [INFO ] Applying decomposition
[2021-05-14 21:43:34] [INFO ] Flatten gal took : 38 ms
[2021-05-14 21:43:34] [INFO ] Flatten gal took : 47 ms
[2021-05-14 21:43:34] [INFO ] Input system was already deterministic with 1197 transitions.
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/graph7822156846051791851.txt, -o, /tmp/graph7822156846051791851.bin, -w, /tmp/graph7822156846051791851.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/graph7822156846051791851.bin, -l, -1, -v, -w, /tmp/graph7822156846051791851.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:43:34] [INFO ] Decomposing Gal with order
[2021-05-14 21:43:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:43:34] [INFO ] Computing Do-Not-Accords matrix : 1197 transitions.
[2021-05-14 21:43:34] [INFO ] Removed a total of 1346 redundant transitions.
[2021-05-14 21:43:34] [INFO ] Computation of Completed DNA matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 21:43:34] [INFO ] Flatten gal took : 116 ms
[2021-05-14 21:43:34] [INFO ] Built C files in 395ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7329598598391071389
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7329598598391071389]
[2021-05-14 21:43:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 375 labels/synchronizations in 9 ms.
[2021-05-14 21:43:42] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability679620294034836732.gal : 8362 ms
[2021-05-14 21:43:42] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3603278592601066963.prop : 2 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability679620294034836732.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability3603278592601066963.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability679620294034836732.gal -t CGAL -reachable-file /tmp/ReachabilityFireability3603278592601066963.prop --nowitness
[2021-05-14 21:43:42] [INFO ] Ran tautology test, simplified 0 / 3 in 8787 ms.
Loading property file /tmp/ReachabilityFireability3603278592601066963.prop.
[2021-05-14 21:43:43] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-00(UNSAT) depth K=0 took 34 ms
[2021-05-14 21:43:43] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-08(UNSAT) depth K=0 took 4 ms
[2021-05-14 21:43:43] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-15(UNSAT) depth K=0 took 2 ms
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
[2021-05-14 21:43:43] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-00(UNSAT) depth K=1 took 89 ms
[2021-05-14 21:43:43] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-08(UNSAT) depth K=1 took 8 ms
[2021-05-14 21:43:43] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-15(UNSAT) depth K=1 took 5 ms
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1934
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1934 after 2746
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 987 out of 1197 initially.
// Phase 1: matrix 987 rows 490 cols
[2021-05-14 21:43:43] [INFO ] Computed 20 place invariants in 3 ms
inv : WantSection_1_T + WantSection_1_F = 1
inv : Turn_4_0 + Turn_4_1 + Turn_4_2 + Turn_4_4 + Turn_4_3 + Turn_4_5 + Turn_4_6 = 1
inv : WantSection_2_T + WantSection_2_F = 1
inv : Turn_0_0 + Turn_0_2 + Turn_0_1 + Turn_0_3 + Turn_0_4 + Turn_0_6 + Turn_0_5 = 1
inv : IsEndLoop_5_0_0 + IsEndLoop_5_1_0 + IsEndLoop_5_2_0 + IsEndLoop_5_3_0 + IsEndLoop_5_4_0 + IsEndLoop_5_5_0 + IsEndLoop_5_0_1 + IsEndLoop_5_1_1 + IsEndLoop_5_3_1 + IsEndLoop_5_2_1 + IsEndLoop_5_4_1 + IsEndLoop_5_5_1 + IsEndLoop_5_0_2 + IsEndLoop_5_1_2 + IsEndLoop_5_2_2 + IsEndLoop_5_3_2 + IsEndLoop_5_5_2 + IsEndLoop_5_4_2 + IsEndLoop_5_1_3 + IsEndLoop_5_0_3 + IsEndLoop_5_3_3 + IsEndLoop_5_2_3 + IsEndLoop_5_5_3 + IsEndLoop_5_4_3 + IsEndLoop_5_2_4 + IsEndLoop_5_0_4 + IsEndLoop_5_1_4 + IsEndLoop_5_4_4 + IsEndLoop_5_3_4 + IsEndLoop_5_5_4 + IsEndLoop_5_2_6 + IsEndLoop_5_3_6 + IsEndLoop_5_0_6 + IsEndLoop_5_1_6 + EndTurn_5_1 + EndTurn_5_2 + IsEndLoop_5_4_6 + EndTurn_5_0 + EndTurn_5_5 + BeginLoop_5_1_0 + BeginLoop_5_0_0 + EndTurn_5_3 + EndTurn_5_4 + BeginLoop_5_4_0 + BeginLoop_5_5_0 + BeginLoop_5_2_0 + BeginLoop_5_3_0 + WantSection_5_F + TestAlone_5_3_0 + TestAlone_5_3_4 + TestTurn_5_5 + TestTurn_5_4 + TestTurn_5_3 + TestTurn_5_2 + TestTurn_5_1 + TestTurn_5_0 + TestIdentity_5_3_0 + AskForSection_5_3 + AskForSection_5_1 + AskForSection_5_2 + AskForSection_5_0 + CS_5 + AskForSection_5_5 + AskForSection_5_4 = 1
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_5_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_5_1 + IsEndLoop_3_0_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_2_2 + IsEndLoop_3_4_2 + IsEndLoop_3_5_2 + IsEndLoop_3_0_4 + IsEndLoop_3_2_4 + IsEndLoop_3_1_4 + IsEndLoop_3_4_4 + IsEndLoop_3_3_4 + IsEndLoop_3_1_5 + IsEndLoop_3_0_5 + IsEndLoop_3_5_4 + IsEndLoop_3_3_5 + IsEndLoop_3_2_5 + IsEndLoop_3_5_5 + IsEndLoop_3_4_5 + IsEndLoop_3_2_6 + IsEndLoop_3_3_6 + IsEndLoop_3_4_6 + IsEndLoop_3_0_6 + IsEndLoop_3_1_6 + EndTurn_3_1 + EndTurn_3_2 + EndTurn_3_0 + BeginLoop_3_0_0 + BeginLoop_3_1_0 + EndTurn_3_3 + EndTurn_3_5 + EndTurn_3_4 + BeginLoop_3_4_0 + BeginLoop_3_5_0 + BeginLoop_3_2_0 + BeginLoop_3_3_0 + TestAlone_3_3_1 + WantSection_3_F + TestAlone_3_0_2 + TestAlone_3_2_6 + TestTurn_3_5 + TestTurn_3_4 + TestTurn_3_3 + TestTurn_3_2 + TestTurn_3_1 + TestTurn_3_0 + AskForSection_3_3 + AskForSection_3_2 + AskForSection_3_1 + AskForSection_3_0 + CS_3 + AskForSection_3_5 + AskForSection_3_4 = 1
inv : WantSection_3_T + WantSection_3_F = 1
inv : Turn_2_0 + Turn_2_1 + Turn_2_3 + Turn_2_2 + Turn_2_4 + Turn_2_5 + Turn_2_6 = 1
inv : Turn_3_0 + Turn_3_1 + Turn_3_2 + Turn_3_4 + Turn_3_3 + Turn_3_5 + Turn_3_6 = 1
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_4_0 + IsEndLoop_2_5_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_4_1 + IsEndLoop_2_5_1 + IsEndLoop_2_1_3 + IsEndLoop_2_0_3 + IsEndLoop_2_3_3 + IsEndLoop_2_4_3 + IsEndLoop_2_2_3 + IsEndLoop_2_0_4 + IsEndLoop_2_5_3 + IsEndLoop_2_2_4 + IsEndLoop_2_1_4 + IsEndLoop_2_4_4 + IsEndLoop_2_3_4 + IsEndLoop_2_1_5 + IsEndLoop_2_0_5 + IsEndLoop_2_5_4 + IsEndLoop_2_3_5 + IsEndLoop_2_2_5 + IsEndLoop_2_5_5 + IsEndLoop_2_4_5 + IsEndLoop_2_3_6 + IsEndLoop_2_4_6 + IsEndLoop_2_0_6 + IsEndLoop_2_1_6 + IsEndLoop_2_2_6 + EndTurn_2_1 + EndTurn_2_2 + EndTurn_2_0 + BeginLoop_2_0_0 + BeginLoop_2_1_0 + EndTurn_2_4 + EndTurn_2_3 + EndTurn_2_5 + BeginLoop_2_4_0 + BeginLoop_2_5_0 + BeginLoop_2_2_0 + BeginLoop_2_3_0 + WantSection_2_F + TestTurn_2_5 + TestTurn_2_4 + TestTurn_2_3 + TestTurn_2_2 + TestTurn_2_1 + TestTurn_2_0 + AskForSection_2_3 + AskForSection_2_2 + AskForSection_2_1 + AskForSection_2_0 + CS_2 + AskForSection_2_5 + AskForSection_2_4 = 1
inv : Turn_1_0 + Turn_1_1 + Turn_1_3 + Turn_1_2 + Turn_1_4 + Turn_1_5 + Turn_1_6 = 1
inv : WantSection_4_T + WantSection_4_F = 1
inv : Turn_5_1 + Turn_5_0 + Turn_5_2 + Turn_5_3 + Turn_5_5 + Turn_5_4 + Turn_5_6 = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_5_0 + IsEndLoop_1_1_2 + IsEndLoop_1_0_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_4_2 + IsEndLoop_1_5_2 + IsEndLoop_1_1_3 + IsEndLoop_1_0_3 + IsEndLoop_1_4_3 + IsEndLoop_1_2_3 + IsEndLoop_1_3_3 + IsEndLoop_1_0_4 + IsEndLoop_1_5_3 + IsEndLoop_1_2_4 + IsEndLoop_1_1_4 + IsEndLoop_1_5_4 + IsEndLoop_1_4_4 + IsEndLoop_1_3_4 + IsEndLoop_1_1_5 + IsEndLoop_1_0_5 + IsEndLoop_1_3_5 + IsEndLoop_1_2_5 + IsEndLoop_1_5_5 + IsEndLoop_1_4_5 + IsEndLoop_1_3_6 + IsEndLoop_1_4_6 + IsEndLoop_1_0_6 + IsEndLoop_1_1_6 + IsEndLoop_1_2_6 + EndTurn_1_1 + EndTurn_1_2 + EndTurn_1_3 + EndTurn_1_0 + BeginLoop_1_0_0 + BeginLoop_1_1_0 + EndTurn_1_4 + EndTurn_1_5 + BeginLoop_1_5_0 + BeginLoop_1_4_0 + BeginLoop_1_2_0 + BeginLoop_1_3_0 + WantSection_1_F + TestAlone_1_5_3 + TestTurn_1_5 + TestTurn_1_4 + TestTurn_1_3 + TestTurn_1_2 + TestTurn_1_1 + TestTurn_1_0 + AskForSection_1_3 + AskForSection_1_2 + AskForSection_1_1 + AskForSection_1_0 + AskForSection_1_5 + CS_1 + AskForSection_1_4 = 1
inv : WantSection_0_T + WantSection_0_F = 1
inv : WantSection_6_T + WantSection_6_F = 1
inv : WantSection_5_T + WantSection_5_F = 1
inv : IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_4_1 + IsEndLoop_0_0_2 + IsEndLoop_0_5_1 + IsEndLoop_0_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_3_2 + IsEndLoop_0_4_2 + IsEndLoop_0_5_2 + IsEndLoop_0_1_3 + IsEndLoop_0_2_3 + IsEndLoop_0_0_3 + IsEndLoop_0_4_3 + IsEndLoop_0_3_3 + IsEndLoop_0_0_4 + IsEndLoop_0_5_3 + IsEndLoop_0_2_4 + IsEndLoop_0_1_4 + IsEndLoop_0_5_4 + IsEndLoop_0_4_4 + IsEndLoop_0_3_4 + IsEndLoop_0_1_5 + IsEndLoop_0_0_5 + IsEndLoop_0_3_5 + IsEndLoop_0_2_5 + IsEndLoop_0_0_6 + IsEndLoop_0_5_5 + IsEndLoop_0_4_5 + IsEndLoop_0_3_6 + IsEndLoop_0_4_6 + IsEndLoop_0_1_6 + IsEndLoop_0_2_6 + EndTurn_0_1 + EndTurn_0_2 + EndTurn_0_3 + EndTurn_0_0 + BeginLoop_0_0_0 + BeginLoop_0_1_0 + EndTurn_0_4 + EndTurn_0_5 + BeginLoop_0_5_0 + BeginLoop_0_2_0 + BeginLoop_0_4_0 + BeginLoop_0_3_0 + WantSection_0_F + TestAlone_0_5_1 + TestTurn_0_5 + TestTurn_0_4 + TestTurn_0_3 + TestTurn_0_2 + TestTurn_0_1 + TestTurn_0_0 + AskForSection_0_3 + AskForSection_0_2 + AskForSection_0_1 + AskForSection_0_0 + CS_0 + AskForSection_0_4 + AskForSection_0_5 = 1
inv : IsEndLoop_6_0_0 + IsEndLoop_6_1_0 + IsEndLoop_6_2_0 + IsEndLoop_6_3_0 + IsEndLoop_6_4_0 + IsEndLoop_6_5_0 + IsEndLoop_6_0_1 + IsEndLoop_6_1_1 + IsEndLoop_6_2_1 + IsEndLoop_6_4_1 + IsEndLoop_6_3_1 + IsEndLoop_6_5_1 + IsEndLoop_6_0_2 + IsEndLoop_6_1_2 + IsEndLoop_6_2_2 + IsEndLoop_6_3_2 + IsEndLoop_6_4_2 + IsEndLoop_6_1_3 + IsEndLoop_6_5_2 + IsEndLoop_6_0_3 + IsEndLoop_6_3_3 + IsEndLoop_6_2_3 + IsEndLoop_6_5_3 + IsEndLoop_6_4_3 + IsEndLoop_6_1_4 + IsEndLoop_6_2_4 + IsEndLoop_6_0_4 + IsEndLoop_6_4_4 + IsEndLoop_6_3_4 + IsEndLoop_6_0_5 + IsEndLoop_6_5_4 + IsEndLoop_6_2_5 + IsEndLoop_6_1_5 + IsEndLoop_6_4_5 + IsEndLoop_6_3_5 + EndTurn_6_1 + EndTurn_6_2 + EndTurn_6_0 + EndTurn_6_5 + BeginLoop_6_0_0 + EndTurn_6_3 + EndTurn_6_4 + BeginLoop_6_4_0 + BeginLoop_6_5_0 + BeginLoop_6_2_0 + BeginLoop_6_1_0 + BeginLoop_6_3_0 + BeginLoop_6_3_4 + WantSection_6_F + TestAlone_6_3_4 + TestTurn_6_5 + TestTurn_6_4 + TestTurn_6_3 + TestTurn_6_2 + TestTurn_6_1 + TestTurn_6_0 + AskForSection_6_2 + AskForSection_6_3 + AskForSection_6_1 + AskForSection_6_0 + CS_6 + AskForSection_6_5 + AskForSection_6_4 = 1
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_4_0 + IsEndLoop_4_5_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_4_1 + IsEndLoop_4_5_1 + IsEndLoop_4_0_2 + IsEndLoop_4_1_2 + IsEndLoop_4_2_2 + IsEndLoop_4_4_2 + IsEndLoop_4_3_2 + IsEndLoop_4_5_2 + IsEndLoop_4_1_3 + IsEndLoop_4_0_3 + IsEndLoop_4_3_3 + IsEndLoop_4_2_3 + IsEndLoop_4_5_3 + IsEndLoop_4_4_3 + IsEndLoop_4_0_5 + IsEndLoop_4_3_5 + IsEndLoop_4_2_5 + IsEndLoop_4_1_5 + IsEndLoop_4_5_5 + IsEndLoop_4_4_5 + IsEndLoop_4_2_6 + IsEndLoop_4_3_6 + IsEndLoop_4_4_6 + IsEndLoop_4_0_6 + IsEndLoop_4_1_6 + EndTurn_4_1 + EndTurn_4_2 + EndTurn_4_0 + BeginLoop_4_0_0 + EndTurn_4_5 + BeginLoop_4_1_0 + EndTurn_4_3 + EndTurn_4_4 + BeginLoop_4_4_0 + BeginLoop_4_5_0 + BeginLoop_4_2_0 + BeginLoop_4_3_0 + BeginLoop_4_3_5 + WantSection_4_F + TestAlone_4_5_2 + TestAlone_4_0_5 + TestAlone_4_3_5 + TestTurn_4_5 + TestTurn_4_4 + TestTurn_4_3 + TestTurn_4_2 + TestTurn_4_1 + TestTurn_4_0 + AskForSection_4_3 + AskForSection_4_2 + AskForSection_4_0 + AskForSection_4_1 + CS_4 + AskForSection_4_5 + AskForSection_4_4 = 1
Total of 20 invariants.
[2021-05-14 21:43:43] [INFO ] Computed 20 place invariants in 6 ms
[2021-05-14 21:43:44] [INFO ] Proved 490 variables to be positive in 904 ms
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2746 after 667504
[2021-05-14 21:43:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-00
[2021-05-14 21:43:44] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-00(SAT) depth K=0 took 94 ms
[2021-05-14 21:43:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-08
[2021-05-14 21:43:44] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-08(SAT) depth K=0 took 74 ms
[2021-05-14 21:43:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-15
[2021-05-14 21:43:44] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-15(SAT) depth K=0 took 48 ms
[2021-05-14 21:43:44] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-00(UNSAT) depth K=2 took 1662 ms
[2021-05-14 21:43:45] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-08(UNSAT) depth K=2 took 216 ms
[2021-05-14 21:43:45] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-15(UNSAT) depth K=2 took 203 ms
[2021-05-14 21:43:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-00
[2021-05-14 21:43:45] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-00(SAT) depth K=1 took 713 ms
[2021-05-14 21:43:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-08
[2021-05-14 21:43:45] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-08(SAT) depth K=1 took 659 ms
[2021-05-14 21:43:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-15
[2021-05-14 21:43:46] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-15(SAT) depth K=1 took 554 ms
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :4.36655e+07 after 4.3735e+07
[2021-05-14 21:43:59] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-00(UNSAT) depth K=3 took 13884 ms
Compilation finished in 25114 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7329598598391071389]
Link finished in 90 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityFireability00==true], workingDir=/tmp/ltsmin7329598598391071389]
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :4.3735e+07 after 4.41953e+07
[2021-05-14 21:44:35] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-08(UNSAT) depth K=3 took 36425 ms
[2021-05-14 21:44:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-00
[2021-05-14 21:44:41] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-00(SAT) depth K=2 took 55286 ms
[2021-05-14 21:44:58] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-15(UNSAT) depth K=3 took 23017 ms
[2021-05-14 21:45:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-08
[2021-05-14 21:45:07] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-08(SAT) depth K=2 took 25379 ms
[2021-05-14 21:45:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-15
[2021-05-14 21:45:11] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-15(SAT) depth K=2 took 4431 ms
[2021-05-14 21:45:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-00
[2021-05-14 21:45:18] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-00(SAT) depth K=3 took 6756 ms
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :4.41953e+07 after 5.38118e+07
[2021-05-14 21:52:01] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-00(UNSAT) depth K=4 took 423404 ms
[2021-05-14 21:52:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-08
[2021-05-14 21:52:42] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-08(SAT) depth K=3 took 444459 ms
[2021-05-14 21:53:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-15
[2021-05-14 21:53:18] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-15(SAT) depth K=3 took 35716 ms
[2021-05-14 21:54:47] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-08(UNSAT) depth K=4 took 165234 ms
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :5.38118e+07 after 3.57027e+08
[2021-05-14 21:57:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-00
[2021-05-14 21:57:57] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-00(SAT) depth K=4 took 279315 ms
[2021-05-14 22:03:55] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-15(UNSAT) depth K=4 took 548690 ms
WARNING : LTSmin timed out (>1200 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityFireability00==true], workingDir=/tmp/ltsmin7329598598391071389]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityFireability08==true], workingDir=/tmp/ltsmin7329598598391071389]
Detected timeout of ITS tools.
[2021-05-14 22:09:21] [INFO ] Applying decomposition
[2021-05-14 22:09:21] [INFO ] Flatten gal took : 133 ms
[2021-05-14 22:09:21] [INFO ] Decomposing Gal with order
[2021-05-14 22:09:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 22:09:21] [INFO ] Removed a total of 1346 redundant transitions.
[2021-05-14 22:09:21] [INFO ] Flatten gal took : 176 ms
[2021-05-14 22:09:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 364 labels/synchronizations in 30 ms.
[2021-05-14 22:09:25] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8763853937067801691.gal : 3114 ms
[2021-05-14 22:09:25] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability184336428726775340.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability8763853937067801691.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability184336428726775340.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability8763853937067801691.gal -t CGAL -reachable-file /tmp/ReachabilityFireability184336428726775340.prop --nowitness
Loading property file /tmp/ReachabilityFireability184336428726775340.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 29
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :29 after 4092
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :4092 after 8890
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :8890 after 17760
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :17760 after 483312
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :3.04437e+06 after 3.28145e+06
WARNING : LTSmin timed out (>1200 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityFireability08==true], workingDir=/tmp/ltsmin7329598598391071389]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityFireability15==true], workingDir=/tmp/ltsmin7329598598391071389]
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :3.28145e+06 after 4.09367e+07
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-6"
export BK_EXAMINATION="ReachabilityFireability"
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-6, examination is ReachabilityFireability"
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-162089128200639"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;