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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K 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 24K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 177K 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-18-00
FORMULA_NAME BusinessProcesses-PT-18-01
FORMULA_NAME BusinessProcesses-PT-18-02
FORMULA_NAME BusinessProcesses-PT-18-03
FORMULA_NAME BusinessProcesses-PT-18-04
FORMULA_NAME BusinessProcesses-PT-18-05
FORMULA_NAME BusinessProcesses-PT-18-06
FORMULA_NAME BusinessProcesses-PT-18-07
FORMULA_NAME BusinessProcesses-PT-18-08
FORMULA_NAME BusinessProcesses-PT-18-09
FORMULA_NAME BusinessProcesses-PT-18-10
FORMULA_NAME BusinessProcesses-PT-18-11
FORMULA_NAME BusinessProcesses-PT-18-12
FORMULA_NAME BusinessProcesses-PT-18-13
FORMULA_NAME BusinessProcesses-PT-18-14
FORMULA_NAME BusinessProcesses-PT-18-15

=== Now, execution of the tool begins

BK_START 1620548432660

Running Version 0
[2021-05-09 08:20:35] [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 08:20:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:20:35] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2021-05-09 08:20:35] [INFO ] Transformed 717 places.
[2021-05-09 08:20:35] [INFO ] Transformed 642 transitions.
[2021-05-09 08:20:35] [INFO ] Found NUPN structural information;
[2021-05-09 08:20:35] [INFO ] Parsed PT model containing 717 places and 642 transitions in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 702 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 104 place count 598 transition count 531
Iterating global reduction 1 with 96 rules applied. Total rules applied 200 place count 598 transition count 531
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 247 place count 551 transition count 484
Iterating global reduction 1 with 47 rules applied. Total rules applied 294 place count 551 transition count 484
Applied a total of 294 rules in 159 ms. Remains 551 /702 variables (removed 151) and now considering 484/627 (removed 143) transitions.
// Phase 1: matrix 484 rows 551 cols
[2021-05-09 08:20:36] [INFO ] Computed 106 place invariants in 34 ms
[2021-05-09 08:20:36] [INFO ] Implicit Places using invariants in 517 ms returned []
// Phase 1: matrix 484 rows 551 cols
[2021-05-09 08:20:36] [INFO ] Computed 106 place invariants in 16 ms
[2021-05-09 08:20:37] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
// Phase 1: matrix 484 rows 551 cols
[2021-05-09 08:20:37] [INFO ] Computed 106 place invariants in 56 ms
[2021-05-09 08:20:38] [INFO ] Dead Transitions using invariants and state equation in 1112 ms returned []
Finished structural reductions, in 1 iterations. Remains : 551/702 places, 484/627 transitions.
[2021-05-09 08:20:38] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 08:20:38] [INFO ] Flatten gal took : 72 ms
FORMULA BusinessProcesses-PT-18-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 08:20:38] [INFO ] Flatten gal took : 37 ms
[2021-05-09 08:20:38] [INFO ] Input system was already deterministic with 484 transitions.
Incomplete random walk after 100000 steps, including 532 resets, run finished after 459 ms. (steps per millisecond=217 ) properties (out of 20) seen :8
Running SMT prover for 12 properties.
// Phase 1: matrix 484 rows 551 cols
[2021-05-09 08:20:39] [INFO ] Computed 106 place invariants in 7 ms
[2021-05-09 08:20:39] [INFO ] [Real]Absence check using 65 positive place invariants in 37 ms returned sat
[2021-05-09 08:20:39] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:39] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2021-05-09 08:20:40] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 4 ms to minimize.
[2021-05-09 08:20:40] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 2 ms to minimize.
[2021-05-09 08:20:40] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:20:40] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 0 ms to minimize.
[2021-05-09 08:20:40] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2021-05-09 08:20:40] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2021-05-09 08:20:40] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2021-05-09 08:20:41] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2021-05-09 08:20:41] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2021-05-09 08:20:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1349 ms
[2021-05-09 08:20:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 23 ms returned sat
[2021-05-09 08:20:41] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 08:20:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:41] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2021-05-09 08:20:41] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 1 ms to minimize.
[2021-05-09 08:20:41] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2021-05-09 08:20:42] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 10 ms to minimize.
[2021-05-09 08:20:42] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2021-05-09 08:20:42] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:20:43] [INFO ] Deduced a trap composed of 26 places in 1187 ms of which 1 ms to minimize.
[2021-05-09 08:20:43] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2021-05-09 08:20:43] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2021-05-09 08:20:43] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2021-05-09 08:20:43] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2111 ms
[2021-05-09 08:20:43] [INFO ] Computed and/alt/rep : 478/977/478 causal constraints (skipped 5 transitions) in 33 ms.
[2021-05-09 08:20:46] [INFO ] Added : 323 causal constraints over 65 iterations in 2969 ms. Result :sat
[2021-05-09 08:20:46] [INFO ] [Real]Absence check using 65 positive place invariants in 21 ms returned sat
[2021-05-09 08:20:46] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 08:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:46] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2021-05-09 08:20:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:47] [INFO ] [Nat]Absence check using 65 positive place invariants in 48 ms returned sat
[2021-05-09 08:20:47] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:20:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:47] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2021-05-09 08:20:47] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2021-05-09 08:20:47] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 0 ms to minimize.
[2021-05-09 08:20:56] [INFO ] Deduced a trap composed of 95 places in 9049 ms of which 0 ms to minimize.
[2021-05-09 08:20:57] [INFO ] Deduced a trap composed of 92 places in 216 ms of which 13 ms to minimize.
[2021-05-09 08:20:57] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2021-05-09 08:20:57] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2021-05-09 08:20:57] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2021-05-09 08:20:57] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2021-05-09 08:20:57] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2021-05-09 08:20:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 10128 ms
[2021-05-09 08:20:57] [INFO ] Computed and/alt/rep : 478/977/478 causal constraints (skipped 5 transitions) in 27 ms.
[2021-05-09 08:20:59] [INFO ] Added : 308 causal constraints over 62 iterations in 1787 ms. Result :sat
[2021-05-09 08:20:59] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2021-05-09 08:20:59] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 08:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:59] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2021-05-09 08:20:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:59] [INFO ] [Nat]Absence check using 65 positive place invariants in 26 ms returned sat
[2021-05-09 08:20:59] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 16 ms returned sat
[2021-05-09 08:20:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:00] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2021-05-09 08:21:00] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 0 ms to minimize.
[2021-05-09 08:21:00] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:21:00] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 1 ms to minimize.
[2021-05-09 08:21:00] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2021-05-09 08:21:00] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2021-05-09 08:21:00] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 0 ms to minimize.
[2021-05-09 08:21:00] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2021-05-09 08:21:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 845 ms
[2021-05-09 08:21:00] [INFO ] Computed and/alt/rep : 478/977/478 causal constraints (skipped 5 transitions) in 34 ms.
[2021-05-09 08:21:03] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 6 ms to minimize.
[2021-05-09 08:21:03] [INFO ] Deduced a trap composed of 105 places in 226 ms of which 0 ms to minimize.
[2021-05-09 08:21:03] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 0 ms to minimize.
[2021-05-09 08:21:03] [INFO ] Deduced a trap composed of 108 places in 212 ms of which 1 ms to minimize.
[2021-05-09 08:21:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1091 ms
[2021-05-09 08:21:04] [INFO ] Added : 329 causal constraints over 66 iterations in 3292 ms. Result :sat
[2021-05-09 08:21:04] [INFO ] [Real]Absence check using 65 positive place invariants in 44 ms returned sat
[2021-05-09 08:21:04] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:04] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2021-05-09 08:21:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:04] [INFO ] [Nat]Absence check using 65 positive place invariants in 54 ms returned sat
[2021-05-09 08:21:04] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:21:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:05] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2021-05-09 08:21:05] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2021-05-09 08:21:05] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 0 ms to minimize.
[2021-05-09 08:21:05] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 1 ms to minimize.
[2021-05-09 08:21:06] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 1 ms to minimize.
[2021-05-09 08:21:06] [INFO ] Deduced a trap composed of 96 places in 185 ms of which 0 ms to minimize.
[2021-05-09 08:21:06] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:21:06] [INFO ] Deduced a trap composed of 96 places in 221 ms of which 1 ms to minimize.
[2021-05-09 08:21:06] [INFO ] Deduced a trap composed of 92 places in 184 ms of which 0 ms to minimize.
[2021-05-09 08:21:07] [INFO ] Deduced a trap composed of 100 places in 192 ms of which 1 ms to minimize.
[2021-05-09 08:21:07] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:21:07] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:21:07] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:21:07] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 13 ms to minimize.
[2021-05-09 08:21:08] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:21:08] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 0 ms to minimize.
[2021-05-09 08:21:08] [INFO ] Deduced a trap composed of 102 places in 189 ms of which 1 ms to minimize.
[2021-05-09 08:21:08] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:21:08] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 0 ms to minimize.
[2021-05-09 08:21:08] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 9 ms to minimize.
[2021-05-09 08:21:09] [INFO ] Deduced a trap composed of 105 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:21:09] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 0 ms to minimize.
[2021-05-09 08:21:09] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:21:09] [INFO ] Deduced a trap composed of 102 places in 153 ms of which 0 ms to minimize.
[2021-05-09 08:21:09] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 2 ms to minimize.
[2021-05-09 08:21:09] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:21:09] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:21:10] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 0 ms to minimize.
[2021-05-09 08:21:10] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 3 ms to minimize.
[2021-05-09 08:21:10] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 1 ms to minimize.
[2021-05-09 08:21:10] [INFO ] Deduced a trap composed of 102 places in 146 ms of which 3 ms to minimize.
[2021-05-09 08:21:10] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 13 ms to minimize.
[2021-05-09 08:21:11] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 13 ms to minimize.
[2021-05-09 08:21:11] [INFO ] Deduced a trap composed of 102 places in 154 ms of which 1 ms to minimize.
[2021-05-09 08:21:11] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2021-05-09 08:21:11] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:21:11] [INFO ] Deduced a trap composed of 111 places in 204 ms of which 1 ms to minimize.
[2021-05-09 08:21:11] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 6668 ms
[2021-05-09 08:21:11] [INFO ] Computed and/alt/rep : 478/977/478 causal constraints (skipped 5 transitions) in 30 ms.
[2021-05-09 08:21:13] [INFO ] Added : 261 causal constraints over 53 iterations in 1671 ms. Result :sat
[2021-05-09 08:21:13] [INFO ] [Real]Absence check using 65 positive place invariants in 22 ms returned sat
[2021-05-09 08:21:13] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:21:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:14] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2021-05-09 08:21:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:14] [INFO ] [Nat]Absence check using 65 positive place invariants in 25 ms returned sat
[2021-05-09 08:21:14] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 5 ms returned unsat
[2021-05-09 08:21:14] [INFO ] [Real]Absence check using 65 positive place invariants in 47 ms returned sat
[2021-05-09 08:21:14] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 18 ms returned sat
[2021-05-09 08:21:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:14] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2021-05-09 08:21:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:14] [INFO ] [Nat]Absence check using 65 positive place invariants in 25 ms returned sat
[2021-05-09 08:21:14] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 08:21:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:14] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2021-05-09 08:21:15] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:21:15] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2021-05-09 08:21:15] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:21:15] [INFO ] Deduced a trap composed of 97 places in 171 ms of which 1 ms to minimize.
[2021-05-09 08:21:15] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:21:18] [INFO ] Deduced a trap composed of 27 places in 3471 ms of which 24 ms to minimize.
[2021-05-09 08:21:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4094 ms
[2021-05-09 08:21:19] [INFO ] Computed and/alt/rep : 478/977/478 causal constraints (skipped 5 transitions) in 44 ms.
[2021-05-09 08:21:21] [INFO ] Deduced a trap composed of 94 places in 186 ms of which 1 ms to minimize.
[2021-05-09 08:21:21] [INFO ] Deduced a trap composed of 100 places in 193 ms of which 1 ms to minimize.
[2021-05-09 08:21:21] [INFO ] Deduced a trap composed of 100 places in 191 ms of which 0 ms to minimize.
[2021-05-09 08:21:21] [INFO ] Deduced a trap composed of 107 places in 193 ms of which 0 ms to minimize.
[2021-05-09 08:21:22] [INFO ] Deduced a trap composed of 107 places in 191 ms of which 1 ms to minimize.
[2021-05-09 08:21:22] [INFO ] Deduced a trap composed of 105 places in 189 ms of which 0 ms to minimize.
[2021-05-09 08:21:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1530 ms
[2021-05-09 08:21:22] [INFO ] Added : 324 causal constraints over 67 iterations in 3591 ms. Result :sat
[2021-05-09 08:21:22] [INFO ] [Real]Absence check using 65 positive place invariants in 22 ms returned sat
[2021-05-09 08:21:22] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 26 ms returned sat
[2021-05-09 08:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:22] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2021-05-09 08:21:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:23] [INFO ] [Nat]Absence check using 65 positive place invariants in 26 ms returned sat
[2021-05-09 08:21:23] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 13 ms returned sat
[2021-05-09 08:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:23] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2021-05-09 08:21:23] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:21:23] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2021-05-09 08:21:23] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:21:24] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:21:24] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:21:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 712 ms
[2021-05-09 08:21:24] [INFO ] Computed and/alt/rep : 478/977/478 causal constraints (skipped 5 transitions) in 73 ms.
[2021-05-09 08:21:26] [INFO ] Deduced a trap composed of 104 places in 163 ms of which 1 ms to minimize.
[2021-05-09 08:21:26] [INFO ] Deduced a trap composed of 98 places in 190 ms of which 0 ms to minimize.
[2021-05-09 08:21:26] [INFO ] Deduced a trap composed of 100 places in 167 ms of which 1 ms to minimize.
[2021-05-09 08:21:27] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 0 ms to minimize.
[2021-05-09 08:21:27] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:21:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1112 ms
[2021-05-09 08:21:27] [INFO ] Added : 337 causal constraints over 68 iterations in 3272 ms. Result :sat
[2021-05-09 08:21:27] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2021-05-09 08:21:27] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 08:21:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:27] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-09 08:21:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:27] [INFO ] [Nat]Absence check using 65 positive place invariants in 25 ms returned sat
[2021-05-09 08:21:27] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-09 08:21:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:28] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2021-05-09 08:21:28] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:21:28] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 0 ms to minimize.
[2021-05-09 08:21:28] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:21:28] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:21:28] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2021-05-09 08:21:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 649 ms
[2021-05-09 08:21:28] [INFO ] Computed and/alt/rep : 478/977/478 causal constraints (skipped 5 transitions) in 36 ms.
[2021-05-09 08:21:31] [INFO ] Added : 328 causal constraints over 66 iterations in 2595 ms. Result :sat
[2021-05-09 08:21:31] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2021-05-09 08:21:31] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 08:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:31] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2021-05-09 08:21:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:31] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2021-05-09 08:21:31] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:32] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2021-05-09 08:21:32] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 1 ms to minimize.
[2021-05-09 08:21:32] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 1 ms to minimize.
[2021-05-09 08:21:32] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:21:32] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2021-05-09 08:21:32] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2021-05-09 08:21:32] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2021-05-09 08:21:32] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:21:33] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:21:33] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 1 ms to minimize.
[2021-05-09 08:21:33] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:21:33] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 1 ms to minimize.
[2021-05-09 08:21:33] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1573 ms
[2021-05-09 08:21:33] [INFO ] Computed and/alt/rep : 478/977/478 causal constraints (skipped 5 transitions) in 32 ms.
[2021-05-09 08:21:35] [INFO ] Added : 303 causal constraints over 61 iterations in 1806 ms. Result :sat
[2021-05-09 08:21:35] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2021-05-09 08:21:35] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 08:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:35] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-09 08:21:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:35] [INFO ] [Nat]Absence check using 65 positive place invariants in 22 ms returned sat
[2021-05-09 08:21:35] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 08:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:35] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2021-05-09 08:21:36] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:21:36] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:21:36] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:21:36] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2021-05-09 08:21:36] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 1 ms to minimize.
[2021-05-09 08:21:36] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:21:36] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 1 ms to minimize.
[2021-05-09 08:21:37] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 1 ms to minimize.
[2021-05-09 08:21:37] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 1 ms to minimize.
[2021-05-09 08:21:37] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 1 ms to minimize.
[2021-05-09 08:21:37] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2021-05-09 08:21:37] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:21:37] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:21:37] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:21:38] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:21:38] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:21:38] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:21:38] [INFO ] Deduced a trap composed of 99 places in 163 ms of which 1 ms to minimize.
[2021-05-09 08:21:38] [INFO ] Deduced a trap composed of 108 places in 164 ms of which 1 ms to minimize.
[2021-05-09 08:21:38] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2021-05-09 08:21:38] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2021-05-09 08:21:38] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2021-05-09 08:21:39] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2021-05-09 08:21:39] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 0 ms to minimize.
[2021-05-09 08:21:39] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2021-05-09 08:21:39] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2021-05-09 08:21:39] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2021-05-09 08:21:39] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3386 ms
[2021-05-09 08:21:39] [INFO ] Computed and/alt/rep : 478/977/478 causal constraints (skipped 5 transitions) in 30 ms.
[2021-05-09 08:21:41] [INFO ] Added : 303 causal constraints over 61 iterations in 1755 ms. Result :sat
[2021-05-09 08:21:41] [INFO ] [Real]Absence check using 65 positive place invariants in 23 ms returned sat
[2021-05-09 08:21:41] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-09 08:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:41] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2021-05-09 08:21:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 18 ms returned sat
[2021-05-09 08:21:41] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 08:21:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:41] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2021-05-09 08:21:41] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2021-05-09 08:21:41] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2021-05-09 08:21:41] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2021-05-09 08:21:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 221 ms
[2021-05-09 08:21:42] [INFO ] Computed and/alt/rep : 478/977/478 causal constraints (skipped 5 transitions) in 30 ms.
[2021-05-09 08:21:43] [INFO ] Added : 263 causal constraints over 53 iterations in 1408 ms. Result :sat
[2021-05-09 08:21:43] [INFO ] [Real]Absence check using 65 positive place invariants in 19 ms returned sat
[2021-05-09 08:21:43] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 08:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:43] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-09 08:21:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:43] [INFO ] [Nat]Absence check using 65 positive place invariants in 21 ms returned sat
[2021-05-09 08:21:43] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:44] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2021-05-09 08:21:44] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2021-05-09 08:21:44] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2021-05-09 08:21:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2021-05-09 08:21:44] [INFO ] Computed and/alt/rep : 478/977/478 causal constraints (skipped 5 transitions) in 44 ms.
[2021-05-09 08:21:45] [INFO ] Added : 251 causal constraints over 51 iterations in 1317 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||(F(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 538 transition count 471
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 538 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 538 transition count 470
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 533 transition count 465
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 532 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 532 transition count 464
Applied a total of 39 rules in 122 ms. Remains 532 /551 variables (removed 19) and now considering 464/484 (removed 20) transitions.
// Phase 1: matrix 464 rows 532 cols
[2021-05-09 08:21:45] [INFO ] Computed 106 place invariants in 5 ms
[2021-05-09 08:21:46] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 464 rows 532 cols
[2021-05-09 08:21:46] [INFO ] Computed 106 place invariants in 8 ms
[2021-05-09 08:21:46] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
// Phase 1: matrix 464 rows 532 cols
[2021-05-09 08:21:46] [INFO ] Computed 106 place invariants in 10 ms
[2021-05-09 08:21:47] [INFO ] Dead Transitions using invariants and state equation in 372 ms returned []
Finished structural reductions, in 1 iterations. Remains : 532/551 places, 464/484 transitions.
Stuttering acceptance computed with spot in 428 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-18-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(NEQ s381 1), p0:(AND (NEQ s93 0) (NEQ s115 1)), p1:(AND (EQ s115 0) (EQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-18-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-00 finished in 1949 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 6 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Graph (trivial) has 264 edges and 551 vertex of which 7 / 551 are part of one of the 1 SCC in 16 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 544 transition count 413
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 482 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 481 transition count 412
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 127 place count 481 transition count 297
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 382 place count 341 transition count 297
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 390 place count 333 transition count 289
Iterating global reduction 3 with 8 rules applied. Total rules applied 398 place count 333 transition count 289
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 293 rules applied. Total rules applied 691 place count 185 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 693 place count 184 transition count 147
Applied a total of 693 rules in 200 ms. Remains 184 /551 variables (removed 367) and now considering 147/484 (removed 337) transitions.
// Phase 1: matrix 147 rows 184 cols
[2021-05-09 08:21:47] [INFO ] Computed 78 place invariants in 1 ms
[2021-05-09 08:21:48] [INFO ] Implicit Places using invariants in 309 ms returned [1, 2, 3, 4, 9, 10, 13, 14, 15, 16, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 312 ms to find 26 implicit places.
[2021-05-09 08:21:48] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 147 rows 158 cols
[2021-05-09 08:21:48] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 08:21:48] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Starting structural reductions, iteration 1 : 158/551 places, 147/484 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2021-05-09 08:21:48] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 147 rows 158 cols
[2021-05-09 08:21:48] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 08:21:48] [INFO ] Dead Transitions using invariants and state equation in 202 ms returned []
Finished structural reductions, in 2 iterations. Remains : 158/551 places, 147/484 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-18-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (OR (NEQ s2 0) (NEQ s43 1)) (NEQ s8 0) (NEQ s4 1)), p1:(AND (NEQ s43 0) (NEQ s2 1) (NEQ s127 0) (NEQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-04 finished in 1018 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 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Graph (trivial) has 265 edges and 551 vertex of which 6 / 551 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 545 transition count 413
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 481 transition count 413
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 116 Pre rules applied. Total rules applied 129 place count 481 transition count 297
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 386 place count 340 transition count 297
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 395 place count 331 transition count 288
Iterating global reduction 2 with 9 rules applied. Total rules applied 404 place count 331 transition count 288
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 294 rules applied. Total rules applied 698 place count 183 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 700 place count 182 transition count 145
Applied a total of 700 rules in 82 ms. Remains 182 /551 variables (removed 369) and now considering 145/484 (removed 339) transitions.
// Phase 1: matrix 145 rows 182 cols
[2021-05-09 08:21:48] [INFO ] Computed 79 place invariants in 2 ms
[2021-05-09 08:21:51] [INFO ] Implicit Places using invariants in 3285 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 3311 ms to find 29 implicit places.
[2021-05-09 08:21:51] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 145 rows 153 cols
[2021-05-09 08:21:51] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 08:21:52] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Starting structural reductions, iteration 1 : 153/551 places, 145/484 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2021-05-09 08:21:52] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 145 rows 153 cols
[2021-05-09 08:21:52] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 08:21:52] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 2 iterations. Remains : 153/551 places, 145/484 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-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 (NEQ s93 0) (NEQ s105 1)), p1:(AND (NEQ s123 0) (NEQ s98 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-18-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-05 finished in 3846 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(p0)&&(G(p1)||(F(p0)&&p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 538 transition count 471
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 538 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 538 transition count 470
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 534 transition count 466
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 533 transition count 465
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 533 transition count 465
Applied a total of 37 rules in 42 ms. Remains 533 /551 variables (removed 18) and now considering 465/484 (removed 19) transitions.
// Phase 1: matrix 465 rows 533 cols
[2021-05-09 08:21:52] [INFO ] Computed 106 place invariants in 13 ms
[2021-05-09 08:21:52] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 465 rows 533 cols
[2021-05-09 08:21:52] [INFO ] Computed 106 place invariants in 5 ms
[2021-05-09 08:21:53] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
// Phase 1: matrix 465 rows 533 cols
[2021-05-09 08:21:53] [INFO ] Computed 106 place invariants in 4 ms
[2021-05-09 08:21:53] [INFO ] Dead Transitions using invariants and state equation in 525 ms returned []
Finished structural reductions, in 1 iterations. Remains : 533/551 places, 465/484 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-18-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s344 0) (EQ s479 1)), p2:(AND (OR (EQ s173 0) (EQ s431 1)) (OR (EQ s115 0) (EQ s86 1))), p0:(OR (EQ s115 0) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 529 reset in 546 ms.
Product exploration explored 100000 steps with 529 reset in 308 ms.
Graph (complete) has 1202 edges and 533 vertex of which 532 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Knowledge obtained : [p1, p2, p0]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Entered a terminal (fully accepting) state of product in 8060 steps with 40 reset in 31 ms.
FORMULA BusinessProcesses-PT-18-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-06 finished in 2988 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 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Graph (trivial) has 269 edges and 551 vertex of which 7 / 551 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 544 transition count 409
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 478 transition count 409
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 116 Pre rules applied. Total rules applied 133 place count 478 transition count 293
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 390 place count 337 transition count 293
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 399 place count 328 transition count 284
Iterating global reduction 2 with 9 rules applied. Total rules applied 408 place count 328 transition count 284
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 295 rules applied. Total rules applied 703 place count 179 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 705 place count 178 transition count 141
Applied a total of 705 rules in 36 ms. Remains 178 /551 variables (removed 373) and now considering 141/484 (removed 343) transitions.
// Phase 1: matrix 141 rows 178 cols
[2021-05-09 08:21:55] [INFO ] Computed 78 place invariants in 2 ms
[2021-05-09 08:21:55] [INFO ] Implicit Places using invariants in 114 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 114 ms to find 28 implicit places.
[2021-05-09 08:21:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 141 rows 150 cols
[2021-05-09 08:21:55] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 08:21:55] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 150/551 places, 141/484 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2021-05-09 08:21:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 141 rows 150 cols
[2021-05-09 08:21:55] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-09 08:21:55] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/551 places, 141/484 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-07 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 s114 0) (EQ s4 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 13565 reset in 244 ms.
Product exploration explored 100000 steps with 13690 reset in 258 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13625 reset in 161 ms.
Product exploration explored 100000 steps with 13717 reset in 182 ms.
[2021-05-09 08:21:56] [INFO ] Flatten gal took : 14 ms
[2021-05-09 08:21:56] [INFO ] Flatten gal took : 12 ms
[2021-05-09 08:21:56] [INFO ] Time to serialize gal into /tmp/LTL13023827797620029320.gal : 9 ms
[2021-05-09 08:21:56] [INFO ] Time to serialize properties into /tmp/LTL5129457572215903154.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/LTL13023827797620029320.gal, -t, CGAL, -LTL, /tmp/LTL5129457572215903154.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/LTL13023827797620029320.gal -t CGAL -LTL /tmp/LTL5129457572215903154.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((p607==0)||(p138==1))"))))
Formula 0 simplified : !FG"((p607==0)||(p138==1))"
Reverse transition relation is NOT exact ! Due to transitions t34, t272.t273.t1.t274, t265.t266.t3.t267, t45.t47.t48.t4, t42.t43.t5, t39.t40.t6, t36.t37.t7, t263.t280, t276.t278.t279.t0.t280, t269.t270.t2.t280, t62.t187.t188.t334.t480.t336.t337.t66, t60.t169.t170.t327.t475.t328.t329.t66, t59.t164.t323.t348.t472.t324.t325.t66, t56.t161.t318.t470.t320.t321.t66, t56.t158.t318.t469.t320.t321.t66, t55.t155.t314.t349.t467.t315.t316.t66, t54.t152.t310.t346.t465.t311.t312.t66, t53.t175.t176.t306.t350.t463.t307.t308.t66, t134.t403.t262.t280.t66, t73.t189.t191.t194.t195.t196.t197.t201.t205.t209.t214.t218.t222.t226.t230.t234.t238.t243.t248.t252.t256.t260.t281.t285.t289.t293.t297.t305.t309.t313.t317.t322.t326.t330.t298.t304.t74.t77.t81.t84.t87.t90.t93.t96.t99.t102.t105.t108.t111.t114.t117.t120.t123.t126.t129.t132.t135.t138.t141.t144.t147.t150.t153.t156.t159.t162.t165.t168.t171.t174.t177.t180.t183.t181.t178.t172.t163.t160.t157.t154.t151.t148.t145.t142.t139.t136.t133.t130.t127.t124.t121.t118.t115.t112.t109.t106.t103.t100.t97.t94.t91.t88.t85.t82.t75.t300.t301.t299, t73.t189.t191.t194.t195.t196.t197.t201.t205.t209.t214.t218.t222.t226.t230.t234.t238.t243.t248.t252.t256.t260.t281.t285.t289.t293.t297.t305.t309.t313.t317.t322.t326.t330.t298.t304.t74.t77.t81.t84.t87.t90.t93.t96.t99.t102.t105.t108.t111.t114.t117.t120.t123.t126.t129.t132.t135.t138.t141.t144.t147.t150.t153.t156.t159.t162.t165.t168.t171.t174.t177.t180.t183.t181.t178.t172.t163.t160.t157.t154.t151.t148.t145.t142.t139.t136.t133.t130.t127.t124.t121.t118.t115.t112.t109.t106.t103.t100.t97.t94.t91.t88.t85.t82.t75.t300.t301.t302.t303, t460.t66.t300.t301.t299, t460.t66.t300.t301.t302.t303, t461.t66.t300.t301.t299, t461.t66.t300.t301.t302.t303, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/80/25/141
Computing Next relation with stutter on 62480 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
398 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.03314,110376,1,0,503,441064,275,456,5992,588467,886
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-18-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-18-07 finished in 5916 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Graph (trivial) has 269 edges and 551 vertex of which 7 / 551 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 544 transition count 410
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 479 transition count 409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 478 transition count 409
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 133 place count 478 transition count 294
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 388 place count 338 transition count 294
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 397 place count 329 transition count 285
Iterating global reduction 3 with 9 rules applied. Total rules applied 406 place count 329 transition count 285
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 295 rules applied. Total rules applied 701 place count 180 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 703 place count 179 transition count 142
Applied a total of 703 rules in 35 ms. Remains 179 /551 variables (removed 372) and now considering 142/484 (removed 342) transitions.
// Phase 1: matrix 142 rows 179 cols
[2021-05-09 08:22:01] [INFO ] Computed 78 place invariants in 2 ms
[2021-05-09 08:22:01] [INFO ] Implicit Places using invariants in 154 ms returned [3, 4, 5, 6, 7, 8, 9, 12, 13, 14, 15, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 156 ms to find 27 implicit places.
[2021-05-09 08:22:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 142 rows 152 cols
[2021-05-09 08:22:01] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-09 08:22:01] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Starting structural reductions, iteration 1 : 152/551 places, 142/484 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2021-05-09 08:22:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 142 rows 152 cols
[2021-05-09 08:22:01] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-09 08:22:01] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Finished structural reductions, in 2 iterations. Remains : 152/551 places, 142/484 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 0) (EQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-09 finished in 428 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 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Graph (trivial) has 269 edges and 551 vertex of which 7 / 551 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 544 transition count 410
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 479 transition count 410
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 117 Pre rules applied. Total rules applied 131 place count 479 transition count 293
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 390 place count 337 transition count 293
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 401 place count 326 transition count 282
Iterating global reduction 2 with 11 rules applied. Total rules applied 412 place count 326 transition count 282
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 700 place count 181 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 702 place count 180 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 703 place count 179 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 704 place count 178 transition count 141
Applied a total of 704 rules in 50 ms. Remains 178 /551 variables (removed 373) and now considering 141/484 (removed 343) transitions.
// Phase 1: matrix 141 rows 178 cols
[2021-05-09 08:22:01] [INFO ] Computed 78 place invariants in 1 ms
[2021-05-09 08:22:01] [INFO ] Implicit Places using invariants in 172 ms returned [48, 49, 50, 51, 52, 53, 54, 147]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 174 ms to find 8 implicit places.
[2021-05-09 08:22:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 141 rows 170 cols
[2021-05-09 08:22:01] [INFO ] Computed 70 place invariants in 1 ms
[2021-05-09 08:22:02] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Starting structural reductions, iteration 1 : 170/551 places, 141/484 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2021-05-09 08:22:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 141 rows 170 cols
[2021-05-09 08:22:02] [INFO ] Computed 70 place invariants in 1 ms
[2021-05-09 08:22:02] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 2 iterations. Remains : 170/551 places, 141/484 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s42 0) (NEQ s46 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 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-10 finished in 465 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X((G(p1) U (G(p1)&&p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 538 transition count 471
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 538 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 538 transition count 470
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 533 transition count 465
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 532 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 532 transition count 464
Applied a total of 39 rules in 40 ms. Remains 532 /551 variables (removed 19) and now considering 464/484 (removed 20) transitions.
// Phase 1: matrix 464 rows 532 cols
[2021-05-09 08:22:02] [INFO ] Computed 106 place invariants in 4 ms
[2021-05-09 08:22:02] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 464 rows 532 cols
[2021-05-09 08:22:02] [INFO ] Computed 106 place invariants in 4 ms
[2021-05-09 08:22:03] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1037 ms to find 0 implicit places.
// Phase 1: matrix 464 rows 532 cols
[2021-05-09 08:22:03] [INFO ] Computed 106 place invariants in 3 ms
[2021-05-09 08:22:03] [INFO ] Dead Transitions using invariants and state equation in 275 ms returned []
Finished structural reductions, in 1 iterations. Remains : 532/551 places, 464/484 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-18-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s259 0) (EQ s495 1) (OR (EQ s277 0) (EQ s175 1))), p2:(AND (OR (EQ s277 0) (EQ s175 1)) (EQ s259 0) (EQ s495 1)), p1:(OR (EQ s495 0) (EQ s259 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-11 finished in 1525 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 539 transition count 472
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 539 transition count 472
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 539 transition count 471
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 535 transition count 467
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 534 transition count 466
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 534 transition count 466
Applied a total of 35 rules in 61 ms. Remains 534 /551 variables (removed 17) and now considering 466/484 (removed 18) transitions.
// Phase 1: matrix 466 rows 534 cols
[2021-05-09 08:22:03] [INFO ] Computed 106 place invariants in 4 ms
[2021-05-09 08:22:04] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 466 rows 534 cols
[2021-05-09 08:22:04] [INFO ] Computed 106 place invariants in 3 ms
[2021-05-09 08:22:04] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
// Phase 1: matrix 466 rows 534 cols
[2021-05-09 08:22:04] [INFO ] Computed 106 place invariants in 3 ms
[2021-05-09 08:22:04] [INFO ] Dead Transitions using invariants and state equation in 304 ms returned []
Finished structural reductions, in 1 iterations. Remains : 534/551 places, 466/484 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-18-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s265 0) (NEQ s21 1)), p1:(AND (NEQ s476 0) (NEQ s291 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-13 finished in 1401 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620548525531

--------------------
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-18"
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-18, 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-162038143900460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-18.tgz
mv BusinessProcesses-PT-18 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 ;