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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K 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.4K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:00 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.7K 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 156K 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-14-00
FORMULA_NAME BusinessProcesses-PT-14-01
FORMULA_NAME BusinessProcesses-PT-14-02
FORMULA_NAME BusinessProcesses-PT-14-03
FORMULA_NAME BusinessProcesses-PT-14-04
FORMULA_NAME BusinessProcesses-PT-14-05
FORMULA_NAME BusinessProcesses-PT-14-06
FORMULA_NAME BusinessProcesses-PT-14-07
FORMULA_NAME BusinessProcesses-PT-14-08
FORMULA_NAME BusinessProcesses-PT-14-09
FORMULA_NAME BusinessProcesses-PT-14-10
FORMULA_NAME BusinessProcesses-PT-14-11
FORMULA_NAME BusinessProcesses-PT-14-12
FORMULA_NAME BusinessProcesses-PT-14-13
FORMULA_NAME BusinessProcesses-PT-14-14
FORMULA_NAME BusinessProcesses-PT-14-15

=== Now, execution of the tool begins

BK_START 1620546372401

Running Version 0
[2021-05-09 07:46:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 07:46:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:46:14] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2021-05-09 07:46:14] [INFO ] Transformed 624 places.
[2021-05-09 07:46:14] [INFO ] Transformed 564 transitions.
[2021-05-09 07:46:14] [INFO ] Found NUPN structural information;
[2021-05-09 07:46:14] [INFO ] Parsed PT model containing 624 places and 564 transitions in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 07:46:14] [INFO ] Initial state test concluded for 2 properties.
Deduced a syphon composed of 8 places in 15 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 616 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 94 place count 522 transition count 467
Iterating global reduction 1 with 89 rules applied. Total rules applied 183 place count 522 transition count 467
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 225 place count 480 transition count 425
Iterating global reduction 1 with 42 rules applied. Total rules applied 267 place count 480 transition count 425
Applied a total of 267 rules in 168 ms. Remains 480 /616 variables (removed 136) and now considering 425/556 (removed 131) transitions.
// Phase 1: matrix 425 rows 480 cols
[2021-05-09 07:46:15] [INFO ] Computed 94 place invariants in 38 ms
[2021-05-09 07:46:15] [INFO ] Implicit Places using invariants in 397 ms returned []
// Phase 1: matrix 425 rows 480 cols
[2021-05-09 07:46:15] [INFO ] Computed 94 place invariants in 23 ms
[2021-05-09 07:46:16] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
// Phase 1: matrix 425 rows 480 cols
[2021-05-09 07:46:16] [INFO ] Computed 94 place invariants in 6 ms
[2021-05-09 07:46:16] [INFO ] Dead Transitions using invariants and state equation in 445 ms returned []
Finished structural reductions, in 1 iterations. Remains : 480/616 places, 425/556 transitions.
[2021-05-09 07:46:16] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 07:46:16] [INFO ] Flatten gal took : 121 ms
FORMULA BusinessProcesses-PT-14-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 07:46:16] [INFO ] Flatten gal took : 40 ms
[2021-05-09 07:46:17] [INFO ] Input system was already deterministic with 425 transitions.
Incomplete random walk after 100000 steps, including 685 resets, run finished after 385 ms. (steps per millisecond=259 ) properties (out of 25) seen :9
Running SMT prover for 16 properties.
// Phase 1: matrix 425 rows 480 cols
[2021-05-09 07:46:17] [INFO ] Computed 94 place invariants in 15 ms
[2021-05-09 07:46:17] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2021-05-09 07:46:17] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-09 07:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:17] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-09 07:46:17] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 5 ms to minimize.
[2021-05-09 07:46:18] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:46:18] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2021-05-09 07:46:18] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:46:18] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2021-05-09 07:46:18] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2021-05-09 07:46:18] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:46:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 700 ms
[2021-05-09 07:46:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:46:18] [INFO ] [Nat]Absence check using 55 positive place invariants in 14 ms returned sat
[2021-05-09 07:46:18] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 18 ms returned sat
[2021-05-09 07:46:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:18] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-09 07:46:18] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2021-05-09 07:46:18] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:46:19] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:46:19] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:46:19] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:46:19] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2021-05-09 07:46:19] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:46:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 588 ms
[2021-05-09 07:46:19] [INFO ] Computed and/alt/rep : 418/864/418 causal constraints (skipped 6 transitions) in 20 ms.
[2021-05-09 07:46:21] [INFO ] Added : 324 causal constraints over 65 iterations in 2134 ms. Result :sat
[2021-05-09 07:46:21] [INFO ] [Real]Absence check using 55 positive place invariants in 31 ms returned sat
[2021-05-09 07:46:21] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 14 ms returned sat
[2021-05-09 07:46:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:21] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2021-05-09 07:46:22] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:46:22] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:46:22] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:46:22] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2021-05-09 07:46:22] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:46:22] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:46:22] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:46:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 603 ms
[2021-05-09 07:46:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:46:22] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2021-05-09 07:46:22] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 6 ms returned sat
[2021-05-09 07:46:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:22] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2021-05-09 07:46:22] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2021-05-09 07:46:23] [INFO ] Deduced a trap composed of 18 places in 376 ms of which 1 ms to minimize.
[2021-05-09 07:46:23] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2021-05-09 07:46:23] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2021-05-09 07:46:23] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2021-05-09 07:46:23] [INFO ] Deduced a trap composed of 27 places in 16 ms of which 0 ms to minimize.
[2021-05-09 07:46:23] [INFO ] Deduced a trap composed of 37 places in 14 ms of which 0 ms to minimize.
[2021-05-09 07:46:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 762 ms
[2021-05-09 07:46:23] [INFO ] Computed and/alt/rep : 418/864/418 causal constraints (skipped 6 transitions) in 37 ms.
[2021-05-09 07:46:25] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:46:25] [INFO ] Deduced a trap composed of 112 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:46:26] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:46:26] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:46:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 689 ms
[2021-05-09 07:46:26] [INFO ] Added : 308 causal constraints over 62 iterations in 2751 ms. Result :sat
[2021-05-09 07:46:26] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-09 07:46:26] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:46:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:26] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-09 07:46:26] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 0 ms to minimize.
[2021-05-09 07:46:26] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2021-05-09 07:46:27] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 6 ms to minimize.
[2021-05-09 07:46:27] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:46:27] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:46:27] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:46:27] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:46:27] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:46:27] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:46:27] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:46:27] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:46:27] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1199 ms
[2021-05-09 07:46:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:46:27] [INFO ] [Nat]Absence check using 55 positive place invariants in 17 ms returned sat
[2021-05-09 07:46:27] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-09 07:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:28] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2021-05-09 07:46:28] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 0 ms to minimize.
[2021-05-09 07:46:28] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2021-05-09 07:46:28] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2021-05-09 07:46:28] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:46:28] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:46:28] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:46:28] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:46:28] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:46:28] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:46:29] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2021-05-09 07:46:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 924 ms
[2021-05-09 07:46:29] [INFO ] Computed and/alt/rep : 418/864/418 causal constraints (skipped 6 transitions) in 25 ms.
[2021-05-09 07:46:30] [INFO ] Added : 286 causal constraints over 58 iterations in 1220 ms. Result :sat
[2021-05-09 07:46:30] [INFO ] [Real]Absence check using 55 positive place invariants in 20 ms returned sat
[2021-05-09 07:46:30] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:46:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:30] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-09 07:46:30] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:46:30] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:46:30] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 4 ms to minimize.
[2021-05-09 07:46:30] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:46:31] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:46:31] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:46:31] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 0 ms to minimize.
[2021-05-09 07:46:31] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 0 ms to minimize.
[2021-05-09 07:46:31] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2021-05-09 07:46:31] [INFO ] Deduced a trap composed of 35 places in 22 ms of which 0 ms to minimize.
[2021-05-09 07:46:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 970 ms
[2021-05-09 07:46:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:46:31] [INFO ] [Nat]Absence check using 55 positive place invariants in 35 ms returned sat
[2021-05-09 07:46:31] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 7 ms returned sat
[2021-05-09 07:46:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:31] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-09 07:46:31] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:46:31] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:46:32] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 0 ms to minimize.
[2021-05-09 07:46:32] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:46:32] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:46:32] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:46:32] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:46:32] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:46:32] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:46:32] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:46:32] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 0 ms to minimize.
[2021-05-09 07:46:32] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2021-05-09 07:46:33] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 0 ms to minimize.
[2021-05-09 07:46:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1342 ms
[2021-05-09 07:46:33] [INFO ] Computed and/alt/rep : 418/864/418 causal constraints (skipped 6 transitions) in 32 ms.
[2021-05-09 07:46:34] [INFO ] Added : 237 causal constraints over 48 iterations in 1338 ms. Result :sat
[2021-05-09 07:46:34] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-09 07:46:34] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:34] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-09 07:46:34] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2021-05-09 07:46:34] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2021-05-09 07:46:34] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:46:34] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:46:35] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:46:35] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2021-05-09 07:46:35] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
[2021-05-09 07:46:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 584 ms
[2021-05-09 07:46:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:46:35] [INFO ] [Nat]Absence check using 55 positive place invariants in 23 ms returned sat
[2021-05-09 07:46:35] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 07:46:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:35] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-09 07:46:35] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:46:35] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:46:35] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:46:35] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:46:35] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2021-05-09 07:46:35] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:46:36] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2021-05-09 07:46:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 610 ms
[2021-05-09 07:46:36] [INFO ] Computed and/alt/rep : 418/864/418 causal constraints (skipped 6 transitions) in 53 ms.
[2021-05-09 07:46:37] [INFO ] Added : 236 causal constraints over 48 iterations in 1343 ms. Result :sat
[2021-05-09 07:46:37] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-09 07:46:37] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:46:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:37] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2021-05-09 07:46:37] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:46:37] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:46:38] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:46:38] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:46:38] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:46:38] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2021-05-09 07:46:38] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:46:38] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
[2021-05-09 07:46:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 687 ms
[2021-05-09 07:46:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:46:38] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-09 07:46:38] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 07:46:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:38] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-09 07:46:38] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2021-05-09 07:46:38] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:46:38] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:46:39] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:46:39] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:46:39] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2021-05-09 07:46:39] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:46:39] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2021-05-09 07:46:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 629 ms
[2021-05-09 07:46:39] [INFO ] Computed and/alt/rep : 418/864/418 causal constraints (skipped 6 transitions) in 28 ms.
[2021-05-09 07:46:41] [INFO ] Added : 303 causal constraints over 61 iterations in 1858 ms. Result :sat
[2021-05-09 07:46:41] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2021-05-09 07:46:41] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 15 ms returned sat
[2021-05-09 07:46:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:41] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2021-05-09 07:46:41] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2021-05-09 07:46:41] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 1 ms to minimize.
[2021-05-09 07:46:41] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2021-05-09 07:46:42] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:46:42] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 0 ms to minimize.
[2021-05-09 07:46:42] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:46:42] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 1 ms to minimize.
[2021-05-09 07:46:42] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:46:42] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:46:42] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:46:43] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:46:43] [INFO ] Deduced a trap composed of 35 places in 23 ms of which 0 ms to minimize.
[2021-05-09 07:46:43] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1596 ms
[2021-05-09 07:46:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:46:43] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2021-05-09 07:46:43] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 07:46:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:43] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2021-05-09 07:46:43] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:46:43] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:46:43] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 0 ms to minimize.
[2021-05-09 07:46:43] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:46:44] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2021-05-09 07:46:44] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:46:44] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:46:44] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2021-05-09 07:46:44] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:46:44] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:46:44] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 0 ms to minimize.
[2021-05-09 07:46:44] [INFO ] Deduced a trap composed of 35 places in 24 ms of which 0 ms to minimize.
[2021-05-09 07:46:44] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1407 ms
[2021-05-09 07:46:44] [INFO ] Computed and/alt/rep : 418/864/418 causal constraints (skipped 6 transitions) in 27 ms.
[2021-05-09 07:46:47] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:46:47] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 1 ms to minimize.
[2021-05-09 07:46:47] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 0 ms to minimize.
[2021-05-09 07:46:47] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 0 ms to minimize.
[2021-05-09 07:46:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 748 ms
[2021-05-09 07:46:47] [INFO ] Added : 329 causal constraints over 66 iterations in 3216 ms. Result :sat
[2021-05-09 07:46:48] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2021-05-09 07:46:48] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:46:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:48] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-09 07:46:48] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:46:48] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
[2021-05-09 07:46:48] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:46:48] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:46:48] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:46:48] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:46:48] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:46:48] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:46:48] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:46:49] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:46:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 811 ms
[2021-05-09 07:46:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:46:49] [INFO ] [Nat]Absence check using 55 positive place invariants in 14 ms returned sat
[2021-05-09 07:46:49] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 7 ms returned sat
[2021-05-09 07:46:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:49] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-09 07:46:49] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:46:49] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 0 ms to minimize.
[2021-05-09 07:46:49] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:46:49] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:46:49] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:46:49] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:46:49] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:46:49] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:46:49] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:46:49] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2021-05-09 07:46:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 728 ms
[2021-05-09 07:46:49] [INFO ] Computed and/alt/rep : 418/864/418 causal constraints (skipped 6 transitions) in 17 ms.
[2021-05-09 07:46:51] [INFO ] Added : 284 causal constraints over 57 iterations in 1205 ms. Result :sat
[2021-05-09 07:46:51] [INFO ] [Real]Absence check using 55 positive place invariants in 25 ms returned sat
[2021-05-09 07:46:51] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 6 ms returned sat
[2021-05-09 07:46:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:51] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-09 07:46:51] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2021-05-09 07:46:51] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:46:51] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:46:51] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:46:51] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:46:51] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:46:51] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:46:51] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2021-05-09 07:46:52] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:46:52] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:46:52] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2021-05-09 07:46:52] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:46:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 872 ms
[2021-05-09 07:46:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:46:52] [INFO ] [Nat]Absence check using 55 positive place invariants in 17 ms returned sat
[2021-05-09 07:46:52] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:46:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:52] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2021-05-09 07:46:52] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:46:52] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:46:52] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:46:52] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:46:52] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:46:52] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:46:52] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:46:52] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2021-05-09 07:46:53] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:46:53] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:46:53] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:46:53] [INFO ] Deduced a trap composed of 51 places in 32 ms of which 0 ms to minimize.
[2021-05-09 07:46:53] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 723 ms
[2021-05-09 07:46:53] [INFO ] Computed and/alt/rep : 418/864/418 causal constraints (skipped 6 transitions) in 17 ms.
[2021-05-09 07:46:53] [INFO ] Added : 202 causal constraints over 41 iterations in 683 ms. Result :sat
[2021-05-09 07:46:53] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-09 07:46:53] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 6 ms returned sat
[2021-05-09 07:46:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:54] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2021-05-09 07:46:54] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:46:54] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:46:54] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:46:54] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:46:54] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:46:54] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2021-05-09 07:46:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 500 ms
[2021-05-09 07:46:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:46:54] [INFO ] [Nat]Absence check using 55 positive place invariants in 23 ms returned sat
[2021-05-09 07:46:54] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 07:46:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:54] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-09 07:46:54] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:46:54] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:46:55] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2021-05-09 07:46:55] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2021-05-09 07:46:55] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:46:55] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2021-05-09 07:46:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 420 ms
[2021-05-09 07:46:55] [INFO ] Computed and/alt/rep : 418/864/418 causal constraints (skipped 6 transitions) in 18 ms.
[2021-05-09 07:46:56] [INFO ] Added : 193 causal constraints over 39 iterations in 834 ms. Result :sat
[2021-05-09 07:46:56] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2021-05-09 07:46:56] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 23 ms returned sat
[2021-05-09 07:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:56] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-09 07:46:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:46:56] [INFO ] [Nat]Absence check using 55 positive place invariants in 22 ms returned sat
[2021-05-09 07:46:56] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 07:46:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:56] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-09 07:46:56] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:46:56] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:46:56] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:46:56] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2021-05-09 07:46:56] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2021-05-09 07:46:57] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:46:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 357 ms
[2021-05-09 07:46:57] [INFO ] Computed and/alt/rep : 418/864/418 causal constraints (skipped 6 transitions) in 19 ms.
[2021-05-09 07:46:57] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:46:57] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:46:58] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 1 ms to minimize.
[2021-05-09 07:46:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 313 ms
[2021-05-09 07:46:58] [INFO ] Added : 210 causal constraints over 42 iterations in 1039 ms. Result :sat
[2021-05-09 07:46:58] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2021-05-09 07:46:58] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:58] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-09 07:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:46:58] [INFO ] [Nat]Absence check using 55 positive place invariants in 14 ms returned sat
[2021-05-09 07:46:58] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 7 ms returned sat
[2021-05-09 07:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:46:58] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-09 07:46:58] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:46:58] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 0 ms to minimize.
[2021-05-09 07:46:58] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:46:59] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:46:59] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:46:59] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:46:59] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:46:59] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:46:59] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:46:59] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2021-05-09 07:46:59] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:46:59] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1275 ms
[2021-05-09 07:46:59] [INFO ] Computed and/alt/rep : 418/864/418 causal constraints (skipped 6 transitions) in 20 ms.
[2021-05-09 07:47:01] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 0 ms to minimize.
[2021-05-09 07:47:01] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 1 ms to minimize.
[2021-05-09 07:47:01] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:47:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 607 ms
[2021-05-09 07:47:01] [INFO ] Added : 318 causal constraints over 65 iterations in 2141 ms. Result :sat
[2021-05-09 07:47:02] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2021-05-09 07:47:02] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-09 07:47:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:47:02] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-09 07:47:02] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:47:02] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:47:02] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:47:02] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2021-05-09 07:47:02] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2021-05-09 07:47:02] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:47:02] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:47:02] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:47:02] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2021-05-09 07:47:02] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 688 ms
[2021-05-09 07:47:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:47:02] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2021-05-09 07:47:02] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 6 ms returned sat
[2021-05-09 07:47:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:47:03] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2021-05-09 07:47:03] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:47:03] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:47:03] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:47:03] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:47:03] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:47:03] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:47:03] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2021-05-09 07:47:03] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2021-05-09 07:47:03] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:47:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 580 ms
[2021-05-09 07:47:03] [INFO ] Computed and/alt/rep : 418/864/418 causal constraints (skipped 6 transitions) in 17 ms.
[2021-05-09 07:47:04] [INFO ] Added : 231 causal constraints over 47 iterations in 832 ms. Result :sat
[2021-05-09 07:47:04] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2021-05-09 07:47:04] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 6 ms returned sat
[2021-05-09 07:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:47:04] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2021-05-09 07:47:04] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2021-05-09 07:47:04] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:47:04] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:47:04] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2021-05-09 07:47:04] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 0 ms to minimize.
[2021-05-09 07:47:04] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2021-05-09 07:47:04] [INFO ] Deduced a trap composed of 37 places in 18 ms of which 0 ms to minimize.
[2021-05-09 07:47:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 352 ms
[2021-05-09 07:47:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:47:05] [INFO ] [Nat]Absence check using 55 positive place invariants in 14 ms returned sat
[2021-05-09 07:47:05] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 7 ms returned sat
[2021-05-09 07:47:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:47:05] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2021-05-09 07:47:05] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:47:05] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2021-05-09 07:47:05] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:47:05] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2021-05-09 07:47:05] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2021-05-09 07:47:05] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 0 ms to minimize.
[2021-05-09 07:47:05] [INFO ] Deduced a trap composed of 37 places in 19 ms of which 0 ms to minimize.
[2021-05-09 07:47:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 377 ms
[2021-05-09 07:47:05] [INFO ] Computed and/alt/rep : 418/864/418 causal constraints (skipped 6 transitions) in 25 ms.
[2021-05-09 07:47:07] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 0 ms to minimize.
[2021-05-09 07:47:07] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:47:07] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2021-05-09 07:47:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 452 ms
[2021-05-09 07:47:07] [INFO ] Added : 306 causal constraints over 62 iterations in 1874 ms. Result :sat
[2021-05-09 07:47:07] [INFO ] [Real]Absence check using 55 positive place invariants in 17 ms returned sat
[2021-05-09 07:47:07] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:47:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:47:07] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-09 07:47:07] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2021-05-09 07:47:07] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2021-05-09 07:47:07] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:47:08] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:47:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 279 ms
[2021-05-09 07:47:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:47:08] [INFO ] [Nat]Absence check using 55 positive place invariants in 15 ms returned sat
[2021-05-09 07:47:08] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-09 07:47:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:47:08] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-09 07:47:08] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:47:08] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:47:08] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:47:08] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2021-05-09 07:47:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 263 ms
[2021-05-09 07:47:08] [INFO ] Computed and/alt/rep : 418/864/418 causal constraints (skipped 6 transitions) in 25 ms.
[2021-05-09 07:47:09] [INFO ] Added : 208 causal constraints over 42 iterations in 866 ms. Result :sat
[2021-05-09 07:47:09] [INFO ] [Real]Absence check using 55 positive place invariants in 7 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F(p1)&&F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 425/425 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 479 transition count 377
Reduce places removed 47 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 96 place count 432 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 430 transition count 375
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 98 place count 430 transition count 270
Deduced a syphon composed of 105 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 227 rules applied. Total rules applied 325 place count 308 transition count 270
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 334 place count 299 transition count 261
Ensure Unique test removed 1 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 344 place count 298 transition count 261
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 598 place count 169 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 599 place count 169 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 601 place count 168 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 602 place count 167 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 603 place count 166 transition count 138
Applied a total of 603 rules in 78 ms. Remains 166 /480 variables (removed 314) and now considering 138/425 (removed 287) transitions.
// Phase 1: matrix 138 rows 166 cols
[2021-05-09 07:47:09] [INFO ] Computed 71 place invariants in 9 ms
[2021-05-09 07:47:09] [INFO ] Implicit Places using invariants in 164 ms returned [23, 24, 25, 49, 50, 51, 52]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 167 ms to find 7 implicit places.
[2021-05-09 07:47:09] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 138 rows 159 cols
[2021-05-09 07:47:09] [INFO ] Computed 64 place invariants in 1 ms
[2021-05-09 07:47:09] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Starting structural reductions, iteration 1 : 159/480 places, 138/425 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2021-05-09 07:47:09] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 138 rows 159 cols
[2021-05-09 07:47:09] [INFO ] Computed 64 place invariants in 1 ms
[2021-05-09 07:47:10] [INFO ] Dead Transitions using invariants and state equation in 157 ms returned []
Finished structural reductions, in 2 iterations. Remains : 159/480 places, 138/425 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-14-01 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s21 1) (NEQ s96 1) (NEQ s136 1)), p1:(NEQ s122 1), p2:(NEQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 13845 reset in 498 ms.
Product exploration explored 100000 steps with 13851 reset in 352 ms.
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Entered a terminal (fully accepting) state of product in 72068 steps with 9933 reset in 164 ms.
FORMULA BusinessProcesses-PT-14-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-01 finished in 2300 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0) U (G((X(p0)||G(p1)))||((X(p0)||G(p1))&&(p2||X((p1&&F(p3)))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 469 transition count 414
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 469 transition count 414
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 466 transition count 411
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 466 transition count 411
Applied a total of 28 rules in 77 ms. Remains 466 /480 variables (removed 14) and now considering 411/425 (removed 14) transitions.
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:47:11] [INFO ] Computed 94 place invariants in 4 ms
[2021-05-09 07:47:12] [INFO ] Implicit Places using invariants in 336 ms returned []
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:47:12] [INFO ] Computed 94 place invariants in 2 ms
[2021-05-09 07:47:12] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:47:12] [INFO ] Computed 94 place invariants in 2 ms
[2021-05-09 07:47:12] [INFO ] Dead Transitions using invariants and state equation in 164 ms returned []
Finished structural reductions, in 1 iterations. Remains : 466/480 places, 411/425 transitions.
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true, (NOT p1), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-14-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=7 dest: 9}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=7 dest: 10}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 11}], [{ cond=(NOT p3), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=10 dest: 9}, { cond=(AND p1 (NOT p3)), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=11 dest: 9}]], initial=0, aps=[p1:(OR (NEQ s158 1) (NEQ s345 1) (NEQ s442 1)), p2:(NEQ s216 1), p0:(NEQ s175 1), p3:(NEQ s153 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 339 ms.
Product exploration explored 100000 steps with 33333 reset in 333 ms.
Graph (complete) has 1067 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.21 ms
Knowledge obtained : [p1, p2, p0, p3]
Stuttering acceptance computed with spot in 368 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true, (NOT p1), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 218 ms.
Product exploration explored 100000 steps with 33333 reset in 234 ms.
Applying partial POR strategy [false, false, true, true, false, true, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 365 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true, (NOT p1), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0))]
Support contains 6 out of 466 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 466/466 places, 411/411 transitions.
Graph (trivial) has 211 edges and 466 vertex of which 6 / 466 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 461 transition count 405
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 92 Pre rules applied. Total rules applied 47 place count 461 transition count 589
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 1 with 92 rules applied. Total rules applied 139 place count 461 transition count 589
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 153 place count 447 transition count 539
Deduced a syphon composed of 124 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 167 place count 447 transition count 539
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 253 places in 0 ms
Iterating global reduction 1 with 129 rules applied. Total rules applied 296 place count 447 transition count 539
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 330 place count 413 transition count 505
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 364 place count 413 transition count 505
Deduced a syphon composed of 219 places in 0 ms
Applied a total of 364 rules in 135 ms. Remains 413 /466 variables (removed 53) and now considering 505/411 (removed -94) transitions.
[2021-05-09 07:47:15] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 505 rows 413 cols
[2021-05-09 07:47:15] [INFO ] Computed 94 place invariants in 6 ms
[2021-05-09 07:47:16] [INFO ] Dead Transitions using invariants and state equation in 375 ms returned []
Finished structural reductions, in 1 iterations. Remains : 413/466 places, 505/411 transitions.
Product exploration explored 100000 steps with 33333 reset in 1160 ms.
Product exploration explored 100000 steps with 33333 reset in 952 ms.
[2021-05-09 07:47:18] [INFO ] Flatten gal took : 39 ms
[2021-05-09 07:47:18] [INFO ] Flatten gal took : 58 ms
[2021-05-09 07:47:18] [INFO ] Time to serialize gal into /tmp/LTL5511939847299564735.gal : 45 ms
[2021-05-09 07:47:18] [INFO ] Time to serialize properties into /tmp/LTL17975324907981317818.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/LTL5511939847299564735.gal, -t, CGAL, -LTL, /tmp/LTL17975324907981317818.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/LTL5511939847299564735.gal -t CGAL -LTL /tmp/LTL17975324907981317818.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X("(p206!=1)"))U((G((X("(p206!=1)"))||(G("(((p189!=1)||(p412!=1))||(p600!=1))"))))||(((X("(p206!=1)"))||(G("(((p189!=1)||(p412!=1))||(p600!=1))")))&&(("(p256!=1)")||(X(("(((p189!=1)||(p412!=1))||(p600!=1))")&&(F("(p184!=1)"))))))))))
Formula 0 simplified : !X(X"(p206!=1)" U (G(X"(p206!=1)" | G"(((p189!=1)||(p412!=1))||(p600!=1))") | ((X"(p206!=1)" | G"(((p189!=1)||(p412!=1))||(p600!=1))") & ("(p256!=1)" | X("(((p189!=1)||(p412!=1))||(p600!=1))" & F"(p184!=1)")))))
Detected timeout of ITS tools.
[2021-05-09 07:47:33] [INFO ] Flatten gal took : 18 ms
[2021-05-09 07:47:33] [INFO ] Applying decomposition
[2021-05-09 07:47:33] [INFO ] Flatten gal took : 17 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/graph12411119093382123275.txt, -o, /tmp/graph12411119093382123275.bin, -w, /tmp/graph12411119093382123275.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/graph12411119093382123275.bin, -l, -1, -v, -w, /tmp/graph12411119093382123275.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:47:33] [INFO ] Decomposing Gal with order
[2021-05-09 07:47:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:47:33] [INFO ] Removed a total of 276 redundant transitions.
[2021-05-09 07:47:33] [INFO ] Flatten gal took : 108 ms
[2021-05-09 07:47:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 22 ms.
[2021-05-09 07:47:34] [INFO ] Time to serialize gal into /tmp/LTL14160007880725496906.gal : 23 ms
[2021-05-09 07:47:34] [INFO ] Time to serialize properties into /tmp/LTL4901384686549122540.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/LTL14160007880725496906.gal, -t, CGAL, -LTL, /tmp/LTL4901384686549122540.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/LTL14160007880725496906.gal -t CGAL -LTL /tmp/LTL4901384686549122540.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X("(i8.i0.u64.p206!=1)"))U((G((X("(i8.i0.u64.p206!=1)"))||(G("(((i8.i0.u54.p189!=1)||(i8.i0.u119.p412!=1))||(i8.i1.u153.p600!=1))"))))||(((X("(i8.i0.u64.p206!=1)"))||(G("(((i8.i0.u54.p189!=1)||(i8.i0.u119.p412!=1))||(i8.i1.u153.p600!=1))")))&&(("(i11.i0.u81.p256!=1)")||(X(("(((i8.i0.u54.p189!=1)||(i8.i0.u119.p412!=1))||(i8.i1.u153.p600!=1))")&&(F("(i8.i0.u57.p184!=1)"))))))))))
Formula 0 simplified : !X(X"(i8.i0.u64.p206!=1)" U (G(X"(i8.i0.u64.p206!=1)" | G"(((i8.i0.u54.p189!=1)||(i8.i0.u119.p412!=1))||(i8.i1.u153.p600!=1))") | ((X"(i8.i0.u64.p206!=1)" | G"(((i8.i0.u54.p189!=1)||(i8.i0.u119.p412!=1))||(i8.i1.u153.p600!=1))") & ("(i11.i0.u81.p256!=1)" | X("(((i8.i0.u54.p189!=1)||(i8.i0.u119.p412!=1))||(i8.i1.u153.p600!=1))" & F"(i8.i0.u57.p184!=1)")))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14171082483348692192
[2021-05-09 07:47:49] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14171082483348692192
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14171082483348692192]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14171082483348692192] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14171082483348692192] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BusinessProcesses-PT-14-02 finished in 38388 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 425/425 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 479 transition count 376
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 98 place count 431 transition count 374
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 429 transition count 374
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 100 place count 429 transition count 269
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 227 rules applied. Total rules applied 327 place count 307 transition count 269
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 337 place count 297 transition count 259
Ensure Unique test removed 1 places
Iterating global reduction 3 with 11 rules applied. Total rules applied 348 place count 296 transition count 259
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 606 place count 165 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 607 place count 165 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 608 place count 164 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 609 place count 163 transition count 130
Applied a total of 609 rules in 47 ms. Remains 163 /480 variables (removed 317) and now considering 130/425 (removed 295) transitions.
// Phase 1: matrix 130 rows 163 cols
[2021-05-09 07:47:50] [INFO ] Computed 71 place invariants in 2 ms
[2021-05-09 07:47:50] [INFO ] Implicit Places using invariants in 192 ms returned [0, 1, 2, 3, 4, 5, 6, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 194 ms to find 19 implicit places.
[2021-05-09 07:47:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 130 rows 144 cols
[2021-05-09 07:47:50] [INFO ] Computed 52 place invariants in 4 ms
[2021-05-09 07:47:50] [INFO ] Dead Transitions using invariants and state equation in 318 ms returned []
Starting structural reductions, iteration 1 : 144/480 places, 130/425 transitions.
Applied a total of 0 rules in 3 ms. Remains 144 /144 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2021-05-09 07:47:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 130 rows 144 cols
[2021-05-09 07:47:50] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 07:47:51] [INFO ] Dead Transitions using invariants and state equation in 214 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/480 places, 130/425 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s68 1) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-03 finished in 937 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 471 transition count 416
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 471 transition count 416
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 469 transition count 414
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 469 transition count 414
Applied a total of 22 rules in 21 ms. Remains 469 /480 variables (removed 11) and now considering 414/425 (removed 11) transitions.
// Phase 1: matrix 414 rows 469 cols
[2021-05-09 07:47:51] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:47:51] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 414 rows 469 cols
[2021-05-09 07:47:51] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:47:51] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
// Phase 1: matrix 414 rows 469 cols
[2021-05-09 07:47:51] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:47:52] [INFO ] Dead Transitions using invariants and state equation in 200 ms returned []
Finished structural reductions, in 1 iterations. Remains : 469/480 places, 414/425 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-14-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s387 1), p1:(AND (EQ s270 1) (EQ s399 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][false, false, false]]
Stuttering criterion allowed to conclude after 158 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-04 finished in 1048 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((F(p0)&&F(G(p1)))) U p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 469 transition count 414
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 469 transition count 414
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 466 transition count 411
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 466 transition count 411
Applied a total of 28 rules in 20 ms. Remains 466 /480 variables (removed 14) and now considering 411/425 (removed 14) transitions.
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:47:52] [INFO ] Computed 94 place invariants in 2 ms
[2021-05-09 07:47:52] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:47:52] [INFO ] Computed 94 place invariants in 2 ms
[2021-05-09 07:47:52] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:47:52] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:47:53] [INFO ] Dead Transitions using invariants and state equation in 267 ms returned []
Finished structural reductions, in 1 iterations. Remains : 466/480 places, 411/425 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-14-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s13 1), p0:(OR (NEQ s203 1) (NEQ s365 1) (NEQ s429 1)), p1:(NEQ s403 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 718 reset in 301 ms.
Stack based approach found an accepted trace after 6663 steps with 49 reset with depth 5 and stack size 5 in 27 ms.
FORMULA BusinessProcesses-PT-14-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-05 finished in 1376 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 469 transition count 414
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 469 transition count 414
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 466 transition count 411
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 466 transition count 411
Applied a total of 28 rules in 37 ms. Remains 466 /480 variables (removed 14) and now considering 411/425 (removed 14) transitions.
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:47:53] [INFO ] Computed 94 place invariants in 6 ms
[2021-05-09 07:47:53] [INFO ] Implicit Places using invariants in 231 ms returned []
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:47:53] [INFO ] Computed 94 place invariants in 4 ms
[2021-05-09 07:47:54] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:47:54] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:47:54] [INFO ] Dead Transitions using invariants and state equation in 279 ms returned []
Finished structural reductions, in 1 iterations. Remains : 466/480 places, 411/425 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s238 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 120 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-06 finished in 1250 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))||G(((p2 U ((p2&&G(p0))||G(p2)))||p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 471 transition count 416
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 471 transition count 416
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 468 transition count 413
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 468 transition count 413
Applied a total of 24 rules in 35 ms. Remains 468 /480 variables (removed 12) and now considering 413/425 (removed 12) transitions.
// Phase 1: matrix 413 rows 468 cols
[2021-05-09 07:47:54] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:47:55] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 413 rows 468 cols
[2021-05-09 07:47:55] [INFO ] Computed 94 place invariants in 2 ms
[2021-05-09 07:47:55] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
// Phase 1: matrix 413 rows 468 cols
[2021-05-09 07:47:55] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:47:55] [INFO ] Dead Transitions using invariants and state equation in 200 ms returned []
Finished structural reductions, in 1 iterations. Remains : 468/480 places, 413/425 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-14-07 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(OR (NEQ s34 1) (NEQ s268 1) (NEQ s433 1)), p2:(NEQ s387 1), p0:(NEQ s426 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 680 reset in 165 ms.
Product exploration explored 100000 steps with 680 reset in 212 ms.
Graph (complete) has 1071 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [p1, p2, p0]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 681 reset in 184 ms.
Product exploration explored 100000 steps with 680 reset in 202 ms.
Applying partial POR strategy [true, true, true, false]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 5 out of 468 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 468/468 places, 413/413 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 468 transition count 413
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 97 Pre rules applied. Total rules applied 46 place count 468 transition count 629
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 143 place count 468 transition count 629
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 157 place count 454 transition count 579
Deduced a syphon composed of 129 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 171 place count 454 transition count 579
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 260 places in 1 ms
Iterating global reduction 1 with 131 rules applied. Total rules applied 302 place count 454 transition count 579
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 334 place count 422 transition count 547
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 366 place count 422 transition count 547
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 368 place count 422 transition count 551
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 369 place count 422 transition count 550
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 371 place count 420 transition count 546
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 373 place count 420 transition count 546
Deduced a syphon composed of 228 places in 1 ms
Applied a total of 373 rules in 140 ms. Remains 420 /468 variables (removed 48) and now considering 546/413 (removed -133) transitions.
[2021-05-09 07:47:57] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 546 rows 420 cols
[2021-05-09 07:47:57] [INFO ] Computed 94 place invariants in 4 ms
[2021-05-09 07:47:57] [INFO ] Dead Transitions using invariants and state equation in 454 ms returned []
Finished structural reductions, in 1 iterations. Remains : 420/468 places, 546/413 transitions.
Product exploration explored 100000 steps with 9698 reset in 477 ms.
Product exploration explored 100000 steps with 9678 reset in 428 ms.
[2021-05-09 07:47:58] [INFO ] Flatten gal took : 14 ms
[2021-05-09 07:47:58] [INFO ] Flatten gal took : 13 ms
[2021-05-09 07:47:58] [INFO ] Time to serialize gal into /tmp/LTL5978928486741186012.gal : 3 ms
[2021-05-09 07:47:58] [INFO ] Time to serialize properties into /tmp/LTL3577617285528189404.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/LTL5978928486741186012.gal, -t, CGAL, -LTL, /tmp/LTL3577617285528189404.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/LTL5978928486741186012.gal -t CGAL -LTL /tmp/LTL3577617285528189404.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(p576!=1)")))||(G(("(((p35!=1)||(p316!=1))||(p589!=1))")||(("(p479!=1)")U((("(p479!=1)")&&(G("(p576!=1)")))||(G("(p479!=1)")))))))))
Formula 0 simplified : !X(FG"(p576!=1)" | G("(((p35!=1)||(p316!=1))||(p589!=1))" | ("(p479!=1)" U (("(p479!=1)" & G"(p576!=1)") | G"(p479!=1)"))))
Detected timeout of ITS tools.
[2021-05-09 07:48:13] [INFO ] Flatten gal took : 33 ms
[2021-05-09 07:48:13] [INFO ] Applying decomposition
[2021-05-09 07:48:13] [INFO ] Flatten gal took : 14 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/graph4393477322304377174.txt, -o, /tmp/graph4393477322304377174.bin, -w, /tmp/graph4393477322304377174.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/graph4393477322304377174.bin, -l, -1, -v, -w, /tmp/graph4393477322304377174.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:48:13] [INFO ] Decomposing Gal with order
[2021-05-09 07:48:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:48:13] [INFO ] Removed a total of 272 redundant transitions.
[2021-05-09 07:48:13] [INFO ] Flatten gal took : 33 ms
[2021-05-09 07:48:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 13 ms.
[2021-05-09 07:48:13] [INFO ] Time to serialize gal into /tmp/LTL5649255542538837217.gal : 15 ms
[2021-05-09 07:48:13] [INFO ] Time to serialize properties into /tmp/LTL18355949170934022718.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/LTL5649255542538837217.gal, -t, CGAL, -LTL, /tmp/LTL18355949170934022718.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/LTL5649255542538837217.gal -t CGAL -LTL /tmp/LTL18355949170934022718.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(i17.u123.p576!=1)")))||(G(("(((i5.i0.u14.p35!=1)||(i15.i1.u97.p316!=1))||(i17.u123.p589!=1))")||(("(i15.i0.u128.p479!=1)")U((("(i15.i0.u128.p479!=1)")&&(G("(i17.u123.p576!=1)")))||(G("(i15.i0.u128.p479!=1)")))))))))
Formula 0 simplified : !X(FG"(i17.u123.p576!=1)" | G("(((i5.i0.u14.p35!=1)||(i15.i1.u97.p316!=1))||(i17.u123.p589!=1))" | ("(i15.i0.u128.p479!=1)" U (("(i15.i0.u128.p479!=1)" & G"(i17.u123.p576!=1)") | G"(i15.i0.u128.p479!=1)"))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12184178537997601849
[2021-05-09 07:48:28] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12184178537997601849
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12184178537997601849]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12184178537997601849] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12184178537997601849] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BusinessProcesses-PT-14-07 finished in 35074 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 227 edges and 480 vertex of which 6 / 480 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 474 transition count 367
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 423 transition count 367
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 103 place count 423 transition count 266
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 322 place count 305 transition count 266
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 331 place count 296 transition count 257
Ensure Unique test removed 1 places
Iterating global reduction 2 with 10 rules applied. Total rules applied 341 place count 295 transition count 257
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 1 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 597 place count 165 transition count 131
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 599 place count 164 transition count 135
Applied a total of 599 rules in 53 ms. Remains 164 /480 variables (removed 316) and now considering 135/425 (removed 290) transitions.
// Phase 1: matrix 135 rows 164 cols
[2021-05-09 07:48:29] [INFO ] Computed 72 place invariants in 1 ms
[2021-05-09 07:48:30] [INFO ] Implicit Places using invariants in 125 ms returned [1, 4, 5, 6, 7, 8, 15, 16, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 127 ms to find 19 implicit places.
[2021-05-09 07:48:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 135 rows 145 cols
[2021-05-09 07:48:30] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 07:48:30] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Starting structural reductions, iteration 1 : 145/480 places, 135/425 transitions.
Applied a total of 0 rules in 7 ms. Remains 145 /145 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2021-05-09 07:48:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 135 rows 145 cols
[2021-05-09 07:48:30] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 07:48:30] [INFO ] Dead Transitions using invariants and state equation in 171 ms returned []
Finished structural reductions, in 2 iterations. Remains : 145/480 places, 135/425 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-09 finished in 653 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 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 227 edges and 480 vertex of which 6 / 480 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 474 transition count 367
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 423 transition count 367
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 103 place count 423 transition count 266
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 322 place count 305 transition count 266
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 331 place count 296 transition count 257
Ensure Unique test removed 1 places
Iterating global reduction 2 with 10 rules applied. Total rules applied 341 place count 295 transition count 257
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 597 place count 165 transition count 131
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 599 place count 164 transition count 135
Applied a total of 599 rules in 35 ms. Remains 164 /480 variables (removed 316) and now considering 135/425 (removed 290) transitions.
// Phase 1: matrix 135 rows 164 cols
[2021-05-09 07:48:30] [INFO ] Computed 72 place invariants in 15 ms
[2021-05-09 07:48:30] [INFO ] Implicit Places using invariants in 188 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 189 ms to find 20 implicit places.
[2021-05-09 07:48:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 135 rows 144 cols
[2021-05-09 07:48:30] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-09 07:48:30] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Starting structural reductions, iteration 1 : 144/480 places, 135/425 transitions.
Applied a total of 0 rules in 3 ms. Remains 144 /144 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2021-05-09 07:48:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 135 rows 144 cols
[2021-05-09 07:48:30] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 07:48:30] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/480 places, 135/425 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s93 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 626 steps with 132 reset in 4 ms.
FORMULA BusinessProcesses-PT-14-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-10 finished in 467 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0 U (p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 470 transition count 415
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 470 transition count 415
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 468 transition count 413
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 468 transition count 413
Applied a total of 24 rules in 15 ms. Remains 468 /480 variables (removed 12) and now considering 413/425 (removed 12) transitions.
// Phase 1: matrix 413 rows 468 cols
[2021-05-09 07:48:31] [INFO ] Computed 94 place invariants in 2 ms
[2021-05-09 07:48:31] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 413 rows 468 cols
[2021-05-09 07:48:31] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:48:31] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
// Phase 1: matrix 413 rows 468 cols
[2021-05-09 07:48:31] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:48:31] [INFO ] Dead Transitions using invariants and state equation in 231 ms returned []
Finished structural reductions, in 1 iterations. Remains : 468/480 places, 413/425 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-14-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p2:(EQ s398 1), p0:(OR (EQ s398 0) (EQ s252 0)), p1:(AND (EQ s152 1) (EQ s423 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]]
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-12 finished in 905 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (p1 U X(X(X(G(!p1))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 469 transition count 414
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 469 transition count 414
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 466 transition count 411
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 466 transition count 411
Applied a total of 28 rules in 15 ms. Remains 466 /480 variables (removed 14) and now considering 411/425 (removed 14) transitions.
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:48:31] [INFO ] Computed 94 place invariants in 2 ms
[2021-05-09 07:48:32] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:48:32] [INFO ] Computed 94 place invariants in 2 ms
[2021-05-09 07:48:32] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:48:32] [INFO ] Computed 94 place invariants in 2 ms
[2021-05-09 07:48:32] [INFO ] Dead Transitions using invariants and state equation in 184 ms returned []
Finished structural reductions, in 1 iterations. Remains : 466/480 places, 411/425 transitions.
Stuttering acceptance computed with spot in 197 ms :[p1, p1, (AND p1 (NOT p0)), p1, p1, true, p1, (AND (NOT p0) p1), p1, (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 8}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 8}, { cond=(AND p1 p0), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 9}, { cond=(AND p1 p0), acceptance={} source=9 dest: 10}], [{ cond=(NOT p0), acceptance={} source=10 dest: 5}, { cond=p0, acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(AND (EQ s182 1) (EQ s276 1) (EQ s431 1)), p1:(EQ s195 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3650 steps with 25 reset in 6 ms.
FORMULA BusinessProcesses-PT-14-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-14 finished in 932 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(!p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 225 edges and 480 vertex of which 6 / 480 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 474 transition count 368
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 424 transition count 367
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 423 transition count 367
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 103 place count 423 transition count 265
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 324 place count 304 transition count 265
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 333 place count 295 transition count 256
Ensure Unique test removed 1 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 343 place count 294 transition count 256
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 591 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 593 place count 167 transition count 138
Applied a total of 593 rules in 21 ms. Remains 167 /480 variables (removed 313) and now considering 138/425 (removed 287) transitions.
// Phase 1: matrix 138 rows 167 cols
[2021-05-09 07:48:32] [INFO ] Computed 72 place invariants in 2 ms
[2021-05-09 07:48:33] [INFO ] Implicit Places using invariants in 143 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 144 ms to find 19 implicit places.
[2021-05-09 07:48:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 138 rows 148 cols
[2021-05-09 07:48:33] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 07:48:33] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Starting structural reductions, iteration 1 : 148/480 places, 138/425 transitions.
Applied a total of 0 rules in 2 ms. Remains 148 /148 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2021-05-09 07:48:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 138 rows 148 cols
[2021-05-09 07:48:33] [INFO ] Computed 53 place invariants in 0 ms
[2021-05-09 07:48:33] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 2 iterations. Remains : 148/480 places, 138/425 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s121 1), p1:(OR (EQ s48 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-15 finished in 411 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7719418428387943069
[2021-05-09 07:48:33] [INFO ] Computing symmetric may disable matrix : 425 transitions.
[2021-05-09 07:48:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:48:33] [INFO ] Applying decomposition
[2021-05-09 07:48:33] [INFO ] Computing symmetric may enable matrix : 425 transitions.
[2021-05-09 07:48:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:48:33] [INFO ] Flatten gal took : 13 ms
[2021-05-09 07:48:33] [INFO ] Computing Do-Not-Accords matrix : 425 transitions.
[2021-05-09 07:48:33] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:48:33] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7719418428387943069
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7719418428387943069]
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/graph6046588421039717191.txt, -o, /tmp/graph6046588421039717191.bin, -w, /tmp/graph6046588421039717191.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/graph6046588421039717191.bin, -l, -1, -v, -w, /tmp/graph6046588421039717191.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:48:33] [INFO ] Decomposing Gal with order
[2021-05-09 07:48:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:48:33] [INFO ] Removed a total of 266 redundant transitions.
[2021-05-09 07:48:33] [INFO ] Flatten gal took : 60 ms
[2021-05-09 07:48:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-09 07:48:33] [INFO ] Time to serialize gal into /tmp/LTLFireability18396051428348753709.gal : 17 ms
[2021-05-09 07:48:33] [INFO ] Time to serialize properties into /tmp/LTLFireability12021153890548418866.ltl : 9 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability18396051428348753709.gal, -t, CGAL, -LTL, /tmp/LTLFireability12021153890548418866.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/LTLFireability18396051428348753709.gal -t CGAL -LTL /tmp/LTLFireability12021153890548418866.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(((X("(i17.i0.u66.p206!=1)"))||(G(!("(((i17.i1.u58.p189==1)&&(i17.i0.u117.p412==1))&&(i17.i0.u157.p600==1))"))))U(((("(i10.i1.u80.p256!=1)")||(X((!("(((i17.i1.u58.p189==1)&&(i17.i0.u117.p412==1))&&(i17.i0.u157.p600==1))"))&&(F("(i17.i0.u57.p184!=1)")))))&&((X("(i17.i0.u66.p206!=1)"))||(G(!("(((i17.i1.u58.p189==1)&&(i17.i0.u117.p412==1))&&(i17.i0.u157.p600==1))")))))||(G((X("(i17.i0.u66.p206!=1)"))||(G(!("(((i17.i1.u58.p189==1)&&(i17.i0.u117.p412==1))&&(i17.i0.u157.p600==1))")))))))))
Formula 0 simplified : !X((X"(i17.i0.u66.p206!=1)" | G!"(((i17.i1.u58.p189==1)&&(i17.i0.u117.p412==1))&&(i17.i0.u157.p600==1))") U (((X"(i17.i0.u66.p206!=1)" | G!"(((i17.i1.u58.p189==1)&&(i17.i0.u117.p412==1))&&(i17.i0.u157.p600==1))") & ("(i10.i1.u80.p256!=1)" | X(!"(((i17.i1.u58.p189==1)&&(i17.i0.u117.p412==1))&&(i17.i0.u157.p600==1))" & F"(i17.i0.u57.p184!=1)"))) | G(X"(i17.i0.u66.p206!=1)" | G!"(((i17.i1.u58.p189==1)&&(i17.i0.u117.p412==1))&&(i17.i0.u157.p600==1))")))
Compilation finished in 2582 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7719418428387943069]
Link finished in 108 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((X((LTLAPp0==true)) U ([]((X((LTLAPp0==true))||[]((LTLAPp1==true))))||((X((LTLAPp0==true))||[]((LTLAPp1==true)))&&((LTLAPp2==true)||X(((LTLAPp1==true)&&<>((LTLAPp3==true))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7719418428387943069]
LTSmin run took 3350 ms.
FORMULA BusinessProcesses-PT-14-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>([]((LTLAPp4==true)))||[]((((LTLAPp6==true) U (((LTLAPp6==true)&&[]((LTLAPp4==true)))||[]((LTLAPp6==true))))||(LTLAPp5==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7719418428387943069]
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t286, t366, t408, t422, t533, t534, t543, t544, i0.i0.u75.t289, i0.i0.u79.t276, i0.i1.u77.t279, i0.i2.t150, i0.i2.u124.t151, i1.u99.t245, i1.u100.t241, i2.u49.t335, i2.u51.t331, i3.i0.u43.t347, i3.i0.u47.t339, i3.i1.u45.t343, i4.t402, i4.u19.t415, i4.u21.t405, i4.u22.t406, i5.i0.t416, i5.i0.u13.t430, i5.i0.u17.t420, i5.i0.u18.t419, i5.i0.u130.t114, i5.i0.u130.t118, i5.i1.t432, i5.i1.u14.t428, i6.i0.u23.t401, i6.i1.u25.t395, i7.i1.u110.t201, i7.i1.u111.t197, i7.i1.u112.t193, i8.i0.u27.t389, i8.i0.u35.t361, i8.i1.u33.t365, i9.i0.u41.t351, i9.i1.u37.t357, i9.i2.u113.t189, i9.i2.u114.t185, i9.i2.u115.t181, i10.i0.u119.t165, i10.i1.u120.t161, i10.i1.u121.t157, i10.i1.u122.t153, i11.t290, i11.i0.u69.t301, i11.i1.u73.t293, i12.i0.t383, i12.i1.u108.t209, i12.i1.u109.t205, i12.i2.u106.t217, i12.i2.u107.t213, i13.i0.u71.t297, i13.i1.u101.t237, i13.i1.u102.t233, i13.i1.u103.t229, i13.i1.u104.t225, i13.i1.u105.t221, i14.i0.u15.t424, i14.i0.u15.t426, i14.i0.u15.t427, i14.i1.u96.t257, i14.i1.u97.t253, i14.i1.u98.t249, i15.u92.t272, i15.u93.t269, i16.t86, i16.t77, i16.t57, i16.t6, i16.u125.t22, i16.u125.t68, i16.u125.t108, i16.u125.t143, i17.t3, i17.t2, i17.i0.t5, i17.i0.u54.t308, i17.i0.u54.t317, i17.i0.u54.t327, i17.i0.u117.t173, i17.i0.u118.t169, i17.i1.u116.t177, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/297/92/425
Computing Next relation with stutter on 1206 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
3175 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,31.8382,620748,1,0,1.17794e+06,947,6903,1.98758e+06,326,2746,3165909
no accepting run found
Formula 0 is TRUE no accepting run found.
Checking formula 1 : !((X((F(G("(i16.u125.p576!=1)")))||(G((!("(((i14.i0.u15.p35==1)&&(i14.i1.u98.p316==1))&&(i16.u125.p589==1))"))||(("(i5.i0.u130.p479!=1)")U((("(i5.i0.u130.p479!=1)")&&(G("(i16.u125.p576!=1)")))||(G("(i5.i0.u130.p479!=1)")))))))))
Formula 1 simplified : !X(FG"(i16.u125.p576!=1)" | G(!"(((i14.i0.u15.p35==1)&&(i14.i1.u98.p316==1))&&(i16.u125.p589==1))" | ("(i5.i0.u130.p479!=1)" U (("(i5.i0.u130.p479!=1)" & G"(i16.u125.p576!=1)") | G"(i5.i0.u130.p479!=1)"))))
Computing Next relation with stutter on 1206 deadlock states
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>([]((LTLAPp4==true)))||[]((((LTLAPp6==true) U (((LTLAPp6==true)&&[]((LTLAPp4==true)))||[]((LTLAPp6==true))))||(LTLAPp5==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7719418428387943069]
Retrying LTSmin with larger timeout 2400 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>([]((LTLAPp4==true)))||[]((((LTLAPp6==true) U (((LTLAPp6==true)&&[]((LTLAPp4==true)))||[]((LTLAPp6==true))))||(LTLAPp5==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7719418428387943069]
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
44489 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,476.742,6125144,1,0,1.09749e+07,1145,7991,1.49333e+07,360,4184,19453403
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-14-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620547710727

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-14"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-14, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143900429"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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