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-162038143900436.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900436
=====================================================================

--------------------
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 1620547119557

Running Version 0
[2021-05-09 07:58:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:58:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:58:41] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2021-05-09 07:58:41] [INFO ] Transformed 630 places.
[2021-05-09 07:58:41] [INFO ] Transformed 566 transitions.
[2021-05-09 07:58:41] [INFO ] Found NUPN structural information;
[2021-05-09 07:58:41] [INFO ] Parsed PT model containing 630 places and 566 transitions in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 07:58:41] [INFO ] Initial state test concluded for 3 properties.
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 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 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 84 place count 542 transition count 481
Iterating global reduction 1 with 81 rules applied. Total rules applied 165 place count 542 transition count 481
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 200 place count 507 transition count 446
Iterating global reduction 1 with 35 rules applied. Total rules applied 235 place count 507 transition count 446
Applied a total of 235 rules in 107 ms. Remains 507 /626 variables (removed 119) and now considering 446/562 (removed 116) transitions.
// Phase 1: matrix 446 rows 507 cols
[2021-05-09 07:58:41] [INFO ] Computed 99 place invariants in 37 ms
[2021-05-09 07:58:41] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 446 rows 507 cols
[2021-05-09 07:58:41] [INFO ] Computed 99 place invariants in 6 ms
[2021-05-09 07:58:42] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 507 cols
[2021-05-09 07:58:42] [INFO ] Computed 99 place invariants in 10 ms
[2021-05-09 07:58:42] [INFO ] Dead Transitions using invariants and state equation in 208 ms returned []
Finished structural reductions, in 1 iterations. Remains : 507/626 places, 446/562 transitions.
[2021-05-09 07:58:42] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 07:58:42] [INFO ] Flatten gal took : 59 ms
FORMULA BusinessProcesses-PT-15-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 07:58:42] [INFO ] Flatten gal took : 27 ms
[2021-05-09 07:58:42] [INFO ] Input system was already deterministic with 446 transitions.
Incomplete random walk after 100000 steps, including 671 resets, run finished after 483 ms. (steps per millisecond=207 ) properties (out of 20) seen :8
Running SMT prover for 12 properties.
// Phase 1: matrix 446 rows 507 cols
[2021-05-09 07:58:43] [INFO ] Computed 99 place invariants in 15 ms
[2021-05-09 07:58:43] [INFO ] [Real]Absence check using 58 positive place invariants in 17 ms returned sat
[2021-05-09 07:58:43] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:58:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:43] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-09 07:58:43] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 4 ms to minimize.
[2021-05-09 07:58:43] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2021-05-09 07:58:43] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:58:44] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2021-05-09 07:58:44] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:58:44] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 0 ms to minimize.
[2021-05-09 07:58:44] [INFO ] Deduced a trap composed of 101 places in 84 ms of which 1 ms to minimize.
[2021-05-09 07:58:44] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:58:44] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:58:44] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:58:44] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:58:44] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1254 ms
[2021-05-09 07:58:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:58:44] [INFO ] [Nat]Absence check using 58 positive place invariants in 15 ms returned sat
[2021-05-09 07:58:44] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 07:58:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:44] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2021-05-09 07:58:45] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:58:45] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:58:45] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2021-05-09 07:58:45] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2021-05-09 07:58:45] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2021-05-09 07:58:45] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2021-05-09 07:58:45] [INFO ] Deduced a trap composed of 101 places in 78 ms of which 1 ms to minimize.
[2021-05-09 07:58:45] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:58:45] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:58:45] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2021-05-09 07:58:46] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:58:46] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1144 ms
[2021-05-09 07:58:46] [INFO ] Computed and/alt/rep : 415/740/415 causal constraints (skipped 30 transitions) in 28 ms.
[2021-05-09 07:58:47] [INFO ] Added : 255 causal constraints over 51 iterations in 1172 ms. Result :sat
[2021-05-09 07:58:47] [INFO ] [Real]Absence check using 58 positive place invariants in 21 ms returned sat
[2021-05-09 07:58:47] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:58:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:47] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-09 07:58:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:58:47] [INFO ] [Nat]Absence check using 58 positive place invariants in 13 ms returned sat
[2021-05-09 07:58:47] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 07:58:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:47] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2021-05-09 07:58:47] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2021-05-09 07:58:47] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:58:47] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:58:48] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2021-05-09 07:58:48] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2021-05-09 07:58:48] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:58:48] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:58:48] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:58:48] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:58:48] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:58:48] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:58:48] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 5 ms to minimize.
[2021-05-09 07:58:48] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2021-05-09 07:58:48] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:58:48] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:58:48] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:58:49] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:58:49] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:58:49] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:58:49] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:58:49] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2021-05-09 07:58:49] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:58:49] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1787 ms
[2021-05-09 07:58:49] [INFO ] Computed and/alt/rep : 415/740/415 causal constraints (skipped 30 transitions) in 26 ms.
[2021-05-09 07:58:50] [INFO ] Added : 258 causal constraints over 52 iterations in 1323 ms. Result :sat
[2021-05-09 07:58:50] [INFO ] [Real]Absence check using 58 positive place invariants in 18 ms returned sat
[2021-05-09 07:58:50] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 07:58:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:51] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-09 07:58:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:58:51] [INFO ] [Nat]Absence check using 58 positive place invariants in 17 ms returned sat
[2021-05-09 07:58:51] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:58:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:51] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2021-05-09 07:58:51] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:58:51] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:58:51] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:58:51] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 1 ms to minimize.
[2021-05-09 07:58:51] [INFO ] Deduced a trap composed of 104 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:58:52] [INFO ] Deduced a trap composed of 102 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:58:52] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 3 ms to minimize.
[2021-05-09 07:58:52] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:58:52] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:58:52] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:58:52] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 0 ms to minimize.
[2021-05-09 07:58:52] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 1 ms to minimize.
[2021-05-09 07:58:52] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:58:52] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:58:53] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:58:53] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:58:53] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 1 ms to minimize.
[2021-05-09 07:58:53] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:58:53] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:58:53] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2021-05-09 07:58:53] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:58:53] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2021-05-09 07:58:53] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:58:53] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2021-05-09 07:58:54] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2021-05-09 07:58:54] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:58:54] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:58:54] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:58:54] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:58:54] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3034 ms
[2021-05-09 07:58:54] [INFO ] Computed and/alt/rep : 415/740/415 causal constraints (skipped 30 transitions) in 27 ms.
[2021-05-09 07:58:55] [INFO ] Added : 248 causal constraints over 50 iterations in 1140 ms. Result :sat
[2021-05-09 07:58:55] [INFO ] [Real]Absence check using 58 positive place invariants in 25 ms returned sat
[2021-05-09 07:58:55] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 07:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:55] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-09 07:58:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:58:55] [INFO ] [Nat]Absence check using 58 positive place invariants in 18 ms returned sat
[2021-05-09 07:58:55] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:55] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-09 07:58:56] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:58:56] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2021-05-09 07:58:56] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2021-05-09 07:58:56] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:58:56] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:58:56] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:58:56] [INFO ] Deduced a trap composed of 94 places in 78 ms of which 0 ms to minimize.
[2021-05-09 07:58:56] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:58:57] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:58:57] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 0 ms to minimize.
[2021-05-09 07:58:57] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:58:57] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:58:57] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:58:57] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2021-05-09 07:58:57] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 0 ms to minimize.
[2021-05-09 07:58:57] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:58:57] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:58:57] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:58:57] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1973 ms
[2021-05-09 07:58:57] [INFO ] Computed and/alt/rep : 415/740/415 causal constraints (skipped 30 transitions) in 25 ms.
[2021-05-09 07:58:59] [INFO ] Added : 253 causal constraints over 51 iterations in 1359 ms. Result :sat
[2021-05-09 07:58:59] [INFO ] [Real]Absence check using 58 positive place invariants in 14 ms returned sat
[2021-05-09 07:58:59] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:58:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:59] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2021-05-09 07:58:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:58:59] [INFO ] [Nat]Absence check using 58 positive place invariants in 18 ms returned sat
[2021-05-09 07:58:59] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 07:58:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:59] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2021-05-09 07:58:59] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:58:59] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:59:00] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:59:00] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:59:00] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:59:00] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:59:00] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2021-05-09 07:59:00] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 0 ms to minimize.
[2021-05-09 07:59:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 653 ms
[2021-05-09 07:59:00] [INFO ] Computed and/alt/rep : 415/740/415 causal constraints (skipped 30 transitions) in 26 ms.
[2021-05-09 07:59:01] [INFO ] Added : 244 causal constraints over 49 iterations in 1156 ms. Result :sat
[2021-05-09 07:59:01] [INFO ] [Real]Absence check using 58 positive place invariants in 13 ms returned sat
[2021-05-09 07:59:01] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 07:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:01] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-09 07:59:01] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:59:01] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2021-05-09 07:59:01] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2021-05-09 07:59:02] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:59:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 263 ms
[2021-05-09 07:59:02] [INFO ] [Real]Absence check using 58 positive place invariants in 17 ms returned sat
[2021-05-09 07:59:02] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 07:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:02] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-09 07:59:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:02] [INFO ] [Nat]Absence check using 58 positive place invariants in 22 ms returned sat
[2021-05-09 07:59:02] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 07:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:02] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-09 07:59:02] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2021-05-09 07:59:02] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:59:02] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:59:03] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 0 ms to minimize.
[2021-05-09 07:59:03] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:59:03] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:59:03] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:59:03] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:59:03] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:59:03] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:59:03] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 1 ms to minimize.
[2021-05-09 07:59:03] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 0 ms to minimize.
[2021-05-09 07:59:04] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:59:04] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 1 ms to minimize.
[2021-05-09 07:59:04] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1734 ms
[2021-05-09 07:59:04] [INFO ] Computed and/alt/rep : 415/740/415 causal constraints (skipped 30 transitions) in 24 ms.
[2021-05-09 07:59:05] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:59:05] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:59:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2021-05-09 07:59:06] [INFO ] Added : 289 causal constraints over 58 iterations in 1862 ms. Result :sat
[2021-05-09 07:59:06] [INFO ] [Real]Absence check using 58 positive place invariants in 22 ms returned sat
[2021-05-09 07:59:06] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 07:59:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:06] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2021-05-09 07:59:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:06] [INFO ] [Nat]Absence check using 58 positive place invariants in 21 ms returned sat
[2021-05-09 07:59:06] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 07:59:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:06] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2021-05-09 07:59:06] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:59:06] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:59:06] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:59:06] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 0 ms to minimize.
[2021-05-09 07:59:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 302 ms
[2021-05-09 07:59:06] [INFO ] Computed and/alt/rep : 415/740/415 causal constraints (skipped 30 transitions) in 20 ms.
[2021-05-09 07:59:08] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 0 ms to minimize.
[2021-05-09 07:59:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2021-05-09 07:59:08] [INFO ] Added : 279 causal constraints over 57 iterations in 1666 ms. Result :sat
[2021-05-09 07:59:08] [INFO ] [Real]Absence check using 58 positive place invariants in 21 ms returned sat
[2021-05-09 07:59:08] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 07:59:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:08] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2021-05-09 07:59:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:09] [INFO ] [Nat]Absence check using 58 positive place invariants in 23 ms returned sat
[2021-05-09 07:59:09] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 07:59:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:09] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2021-05-09 07:59:09] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:59:09] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:59:09] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:59:09] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:59:09] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:59:09] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:59:09] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 1 ms to minimize.
[2021-05-09 07:59:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 689 ms
[2021-05-09 07:59:09] [INFO ] Computed and/alt/rep : 415/740/415 causal constraints (skipped 30 transitions) in 31 ms.
[2021-05-09 07:59:11] [INFO ] Added : 260 causal constraints over 52 iterations in 1692 ms. Result :sat
[2021-05-09 07:59:11] [INFO ] [Real]Absence check using 58 positive place invariants in 21 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 159 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 18 ms returned sat
[2021-05-09 07:59:11] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 07:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:12] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-09 07:59:12] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 0 ms to minimize.
[2021-05-09 07:59:12] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 1 ms to minimize.
[2021-05-09 07:59:12] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2021-05-09 07:59:12] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:59:12] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:59:12] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:59:13] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:59:13] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 0 ms to minimize.
[2021-05-09 07:59:13] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:59:13] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:59:13] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:59:13] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:59:13] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 0 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 0 ms to minimize.
[2021-05-09 07:59:14] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:59:15] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2021-05-09 07:59:15] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 0 ms to minimize.
[2021-05-09 07:59:15] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:59:15] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 0 ms to minimize.
[2021-05-09 07:59:15] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:59:15] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 1 ms to minimize.
[2021-05-09 07:59:15] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:59:15] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 0 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 118 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:59:16] [INFO ] Deduced a trap composed of 110 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 113 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 0 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:59:17] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 5723 ms
[2021-05-09 07:59:17] [INFO ] Computed and/alt/rep : 415/740/415 causal constraints (skipped 30 transitions) in 46 ms.
[2021-05-09 07:59:19] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:59:19] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:59:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 363 ms
[2021-05-09 07:59:19] [INFO ] Added : 255 causal constraints over 52 iterations in 2041 ms. Result :sat
[2021-05-09 07:59:19] [INFO ] [Real]Absence check using 58 positive place invariants in 15 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 138 ms returned sat
[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 19 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 173 ms returned sat
[2021-05-09 07:59:20] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:59:20] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:59:20] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 1 ms to minimize.
[2021-05-09 07:59:20] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:59:20] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:59:21] [INFO ] Deduced a trap composed of 100 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:59:21] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 1 ms to minimize.
[2021-05-09 07:59:21] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:59:21] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:59:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1084 ms
[2021-05-09 07:59:21] [INFO ] Computed and/alt/rep : 415/740/415 causal constraints (skipped 30 transitions) in 26 ms.
[2021-05-09 07:59:23] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:59:23] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:59:23] [INFO ] Deduced a trap composed of 96 places in 77 ms of which 1 ms to minimize.
[2021-05-09 07:59:23] [INFO ] Deduced a trap composed of 108 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:59:23] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:59:23] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:59:23] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:59:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 829 ms
[2021-05-09 07:59:23] [INFO ] Added : 298 causal constraints over 60 iterations in 2504 ms. Result :sat
[2021-05-09 07:59:24] [INFO ] [Real]Absence check using 58 positive place invariants in 23 ms returned sat
[2021-05-09 07:59:24] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-09 07:59:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:24] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2021-05-09 07:59:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:24] [INFO ] [Nat]Absence check using 58 positive place invariants in 20 ms returned sat
[2021-05-09 07:59:24] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-09 07:59:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:24] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2021-05-09 07:59:24] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 0 ms to minimize.
[2021-05-09 07:59:24] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 1 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:59:25] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:59:26] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2021-05-09 07:59:26] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:59:26] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1500 ms
[2021-05-09 07:59:26] [INFO ] Computed and/alt/rep : 415/740/415 causal constraints (skipped 30 transitions) in 29 ms.
[2021-05-09 07:59:27] [INFO ] Added : 296 causal constraints over 60 iterations in 1754 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2021-05-09 07:59:27] [INFO ] Initial state test concluded for 1 properties.
FORMULA BusinessProcesses-PT-15-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G((G(p1)||(p2 U (p3||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 507 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 507/507 places, 446/446 transitions.
Graph (trivial) has 241 edges and 507 vertex of which 6 / 507 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 501 transition count 380
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 442 transition count 380
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 119 place count 442 transition count 278
Deduced a syphon composed of 102 places in 2 ms
Ensure Unique test removed 18 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 341 place count 322 transition count 278
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 354 place count 309 transition count 265
Iterating global reduction 2 with 13 rules applied. Total rules applied 367 place count 309 transition count 265
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 261 rules applied. Total rules applied 628 place count 177 transition count 136
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 2 with 2 rules applied. Total rules applied 630 place count 176 transition count 140
Applied a total of 630 rules in 114 ms. Remains 176 /507 variables (removed 331) and now considering 140/446 (removed 306) transitions.
// Phase 1: matrix 140 rows 176 cols
[2021-05-09 07:59:28] [INFO ] Computed 78 place invariants in 1 ms
[2021-05-09 07:59:28] [INFO ] Implicit Places using invariants in 132 ms returned [1, 2, 3, 4, 5, 6, 7, 10, 11, 34, 35, 36, 37, 38, 43, 44, 45, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 135 ms to find 25 implicit places.
[2021-05-09 07:59:28] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 140 rows 151 cols
[2021-05-09 07:59:28] [INFO ] Computed 53 place invariants in 0 ms
[2021-05-09 07:59:28] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Starting structural reductions, iteration 1 : 151/507 places, 140/446 transitions.
Applied a total of 0 rules in 9 ms. Remains 151 /151 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2021-05-09 07:59:28] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 140 rows 151 cols
[2021-05-09 07:59:28] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 07:59:28] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 2 iterations. Remains : 151/507 places, 140/446 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-15-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p1 p2) (AND (NOT p0) p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s116 1), p1:(OR (EQ s100 0) (EQ s106 1)), p3:(AND (NEQ s116 1) (NEQ s102 0) (NEQ s86 1)), p2:(AND (NEQ s102 0) (NEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 17617 reset in 435 ms.
Product exploration explored 100000 steps with 17674 reset in 243 ms.
Knowledge obtained : [(NOT p0), p1, (NOT p3), (NOT p2)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17638 reset in 236 ms.
Product exploration explored 100000 steps with 17702 reset in 225 ms.
[2021-05-09 07:59:30] [INFO ] Flatten gal took : 11 ms
[2021-05-09 07:59:30] [INFO ] Flatten gal took : 11 ms
[2021-05-09 07:59:30] [INFO ] Time to serialize gal into /tmp/LTL10427197775025923302.gal : 6 ms
[2021-05-09 07:59:30] [INFO ] Time to serialize properties into /tmp/LTL11933776985980843977.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/LTL10427197775025923302.gal, -t, CGAL, -LTL, /tmp/LTL11933776985980843977.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/LTL10427197775025923302.gal -t CGAL -LTL /tmp/LTL11933776985980843977.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p539==1)"))||(G((G("((p464==0)||(p491==1))"))||(("((p466!=0)&&(p422!=1))")U(("(((p539!=1)&&(p466!=0))&&(p422!=1))")||(G("((p466!=0)&&(p422!=1))"))))))))
Formula 0 simplified : !(F"(p539==1)" | G(G"((p464==0)||(p491==1))" | ("((p466!=0)&&(p422!=1))" U ("(((p539!=1)&&(p466!=0))&&(p422!=1))" | G"((p466!=0)&&(p422!=1))"))))
Reverse transition relation is NOT exact ! Due to transitions t68, t269.t271.t272.t0.t273, t265.t266.t1.t267, t262.t263.t2.t273, t259.t260.t3.t273, t216.t217.t5.t218, t46.t48.t49.t6, t43.t44.t7, t40.t41.t8, t37.t38.t9, t25.t26.t10, t153.t154.t292.t321.t430.t293.t294.t78, t157.t381.t257.t273.t78, t141.t376.t257.t273.t78, t138.t371.t257.t273.t78, t439.t63, t80.t179.t181.t184.t185.t189.t193.t197.t201.t205.t209.t213.t219.t223.t227.t231.t237.t241.t247.t251.t255.t274.t278.t282.t291.t295.t300.t304.t283.t290.t232.t81.t84.t87.t90.t93.t96.t99.t102.t105.t108.t112.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t149.t152.t155.t158.t161.t164.t167.t170.t173.t174.t171.t168.t165.t162.t159.t156.t150.t143.t140.t137.t134.t131.t128.t125.t122.t119.t116.t113.t106.t103.t100.t97.t94.t91.t88.t85.t82.t285.t286.t284, t80.t179.t181.t184.t185.t189.t193.t197.t201.t205.t209.t213.t219.t223.t227.t231.t237.t241.t247.t251.t255.t274.t278.t282.t291.t295.t300.t304.t283.t290.t232.t81.t84.t87.t90.t93.t96.t99.t102.t105.t108.t112.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t149.t152.t155.t158.t161.t164.t167.t170.t173.t174.t171.t168.t165.t162.t159.t156.t150.t143.t140.t137.t134.t131.t128.t125.t122.t119.t116.t113.t106.t103.t100.t97.t94.t91.t88.t85.t82.t285.t286.t287.t288, t426.t78.t285.t286.t284, t426.t78.t285.t286.t287.t288, t427.t78.t285.t286.t284, t427.t78.t285.t286.t287.t288, t428.t78.t285.t286.t284, t428.t78.t285.t286.t287.t288, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/80/24/140
Computing Next relation with stutter on 972 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
106 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.09569,63496,1,0,280,166379,301,224,6052,165885,490
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-15-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-15-00 finished in 3463 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 507 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 507/507 places, 446/446 transitions.
Graph (trivial) has 245 edges and 507 vertex of which 6 / 507 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 501 transition count 380
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 442 transition count 380
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 119 place count 442 transition count 274
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 351 place count 316 transition count 274
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 366 place count 301 transition count 259
Iterating global reduction 2 with 15 rules applied. Total rules applied 381 place count 301 transition count 259
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 637 place count 171 transition count 133
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 2 with 2 rules applied. Total rules applied 639 place count 170 transition count 137
Applied a total of 639 rules in 95 ms. Remains 170 /507 variables (removed 337) and now considering 137/446 (removed 309) transitions.
// Phase 1: matrix 137 rows 170 cols
[2021-05-09 07:59:31] [INFO ] Computed 75 place invariants in 1 ms
[2021-05-09 07:59:31] [INFO ] Implicit Places using invariants in 98 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 100 ms to find 22 implicit places.
[2021-05-09 07:59:31] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 137 rows 148 cols
[2021-05-09 07:59:31] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 07:59:31] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Starting structural reductions, iteration 1 : 148/507 places, 137/446 transitions.
Applied a total of 0 rules in 7 ms. Remains 148 /148 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2021-05-09 07:59:31] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 137 rows 148 cols
[2021-05-09 07:59:31] [INFO ] Computed 53 place invariants in 2 ms
[2021-05-09 07:59:31] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 2 iterations. Remains : 148/507 places, 137/446 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s69 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 3 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-01 finished in 419 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 507 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 507/507 places, 446/446 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 491 transition count 430
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 491 transition count 430
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 484 transition count 423
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 484 transition count 423
Applied a total of 46 rules in 42 ms. Remains 484 /507 variables (removed 23) and now considering 423/446 (removed 23) transitions.
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 07:59:31] [INFO ] Computed 99 place invariants in 5 ms
[2021-05-09 07:59:32] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 07:59:32] [INFO ] Computed 99 place invariants in 5 ms
[2021-05-09 07:59:32] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 07:59:32] [INFO ] Computed 99 place invariants in 5 ms
[2021-05-09 07:59:32] [INFO ] Dead Transitions using invariants and state equation in 244 ms returned []
Finished structural reductions, in 1 iterations. Remains : 484/507 places, 423/446 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-15-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(NEQ s380 1), p0:(AND (NEQ s398 0) (NEQ s413 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 372 ms.
Product exploration explored 100000 steps with 33333 reset in 268 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.2 ms
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 305 ms.
Product exploration explored 100000 steps with 33333 reset in 356 ms.
Applying partial POR strategy [false, true, false, false, true]
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 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 221 edges and 484 vertex of which 6 / 484 are part of one of the 1 SCC in 0 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 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 98 Pre rules applied. Total rules applied 51 place count 479 transition count 630
Deduced a syphon composed of 148 places in 1 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 149 place count 479 transition count 630
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 166 place count 462 transition count 569
Deduced a syphon composed of 131 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 183 place count 462 transition count 569
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 265 places in 1 ms
Iterating global reduction 1 with 134 rules applied. Total rules applied 317 place count 462 transition count 569
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 351 place count 428 transition count 535
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 385 place count 428 transition count 535
Deduced a syphon composed of 231 places in 0 ms
Applied a total of 385 rules in 106 ms. Remains 428 /484 variables (removed 56) and now considering 535/423 (removed -112) transitions.
[2021-05-09 07:59:35] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 535 rows 428 cols
[2021-05-09 07:59:35] [INFO ] Computed 99 place invariants in 6 ms
[2021-05-09 07:59:35] [INFO ] Dead Transitions using invariants and state equation in 320 ms returned []
Finished structural reductions, in 1 iterations. Remains : 428/484 places, 535/423 transitions.
Product exploration explored 100000 steps with 33333 reset in 1107 ms.
Product exploration explored 100000 steps with 33333 reset in 1145 ms.
[2021-05-09 07:59:37] [INFO ] Flatten gal took : 42 ms
[2021-05-09 07:59:37] [INFO ] Flatten gal took : 31 ms
[2021-05-09 07:59:37] [INFO ] Time to serialize gal into /tmp/LTL16167611183723409498.gal : 6 ms
[2021-05-09 07:59:37] [INFO ] Time to serialize properties into /tmp/LTL16878029363251920598.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/LTL16167611183723409498.gal, -t, CGAL, -LTL, /tmp/LTL16878029363251920598.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/LTL16167611183723409498.gal -t CGAL -LTL /tmp/LTL16878029363251920598.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((p477!=0)&&(p514!=1))"))||(X(X(F("(p442!=1)"))))))
Formula 0 simplified : !(G"((p477!=0)&&(p514!=1))" | XXF"(p442!=1)")
Detected timeout of ITS tools.
[2021-05-09 07:59:52] [INFO ] Flatten gal took : 45 ms
[2021-05-09 07:59:52] [INFO ] Applying decomposition
[2021-05-09 07:59:52] [INFO ] Flatten gal took : 34 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/graph13714562650287360734.txt, -o, /tmp/graph13714562650287360734.bin, -w, /tmp/graph13714562650287360734.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/graph13714562650287360734.bin, -l, -1, -v, -w, /tmp/graph13714562650287360734.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:59:53] [INFO ] Decomposing Gal with order
[2021-05-09 07:59:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:59:53] [INFO ] Removed a total of 269 redundant transitions.
[2021-05-09 07:59:53] [INFO ] Flatten gal took : 75 ms
[2021-05-09 07:59:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 22 ms.
[2021-05-09 07:59:53] [INFO ] Time to serialize gal into /tmp/LTL2475305890937584257.gal : 9 ms
[2021-05-09 07:59:53] [INFO ] Time to serialize properties into /tmp/LTL14809717663185231637.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/LTL2475305890937584257.gal, -t, CGAL, -LTL, /tmp/LTL14809717663185231637.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/LTL2475305890937584257.gal -t CGAL -LTL /tmp/LTL14809717663185231637.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("((i3.u135.p477!=0)&&(i15.i2.u168.p514!=1))"))||(X(X(F("(i9.i1.u130.p442!=1)"))))))
Formula 0 simplified : !(G"((i3.u135.p477!=0)&&(i15.i2.u168.p514!=1))" | XXF"(i9.i1.u130.p442!=1)")
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t185, t193, t282, t295, t304, t427, t428, t430, t431, t439, i0.t205, i0.u68.t212, i0.u70.t208, i1.u60.t226, i1.u62.t222, i2.u48.t250, i2.u50.t246, i3.t291, i3.u14.t307, i3.u20.t294, i4.u12.t310, i4.u13.t309, i5.i0.u16.t303, i5.i0.u102.t171, i5.i1.u100.t176, i5.i1.u101.t174, i5.i1.u103.t168, i5.i1.u104.t165, i5.i1.u105.t162, i6.i0.u52.t240, i6.i0.u58.t230, i6.i1.t236, i7.u64.t218, i8.t197, i8.u73.t204, i8.u75.t200, i9.i0.t189, i9.i0.u79.t192, i9.i1.u129.t88, i9.i1.u130.t85, i9.i2.u77.t196, i9.i2.u127.t94, i9.i2.u128.t91, i10.u121.t113, i10.u122.t109, i10.u123.t106, i10.u124.t103, i11.u117.t125, i11.u118.t122, i11.u119.t119, i11.u120.t116, i12.u46.t254, i12.u114.t134, i12.u115.t131, i12.u116.t128, i13.i0.u26.t281, i13.i0.u28.t277, i13.i1.u110.t146, i13.i1.u111.t143, i14.u106.t159, i14.u109.t150, i15.t3, i15.t0, i15.i0.u112.t140, i15.i1.t1, i15.i1.t2, i15.i1.u30.t257, i15.i1.u30.t273, i15.i1.u107.t156, i15.i2.u113.t137, i16.i0.u18.t298, i16.i0.u19.t297, i16.i1.u125.t100, i16.i1.u126.t97, i17.i0.u83.t183, i17.i1.u81.t188, i17.i1.u85.t180, i17.i2.u131.t82, i18.i0.t290, i18.i1.t10, i18.i1.u133.t78, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/301/85/422
Computing Next relation with stutter on 972 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
489 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,4.96236,206060,1,0,368952,1258,6440,648246,293,3107,1114025
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-15-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-15-02 finished in 27186 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 4 out of 507 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 507/507 places, 446/446 transitions.
Graph (trivial) has 241 edges and 507 vertex of which 6 / 507 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.
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 59 place count 501 transition count 381
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 443 transition count 381
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 117 place count 443 transition count 277
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 227 rules applied. Total rules applied 344 place count 320 transition count 277
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 356 place count 308 transition count 265
Iterating global reduction 2 with 12 rules applied. Total rules applied 368 place count 308 transition count 265
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 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 628 place count 176 transition count 137
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 630 place count 175 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 631 place count 174 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 632 place count 173 transition count 140
Applied a total of 632 rules in 87 ms. Remains 173 /507 variables (removed 334) and now considering 140/446 (removed 306) transitions.
// Phase 1: matrix 140 rows 173 cols
[2021-05-09 07:59:59] [INFO ] Computed 75 place invariants in 2 ms
[2021-05-09 07:59:59] [INFO ] Implicit Places using invariants in 111 ms returned [9, 10, 33, 34, 35, 36, 37, 42, 43, 44, 48, 49, 50, 51, 52, 53, 54]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 112 ms to find 17 implicit places.
[2021-05-09 07:59:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 140 rows 156 cols
[2021-05-09 07:59:59] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-09 07:59:59] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Starting structural reductions, iteration 1 : 156/507 places, 140/446 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2021-05-09 07:59:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 140 rows 156 cols
[2021-05-09 07:59:59] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-09 07:59:59] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 2 iterations. Remains : 156/507 places, 140/446 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-15-05 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:(OR (EQ s103 0) (EQ s118 1) (AND (NEQ s129 0) (NEQ s6 1))), p1:(AND (NEQ s103 0) (NEQ s118 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 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 457 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(G(p1))||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 507 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 507/507 places, 446/446 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 491 transition count 430
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 491 transition count 430
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 484 transition count 423
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 484 transition count 423
Applied a total of 46 rules in 30 ms. Remains 484 /507 variables (removed 23) and now considering 423/446 (removed 23) transitions.
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 07:59:59] [INFO ] Computed 99 place invariants in 3 ms
[2021-05-09 07:59:59] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 07:59:59] [INFO ] Computed 99 place invariants in 19 ms
[2021-05-09 08:00:00] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
// Phase 1: matrix 423 rows 484 cols
[2021-05-09 08:00:00] [INFO ] Computed 99 place invariants in 3 ms
[2021-05-09 08:00:00] [INFO ] Dead Transitions using invariants and state equation in 230 ms returned []
Finished structural reductions, in 1 iterations. Remains : 484/507 places, 423/446 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-15-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=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:(OR (EQ s452 0) (EQ s399 1)), p1:(OR (EQ s100 0) (EQ s387 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]]
Product exploration explored 100000 steps with 677 reset in 192 ms.
Product exploration explored 100000 steps with 673 reset in 301 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.2 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 677 reset in 228 ms.
Product exploration explored 100000 steps with 668 reset in 233 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 4 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 220 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 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 98 Pre rules applied. Total rules applied 51 place count 479 transition count 634
Deduced a syphon composed of 148 places in 1 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 149 place count 479 transition count 634
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 166 place count 462 transition count 573
Deduced a syphon composed of 131 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 183 place count 462 transition count 573
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 265 places in 1 ms
Iterating global reduction 1 with 134 rules applied. Total rules applied 317 place count 462 transition count 573
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 351 place count 428 transition count 539
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 385 place count 428 transition count 539
Deduced a syphon composed of 231 places in 0 ms
Applied a total of 385 rules in 82 ms. Remains 428 /484 variables (removed 56) and now considering 539/423 (removed -116) transitions.
[2021-05-09 08:00:02] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 539 rows 428 cols
[2021-05-09 08:00:02] [INFO ] Computed 99 place invariants in 6 ms
[2021-05-09 08:00:02] [INFO ] Dead Transitions using invariants and state equation in 287 ms returned []
Finished structural reductions, in 1 iterations. Remains : 428/484 places, 539/423 transitions.
Product exploration explored 100000 steps with 677 reset in 194 ms.
Product exploration explored 100000 steps with 677 reset in 212 ms.
[2021-05-09 08:00:02] [INFO ] Flatten gal took : 17 ms
[2021-05-09 08:00:02] [INFO ] Flatten gal took : 14 ms
[2021-05-09 08:00:02] [INFO ] Time to serialize gal into /tmp/LTL4947358372193377591.gal : 2 ms
[2021-05-09 08:00:02] [INFO ] Time to serialize properties into /tmp/LTL8113064506964746522.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/LTL4947358372193377591.gal, -t, CGAL, -LTL, /tmp/LTL8113064506964746522.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/LTL4947358372193377591.gal -t CGAL -LTL /tmp/LTL8113064506964746522.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("((p598==0)||(p480==1))")||(X(G("((p122==0)||(p453==1))"))))))
Formula 0 simplified : !G("((p598==0)||(p480==1))" | XG"((p122==0)||(p453==1))")
Detected timeout of ITS tools.
[2021-05-09 08:00:17] [INFO ] Flatten gal took : 33 ms
[2021-05-09 08:00:17] [INFO ] Applying decomposition
[2021-05-09 08:00:17] [INFO ] Flatten gal took : 32 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/graph8946652794515204020.txt, -o, /tmp/graph8946652794515204020.bin, -w, /tmp/graph8946652794515204020.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/graph8946652794515204020.bin, -l, -1, -v, -w, /tmp/graph8946652794515204020.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:00:17] [INFO ] Decomposing Gal with order
[2021-05-09 08:00:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:00:18] [INFO ] Removed a total of 266 redundant transitions.
[2021-05-09 08:00:18] [INFO ] Flatten gal took : 40 ms
[2021-05-09 08:00:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 10 ms.
[2021-05-09 08:00:18] [INFO ] Time to serialize gal into /tmp/LTL13470281987166993000.gal : 6 ms
[2021-05-09 08:00:18] [INFO ] Time to serialize properties into /tmp/LTL16578896697726607806.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/LTL13470281987166993000.gal, -t, CGAL, -LTL, /tmp/LTL16578896697726607806.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/LTL13470281987166993000.gal -t CGAL -LTL /tmp/LTL16578896697726607806.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(("((i17.i0.u159.p598==0)||(i7.i1.u134.p480==1))")||(X(G("((i17.i0.u32.p122==0)||(i8.i1.u130.p453==1))"))))))
Formula 0 simplified : !G("((i17.i0.u159.p598==0)||(i7.i1.u134.p480==1))" | XG"((i17.i0.u32.p122==0)||(i8.i1.u130.p453==1))")
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t185, t193, t282, t295, t427, t428, t430, t431, t439, i0.i0.t189, i0.i0.u77.t196, i0.i0.u79.t192, i0.i1.u126.t91, i0.i1.u127.t88, i0.i1.u128.t85, i1.t197, i1.u73.t204, i1.u75.t200, i2.t205, i2.i0.u69.t212, i2.i1.u71.t208, i2.i1.u124.t97, i2.i1.u125.t94, i3.i0.u63.t222, i3.i1.u65.t218, i3.i2.u98.t176, i3.i2.u99.t174, i3.i2.u100.t171, i4.u28.t277, i4.u47.t254, i4.u49.t250, i5.u26.t281, i6.u19.t298, i6.u20.t297, i7.i0.t304, i7.i0.u13.t309, i7.i0.u14.t310, i7.i0.u15.t307, i7.i1.u17.t303, i8.i0.t290, i8.i1.t10, i8.i1.u130.t78, i9.i0.u51.t246, i9.i1.u113.t131, i9.i1.u114.t128, i9.i1.u115.t125, i9.i1.u116.t122, i10.i0.t236, i10.i0.u53.t240, i10.i0.u117.t119, i11.i0.u83.t183, i11.i1.u81.t188, i11.i1.u85.t180, i11.i2.u129.t82, i12.u121.t106, i12.u122.t103, i12.u123.t100, i13.i0.u59.t230, i13.i0.u61.t226, i13.i1.u118.t116, i13.i1.u119.t113, i13.i1.u120.t109, i14.i0.u112.t134, i14.i1.u108.t146, i14.i1.u109.t143, i15.i0.t291, i15.i0.u21.t294, i15.i1.u107.t150, i16.u101.t168, i16.u102.t165, i16.u103.t162, i16.u104.t159, i17.t3, i17.t0, i17.i0.t1, i17.i0.t2, i17.i0.t257, i17.i0.u30.t273, i17.i0.u105.t156, i17.i1.u110.t140, i17.i2.u111.t137, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/298/85/419
Computing Next relation with stutter on 972 deadlock states
99 unique states visited
0 strongly connected components in search stack
101 transitions explored
99 items max in DFS search stack
522 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,5.27858,204228,1,0,383319,1020,7488,769981,312,3645,808233
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-15-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-15-06 finished in 24739 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 507 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 507/507 places, 446/446 transitions.
Graph (trivial) has 241 edges and 507 vertex of which 6 / 507 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.
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 501 transition count 382
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 444 transition count 382
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 444 transition count 278
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 227 rules applied. Total rules applied 342 place count 321 transition count 278
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 355 place count 308 transition count 265
Iterating global reduction 2 with 13 rules applied. Total rules applied 368 place count 308 transition count 265
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 628 place count 176 transition count 137
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 630 place count 175 transition count 141
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 636 place count 175 transition count 141
Applied a total of 636 rules in 56 ms. Remains 175 /507 variables (removed 332) and now considering 141/446 (removed 305) transitions.
// Phase 1: matrix 141 rows 175 cols
[2021-05-09 08:00:24] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-09 08:00:24] [INFO ] Implicit Places using invariants in 138 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 43, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 139 ms to find 23 implicit places.
[2021-05-09 08:00:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 141 rows 152 cols
[2021-05-09 08:00:24] [INFO ] Computed 53 place invariants in 3 ms
[2021-05-09 08:00:24] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Starting structural reductions, iteration 1 : 152/507 places, 141/446 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2021-05-09 08:00:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 141 rows 152 cols
[2021-05-09 08:00:24] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 08:00:24] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 2 iterations. Remains : 152/507 places, 141/446 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s79 0) (EQ s120 1)) (OR (EQ s79 0) (EQ s120 1) (EQ s5 0) (EQ s105 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 3 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-07 finished in 407 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 507 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 507/507 places, 446/446 transitions.
Graph (trivial) has 245 edges and 507 vertex of which 6 / 507 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 501 transition count 380
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 442 transition count 380
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 119 place count 442 transition count 275
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 2 with 230 rules applied. Total rules applied 349 place count 317 transition count 275
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 363 place count 303 transition count 261
Iterating global reduction 2 with 14 rules applied. Total rules applied 377 place count 303 transition count 261
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 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 637 place count 171 transition count 133
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 639 place count 170 transition count 137
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 645 place count 170 transition count 137
Applied a total of 645 rules in 42 ms. Remains 170 /507 variables (removed 337) and now considering 137/446 (removed 309) transitions.
// Phase 1: matrix 137 rows 170 cols
[2021-05-09 08:00:24] [INFO ] Computed 75 place invariants in 1 ms
[2021-05-09 08:00:24] [INFO ] Implicit Places using invariants in 115 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 117 ms to find 22 implicit places.
[2021-05-09 08:00:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 137 rows 148 cols
[2021-05-09 08:00:24] [INFO ] Computed 53 place invariants in 2 ms
[2021-05-09 08:00:24] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Starting structural reductions, iteration 1 : 148/507 places, 137/446 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2021-05-09 08:00:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 137 rows 148 cols
[2021-05-09 08:00:24] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 08:00:24] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 2 iterations. Remains : 148/507 places, 137/446 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s52 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 21587 reset in 163 ms.
Product exploration explored 100000 steps with 21700 reset in 180 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21676 reset in 223 ms.
Product exploration explored 100000 steps with 21698 reset in 236 ms.
[2021-05-09 08:00:25] [INFO ] Flatten gal took : 17 ms
[2021-05-09 08:00:25] [INFO ] Flatten gal took : 14 ms
[2021-05-09 08:00:25] [INFO ] Time to serialize gal into /tmp/LTL17902096037060865763.gal : 2 ms
[2021-05-09 08:00:25] [INFO ] Time to serialize properties into /tmp/LTL7642394833798741329.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/LTL17902096037060865763.gal, -t, CGAL, -LTL, /tmp/LTL7642394833798741329.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/LTL17902096037060865763.gal -t CGAL -LTL /tmp/LTL7642394833798741329.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((p103==0)||(p340==1))"))))
Formula 0 simplified : !FG"((p103==0)||(p340==1))"
Reverse transition relation is NOT exact ! Due to transitions t148, t439, t269.t271.t272.t0.t273, t265.t266.t1.t267, t262.t263.t2.t273, t259.t260.t3.t273, t216.t217.t5.t218, t46.t48.t49.t6, t43.t44.t7, t40.t41.t8, t37.t38.t9, t25.t26.t10, t54.t153.t154.t292.t321.t430.t293.t294.t78, t157.t381.t257.t273.t78, t141.t376.t257.t273.t78, t138.t371.t257.t273.t78, t442.t182.t329.t183.t78, t80.t179.t181.t184.t185.t189.t193.t197.t201.t205.t209.t213.t219.t223.t227.t231.t237.t241.t247.t251.t255.t274.t278.t282.t291.t295.t300.t304.t283.t290.t232.t81.t84.t87.t90.t93.t96.t99.t102.t105.t108.t112.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t149.t152.t155.t158.t161.t164.t167.t170.t173.t174.t171.t168.t165.t162.t159.t156.t150.t146.t147.t143.t140.t137.t134.t131.t128.t125.t122.t119.t116.t113.t106.t103.t100.t97.t94.t91.t88.t85.t82.t285.t286.t284, t80.t179.t181.t184.t185.t189.t193.t197.t201.t205.t209.t213.t219.t223.t227.t231.t237.t241.t247.t251.t255.t274.t278.t282.t291.t295.t300.t304.t283.t290.t232.t81.t84.t87.t90.t93.t96.t99.t102.t105.t108.t112.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t149.t152.t155.t158.t161.t164.t167.t170.t173.t174.t171.t168.t165.t162.t159.t156.t150.t146.t147.t143.t140.t137.t134.t131.t128.t125.t122.t119.t116.t113.t106.t103.t100.t97.t94.t91.t88.t85.t82.t285.t286.t287.t288, t426.t78.t285.t286.t284, t426.t78.t285.t286.t287.t288, t428.t78.t285.t286.t284, t428.t78.t285.t286.t287.t288, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/78/23/137
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
120 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.2328,58196,1,0,323,161546,267,285,5954,188298,597
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-15-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-15-10 finished in 2615 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(F(p0)))&&F((X((p2 U p3))||p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 507 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 507/507 places, 446/446 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 493 transition count 432
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 493 transition count 432
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 487 transition count 426
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 487 transition count 426
Applied a total of 40 rules in 37 ms. Remains 487 /507 variables (removed 20) and now considering 426/446 (removed 20) transitions.
// Phase 1: matrix 426 rows 487 cols
[2021-05-09 08:00:27] [INFO ] Computed 99 place invariants in 3 ms
[2021-05-09 08:00:27] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 426 rows 487 cols
[2021-05-09 08:00:27] [INFO ] Computed 99 place invariants in 4 ms
[2021-05-09 08:00:27] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
// Phase 1: matrix 426 rows 487 cols
[2021-05-09 08:00:27] [INFO ] Computed 99 place invariants in 2 ms
[2021-05-09 08:00:28] [INFO ] Dead Transitions using invariants and state equation in 193 ms returned []
Finished structural reductions, in 1 iterations. Remains : 487/507 places, 426/446 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s425 0) (EQ s88 1)), p3:(AND (OR (EQ s133 0) (EQ s454 1)) (OR (EQ s425 0) (EQ s88 1))), p0:(EQ s295 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 980 reset in 236 ms.
Stack based approach found an accepted trace after 346 steps with 3 reset with depth 17 and stack size 17 in 1 ms.
FORMULA BusinessProcesses-PT-15-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-12 finished in 1282 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 507 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 507/507 places, 446/446 transitions.
Graph (trivial) has 246 edges and 507 vertex of which 6 / 507 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 501 transition count 380
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 442 transition count 380
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 119 place count 442 transition count 274
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 351 place count 316 transition count 274
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 366 place count 301 transition count 259
Iterating global reduction 2 with 15 rules applied. Total rules applied 381 place count 301 transition count 259
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 637 place count 171 transition count 133
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 639 place count 170 transition count 137
Applied a total of 639 rules in 20 ms. Remains 170 /507 variables (removed 337) and now considering 137/446 (removed 309) transitions.
// Phase 1: matrix 137 rows 170 cols
[2021-05-09 08:00:28] [INFO ] Computed 75 place invariants in 2 ms
[2021-05-09 08:00:28] [INFO ] Implicit Places using invariants in 116 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 118 ms to find 22 implicit places.
[2021-05-09 08:00:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 137 rows 148 cols
[2021-05-09 08:00:28] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 08:00:28] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Starting structural reductions, iteration 1 : 148/507 places, 137/446 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2021-05-09 08:00:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 137 rows 148 cols
[2021-05-09 08:00:28] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 08:00:28] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 2 iterations. Remains : 148/507 places, 137/446 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s34 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 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 315 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620547228972

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143900436"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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