Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143900437.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 BusinessProcesses-PT-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 157K 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 BusinessProcesses-PT-15-00
FORMULA_NAME BusinessProcesses-PT-15-01
FORMULA_NAME BusinessProcesses-PT-15-02
FORMULA_NAME BusinessProcesses-PT-15-03
FORMULA_NAME BusinessProcesses-PT-15-04
FORMULA_NAME BusinessProcesses-PT-15-05
FORMULA_NAME BusinessProcesses-PT-15-06
FORMULA_NAME BusinessProcesses-PT-15-07
FORMULA_NAME BusinessProcesses-PT-15-08
FORMULA_NAME BusinessProcesses-PT-15-09
FORMULA_NAME BusinessProcesses-PT-15-10
FORMULA_NAME BusinessProcesses-PT-15-11
FORMULA_NAME BusinessProcesses-PT-15-12
FORMULA_NAME BusinessProcesses-PT-15-13
FORMULA_NAME BusinessProcesses-PT-15-14
FORMULA_NAME BusinessProcesses-PT-15-15

=== Now, execution of the tool begins

BK_START 1620547143230

Running Version 0
[2021-05-09 07:59:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-09 07:59:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:59:05] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2021-05-09 07:59:05] [INFO ] Transformed 630 places.
[2021-05-09 07:59:05] [INFO ] Transformed 566 transitions.
[2021-05-09 07:59:05] [INFO ] Found NUPN structural information;
[2021-05-09 07:59:05] [INFO ] Parsed PT model containing 630 places and 566 transitions in 116 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 07:59:05] [INFO ] Initial state test concluded for 2 properties.
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 626 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 87 place count 539 transition count 478
Iterating global reduction 1 with 84 rules applied. Total rules applied 171 place count 539 transition count 478
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 214 place count 496 transition count 435
Iterating global reduction 1 with 43 rules applied. Total rules applied 257 place count 496 transition count 435
Applied a total of 257 rules in 103 ms. Remains 496 /626 variables (removed 130) and now considering 435/562 (removed 127) transitions.
// Phase 1: matrix 435 rows 496 cols
[2021-05-09 07:59:05] [INFO ] Computed 99 place invariants in 27 ms
[2021-05-09 07:59:05] [INFO ] Implicit Places using invariants in 297 ms returned []
// Phase 1: matrix 435 rows 496 cols
[2021-05-09 07:59:05] [INFO ] Computed 99 place invariants in 15 ms
[2021-05-09 07:59:06] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
// Phase 1: matrix 435 rows 496 cols
[2021-05-09 07:59:06] [INFO ] Computed 99 place invariants in 15 ms
[2021-05-09 07:59:06] [INFO ] Dead Transitions using invariants and state equation in 223 ms returned []
Finished structural reductions, in 1 iterations. Remains : 496/626 places, 435/562 transitions.
[2021-05-09 07:59:06] [INFO ] Flatten gal took : 59 ms
[2021-05-09 07:59:06] [INFO ] Flatten gal took : 26 ms
[2021-05-09 07:59:06] [INFO ] Input system was already deterministic with 435 transitions.
Incomplete random walk after 100000 steps, including 669 resets, run finished after 315 ms. (steps per millisecond=317 ) properties (out of 32) seen :13
Running SMT prover for 19 properties.
// Phase 1: matrix 435 rows 496 cols
[2021-05-09 07:59:07] [INFO ] Computed 99 place invariants in 8 ms
[2021-05-09 07:59:07] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2021-05-09 07:59:07] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 07:59:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:07] [INFO ] [Real]Absence check using state equation in 157 ms returned unsat
[2021-05-09 07:59:07] [INFO ] [Real]Absence check using 58 positive place invariants in 15 ms returned sat
[2021-05-09 07:59:07] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:59:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:07] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-09 07:59:07] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2021-05-09 07:59:07] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2021-05-09 07:59:07] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:59:07] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2021-05-09 07:59:08] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:59:08] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 0 ms to minimize.
[2021-05-09 07:59:08] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:59:08] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2021-05-09 07:59:08] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2021-05-09 07:59:08] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2021-05-09 07:59:08] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2021-05-09 07:59:08] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2021-05-09 07:59:08] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 925 ms
[2021-05-09 07:59:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:08] [INFO ] [Nat]Absence check using 58 positive place invariants in 14 ms returned sat
[2021-05-09 07:59:08] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 07:59:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:08] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2021-05-09 07:59:08] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:59:08] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2021-05-09 07:59:08] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:59:08] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:59:09] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:59:09] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:59:09] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:59:09] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2021-05-09 07:59:09] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2021-05-09 07:59:09] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2021-05-09 07:59:09] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2021-05-09 07:59:09] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:59:09] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 767 ms
[2021-05-09 07:59:09] [INFO ] Computed and/alt/rep : 429/826/429 causal constraints (skipped 5 transitions) in 37 ms.
[2021-05-09 07:59:10] [INFO ] Added : 267 causal constraints over 54 iterations in 1394 ms. Result :sat
[2021-05-09 07:59:10] [INFO ] [Real]Absence check using 58 positive place invariants in 20 ms returned sat
[2021-05-09 07:59:10] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 07:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:11] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-09 07:59:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:11] [INFO ] [Nat]Absence check using 58 positive place invariants in 14 ms returned sat
[2021-05-09 07:59:11] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 07:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:11] [INFO ] [Nat]Absence check using state equation in 140 ms returned unsat
[2021-05-09 07:59:11] [INFO ] [Real]Absence check using 58 positive place invariants in 13 ms returned sat
[2021-05-09 07:59:11] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 14 ms returned sat
[2021-05-09 07:59:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:11] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2021-05-09 07:59:11] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:59:11] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:59:11] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:59:11] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:59:12] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 0 ms to minimize.
[2021-05-09 07:59:12] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:59:12] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:59:12] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:59:12] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:59:12] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:59:12] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 1 ms to minimize.
[2021-05-09 07:59:12] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:59:13] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2021-05-09 07:59:13] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:59:13] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:59:13] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:59:13] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:59:13] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2021-05-09 07:59:13] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:59:13] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:59:13] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3152 ms
[2021-05-09 07:59:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:14] [INFO ] [Nat]Absence check using 58 positive place invariants in 19 ms returned sat
[2021-05-09 07:59:14] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 07:59:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:14] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2021-05-09 07:59:15] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:59:15] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 11 ms to minimize.
[2021-05-09 07:59:15] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:59:15] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:59:15] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:59:15] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:59:15] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 1 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 0 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 4 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 0 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 0 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3081 ms
[2021-05-09 07:59:18] [INFO ] Computed and/alt/rep : 429/826/429 causal constraints (skipped 5 transitions) in 27 ms.
[2021-05-09 07:59:19] [INFO ] Added : 320 causal constraints over 64 iterations in 1804 ms. Result :sat
[2021-05-09 07:59:19] [INFO ] [Real]Absence check using 58 positive place invariants in 16 ms returned sat
[2021-05-09 07:59:19] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:20] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-09 07:59:20] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2021-05-09 07:59:20] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:59:20] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:59:20] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2021-05-09 07:59:20] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:59:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 459 ms
[2021-05-09 07:59:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:20] [INFO ] [Nat]Absence check using 58 positive place invariants in 20 ms returned sat
[2021-05-09 07:59:20] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 07:59:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:20] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2021-05-09 07:59:20] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2021-05-09 07:59:20] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2021-05-09 07:59:21] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:59:21] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:59:21] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:59:21] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2021-05-09 07:59:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 742 ms
[2021-05-09 07:59:21] [INFO ] Computed and/alt/rep : 429/826/429 causal constraints (skipped 5 transitions) in 34 ms.
[2021-05-09 07:59:23] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2021-05-09 07:59:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2021-05-09 07:59:23] [INFO ] Added : 283 causal constraints over 58 iterations in 1692 ms. Result :sat
[2021-05-09 07:59:23] [INFO ] [Real]Absence check using 58 positive place invariants in 15 ms returned sat
[2021-05-09 07:59:23] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:23] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2021-05-09 07:59:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:23] [INFO ] [Nat]Absence check using 58 positive place invariants in 18 ms returned sat
[2021-05-09 07:59:23] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 07:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:23] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2021-05-09 07:59:23] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 0 ms to minimize.
[2021-05-09 07:59:23] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2021-05-09 07:59:24] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:59:24] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 0 ms to minimize.
[2021-05-09 07:59:24] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:59:24] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:59:24] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:59:24] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:59:24] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:59:24] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2021-05-09 07:59:24] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 0 ms to minimize.
[2021-05-09 07:59:24] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 0 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:59:26] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:59:26] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:59:26] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:59:26] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:59:26] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:59:26] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:59:26] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:59:26] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:59:26] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:59:26] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 0 ms to minimize.
[2021-05-09 07:59:26] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
[2021-05-09 07:59:26] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3052 ms
[2021-05-09 07:59:26] [INFO ] Computed and/alt/rep : 429/826/429 causal constraints (skipped 5 transitions) in 26 ms.
[2021-05-09 07:59:28] [INFO ] Added : 273 causal constraints over 55 iterations in 1377 ms. Result :sat
[2021-05-09 07:59:28] [INFO ] [Real]Absence check using 58 positive place invariants in 24 ms returned sat
[2021-05-09 07:59:28] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 07:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:28] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2021-05-09 07:59:28] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2021-05-09 07:59:28] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:59:28] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2021-05-09 07:59:29] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:59:29] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2021-05-09 07:59:29] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:59:29] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:59:29] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:59:29] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:59:29] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:59:29] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2021-05-09 07:59:29] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:59:30] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2021-05-09 07:59:30] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:59:30] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2021-05-09 07:59:30] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2021-05-09 07:59:30] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1839 ms
[2021-05-09 07:59:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:30] [INFO ] [Nat]Absence check using 58 positive place invariants in 16 ms returned sat
[2021-05-09 07:59:30] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:59:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:30] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2021-05-09 07:59:30] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2021-05-09 07:59:30] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2021-05-09 07:59:30] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 1 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 0 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2021-05-09 07:59:32] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:59:32] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1530 ms
[2021-05-09 07:59:32] [INFO ] Computed and/alt/rep : 429/826/429 causal constraints (skipped 5 transitions) in 40 ms.
[2021-05-09 07:59:33] [INFO ] Added : 253 causal constraints over 51 iterations in 1499 ms. Result :sat
[2021-05-09 07:59:33] [INFO ] [Real]Absence check using 58 positive place invariants in 14 ms returned sat
[2021-05-09 07:59:33] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:33] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-09 07:59:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:33] [INFO ] [Nat]Absence check using 58 positive place invariants in 20 ms returned sat
[2021-05-09 07:59:33] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 07:59:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:34] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2021-05-09 07:59:34] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:59:34] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2021-05-09 07:59:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2021-05-09 07:59:34] [INFO ] Computed and/alt/rep : 429/826/429 causal constraints (skipped 5 transitions) in 29 ms.
[2021-05-09 07:59:35] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 1 ms to minimize.
[2021-05-09 07:59:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2021-05-09 07:59:36] [INFO ] Added : 298 causal constraints over 60 iterations in 1769 ms. Result :sat
[2021-05-09 07:59:36] [INFO ] [Real]Absence check using 58 positive place invariants in 16 ms returned sat
[2021-05-09 07:59:36] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:36] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2021-05-09 07:59:36] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:59:36] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:59:36] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2021-05-09 07:59:36] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:59:36] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2021-05-09 07:59:36] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:59:36] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:59:36] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:59:36] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:59:37] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:59:37] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:59:37] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2021-05-09 07:59:37] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2021-05-09 07:59:37] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1026 ms
[2021-05-09 07:59:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:37] [INFO ] [Nat]Absence check using 58 positive place invariants in 19 ms returned sat
[2021-05-09 07:59:37] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 07:59:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:37] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2021-05-09 07:59:37] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:59:37] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:59:37] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:59:38] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2021-05-09 07:59:38] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2021-05-09 07:59:38] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2021-05-09 07:59:38] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:59:38] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:59:38] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2021-05-09 07:59:38] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:59:38] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:59:38] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2021-05-09 07:59:38] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:59:38] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1222 ms
[2021-05-09 07:59:38] [INFO ] Computed and/alt/rep : 429/826/429 causal constraints (skipped 5 transitions) in 26 ms.
[2021-05-09 07:59:40] [INFO ] Added : 273 causal constraints over 55 iterations in 1275 ms. Result :sat
[2021-05-09 07:59:40] [INFO ] [Real]Absence check using 58 positive place invariants in 14 ms returned sat
[2021-05-09 07:59:40] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 07:59:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:40] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-09 07:59:40] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2021-05-09 07:59:40] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2021-05-09 07:59:40] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:59:40] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:59:40] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:59:40] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:59:40] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:59:40] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2021-05-09 07:59:40] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:59:40] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:59:40] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2021-05-09 07:59:41] [INFO ] Deduced a trap composed of 34 places in 22 ms of which 0 ms to minimize.
[2021-05-09 07:59:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 761 ms
[2021-05-09 07:59:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:41] [INFO ] [Nat]Absence check using 58 positive place invariants in 14 ms returned sat
[2021-05-09 07:59:41] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 07:59:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:41] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-09 07:59:41] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:59:41] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:59:41] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2021-05-09 07:59:41] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:59:41] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2021-05-09 07:59:41] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:59:41] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:59:41] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2021-05-09 07:59:41] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2021-05-09 07:59:41] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:59:41] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2021-05-09 07:59:41] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2021-05-09 07:59:41] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 0 ms to minimize.
[2021-05-09 07:59:42] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 13 ms to minimize.
[2021-05-09 07:59:42] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 780 ms
[2021-05-09 07:59:42] [INFO ] Computed and/alt/rep : 429/826/429 causal constraints (skipped 5 transitions) in 20 ms.
[2021-05-09 07:59:43] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:59:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2021-05-09 07:59:43] [INFO ] Added : 293 causal constraints over 59 iterations in 1389 ms. Result :sat
[2021-05-09 07:59:43] [INFO ] [Real]Absence check using 58 positive place invariants in 18 ms returned sat
[2021-05-09 07:59:43] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 07:59:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:43] [INFO ] [Real]Absence check using state equation in 156 ms returned unsat
[2021-05-09 07:59:43] [INFO ] [Real]Absence check using 58 positive place invariants in 18 ms returned sat
[2021-05-09 07:59:43] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 07:59:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:43] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2021-05-09 07:59:44] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2021-05-09 07:59:44] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:59:44] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:59:44] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:59:44] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2021-05-09 07:59:44] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:59:44] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:59:44] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:59:44] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:59:45] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 1 ms to minimize.
[2021-05-09 07:59:45] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:59:45] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:59:45] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:59:45] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:59:45] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:59:45] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2021-05-09 07:59:45] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1836 ms
[2021-05-09 07:59:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:45] [INFO ] [Nat]Absence check using 58 positive place invariants in 18 ms returned sat
[2021-05-09 07:59:45] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 07:59:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:46] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-09 07:59:46] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:59:46] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:59:46] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:59:46] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:59:46] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:59:46] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:59:46] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:59:46] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:59:47] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2021-05-09 07:59:47] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:59:47] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 1 ms to minimize.
[2021-05-09 07:59:47] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:59:47] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2021-05-09 07:59:47] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:59:47] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 1 ms to minimize.
[2021-05-09 07:59:47] [INFO ] Deduced a trap composed of 32 places in 19 ms of which 0 ms to minimize.
[2021-05-09 07:59:47] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1667 ms
[2021-05-09 07:59:47] [INFO ] Computed and/alt/rep : 429/826/429 causal constraints (skipped 5 transitions) in 19 ms.
[2021-05-09 07:59:49] [INFO ] Added : 293 causal constraints over 59 iterations in 1621 ms. Result :sat
[2021-05-09 07:59:49] [INFO ] [Real]Absence check using 58 positive place invariants in 22 ms returned sat
[2021-05-09 07:59:49] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-09 07:59:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:49] [INFO ] [Real]Absence check using state equation in 148 ms returned unsat
[2021-05-09 07:59:49] [INFO ] [Real]Absence check using 58 positive place invariants in 19 ms returned sat
[2021-05-09 07:59:49] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 07:59:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:49] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2021-05-09 07:59:49] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 0 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 0 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:59:52] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:59:52] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:59:52] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:59:52] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:59:52] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:59:52] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 2524 ms
[2021-05-09 07:59:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:52] [INFO ] [Nat]Absence check using 58 positive place invariants in 14 ms returned sat
[2021-05-09 07:59:52] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 07:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:52] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-09 07:59:52] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:59:52] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2021-05-09 07:59:52] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:59:52] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:59:53] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:59:53] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2021-05-09 07:59:53] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:59:53] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:59:53] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:59:53] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:59:53] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2021-05-09 07:59:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 899 ms
[2021-05-09 07:59:53] [INFO ] Computed and/alt/rep : 429/826/429 causal constraints (skipped 5 transitions) in 19 ms.
[2021-05-09 07:59:54] [INFO ] Added : 282 causal constraints over 57 iterations in 1123 ms. Result :sat
[2021-05-09 07:59:54] [INFO ] [Real]Absence check using 58 positive place invariants in 23 ms returned sat
[2021-05-09 07:59:54] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 07:59:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:54] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-09 07:59:54] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:59:55] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:59:55] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2021-05-09 07:59:55] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:59:55] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2021-05-09 07:59:55] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:59:55] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:59:55] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2021-05-09 07:59:55] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2021-05-09 07:59:55] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2021-05-09 07:59:55] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:59:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 841 ms
[2021-05-09 07:59:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:55] [INFO ] [Nat]Absence check using 58 positive place invariants in 14 ms returned sat
[2021-05-09 07:59:55] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 07:59:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:55] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2021-05-09 07:59:55] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:59:56] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2021-05-09 07:59:56] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:59:56] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:59:56] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:59:56] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:59:56] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:59:56] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2021-05-09 07:59:56] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2021-05-09 07:59:56] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2021-05-09 07:59:56] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2021-05-09 07:59:56] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 703 ms
[2021-05-09 07:59:56] [INFO ] Computed and/alt/rep : 429/826/429 causal constraints (skipped 5 transitions) in 20 ms.
[2021-05-09 07:59:58] [INFO ] Added : 311 causal constraints over 63 iterations in 1477 ms. Result :sat
[2021-05-09 07:59:58] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned unsat
[2021-05-09 07:59:58] [INFO ] [Real]Absence check using 58 positive place invariants in 23 ms returned sat
[2021-05-09 07:59:58] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 07:59:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:58] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-09 07:59:58] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2021-05-09 07:59:58] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:59:58] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:59:58] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:59:58] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:59:58] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2021-05-09 08:00:00] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2021-05-09 08:00:00] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2021-05-09 08:00:00] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2021-05-09 08:00:00] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2021-05-09 08:00:00] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2021-05-09 08:00:00] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2021-05-09 08:00:00] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2021-05-09 08:00:00] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2000 ms
[2021-05-09 08:00:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:00:00] [INFO ] [Nat]Absence check using 58 positive place invariants in 20 ms returned sat
[2021-05-09 08:00:00] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 08:00:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:00] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2021-05-09 08:00:00] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2021-05-09 08:00:00] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2021-05-09 08:00:01] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2021-05-09 08:00:01] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2021-05-09 08:00:01] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2021-05-09 08:00:01] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:00:01] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2021-05-09 08:00:01] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:00:01] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2021-05-09 08:00:01] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2021-05-09 08:00:01] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2021-05-09 08:00:01] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 0 ms to minimize.
[2021-05-09 08:00:01] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2021-05-09 08:00:01] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2021-05-09 08:00:02] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
[2021-05-09 08:00:02] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2021-05-09 08:00:02] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2021-05-09 08:00:02] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2021-05-09 08:00:02] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2021-05-09 08:00:02] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2021-05-09 08:00:02] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:00:02] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2021-05-09 08:00:02] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2021-05-09 08:00:02] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2021-05-09 08:00:02] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2021-05-09 08:00:02] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2021-05-09 08:00:02] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2080 ms
[2021-05-09 08:00:02] [INFO ] Computed and/alt/rep : 429/826/429 causal constraints (skipped 5 transitions) in 20 ms.
[2021-05-09 08:00:04] [INFO ] Added : 288 causal constraints over 58 iterations in 1193 ms. Result :sat
[2021-05-09 08:00:04] [INFO ] [Real]Absence check using 58 positive place invariants in 30 ms returned sat
[2021-05-09 08:00:04] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-09 08:00:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:04] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-09 08:00:04] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2021-05-09 08:00:04] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2021-05-09 08:00:04] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2021-05-09 08:00:04] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2021-05-09 08:00:04] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2021-05-09 08:00:04] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2021-05-09 08:00:04] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:00:04] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2021-05-09 08:00:05] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2021-05-09 08:00:05] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
[2021-05-09 08:00:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 801 ms
[2021-05-09 08:00:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:00:05] [INFO ] [Nat]Absence check using 58 positive place invariants in 32 ms returned sat
[2021-05-09 08:00:05] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-09 08:00:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:05] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-09 08:00:05] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:00:05] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2021-05-09 08:00:05] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2021-05-09 08:00:05] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2021-05-09 08:00:05] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2021-05-09 08:00:05] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 0 ms to minimize.
[2021-05-09 08:00:06] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
[2021-05-09 08:00:06] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:00:06] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:00:06] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2021-05-09 08:00:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 923 ms
[2021-05-09 08:00:06] [INFO ] Computed and/alt/rep : 429/826/429 causal constraints (skipped 5 transitions) in 20 ms.
[2021-05-09 08:00:07] [INFO ] Added : 321 causal constraints over 65 iterations in 1539 ms. Result :sat
[2021-05-09 08:00:07] [INFO ] [Real]Absence check using 58 positive place invariants in 23 ms returned sat
[2021-05-09 08:00:07] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:00:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:08] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-09 08:00:08] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2021-05-09 08:00:08] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2021-05-09 08:00:08] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2021-05-09 08:00:08] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:00:08] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2021-05-09 08:00:08] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 0 ms to minimize.
[2021-05-09 08:00:08] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2021-05-09 08:00:09] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2021-05-09 08:00:09] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2021-05-09 08:00:09] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 909 ms
[2021-05-09 08:00:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:00:09] [INFO ] [Nat]Absence check using 58 positive place invariants in 24 ms returned sat
[2021-05-09 08:00:09] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:00:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:09] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2021-05-09 08:00:09] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2021-05-09 08:00:09] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2021-05-09 08:00:09] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:00:09] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2021-05-09 08:00:09] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2021-05-09 08:00:10] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2021-05-09 08:00:10] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2021-05-09 08:00:10] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2021-05-09 08:00:10] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2021-05-09 08:00:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 860 ms
[2021-05-09 08:00:10] [INFO ] Computed and/alt/rep : 429/826/429 causal constraints (skipped 5 transitions) in 31 ms.
[2021-05-09 08:00:11] [INFO ] Added : 273 causal constraints over 55 iterations in 1461 ms. Result :sat
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
[2021-05-09 08:00:11] [INFO ] Initial state test concluded for 1 properties.
FORMULA BusinessProcesses-PT-15-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 496 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 496/496 places, 435/435 transitions.
Graph (trivial) has 234 edges and 496 vertex of which 7 / 496 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 489 transition count 370
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 432 transition count 369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 431 transition count 369
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 117 place count 431 transition count 267
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 223 rules applied. Total rules applied 340 place count 310 transition count 267
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 347 place count 303 transition count 260
Iterating global reduction 3 with 7 rules applied. Total rules applied 354 place count 303 transition count 260
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 354 place count 303 transition count 259
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 356 place count 302 transition count 259
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 614 place count 171 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 616 place count 170 transition count 136
Applied a total of 616 rules in 96 ms. Remains 170 /496 variables (removed 326) and now considering 136/435 (removed 299) transitions.
// Phase 1: matrix 136 rows 170 cols
[2021-05-09 08:00:11] [INFO ] Computed 76 place invariants in 4 ms
[2021-05-09 08:00:12] [INFO ] Implicit Places using invariants in 222 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 48, 49, 50, 51, 52, 53, 54, 55, 136]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 224 ms to find 23 implicit places.
[2021-05-09 08:00:12] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 136 rows 147 cols
[2021-05-09 08:00:12] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 08:00:12] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Starting structural reductions, iteration 1 : 147/496 places, 136/435 transitions.
Applied a total of 0 rules in 11 ms. Remains 147 /147 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2021-05-09 08:00:12] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 136 rows 147 cols
[2021-05-09 08:00:12] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 08:00:12] [INFO ] Dead Transitions using invariants and state equation in 139 ms returned []
Finished structural reductions, in 2 iterations. Remains : 147/496 places, 136/435 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 21637 reset in 322 ms.
Product exploration explored 100000 steps with 21760 reset in 209 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21671 reset in 175 ms.
Product exploration explored 100000 steps with 21700 reset in 196 ms.
[2021-05-09 08:00:13] [INFO ] Flatten gal took : 12 ms
[2021-05-09 08:00:13] [INFO ] Flatten gal took : 11 ms
[2021-05-09 08:00:13] [INFO ] Time to serialize gal into /tmp/LTL11906744476626333995.gal : 2 ms
[2021-05-09 08:00:13] [INFO ] Time to serialize properties into /tmp/LTL8959517499188253770.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11906744476626333995.gal, -t, CGAL, -LTL, /tmp/LTL8959517499188253770.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11906744476626333995.gal -t CGAL -LTL /tmp/LTL8959517499188253770.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p164!=1)"))))
Formula 0 simplified : !FG"(p164!=1)"
Reverse transition relation is NOT exact ! Due to transitions t428, t253.t255.t256.t0.t257, t250.t251.t1.t257, t247.t248.t2.t257, t244.t245.t3.t257, t203.t204.t5.t205, t42.t44.t45.t6, t39.t40.t7, t36.t37.t8, t33.t34.t9, t22.t23.t10, t48.t140.t141.t279.t310.t419.t280.t281.t65, t144.t370.t242.t257.t65, t129.t365.t242.t257.t65, t126.t360.t242.t257.t65, t431.t169.t318.t170.t65, t67.t166.t168.t171.t172.t176.t180.t184.t188.t192.t196.t200.t206.t210.t214.t218.t224.t228.t232.t236.t240.t258.t262.t266.t278.t282.t287.t291.t219.t68.t71.t74.t77.t80.t84.t87.t90.t93.t96.t99.t102.t105.t108.t111.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t151.t155.t158.t161.t164.t162.t159.t156.t149.t146.t143.t137.t134.t131.t128.t125.t122.t119.t116.t109.t106.t103.t100.t97.t94.t91.t88.t85.t78.t75.t72.t69.t267.t277.t268.t269.t270, t67.t166.t168.t171.t172.t176.t180.t184.t188.t192.t196.t200.t206.t210.t214.t218.t224.t228.t232.t236.t240.t258.t262.t266.t278.t282.t287.t291.t219.t68.t71.t74.t77.t80.t84.t87.t90.t93.t96.t99.t102.t105.t108.t111.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t151.t155.t158.t161.t164.t162.t159.t156.t149.t146.t143.t137.t134.t131.t128.t125.t122.t119.t116.t109.t106.t103.t100.t97.t94.t91.t88.t85.t78.t75.t72.t69.t267.t277.t268.t269.t275.t276, t415.t65.t267.t277.t268.t269.t270, t415.t65.t267.t277.t268.t269.t275.t276, t416.t65.t267.t277.t268.t269.t270, t416.t65.t267.t277.t268.t269.t275.t276, t417.t65.t267.t277.t268.t269.t270, t417.t65.t267.t277.t268.t269.t275.t276, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/76/24/136
Computing Next relation with stutter on 972 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
138 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.43066,60812,1,0,443,172599,265,399,5885,229140,796
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-15-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-15-00 finished in 3603 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(((F((p2 U (p3||G(p2))))&&p1)||G(F((p2 U (p3||G(p2))))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 496 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 489 transition count 428
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 489 transition count 428
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 485 transition count 424
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 485 transition count 424
Applied a total of 22 rules in 44 ms. Remains 485 /496 variables (removed 11) and now considering 424/435 (removed 11) transitions.
// Phase 1: matrix 424 rows 485 cols
[2021-05-09 08:00:15] [INFO ] Computed 99 place invariants in 9 ms
[2021-05-09 08:00:15] [INFO ] Implicit Places using invariants in 371 ms returned []
// Phase 1: matrix 424 rows 485 cols
[2021-05-09 08:00:15] [INFO ] Computed 99 place invariants in 6 ms
[2021-05-09 08:00:16] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
// Phase 1: matrix 424 rows 485 cols
[2021-05-09 08:00:16] [INFO ] Computed 99 place invariants in 4 ms
[2021-05-09 08:00:16] [INFO ] Dead Transitions using invariants and state equation in 290 ms returned []
Finished structural reductions, in 1 iterations. Remains : 485/496 places, 424/435 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-15-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p3)) (AND (NOT p3) (NOT p2))), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s275 1), p1:(AND (NEQ s275 1) (OR (NEQ s88 1) (NEQ s418 1))), p3:(AND (NEQ s463 1) (NEQ s65 1)), p2:(NEQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 507 ms.
Product exploration explored 100000 steps with 50000 reset in 490 ms.
Graph (complete) has 1103 edges and 485 vertex of which 484 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Knowledge obtained : [(NOT p0), p1, p3, p2]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 522 ms.
Product exploration explored 100000 steps with 50000 reset in 464 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Support contains 5 out of 485 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 485/485 places, 424/424 transitions.
Graph (trivial) has 217 edges and 485 vertex of which 6 / 485 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 480 transition count 418
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 97 Pre rules applied. Total rules applied 51 place count 480 transition count 620
Deduced a syphon composed of 147 places in 1 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 148 place count 480 transition count 620
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 165 place count 463 transition count 557
Deduced a syphon composed of 130 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 182 place count 463 transition count 557
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 264 places in 0 ms
Iterating global reduction 1 with 134 rules applied. Total rules applied 316 place count 463 transition count 557
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 349 place count 430 transition count 524
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 382 place count 430 transition count 524
Deduced a syphon composed of 231 places in 1 ms
Applied a total of 382 rules in 103 ms. Remains 430 /485 variables (removed 55) and now considering 524/424 (removed -100) transitions.
[2021-05-09 08:00:19] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 524 rows 430 cols
[2021-05-09 08:00:19] [INFO ] Computed 99 place invariants in 6 ms
[2021-05-09 08:00:20] [INFO ] Dead Transitions using invariants and state equation in 349 ms returned []
Finished structural reductions, in 1 iterations. Remains : 430/485 places, 524/424 transitions.
Product exploration explored 100000 steps with 50000 reset in 1588 ms.
Product exploration explored 100000 steps with 50000 reset in 1464 ms.
[2021-05-09 08:00:23] [INFO ] Flatten gal took : 22 ms
[2021-05-09 08:00:23] [INFO ] Flatten gal took : 19 ms
[2021-05-09 08:00:23] [INFO ] Time to serialize gal into /tmp/LTL13110075139038283802.gal : 8 ms
[2021-05-09 08:00:23] [INFO ] Time to serialize properties into /tmp/LTL15135456869836522412.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13110075139038283802.gal, -t, CGAL, -LTL, /tmp/LTL15135456869836522412.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13110075139038283802.gal -t CGAL -LTL /tmp/LTL15135456869836522412.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p310==1)")||(F((("((p310!=1)&&((p110!=1)||(p524!=1)))")&&(F(("(p76!=1)")U(("((p608!=1)&&(p76!=1))")||(G("(p76!=1)"))))))||(G(F(("(p76!=1)")U(("((p608!=1)&&(p76!=1))")||(G("(p76!=1)")))))))))))
Formula 0 simplified : !X("(p310==1)" | F(("((p310!=1)&&((p110!=1)||(p524!=1)))" & F("(p76!=1)" U ("((p608!=1)&&(p76!=1))" | G"(p76!=1)"))) | GF("(p76!=1)" U ("((p608!=1)&&(p76!=1))" | G"(p76!=1)"))))
Detected timeout of ITS tools.
[2021-05-09 08:00:38] [INFO ] Flatten gal took : 46 ms
[2021-05-09 08:00:38] [INFO ] Applying decomposition
[2021-05-09 08:00:38] [INFO ] Flatten gal took : 56 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/graph2560649345756387407.txt, -o, /tmp/graph2560649345756387407.bin, -w, /tmp/graph2560649345756387407.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/graph2560649345756387407.bin, -l, -1, -v, -w, /tmp/graph2560649345756387407.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:00:38] [INFO ] Decomposing Gal with order
[2021-05-09 08:00:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:00:38] [INFO ] Removed a total of 266 redundant transitions.
[2021-05-09 08:00:38] [INFO ] Flatten gal took : 106 ms
[2021-05-09 08:00:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-05-09 08:00:38] [INFO ] Time to serialize gal into /tmp/LTL8836925546962922529.gal : 11 ms
[2021-05-09 08:00:38] [INFO ] Time to serialize properties into /tmp/LTL5161765835386697849.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8836925546962922529.gal, -t, CGAL, -LTL, /tmp/LTL5161765835386697849.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8836925546962922529.gal -t CGAL -LTL /tmp/LTL5161765835386697849.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i14.u107.p310==1)")||(F((("((i14.u107.p310!=1)&&((i7.u37.p110!=1)||(i7.u147.p524!=1)))")&&(F(("(i16.u26.p76!=1)")U(("((i7.u167.p608!=1)&&(i16.u26.p76!=1))")||(G("(i16.u26.p76!=1)"))))))||(G(F(("(i16.u26.p76!=1)")U(("((i7.u167.p608!=1)&&(i16.u26.p76!=1))")||(G("(i16.u26.p76!=1)")))))))))))
Formula 0 simplified : !X("(i14.u107.p310==1)" | F(("((i14.u107.p310!=1)&&((i7.u37.p110!=1)||(i7.u147.p524!=1)))" & F("(i16.u26.p76!=1)" U ("((i7.u167.p608!=1)&&(i16.u26.p76!=1))" | G"(i16.u26.p76!=1)"))) | GF("(i16.u26.p76!=1)" U ("((i7.u167.p608!=1)&&(i16.u26.p76!=1))" | G"(i16.u26.p76!=1)"))))
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t172, t180, t266, t282, t291, t415, t416, t417, t419, t420, t428, i0.u82.t175, i0.u86.t167, i0.u134.t69, i0.u84.t170, i0.u132.t75, i0.u133.t72, i1.t184, i1.u74.t191, i1.u76.t187, i2.t192, i2.u70.t199, i2.u72.t195, i2.u129.t85, i2.u130.t81, i3.u64.t209, i3.u66.t205, i4.u27.t265, i4.u29.t261, i5.t278, i5.u20.t285, i5.u21.t284, i5.u22.t281, i6.u112.t137, i6.u113.t134, i6.u114.t131, i7.t242, i7.t3, i7.t2, i7.t1, i7.t0, i7.u31.t257, i7.u116.t125, i7.u115.t128, i7.u110.t143, i8.t176, i8.u78.t183, i8.u80.t179, i8.u131.t78, i9.u125.t97, i9.u126.t94, i9.u127.t91, i9.u128.t88, i10.u60.t217, i10.u62.t213, i10.u123.t103, i10.u124.t100, i11.i0.u48.t239, i11.i0.u52.t231, i11.i0.u119.t116, i11.i1.u117.t122, i11.i1.u118.t119, i11.i1.u120.t112, i12.u50.t235, i12.u108.t149, i12.u109.t146, i13.u14.t299, i13.u15.t298, i13.u102.t164, i13.u103.t162, i13.u104.t159, i13.u105.t156, i14.t153, i14.u16.t296, i14.u18.t290, i14.u107.t154, i15.t223, i15.u54.t227, i15.u121.t109, i15.u122.t106, i16.t277, i16.t10, i16.u136.t65, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/301/87/424
Computing Next relation with stutter on 972 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
983 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.88867,275136,1,0,423190,1693,6156,1.45481e+06,318,4316,985299
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-15-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-15-01 finished in 35634 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((X(p1)||(!p0&&F(p2))||G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 496 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 489 transition count 428
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 489 transition count 428
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 486 transition count 425
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 486 transition count 425
Applied a total of 20 rules in 54 ms. Remains 486 /496 variables (removed 10) and now considering 425/435 (removed 10) transitions.
// Phase 1: matrix 425 rows 486 cols
[2021-05-09 08:00:51] [INFO ] Computed 99 place invariants in 14 ms
[2021-05-09 08:00:51] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 425 rows 486 cols
[2021-05-09 08:00:51] [INFO ] Computed 99 place invariants in 6 ms
[2021-05-09 08:00:51] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
// Phase 1: matrix 425 rows 486 cols
[2021-05-09 08:00:51] [INFO ] Computed 99 place invariants in 4 ms
[2021-05-09 08:00:52] [INFO ] Dead Transitions using invariants and state equation in 221 ms returned []
Finished structural reductions, in 1 iterations. Remains : 486/496 places, 425/435 transitions.
Stuttering acceptance computed with spot in 324 ms :[true, (NOT p1), (NOT p2), false, (AND p0 (NOT p1)), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=p0, acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 9}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 0}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=3, aps=[p1:(EQ s333 1), p2:(OR (NEQ s185 1) (NEQ s367 1) (NEQ s451 1)), p0:(EQ s401 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 575 ms.
Product exploration explored 100000 steps with 50000 reset in 543 ms.
Graph (complete) has 1106 edges and 486 vertex of which 485 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p1), p2, (NOT p0)]
Stuttering acceptance computed with spot in 351 ms :[true, (NOT p1), (NOT p2), false, (AND p0 (NOT p1)), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 563 ms.
Product exploration explored 100000 steps with 50000 reset in 533 ms.
Applying partial POR strategy [true, true, true, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 358 ms :[true, (NOT p1), (NOT p2), false, (AND p0 (NOT p1)), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p0), (NOT p0)]
Support contains 5 out of 486 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 486/486 places, 425/425 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 486 transition count 425
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 101 Pre rules applied. Total rules applied 51 place count 486 transition count 650
Deduced a syphon composed of 152 places in 1 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 152 place count 486 transition count 650
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 169 place count 469 transition count 587
Deduced a syphon composed of 135 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 186 place count 469 transition count 587
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 266 places in 0 ms
Iterating global reduction 1 with 131 rules applied. Total rules applied 317 place count 469 transition count 587
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 350 place count 436 transition count 554
Deduced a syphon composed of 233 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 383 place count 436 transition count 554
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 235 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 385 place count 436 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 386 place count 436 transition count 557
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 388 place count 434 transition count 553
Deduced a syphon composed of 233 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 434 transition count 553
Deduced a syphon composed of 233 places in 0 ms
Applied a total of 390 rules in 123 ms. Remains 434 /486 variables (removed 52) and now considering 553/425 (removed -128) transitions.
[2021-05-09 08:00:55] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 553 rows 434 cols
[2021-05-09 08:00:55] [INFO ] Computed 99 place invariants in 8 ms
[2021-05-09 08:00:56] [INFO ] Dead Transitions using invariants and state equation in 413 ms returned []
Finished structural reductions, in 1 iterations. Remains : 434/486 places, 553/425 transitions.
Product exploration explored 100000 steps with 50000 reset in 469 ms.
Product exploration explored 100000 steps with 50000 reset in 369 ms.
[2021-05-09 08:00:57] [INFO ] Flatten gal took : 17 ms
[2021-05-09 08:00:57] [INFO ] Flatten gal took : 16 ms
[2021-05-09 08:00:57] [INFO ] Time to serialize gal into /tmp/LTL12217756514726139165.gal : 2 ms
[2021-05-09 08:00:57] [INFO ] Time to serialize properties into /tmp/LTL3079657031764450621.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12217756514726139165.gal, -t, CGAL, -LTL, /tmp/LTL3079657031764450621.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12217756514726139165.gal -t CGAL -LTL /tmp/LTL3079657031764450621.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(p482==1)"))||(X(((X("(p384==1)"))||(("(p482!=1)")&&(F("(((p209!=1)||(p426!=1))||(p595!=1))"))))||(G("(p482!=1)"))))))
Formula 0 simplified : !(G"(p482==1)" | X(X"(p384==1)" | ("(p482!=1)" & F"(((p209!=1)||(p426!=1))||(p595!=1))") | G"(p482!=1)"))
Detected timeout of ITS tools.
[2021-05-09 08:01:12] [INFO ] Flatten gal took : 20 ms
[2021-05-09 08:01:12] [INFO ] Applying decomposition
[2021-05-09 08:01:12] [INFO ] Flatten gal took : 13 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/graph17860601362978995480.txt, -o, /tmp/graph17860601362978995480.bin, -w, /tmp/graph17860601362978995480.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/graph17860601362978995480.bin, -l, -1, -v, -w, /tmp/graph17860601362978995480.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:01:12] [INFO ] Decomposing Gal with order
[2021-05-09 08:01:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:01:12] [INFO ] Removed a total of 267 redundant transitions.
[2021-05-09 08:01:12] [INFO ] Flatten gal took : 27 ms
[2021-05-09 08:01:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 13 ms.
[2021-05-09 08:01:12] [INFO ] Time to serialize gal into /tmp/LTL1439266354817106499.gal : 6 ms
[2021-05-09 08:01:12] [INFO ] Time to serialize properties into /tmp/LTL4307666838520853518.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1439266354817106499.gal, -t, CGAL, -LTL, /tmp/LTL4307666838520853518.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1439266354817106499.gal -t CGAL -LTL /tmp/LTL4307666838520853518.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("(i17.u136.p482==1)"))||(X(((X("(i10.i3.u118.p384==1)"))||(("(i17.u136.p482!=1)")&&(F("(((i8.i0.u70.p209!=1)||(i8.i1.u126.p426!=1))||(i16.u131.p595!=1))"))))||(G("(i17.u136.p482!=1)"))))))
Formula 0 simplified : !(G"(i17.u136.p482==1)" | X(X"(i10.i3.u118.p384==1)" | ("(i17.u136.p482!=1)" & F"(((i8.i0.u70.p209!=1)||(i8.i1.u126.p426!=1))||(i16.u131.p595!=1))") | G"(i17.u136.p482!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t172, t192, t278, t415, t417, t419, t428, i0.i0.u129.t72, i0.i0.u130.t69, i0.i1.u80.t175, i0.i1.u84.t167, i0.i2.u82.t170, i1.t184, i1.i0.t176, i1.i0.t180, i1.i0.u72.t191, i1.i0.u76.t183, i1.i0.u78.t179, i1.i1.u74.t187, i1.i2.u127.t78, i1.i2.u128.t75, i2.u60.t213, i2.u68.t199, i3.i0.u49.t231, i3.i0.u52.t227, i3.i1.u115.t116, i3.i1.u116.t112, i3.i1.u117.t109, i4.u28.t261, i4.u45.t239, i4.u47.t235, i5.t291, i5.t282, i5.u12.t299, i5.u13.t298, i5.u14.t296, i5.u16.t290, i5.u18.t285, i5.u19.t284, i6.i0.u62.t209, i6.i1.u99.t164, i6.i1.u100.t162, i6.i1.u101.t159, i7.u64.t205, i8.i0.u70.t195, i8.i1.u125.t85, i8.i1.u126.t81, i9.u122.t94, i9.u123.t91, i9.u124.t88, i10.i0.t223, i10.i0.u58.t217, i10.i2.u120.t100, i10.i2.u121.t97, i10.i3.u118.t106, i10.i3.u119.t103, i11.i0.u113.t122, i11.i0.u114.t119, i11.i1.u109.t134, i11.i1.u110.t131, i12.u26.t265, i13.i0.u104.t149, i13.i0.u105.t146, i13.i1.u102.t156, i13.i1.u103.t152, i14.t266, i14.i0.u20.t281, i14.i1.t277, i14.i2.u108.t137, i15.t1, i15.t0, i15.i0.u106.t143, i15.i1.u111.t128, i15.i2.t2, i15.i2.t3, i15.i2.u30.t242, i15.i2.u30.t257, i15.i2.u112.t125, i16.t10, i16.u131.t65, i17.t50, i17.u136.t52, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/300/86/422
Computing Next relation with stutter on 972 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
326 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.30832,159788,1,0,282313,760,6474,606713,306,1970,711617
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-15-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-15-02 finished in 25311 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 496/496 places, 435/435 transitions.
Graph (trivial) has 232 edges and 496 vertex of which 7 / 496 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 489 transition count 370
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 432 transition count 370
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 115 place count 432 transition count 268
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 338 place count 311 transition count 268
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 344 place count 305 transition count 262
Iterating global reduction 2 with 6 rules applied. Total rules applied 350 place count 305 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 350 place count 305 transition count 261
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 352 place count 304 transition count 261
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 610 place count 173 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 612 place count 172 transition count 138
Applied a total of 612 rules in 84 ms. Remains 172 /496 variables (removed 324) and now considering 138/435 (removed 297) transitions.
// Phase 1: matrix 138 rows 172 cols
[2021-05-09 08:01:16] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-09 08:01:16] [INFO ] Implicit Places using invariants in 177 ms returned [1, 5, 6, 7, 10, 11, 34, 35, 36, 37, 38, 43, 44, 45, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 183 ms to find 22 implicit places.
[2021-05-09 08:01:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 138 rows 150 cols
[2021-05-09 08:01:16] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-09 08:01:16] [INFO ] Dead Transitions using invariants and state equation in 215 ms returned []
Starting structural reductions, iteration 1 : 150/496 places, 138/435 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2021-05-09 08:01:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 138 rows 150 cols
[2021-05-09 08:01:16] [INFO ] Computed 54 place invariants in 2 ms
[2021-05-09 08:01:17] [INFO ] Dead Transitions using invariants and state equation in 141 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/496 places, 138/435 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-15-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2 0) (EQ s116 0)), p1:(NEQ s116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 21540 reset in 363 ms.
Product exploration explored 100000 steps with 21550 reset in 194 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 21678 reset in 237 ms.
Product exploration explored 100000 steps with 21711 reset in 198 ms.
[2021-05-09 08:01:18] [INFO ] Flatten gal took : 8 ms
[2021-05-09 08:01:18] [INFO ] Flatten gal took : 8 ms
[2021-05-09 08:01:18] [INFO ] Time to serialize gal into /tmp/LTL173979567122512157.gal : 1 ms
[2021-05-09 08:01:18] [INFO ] Time to serialize properties into /tmp/LTL9370180316877925146.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL173979567122512157.gal, -t, CGAL, -LTL, /tmp/LTL9370180316877925146.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL173979567122512157.gal -t CGAL -LTL /tmp/LTL9370180316877925146.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("((p37==0)&&(p543==0))"))&&(F(G("(p543!=1)"))))))
Formula 0 simplified : !G(F"((p37==0)&&(p543==0))" & FG"(p543!=1)")
Reverse transition relation is NOT exact ! Due to transitions t296, t428, t253.t255.t256.t0.t257, t250.t251.t1.t257, t247.t248.t2.t257, t244.t245.t3.t257, t203.t204.t5.t205, t42.t44.t45.t6, t39.t40.t7, t36.t37.t8, t33.t34.t9, t22.t23.t10, t48.t140.t141.t279.t310.t419.t280.t281.t65, t144.t370.t242.t257.t65, t129.t365.t242.t257.t65, t126.t360.t242.t257.t65, t431.t169.t318.t170.t65, t67.t166.t168.t171.t172.t176.t180.t184.t188.t192.t196.t200.t206.t210.t214.t218.t224.t228.t232.t236.t240.t258.t262.t266.t278.t282.t287.t291.t219.t68.t71.t74.t77.t80.t84.t87.t90.t93.t96.t99.t102.t105.t108.t111.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t151.t155.t158.t161.t164.t162.t159.t156.t149.t146.t143.t137.t134.t131.t128.t125.t122.t119.t116.t109.t106.t103.t100.t97.t94.t91.t88.t85.t78.t75.t72.t69.t267.t277.t268.t269.t270, t67.t166.t168.t171.t172.t176.t180.t184.t188.t192.t196.t200.t206.t210.t214.t218.t224.t228.t232.t236.t240.t258.t262.t266.t278.t282.t287.t291.t219.t68.t71.t74.t77.t80.t84.t87.t90.t93.t96.t99.t102.t105.t108.t111.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t151.t155.t158.t161.t164.t162.t159.t156.t149.t146.t143.t137.t134.t131.t128.t125.t122.t119.t116.t109.t106.t103.t100.t97.t94.t91.t88.t85.t78.t75.t72.t69.t267.t277.t268.t269.t275.t276, t415.t65.t267.t277.t268.t269.t270, t415.t65.t267.t277.t268.t269.t275.t276, t416.t65.t267.t277.t268.t269.t270, t416.t65.t267.t277.t268.t269.t275.t276, t417.t65.t267.t277.t268.t269.t270, t417.t65.t267.t277.t268.t269.t275.t276, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/77/25/138
Computing Next relation with stutter on 972 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
138 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.41118,64264,1,0,296,181393,275,181,6096,171312,428
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-15-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-15-03 finished in 3616 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X((X((p1 U p2))||G(!p2)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 496 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 488 transition count 427
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 488 transition count 427
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 484 transition count 423
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 484 transition count 423
Applied a total of 24 rules in 21 ms. Remains 484 /496 variables (removed 12) and now considering 423/435 (removed 12) transitions.
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 08:01:20] [INFO ] Computed 99 place invariants in 3 ms
[2021-05-09 08:01:20] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 08:01:20] [INFO ] Computed 99 place invariants in 8 ms
[2021-05-09 08:01:20] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 08:01:20] [INFO ] Computed 99 place invariants in 2 ms
[2021-05-09 08:01:21] [INFO ] Dead Transitions using invariants and state equation in 270 ms returned []
Finished structural reductions, in 1 iterations. Remains : 484/496 places, 423/435 transitions.
Stuttering acceptance computed with spot in 306 ms :[true, (NOT p2), false, p2, false, false, false, false, false]
Running random walk in product with property : BusinessProcesses-PT-15-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 7}, { cond=(NOT p0), acceptance={} source=4 dest: 8}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}]], initial=5, aps=[p2:(AND (EQ s103 1) (EQ s308 1) (EQ s463 1)), p1:(AND (EQ s88 1) (EQ s417 1)), p0:(OR (AND (EQ s109 1) (EQ s312 1) (EQ s416 1)) (AND (EQ s103 1) (EQ s308 1) (EQ s463 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 674 reset in 246 ms.
Product exploration explored 100000 steps with 677 reset in 187 ms.
Graph (complete) has 1102 edges and 484 vertex of which 483 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Knowledge obtained : [(NOT p2), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p2), false, p2, false, false, false, false, false]
Product exploration explored 100000 steps with 675 reset in 258 ms.
Product exploration explored 100000 steps with 682 reset in 266 ms.
Applying partial POR strategy [true, true, false, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 347 ms :[true, (NOT p2), false, p2, false, false, false, false, false]
Support contains 8 out of 484 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 484/484 places, 423/423 transitions.
Graph (trivial) has 219 edges and 484 vertex of which 6 / 484 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 479 transition count 417
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 96 Pre rules applied. Total rules applied 51 place count 479 transition count 593
Deduced a syphon composed of 146 places in 1 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 147 place count 479 transition count 593
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 164 place count 462 transition count 530
Deduced a syphon composed of 129 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 181 place count 462 transition count 530
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 261 places in 0 ms
Iterating global reduction 1 with 132 rules applied. Total rules applied 313 place count 462 transition count 530
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 347 place count 428 transition count 496
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 381 place count 428 transition count 496
Deduced a syphon composed of 227 places in 0 ms
Applied a total of 381 rules in 59 ms. Remains 428 /484 variables (removed 56) and now considering 496/423 (removed -73) transitions.
[2021-05-09 08:01:23] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 496 rows 428 cols
[2021-05-09 08:01:23] [INFO ] Computed 99 place invariants in 13 ms
[2021-05-09 08:01:23] [INFO ] Dead Transitions using invariants and state equation in 496 ms returned []
Finished structural reductions, in 1 iterations. Remains : 428/484 places, 496/423 transitions.
Product exploration explored 100000 steps with 11173 reset in 749 ms.
Product exploration explored 100000 steps with 11195 reset in 487 ms.
[2021-05-09 08:01:24] [INFO ] Flatten gal took : 13 ms
[2021-05-09 08:01:25] [INFO ] Flatten gal took : 12 ms
[2021-05-09 08:01:25] [INFO ] Time to serialize gal into /tmp/LTL17092666016863032629.gal : 2 ms
[2021-05-09 08:01:25] [INFO ] Time to serialize properties into /tmp/LTL17518675858773078961.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17092666016863032629.gal, -t, CGAL, -LTL, /tmp/LTL17518675858773078961.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17092666016863032629.gal -t CGAL -LTL /tmp/LTL17518675858773078961.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("((((p131==1)&&(p357==1))&&(p523==1))||(((p125==1)&&(p352==1))&&(p609==1)))")U(X((X(("((p110==1)&&(p524==1))")U("(((p125==1)&&(p352==1))&&(p609==1))")))||(G("(((p125!=1)||(p352!=1))||(p609!=1))"))))))
Formula 0 simplified : !("((((p131==1)&&(p357==1))&&(p523==1))||(((p125==1)&&(p352==1))&&(p609==1)))" U X(X("((p110==1)&&(p524==1))" U "(((p125==1)&&(p352==1))&&(p609==1))") | G"(((p125!=1)||(p352!=1))||(p609!=1))"))
Detected timeout of ITS tools.
[2021-05-09 08:01:40] [INFO ] Flatten gal took : 30 ms
[2021-05-09 08:01:40] [INFO ] Applying decomposition
[2021-05-09 08:01:40] [INFO ] Flatten gal took : 29 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/graph2011425988621302576.txt, -o, /tmp/graph2011425988621302576.bin, -w, /tmp/graph2011425988621302576.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/graph2011425988621302576.bin, -l, -1, -v, -w, /tmp/graph2011425988621302576.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:01:40] [INFO ] Decomposing Gal with order
[2021-05-09 08:01:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:01:40] [INFO ] Removed a total of 268 redundant transitions.
[2021-05-09 08:01:40] [INFO ] Flatten gal took : 39 ms
[2021-05-09 08:01:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2021-05-09 08:01:40] [INFO ] Time to serialize gal into /tmp/LTL13600016635267577672.gal : 5 ms
[2021-05-09 08:01:40] [INFO ] Time to serialize properties into /tmp/LTL8043747672506491675.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13600016635267577672.gal, -t, CGAL, -LTL, /tmp/LTL8043747672506491675.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13600016635267577672.gal -t CGAL -LTL /tmp/LTL8043747672506491675.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((("((((i8.i0.u34.p131==1)&&(i8.i1.u111.p357==1))&&(i8.i1.u111.p523==1))||(((i8.i0.u33.p125==1)&&(i8.i0.u110.p352==1))&&(i8.i0.u161.p609==1)))")U(X((X(("((i8.i0.u35.p110==1)&&(i8.i0.u141.p524==1))")U("(((i8.i0.u33.p125==1)&&(i8.i0.u110.p352==1))&&(i8.i0.u161.p609==1))")))||(G("(((i8.i0.u33.p125!=1)||(i8.i0.u110.p352!=1))||(i8.i0.u161.p609!=1))"))))))
Formula 0 simplified : !("((((i8.i0.u34.p131==1)&&(i8.i1.u111.p357==1))&&(i8.i1.u111.p523==1))||(((i8.i0.u33.p125==1)&&(i8.i0.u110.p352==1))&&(i8.i0.u161.p609==1)))" U X(X("((i8.i0.u35.p110==1)&&(i8.i0.u141.p524==1))" U "(((i8.i0.u33.p125==1)&&(i8.i0.u110.p352==1))&&(i8.i0.u161.p609==1))") | G"(((i8.i0.u33.p125!=1)||(i8.i0.u110.p352!=1))||(i8.i0.u161.p609!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t172, t180, t266, t282, t415, t416, t417, t419, t420, t428, i0.i0.u129.t69, i0.i1.u80.t175, i0.i1.u84.t167, i0.i2.u82.t170, i1.t192, i1.u68.t199, i1.u70.t195, i2.i0.u62.t209, i2.i1.u60.t213, i3.i0.u50.t231, i3.i0.u52.t227, i3.i0.u116.t109, i3.i1.u115.t112, i4.u29.t261, i4.u48.t235, i5.t278, i5.u19.t285, i5.u20.t284, i5.u21.t281, i5.u27.t265, i6.i0.t291, i6.i0.u14.t298, i6.i0.u15.t296, i6.i0.u17.t290, i6.i1.u102.t152, i6.i1.u103.t149, i7.t10, i7.u130.t65, i8.t3, i8.t0, i8.i0.t1, i8.i0.t2, i8.i0.u31.t242, i8.i0.u31.t257, i8.i0.u105.t143, i8.i0.u110.t128, i8.i1.u111.t125, i9.i0.t223, i10.u121.t94, i10.u122.t91, i10.u123.t88, i11.u64.t205, i12.i0.t176, i12.i0.u78.t179, i12.i1.u127.t75, i12.i1.u128.t72, i12.i2.u76.t183, i12.i2.u124.t85, i12.i2.u125.t81, i12.i2.u126.t78, i13.u46.t239, i13.u112.t122, i13.u113.t119, i13.u114.t116, i14.i0.t277, i14.i1.u107.t137, i14.i1.u108.t134, i14.i1.u109.t131, i15.i0.t184, i15.i0.u72.t191, i15.i0.u74.t187, i15.i1.u104.t146, i16.u13.t299, i16.u98.t164, i16.u99.t162, i16.u100.t159, i16.u101.t156, i17.i0.u58.t217, i17.i1.u119.t100, i17.i1.u120.t97, i17.i2.u117.t106, i17.i2.u118.t103, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/300/86/422
Computing Next relation with stutter on 972 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3382077060290942524
[2021-05-09 08:01:55] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3382077060290942524
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/ltsmin3382077060290942524]
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/ltsmin3382077060290942524] 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/ltsmin3382077060290942524] 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)
Treatment of property BusinessProcesses-PT-15-04 finished in 36419 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 489 transition count 428
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 489 transition count 428
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 485 transition count 424
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 485 transition count 424
Applied a total of 22 rules in 23 ms. Remains 485 /496 variables (removed 11) and now considering 424/435 (removed 11) transitions.
// Phase 1: matrix 424 rows 485 cols
[2021-05-09 08:01:56] [INFO ] Computed 99 place invariants in 3 ms
[2021-05-09 08:01:56] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 424 rows 485 cols
[2021-05-09 08:01:56] [INFO ] Computed 99 place invariants in 22 ms
[2021-05-09 08:01:57] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
// Phase 1: matrix 424 rows 485 cols
[2021-05-09 08:01:57] [INFO ] Computed 99 place invariants in 5 ms
[2021-05-09 08:01:58] [INFO ] Dead Transitions using invariants and state equation in 271 ms returned []
Finished structural reductions, in 1 iterations. Remains : 485/496 places, 424/435 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s230 1) (NEQ s326 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-05 finished in 1729 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 496/496 places, 435/435 transitions.
Graph (trivial) has 231 edges and 496 vertex of which 4 / 496 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 492 transition count 374
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 435 transition count 374
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 115 place count 435 transition count 270
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 343 place count 311 transition count 270
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 349 place count 305 transition count 264
Iterating global reduction 2 with 6 rules applied. Total rules applied 355 place count 305 transition count 264
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 615 place count 173 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 617 place count 172 transition count 139
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 618 place count 172 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 619 place count 171 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 620 place count 170 transition count 138
Applied a total of 620 rules in 43 ms. Remains 170 /496 variables (removed 326) and now considering 138/435 (removed 297) transitions.
// Phase 1: matrix 138 rows 170 cols
[2021-05-09 08:01:58] [INFO ] Computed 74 place invariants in 1 ms
[2021-05-09 08:01:58] [INFO ] Implicit Places using invariants in 112 ms returned [0, 1, 2, 3, 4, 9, 10, 33, 34, 35, 36, 41, 42, 43, 47, 48, 49, 50, 51, 52, 53]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 113 ms to find 21 implicit places.
[2021-05-09 08:01:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 138 rows 149 cols
[2021-05-09 08:01:58] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 08:01:58] [INFO ] Dead Transitions using invariants and state equation in 162 ms returned []
Starting structural reductions, iteration 1 : 149/496 places, 138/435 transitions.
Applied a total of 0 rules in 4 ms. Remains 149 /149 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2021-05-09 08:01:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 138 rows 149 cols
[2021-05-09 08:01:58] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 08:01:58] [INFO ] Dead Transitions using invariants and state equation in 234 ms returned []
Finished structural reductions, in 2 iterations. Remains : 149/496 places, 138/435 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-15-06 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s98 1), p0:(EQ s3 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-06 finished in 730 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 496 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 488 transition count 427
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 488 transition count 427
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 484 transition count 423
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 484 transition count 423
Applied a total of 24 rules in 42 ms. Remains 484 /496 variables (removed 12) and now considering 423/435 (removed 12) transitions.
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 08:01:58] [INFO ] Computed 99 place invariants in 13 ms
[2021-05-09 08:01:59] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 08:01:59] [INFO ] Computed 99 place invariants in 3 ms
[2021-05-09 08:01:59] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 08:01:59] [INFO ] Computed 99 place invariants in 2 ms
[2021-05-09 08:01:59] [INFO ] Dead Transitions using invariants and state equation in 199 ms returned []
Finished structural reductions, in 1 iterations. Remains : 484/496 places, 423/435 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s81 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 155 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-09 finished in 1107 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 488 transition count 427
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 488 transition count 427
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 484 transition count 423
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 484 transition count 423
Applied a total of 24 rules in 23 ms. Remains 484 /496 variables (removed 12) and now considering 423/435 (removed 12) transitions.
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 08:01:59] [INFO ] Computed 99 place invariants in 2 ms
[2021-05-09 08:02:00] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 08:02:00] [INFO ] Computed 99 place invariants in 2 ms
[2021-05-09 08:02:00] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 08:02:00] [INFO ] Computed 99 place invariants in 6 ms
[2021-05-09 08:02:00] [INFO ] Dead Transitions using invariants and state equation in 280 ms returned []
Finished structural reductions, in 1 iterations. Remains : 484/496 places, 423/435 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-15-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s407 1), p0:(EQ s286 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 151 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-10 finished in 1202 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 496 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 496/496 places, 435/435 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 495 transition count 376
Reduce places removed 58 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 118 place count 437 transition count 374
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 435 transition count 374
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 120 place count 435 transition count 271
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 346 place count 312 transition count 271
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 354 place count 304 transition count 263
Iterating global reduction 3 with 8 rules applied. Total rules applied 362 place count 304 transition count 263
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 362 place count 304 transition count 262
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 364 place count 303 transition count 262
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 626 place count 170 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 627 place count 170 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 629 place count 169 transition count 136
Applied a total of 629 rules in 37 ms. Remains 169 /496 variables (removed 327) and now considering 136/435 (removed 299) transitions.
// Phase 1: matrix 136 rows 169 cols
[2021-05-09 08:02:01] [INFO ] Computed 75 place invariants in 1 ms
[2021-05-09 08:02:01] [INFO ] Implicit Places using invariants in 162 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 163 ms to find 22 implicit places.
[2021-05-09 08:02:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 136 rows 147 cols
[2021-05-09 08:02:01] [INFO ] Computed 53 place invariants in 0 ms
[2021-05-09 08:02:01] [INFO ] Dead Transitions using invariants and state equation in 199 ms returned []
Starting structural reductions, iteration 1 : 147/496 places, 136/435 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2021-05-09 08:02:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 136 rows 147 cols
[2021-05-09 08:02:01] [INFO ] Computed 53 place invariants in 2 ms
[2021-05-09 08:02:01] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Finished structural reductions, in 2 iterations. Remains : 147/496 places, 136/435 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s124 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 37463 reset in 321 ms.
Product exploration explored 100000 steps with 37521 reset in 427 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 37492 reset in 347 ms.
Product exploration explored 100000 steps with 37494 reset in 333 ms.
[2021-05-09 08:02:03] [INFO ] Flatten gal took : 6 ms
[2021-05-09 08:02:03] [INFO ] Flatten gal took : 6 ms
[2021-05-09 08:02:03] [INFO ] Time to serialize gal into /tmp/LTL16676956218555573304.gal : 1 ms
[2021-05-09 08:02:03] [INFO ] Time to serialize properties into /tmp/LTL15949176244954542964.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16676956218555573304.gal, -t, CGAL, -LTL, /tmp/LTL15949176244954542964.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16676956218555573304.gal -t CGAL -LTL /tmp/LTL15949176244954542964.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(p595==1)")))
Formula 0 simplified : !F"(p595==1)"
Reverse transition relation is NOT exact ! Due to transitions t428, t253.t255.t256.t0.t257, t250.t251.t1.t257, t247.t248.t2.t257, t244.t245.t3.t257, t203.t204.t5.t205, t42.t44.t45.t6, t39.t40.t7, t36.t37.t8, t33.t34.t9, t22.t23.t10, t48.t140.t141.t279.t310.t419.t280.t281.t65, t144.t370.t242.t257.t65, t129.t365.t242.t257.t65, t126.t360.t242.t257.t65, t431.t169.t318.t170.t65, t67.t166.t168.t171.t172.t176.t180.t184.t188.t192.t196.t200.t206.t210.t214.t218.t224.t228.t232.t236.t240.t258.t262.t266.t278.t282.t287.t291.t219.t68.t71.t74.t77.t80.t84.t87.t90.t93.t96.t99.t102.t105.t108.t111.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t151.t155.t158.t161.t164.t162.t159.t156.t149.t146.t143.t137.t134.t131.t128.t125.t122.t119.t116.t109.t106.t103.t100.t97.t94.t91.t88.t85.t78.t75.t72.t69.t267.t277.t268.t269.t270, t67.t166.t168.t171.t172.t176.t180.t184.t188.t192.t196.t200.t206.t210.t214.t218.t224.t228.t232.t236.t240.t258.t262.t266.t278.t282.t287.t291.t219.t68.t71.t74.t77.t80.t84.t87.t90.t93.t96.t99.t102.t105.t108.t111.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t151.t155.t158.t161.t164.t162.t159.t156.t149.t146.t143.t137.t134.t131.t128.t125.t122.t119.t116.t109.t106.t103.t100.t97.t94.t91.t88.t85.t78.t75.t72.t69.t267.t277.t268.t269.t275.t276, t415.t65.t267.t277.t268.t269.t270, t415.t65.t267.t277.t268.t269.t275.t276, t416.t65.t267.t277.t268.t269.t270, t416.t65.t267.t277.t268.t269.t275.t276, t417.t65.t267.t277.t268.t269.t270, t417.t65.t267.t277.t268.t269.t275.t276, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/76/24/136
Computing Next relation with stutter on 972 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
65 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.682083,40320,1,0,199,91277,262,93,5974,57535,263
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-15-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-15-12 finished in 2933 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 496 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 488 transition count 427
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 488 transition count 427
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 484 transition count 423
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 484 transition count 423
Applied a total of 24 rules in 26 ms. Remains 484 /496 variables (removed 12) and now considering 423/435 (removed 12) transitions.
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 08:02:04] [INFO ] Computed 99 place invariants in 5 ms
[2021-05-09 08:02:04] [INFO ] Implicit Places using invariants in 347 ms returned []
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 08:02:04] [INFO ] Computed 99 place invariants in 3 ms
[2021-05-09 08:02:05] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 08:02:05] [INFO ] Computed 99 place invariants in 6 ms
[2021-05-09 08:02:05] [INFO ] Dead Transitions using invariants and state equation in 225 ms returned []
Finished structural reductions, in 1 iterations. Remains : 484/496 places, 423/435 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-15-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s83 1), p1:(AND (EQ s200 1) (EQ s360 1) (EQ s441 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-13 finished in 1536 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(G((X(p2)||p1)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 496 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 489 transition count 428
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 489 transition count 428
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 486 transition count 425
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 486 transition count 425
Applied a total of 20 rules in 41 ms. Remains 486 /496 variables (removed 10) and now considering 425/435 (removed 10) transitions.
// Phase 1: matrix 425 rows 486 cols
[2021-05-09 08:02:05] [INFO ] Computed 99 place invariants in 6 ms
[2021-05-09 08:02:06] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 425 rows 486 cols
[2021-05-09 08:02:06] [INFO ] Computed 99 place invariants in 7 ms
[2021-05-09 08:02:06] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
// Phase 1: matrix 425 rows 486 cols
[2021-05-09 08:02:06] [INFO ] Computed 99 place invariants in 4 ms
[2021-05-09 08:02:06] [INFO ] Dead Transitions using invariants and state equation in 259 ms returned []
Finished structural reductions, in 1 iterations. Remains : 486/496 places, 425/435 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-15-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s64 1), p1:(OR (NEQ s35 1) (NEQ s329 1) (NEQ s451 1)), p2:(NEQ s226 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-14 finished in 1584 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 496 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 496/496 places, 435/435 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 495 transition count 378
Reduce places removed 56 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 58 rules applied. Total rules applied 114 place count 439 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 116 place count 437 transition count 376
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 116 place count 437 transition count 271
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 346 place count 312 transition count 271
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 354 place count 304 transition count 263
Iterating global reduction 3 with 8 rules applied. Total rules applied 362 place count 304 transition count 263
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 362 place count 304 transition count 262
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 364 place count 303 transition count 262
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 622 place count 172 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 172 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 625 place count 171 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 626 place count 170 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 627 place count 169 transition count 137
Applied a total of 627 rules in 42 ms. Remains 169 /496 variables (removed 327) and now considering 137/435 (removed 298) transitions.
// Phase 1: matrix 137 rows 169 cols
[2021-05-09 08:02:07] [INFO ] Computed 74 place invariants in 1 ms
[2021-05-09 08:02:13] [INFO ] Implicit Places using invariants in 6148 ms returned []
// Phase 1: matrix 137 rows 169 cols
[2021-05-09 08:02:13] [INFO ] Computed 74 place invariants in 10 ms
[2021-05-09 08:02:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-05-09 08:02:13] [INFO ] Implicit Places using invariants and state equation in 297 ms returned [55, 57, 59, 61, 63, 65, 67, 74, 76, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116]
Discarding 27 places :
Implicit Place search using SMT with State Equation took 6452 ms to find 27 implicit places.
[2021-05-09 08:02:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 137 rows 142 cols
[2021-05-09 08:02:13] [INFO ] Computed 47 place invariants in 1 ms
[2021-05-09 08:02:13] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Starting structural reductions, iteration 1 : 142/496 places, 137/435 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 142 transition count 124
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 129 transition count 124
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 126 transition count 120
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 126 transition count 120
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 126 transition count 118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 36 place count 124 transition count 118
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 52 place count 115 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 56 place count 113 transition count 109
Applied a total of 56 rules in 11 ms. Remains 113 /142 variables (removed 29) and now considering 109/137 (removed 28) transitions.
// Phase 1: matrix 109 rows 113 cols
[2021-05-09 08:02:13] [INFO ] Computed 45 place invariants in 13 ms
[2021-05-09 08:02:13] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 109 rows 113 cols
[2021-05-09 08:02:13] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-09 08:02:13] [INFO ] State equation strengthened by 27 read => feed constraints.
[2021-05-09 08:02:14] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 113/496 places, 109/435 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s50 1) (EQ s85 1) (EQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-15 finished in 6971 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2720168881142458452
[2021-05-09 08:02:14] [INFO ] Computing symmetric may disable matrix : 435 transitions.
[2021-05-09 08:02:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:02:14] [INFO ] Applying decomposition
[2021-05-09 08:02:14] [INFO ] Computing symmetric may enable matrix : 435 transitions.
[2021-05-09 08:02:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:02:14] [INFO ] Flatten gal took : 44 ms
[2021-05-09 08:02:14] [INFO ] Computing Do-Not-Accords matrix : 435 transitions.
[2021-05-09 08:02:14] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:02:14] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2720168881142458452
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/ltsmin2720168881142458452]
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/graph2791396808809541065.txt, -o, /tmp/graph2791396808809541065.bin, -w, /tmp/graph2791396808809541065.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/graph2791396808809541065.bin, -l, -1, -v, -w, /tmp/graph2791396808809541065.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:02:14] [INFO ] Decomposing Gal with order
[2021-05-09 08:02:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:02:14] [INFO ] Removed a total of 273 redundant transitions.
[2021-05-09 08:02:14] [INFO ] Flatten gal took : 60 ms
[2021-05-09 08:02:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-09 08:02:14] [INFO ] Time to serialize gal into /tmp/LTLFireability9397097027088116942.gal : 44 ms
[2021-05-09 08:02:14] [INFO ] Time to serialize properties into /tmp/LTLFireability9676082065736225989.ltl : 15 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability9397097027088116942.gal, -t, CGAL, -LTL, /tmp/LTLFireability9676082065736225989.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability9397097027088116942.gal -t CGAL -LTL /tmp/LTLFireability9676082065736225989.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((("((((i7.i0.u43.p131==1)&&(i7.i3.u116.p357==1))&&(i7.i3.u116.p523==1))||(((i7.i0.u33.p125==1)&&(i7.i1.u115.p352==1))&&(i7.i0.u147.p609==1)))")U(X((X(("((i7.i0.u35.p110==1)&&(i7.i0.u148.p524==1))")U("(((i7.i0.u33.p125==1)&&(i7.i1.u115.p352==1))&&(i7.i0.u147.p609==1))")))||(G(!("(((i7.i0.u33.p125==1)&&(i7.i1.u115.p352==1))&&(i7.i0.u147.p609==1))")))))))
Formula 0 simplified : !("((((i7.i0.u43.p131==1)&&(i7.i3.u116.p357==1))&&(i7.i3.u116.p523==1))||(((i7.i0.u33.p125==1)&&(i7.i1.u115.p352==1))&&(i7.i0.u147.p609==1)))" U X(X("((i7.i0.u35.p110==1)&&(i7.i0.u148.p524==1))" U "(((i7.i0.u33.p125==1)&&(i7.i1.u115.p352==1))&&(i7.i0.u147.p609==1))") | G!"(((i7.i0.u33.p125==1)&&(i7.i1.u115.p352==1))&&(i7.i0.u147.p609==1))"))
Compilation finished in 2754 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2720168881142458452]
Link finished in 179 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, --when, --ltl, ((LTLAPp0==true) U X((X(((LTLAPp1==true) U (LTLAPp2==true)))||[](!(LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2720168881142458452]
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t282, t292, t388, t406, t420, t546, t548, t550, t559, i0.i0.u83.t285, i0.i0.u88.t275, i0.i0.u136.t148, i0.i1.u86.t278, i0.i2.u134.t156, i0.i2.u135.t152, i1.t296, i1.u75.t303, i1.u77.t299, i2.i0.u60.t329, i2.i0.u62.t325, i2.i1.u125.t188, i2.i1.u126.t184, i3.i0.u28.t387, i3.i0.u30.t383, i3.i1.u113.t232, i3.i1.u114.t228, i4.i0.u11.t429, i4.i0.u12.t428, i4.i1.u64.t321, i4.i1.u102.t271, i4.i1.u103.t268, i4.i1.u104.t264, i5.i0.t410, i5.i0.u16.t419, i5.i0.u18.t414, i5.i0.u19.t413, i5.i1.t111, i5.i1.u142.t115, i6.t392, i6.i1.t397, i6.i1.t401, i7.t3, i7.t0, i7.i0.t1, i7.i0.t2, i7.i0.u32.t360, i7.i0.u32.t379, i7.i0.u110.t244, i7.i1.u115.t224, i7.i3.u116.t220, i8.u50.t349, i9.i0.t335, i10.u66.t317, i11.t304, i11.u70.t311, i11.u73.t307, i12.t286, i12.u79.t295, i12.u81.t291, i12.u133.t160, i13.i0.u52.t345, i13.i0.u54.t339, i13.i1.u122.t200, i13.i1.u123.t196, i13.i1.u124.t192, i14.i0.u48.t353, i14.i1.u117.t216, i14.i1.u118.t212, i14.i1.u119.t208, i14.i2.t205, i14.i2.u121.t206, i15.i0.t423, i15.i0.u13.t425, i15.i1.t257, i15.i1.u105.t260, i15.i1.u106.t258, i15.i1.u108.t252, i16.i0.u20.t409, i16.i1.u112.t236, i16.i2.u109.t248, i17.i0.u127.t180, i17.i0.u128.t176, i17.i0.u129.t172, i17.i0.u130.t168, i17.i1.t165, i17.i1.u132.t166, i18.t10, i18.u137.t142, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/307/92/435
Computing Next relation with stutter on 972 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
1130 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.411,263988,1,0,492770,823,8015,930087,337,2596,1249677
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-15-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620547362387

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="BusinessProcesses-PT-15"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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 BusinessProcesses-PT-15, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143900437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-15.tgz
mv BusinessProcesses-PT-15 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;