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-162038143900461.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 177K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-18-00
FORMULA_NAME BusinessProcesses-PT-18-01
FORMULA_NAME BusinessProcesses-PT-18-02
FORMULA_NAME BusinessProcesses-PT-18-03
FORMULA_NAME BusinessProcesses-PT-18-04
FORMULA_NAME BusinessProcesses-PT-18-05
FORMULA_NAME BusinessProcesses-PT-18-06
FORMULA_NAME BusinessProcesses-PT-18-07
FORMULA_NAME BusinessProcesses-PT-18-08
FORMULA_NAME BusinessProcesses-PT-18-09
FORMULA_NAME BusinessProcesses-PT-18-10
FORMULA_NAME BusinessProcesses-PT-18-11
FORMULA_NAME BusinessProcesses-PT-18-12
FORMULA_NAME BusinessProcesses-PT-18-13
FORMULA_NAME BusinessProcesses-PT-18-14
FORMULA_NAME BusinessProcesses-PT-18-15

=== Now, execution of the tool begins

BK_START 1620548431347

Running Version 0
[2021-05-09 08:20:32] [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 08:20:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:20:33] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2021-05-09 08:20:33] [INFO ] Transformed 717 places.
[2021-05-09 08:20:33] [INFO ] Transformed 642 transitions.
[2021-05-09 08:20:33] [INFO ] Found NUPN structural information;
[2021-05-09 08:20:33] [INFO ] Parsed PT model containing 717 places and 642 transitions in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 08:20:33] [INFO ] Initial state test concluded for 5 properties.
Deduced a syphon composed of 15 places in 15 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 702 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 108 place count 594 transition count 527
Iterating global reduction 1 with 100 rules applied. Total rules applied 208 place count 594 transition count 527
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 209 place count 594 transition count 526
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 258 place count 545 transition count 477
Iterating global reduction 2 with 49 rules applied. Total rules applied 307 place count 545 transition count 477
Applied a total of 307 rules in 129 ms. Remains 545 /702 variables (removed 157) and now considering 477/627 (removed 150) transitions.
// Phase 1: matrix 477 rows 545 cols
[2021-05-09 08:20:33] [INFO ] Computed 106 place invariants in 32 ms
[2021-05-09 08:20:33] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 477 rows 545 cols
[2021-05-09 08:20:33] [INFO ] Computed 106 place invariants in 25 ms
[2021-05-09 08:20:34] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
// Phase 1: matrix 477 rows 545 cols
[2021-05-09 08:20:34] [INFO ] Computed 106 place invariants in 6 ms
[2021-05-09 08:20:34] [INFO ] Dead Transitions using invariants and state equation in 269 ms returned []
Finished structural reductions, in 1 iterations. Remains : 545/702 places, 477/627 transitions.
[2021-05-09 08:20:34] [INFO ] Flatten gal took : 75 ms
[2021-05-09 08:20:34] [INFO ] Flatten gal took : 33 ms
[2021-05-09 08:20:34] [INFO ] Input system was already deterministic with 477 transitions.
Incomplete random walk after 100000 steps, including 533 resets, run finished after 392 ms. (steps per millisecond=255 ) properties (out of 25) seen :15
Running SMT prover for 10 properties.
// Phase 1: matrix 477 rows 545 cols
[2021-05-09 08:20:35] [INFO ] Computed 106 place invariants in 11 ms
[2021-05-09 08:20:35] [INFO ] [Real]Absence check using 65 positive place invariants in 23 ms returned sat
[2021-05-09 08:20:35] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:35] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2021-05-09 08:20:36] [INFO ] Deduced a trap composed of 103 places in 192 ms of which 10 ms to minimize.
[2021-05-09 08:20:36] [INFO ] Deduced a trap composed of 109 places in 167 ms of which 3 ms to minimize.
[2021-05-09 08:20:36] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 1 ms to minimize.
[2021-05-09 08:20:36] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 1 ms to minimize.
[2021-05-09 08:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 949 ms
[2021-05-09 08:20:36] [INFO ] [Real]Absence check using 65 positive place invariants in 26 ms returned sat
[2021-05-09 08:20:36] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:20:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:37] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2021-05-09 08:20:37] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2021-05-09 08:20:37] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2021-05-09 08:20:37] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2021-05-09 08:20:37] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 0 ms to minimize.
[2021-05-09 08:20:37] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2021-05-09 08:20:37] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2021-05-09 08:20:37] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 0 ms to minimize.
[2021-05-09 08:20:37] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2021-05-09 08:20:37] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2021-05-09 08:20:37] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2021-05-09 08:20:37] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 0 ms to minimize.
[2021-05-09 08:20:38] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2021-05-09 08:20:38] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2021-05-09 08:20:38] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2021-05-09 08:20:38] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1143 ms
[2021-05-09 08:20:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:38] [INFO ] [Nat]Absence check using 65 positive place invariants in 24 ms returned sat
[2021-05-09 08:20:38] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:20:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:38] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2021-05-09 08:20:38] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2021-05-09 08:20:38] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2021-05-09 08:20:38] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2021-05-09 08:20:38] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2021-05-09 08:20:38] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2021-05-09 08:20:39] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2021-05-09 08:20:39] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2021-05-09 08:20:39] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:20:39] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2021-05-09 08:20:39] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2021-05-09 08:20:39] [INFO ] Deduced a trap composed of 47 places in 443 ms of which 0 ms to minimize.
[2021-05-09 08:20:39] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2021-05-09 08:20:40] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:20:40] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 0 ms to minimize.
[2021-05-09 08:20:40] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1535 ms
[2021-05-09 08:20:40] [INFO ] Computed and/alt/rep : 471/967/471 causal constraints (skipped 5 transitions) in 36 ms.
[2021-05-09 08:20:42] [INFO ] Added : 300 causal constraints over 60 iterations in 2085 ms. Result :sat
[2021-05-09 08:20:42] [INFO ] [Real]Absence check using 65 positive place invariants in 24 ms returned sat
[2021-05-09 08:20:42] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 08:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:42] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2021-05-09 08:20:42] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 1 ms to minimize.
[2021-05-09 08:20:42] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 1 ms to minimize.
[2021-05-09 08:20:43] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 5 ms to minimize.
[2021-05-09 08:20:43] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:20:43] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:20:43] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:20:43] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:20:43] [INFO ] Deduced a trap composed of 99 places in 146 ms of which 1 ms to minimize.
[2021-05-09 08:20:43] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:20:44] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 0 ms to minimize.
[2021-05-09 08:20:44] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:20:44] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 0 ms to minimize.
[2021-05-09 08:20:44] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 0 ms to minimize.
[2021-05-09 08:20:44] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:20:44] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2021-05-09 08:20:44] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2021-05-09 08:20:44] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2350 ms
[2021-05-09 08:20:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:44] [INFO ] [Nat]Absence check using 65 positive place invariants in 22 ms returned sat
[2021-05-09 08:20:44] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 08:20:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:45] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2021-05-09 08:20:45] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2021-05-09 08:20:45] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:20:45] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2021-05-09 08:20:45] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:20:45] [INFO ] Deduced a trap composed of 95 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:20:45] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:20:45] [INFO ] Deduced a trap composed of 99 places in 69 ms of which 1 ms to minimize.
[2021-05-09 08:20:45] [INFO ] Deduced a trap composed of 98 places in 73 ms of which 0 ms to minimize.
[2021-05-09 08:20:46] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2021-05-09 08:20:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 997 ms
[2021-05-09 08:20:46] [INFO ] Computed and/alt/rep : 471/967/471 causal constraints (skipped 5 transitions) in 19 ms.
[2021-05-09 08:20:48] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 1 ms to minimize.
[2021-05-09 08:20:48] [INFO ] Deduced a trap composed of 99 places in 135 ms of which 0 ms to minimize.
[2021-05-09 08:20:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 426 ms
[2021-05-09 08:20:48] [INFO ] Added : 325 causal constraints over 65 iterations in 2297 ms. Result :sat
[2021-05-09 08:20:48] [INFO ] [Real]Absence check using 65 positive place invariants in 23 ms returned sat
[2021-05-09 08:20:48] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 08:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:48] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-09 08:20:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:48] [INFO ] [Nat]Absence check using 65 positive place invariants in 22 ms returned sat
[2021-05-09 08:20:48] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 08:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:49] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2021-05-09 08:20:49] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:20:49] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:20:49] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:20:49] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2021-05-09 08:20:49] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 1 ms to minimize.
[2021-05-09 08:20:49] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2021-05-09 08:20:49] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2021-05-09 08:20:50] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2021-05-09 08:20:50] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2021-05-09 08:20:50] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2021-05-09 08:20:50] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2021-05-09 08:20:50] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2021-05-09 08:20:50] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2021-05-09 08:20:50] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1383 ms
[2021-05-09 08:20:50] [INFO ] Computed and/alt/rep : 471/967/471 causal constraints (skipped 5 transitions) in 30 ms.
[2021-05-09 08:20:52] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 1 ms to minimize.
[2021-05-09 08:20:52] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:20:52] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 1 ms to minimize.
[2021-05-09 08:20:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 672 ms
[2021-05-09 08:20:53] [INFO ] Added : 362 causal constraints over 73 iterations in 2972 ms. Result :sat
[2021-05-09 08:20:53] [INFO ] [Real]Absence check using 65 positive place invariants in 24 ms returned sat
[2021-05-09 08:20:53] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:53] [INFO ] [Real]Absence check using state equation in 209 ms returned unsat
[2021-05-09 08:20:53] [INFO ] [Real]Absence check using 65 positive place invariants in 26 ms returned sat
[2021-05-09 08:20:53] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:54] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2021-05-09 08:20:54] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2021-05-09 08:20:54] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:20:54] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 0 ms to minimize.
[2021-05-09 08:20:54] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2021-05-09 08:20:54] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2021-05-09 08:20:54] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2021-05-09 08:20:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 555 ms
[2021-05-09 08:20:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:54] [INFO ] [Nat]Absence check using 65 positive place invariants in 25 ms returned sat
[2021-05-09 08:20:54] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:20:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:54] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2021-05-09 08:20:55] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 0 ms to minimize.
[2021-05-09 08:20:55] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2021-05-09 08:20:55] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2021-05-09 08:20:55] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2021-05-09 08:20:55] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2021-05-09 08:20:55] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2021-05-09 08:20:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 487 ms
[2021-05-09 08:20:55] [INFO ] Computed and/alt/rep : 471/967/471 causal constraints (skipped 5 transitions) in 27 ms.
[2021-05-09 08:20:57] [INFO ] Added : 265 causal constraints over 53 iterations in 1832 ms. Result :sat
[2021-05-09 08:20:57] [INFO ] [Real]Absence check using 65 positive place invariants in 19 ms returned sat
[2021-05-09 08:20:57] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 08:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:57] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2021-05-09 08:20:57] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2021-05-09 08:20:57] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2021-05-09 08:20:57] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:20:57] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2021-05-09 08:20:58] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:20:58] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:20:58] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2021-05-09 08:20:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 792 ms
[2021-05-09 08:20:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 25 ms returned sat
[2021-05-09 08:20:58] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:20:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:58] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2021-05-09 08:20:58] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:20:58] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:20:59] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:20:59] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:20:59] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:20:59] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2021-05-09 08:20:59] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:20:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 758 ms
[2021-05-09 08:20:59] [INFO ] Computed and/alt/rep : 471/967/471 causal constraints (skipped 5 transitions) in 27 ms.
[2021-05-09 08:21:01] [INFO ] Added : 294 causal constraints over 59 iterations in 2114 ms. Result :sat
[2021-05-09 08:21:01] [INFO ] [Real]Absence check using 65 positive place invariants in 20 ms returned sat
[2021-05-09 08:21:01] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 08:21:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:01] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-09 08:21:01] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:21:02] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2021-05-09 08:21:02] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2021-05-09 08:21:02] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2021-05-09 08:21:02] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2021-05-09 08:21:02] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2021-05-09 08:21:02] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2021-05-09 08:21:02] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 0 ms to minimize.
[2021-05-09 08:21:02] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 0 ms to minimize.
[2021-05-09 08:21:02] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 909 ms
[2021-05-09 08:21:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:02] [INFO ] [Nat]Absence check using 65 positive place invariants in 23 ms returned sat
[2021-05-09 08:21:02] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 08:21:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:03] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2021-05-09 08:21:03] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2021-05-09 08:21:03] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2021-05-09 08:21:03] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2021-05-09 08:21:03] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2021-05-09 08:21:03] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2021-05-09 08:21:03] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:21:03] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2021-05-09 08:21:03] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2021-05-09 08:21:03] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:21:03] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2021-05-09 08:21:03] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 0 ms to minimize.
[2021-05-09 08:21:04] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2021-05-09 08:21:04] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1034 ms
[2021-05-09 08:21:04] [INFO ] Computed and/alt/rep : 471/967/471 causal constraints (skipped 5 transitions) in 30 ms.
[2021-05-09 08:21:06] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 1 ms to minimize.
[2021-05-09 08:21:06] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:21:06] [INFO ] Deduced a trap composed of 96 places in 151 ms of which 1 ms to minimize.
[2021-05-09 08:21:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 658 ms
[2021-05-09 08:21:06] [INFO ] Added : 328 causal constraints over 66 iterations in 2822 ms. Result :sat
[2021-05-09 08:21:06] [INFO ] [Real]Absence check using 65 positive place invariants in 25 ms returned sat
[2021-05-09 08:21:07] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:21:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:07] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-09 08:21:07] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2021-05-09 08:21:07] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2021-05-09 08:21:07] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:21:07] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 1 ms to minimize.
[2021-05-09 08:21:08] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:21:08] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 0 ms to minimize.
[2021-05-09 08:21:08] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:21:08] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:21:08] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:21:08] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:21:08] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:21:09] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:21:09] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:21:09] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2021-05-09 08:21:09] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2021-05-09 08:21:09] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2021-05-09 08:21:09] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2211 ms
[2021-05-09 08:21:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:09] [INFO ] [Nat]Absence check using 65 positive place invariants in 26 ms returned sat
[2021-05-09 08:21:09] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 14 ms returned sat
[2021-05-09 08:21:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:09] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2021-05-09 08:21:09] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2021-05-09 08:21:10] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:21:10] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2021-05-09 08:21:10] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 0 ms to minimize.
[2021-05-09 08:21:10] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2021-05-09 08:21:10] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 1 ms to minimize.
[2021-05-09 08:21:10] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:21:11] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 1 ms to minimize.
[2021-05-09 08:21:11] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2021-05-09 08:21:11] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 0 ms to minimize.
[2021-05-09 08:21:11] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2021-05-09 08:21:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1708 ms
[2021-05-09 08:21:11] [INFO ] Computed and/alt/rep : 471/967/471 causal constraints (skipped 5 transitions) in 31 ms.
[2021-05-09 08:21:13] [INFO ] Added : 298 causal constraints over 60 iterations in 1706 ms. Result :sat
[2021-05-09 08:21:13] [INFO ] [Real]Absence check using 65 positive place invariants in 25 ms returned sat
[2021-05-09 08:21:13] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:21:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:13] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2021-05-09 08:21:13] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:21:13] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:21:13] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:21:14] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:21:14] [INFO ] Deduced a trap composed of 105 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:21:14] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2021-05-09 08:21:14] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2021-05-09 08:21:14] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2021-05-09 08:21:14] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2021-05-09 08:21:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1147 ms
[2021-05-09 08:21:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:14] [INFO ] [Nat]Absence check using 65 positive place invariants in 22 ms returned sat
[2021-05-09 08:21:14] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 08:21:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:14] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2021-05-09 08:21:15] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2021-05-09 08:21:15] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 1 ms to minimize.
[2021-05-09 08:21:15] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 1 ms to minimize.
[2021-05-09 08:21:15] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:21:15] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:21:15] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2021-05-09 08:21:15] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2021-05-09 08:21:15] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2021-05-09 08:21:16] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2021-05-09 08:21:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1151 ms
[2021-05-09 08:21:16] [INFO ] Computed and/alt/rep : 471/967/471 causal constraints (skipped 5 transitions) in 28 ms.
[2021-05-09 08:21:18] [INFO ] Added : 335 causal constraints over 67 iterations in 2156 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(X(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 477/477 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 539 transition count 471
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 539 transition count 471
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 536 transition count 468
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 534 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 533 transition count 465
Applied a total of 24 rules in 199 ms. Remains 533 /545 variables (removed 12) and now considering 465/477 (removed 12) transitions.
// Phase 1: matrix 465 rows 533 cols
[2021-05-09 08:21:18] [INFO ] Computed 106 place invariants in 10 ms
[2021-05-09 08:21:18] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 465 rows 533 cols
[2021-05-09 08:21:18] [INFO ] Computed 106 place invariants in 5 ms
[2021-05-09 08:21:19] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
// Phase 1: matrix 465 rows 533 cols
[2021-05-09 08:21:19] [INFO ] Computed 106 place invariants in 5 ms
[2021-05-09 08:21:19] [INFO ] Dead Transitions using invariants and state equation in 286 ms returned []
Finished structural reductions, in 1 iterations. Remains : 533/545 places, 465/477 transitions.
Stuttering acceptance computed with spot in 330 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-00 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 3}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=5, aps=[p1:(AND (EQ s112 1) (EQ s359 1) (EQ s504 1)), p0:(EQ s495 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29332 steps with 153 reset in 167 ms.
FORMULA BusinessProcesses-PT-18-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-00 finished in 1846 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((X(X(p0)) U (p1 U p2))||X(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 477/477 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 539 transition count 471
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 539 transition count 471
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 536 transition count 468
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 536 transition count 468
Applied a total of 18 rules in 110 ms. Remains 536 /545 variables (removed 9) and now considering 468/477 (removed 9) transitions.
// Phase 1: matrix 468 rows 536 cols
[2021-05-09 08:21:20] [INFO ] Computed 106 place invariants in 4 ms
[2021-05-09 08:21:20] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 468 rows 536 cols
[2021-05-09 08:21:20] [INFO ] Computed 106 place invariants in 4 ms
[2021-05-09 08:21:20] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
// Phase 1: matrix 468 rows 536 cols
[2021-05-09 08:21:21] [INFO ] Computed 106 place invariants in 9 ms
[2021-05-09 08:21:21] [INFO ] Dead Transitions using invariants and state equation in 237 ms returned []
Finished structural reductions, in 1 iterations. Remains : 536/545 places, 468/477 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), false, (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : BusinessProcesses-PT-18-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}], [{ cond=p2, acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s282 1), p1:(OR (EQ s49 0) (EQ s104 0)), p0:(EQ s104 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 18198 reset in 359 ms.
Stack based approach found an accepted trace after 79 steps with 13 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BusinessProcesses-PT-18-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-01 finished in 1777 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))&&G(p1)))], workingDir=/home/mcc/execution]
Support contains 8 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 477/477 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 539 transition count 471
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 539 transition count 471
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 535 transition count 467
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 534 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 532 transition count 464
Applied a total of 26 rules in 139 ms. Remains 532 /545 variables (removed 13) and now considering 464/477 (removed 13) transitions.
// Phase 1: matrix 464 rows 532 cols
[2021-05-09 08:21:22] [INFO ] Computed 106 place invariants in 4 ms
[2021-05-09 08:21:22] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 464 rows 532 cols
[2021-05-09 08:21:22] [INFO ] Computed 106 place invariants in 7 ms
[2021-05-09 08:21:22] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
// Phase 1: matrix 464 rows 532 cols
[2021-05-09 08:21:22] [INFO ] Computed 106 place invariants in 3 ms
[2021-05-09 08:21:22] [INFO ] Dead Transitions using invariants and state equation in 206 ms returned []
Finished structural reductions, in 1 iterations. Remains : 532/545 places, 464/477 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : BusinessProcesses-PT-18-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (NEQ s38 1) (AND (NEQ s284 1) (OR (NEQ s129 1) (NEQ s353 1) (NEQ s517 1)) (NEQ s38 1))), p0:(OR (NEQ s241 1) (NEQ s320 1) (NEQ s503 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1853 steps with 9 reset in 5 ms.
FORMULA BusinessProcesses-PT-18-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-02 finished in 1091 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 477/477 transitions.
Graph (trivial) has 262 edges and 545 vertex of which 6 / 545 are part of one of the 1 SCC in 4 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 539 transition count 407
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 476 transition count 407
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 116 Pre rules applied. Total rules applied 127 place count 476 transition count 291
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 384 place count 335 transition count 291
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 390 place count 329 transition count 285
Iterating global reduction 2 with 6 rules applied. Total rules applied 396 place count 329 transition count 285
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 328 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 328 transition count 284
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 295 rules applied. Total rules applied 693 place count 179 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 695 place count 178 transition count 141
Applied a total of 695 rules in 73 ms. Remains 178 /545 variables (removed 367) and now considering 141/477 (removed 336) transitions.
// Phase 1: matrix 141 rows 178 cols
[2021-05-09 08:21:23] [INFO ] Computed 78 place invariants in 5 ms
[2021-05-09 08:21:23] [INFO ] Implicit Places using invariants in 263 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 51, 52, 53, 54]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 265 ms to find 27 implicit places.
[2021-05-09 08:21:23] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 141 rows 151 cols
[2021-05-09 08:21:23] [INFO ] Computed 51 place invariants in 2 ms
[2021-05-09 08:21:23] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Starting structural reductions, iteration 1 : 151/545 places, 141/477 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2021-05-09 08:21:23] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 141 rows 151 cols
[2021-05-09 08:21:23] [INFO ] Computed 51 place invariants in 2 ms
[2021-05-09 08:21:23] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Finished structural reductions, in 2 iterations. Remains : 151/545 places, 141/477 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-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:(EQ s26 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 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-03 finished in 612 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)||X(F((X(p1)||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 477/477 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 539 transition count 471
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 539 transition count 471
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 536 transition count 468
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 534 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 533 transition count 465
Applied a total of 24 rules in 74 ms. Remains 533 /545 variables (removed 12) and now considering 465/477 (removed 12) transitions.
// Phase 1: matrix 465 rows 533 cols
[2021-05-09 08:21:23] [INFO ] Computed 106 place invariants in 5 ms
[2021-05-09 08:21:23] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 465 rows 533 cols
[2021-05-09 08:21:23] [INFO ] Computed 106 place invariants in 5 ms
[2021-05-09 08:21:24] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
// Phase 1: matrix 465 rows 533 cols
[2021-05-09 08:21:24] [INFO ] Computed 106 place invariants in 3 ms
[2021-05-09 08:21:24] [INFO ] Dead Transitions using invariants and state equation in 240 ms returned []
Finished structural reductions, in 1 iterations. Remains : 533/545 places, 465/477 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-18-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s45 1), p2:(OR (NEQ s152 1) (NEQ s363 1) (NEQ s504 1)), p1:(EQ s491 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 551 reset in 306 ms.
Product exploration explored 100000 steps with 550 reset in 250 ms.
Graph (complete) has 1202 edges and 533 vertex of which 532 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [(NOT p0), p2, (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 553 reset in 279 ms.
Product exploration explored 100000 steps with 547 reset in 275 ms.
Applying partial POR strategy [true, true, true]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 533 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 533/533 places, 465/465 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 533 transition count 465
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 108 Pre rules applied. Total rules applied 60 place count 533 transition count 713
Deduced a syphon composed of 168 places in 1 ms
Iterating global reduction 1 with 108 rules applied. Total rules applied 168 place count 533 transition count 713
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 189 place count 512 transition count 640
Deduced a syphon composed of 147 places in 2 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 210 place count 512 transition count 640
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 299 places in 0 ms
Iterating global reduction 1 with 152 rules applied. Total rules applied 362 place count 512 transition count 640
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 401 place count 473 transition count 601
Deduced a syphon composed of 260 places in 4 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 440 place count 473 transition count 601
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 262 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 442 place count 473 transition count 616
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 443 place count 473 transition count 615
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 445 place count 471 transition count 611
Deduced a syphon composed of 260 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 447 place count 471 transition count 611
Deduced a syphon composed of 260 places in 0 ms
Applied a total of 447 rules in 146 ms. Remains 471 /533 variables (removed 62) and now considering 611/465 (removed -146) transitions.
[2021-05-09 08:21:26] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 611 rows 471 cols
[2021-05-09 08:21:26] [INFO ] Computed 106 place invariants in 10 ms
[2021-05-09 08:21:26] [INFO ] Dead Transitions using invariants and state equation in 448 ms returned []
Finished structural reductions, in 1 iterations. Remains : 471/533 places, 611/465 transitions.
Product exploration explored 100000 steps with 10657 reset in 505 ms.
Product exploration explored 100000 steps with 10690 reset in 476 ms.
[2021-05-09 08:21:28] [INFO ] Flatten gal took : 38 ms
[2021-05-09 08:21:28] [INFO ] Flatten gal took : 38 ms
[2021-05-09 08:21:28] [INFO ] Time to serialize gal into /tmp/LTL16736805206699219191.gal : 31 ms
[2021-05-09 08:21:28] [INFO ] Time to serialize properties into /tmp/LTL11300415451711430806.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/LTL16736805206699219191.gal, -t, CGAL, -LTL, /tmp/LTL11300415451711430806.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/LTL16736805206699219191.gal -t CGAL -LTL /tmp/LTL11300415451711430806.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("(p47==1)"))||(X(F((X("(p661==1)"))||(G("(((p176!=1)||(p437!=1))||(p688!=1))"))))))))
Formula 0 simplified : !G(F"(p47==1)" | XF(X"(p661==1)" | G"(((p176!=1)||(p437!=1))||(p688!=1))"))
Detected timeout of ITS tools.
[2021-05-09 08:21:43] [INFO ] Flatten gal took : 46 ms
[2021-05-09 08:21:43] [INFO ] Applying decomposition
[2021-05-09 08:21:43] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11962622394001038913.txt, -o, /tmp/graph11962622394001038913.bin, -w, /tmp/graph11962622394001038913.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/graph11962622394001038913.bin, -l, -1, -v, -w, /tmp/graph11962622394001038913.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:21:43] [INFO ] Decomposing Gal with order
[2021-05-09 08:21:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:21:43] [INFO ] Removed a total of 288 redundant transitions.
[2021-05-09 08:21:43] [INFO ] Flatten gal took : 104 ms
[2021-05-09 08:21:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 22 ms.
[2021-05-09 08:21:43] [INFO ] Time to serialize gal into /tmp/LTL5941083766878106872.gal : 14 ms
[2021-05-09 08:21:43] [INFO ] Time to serialize properties into /tmp/LTL7361722243712229769.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/LTL5941083766878106872.gal, -t, CGAL, -LTL, /tmp/LTL7361722243712229769.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/LTL5941083766878106872.gal -t CGAL -LTL /tmp/LTL7361722243712229769.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F("(i15.i1.u18.p47==1)"))||(X(F((X("(i12.i2.u174.p661==1)"))||(G("(((i3.u57.p176!=1)||(i2.i1.u128.p437!=1))||(i12.i2.u146.p688!=1))"))))))))
Formula 0 simplified : !G(F"(i15.i1.u18.p47==1)" | XF(X"(i12.i2.u174.p661==1)" | G"(((i3.u57.p176!=1)||(i2.i1.u128.p437!=1))||(i12.i2.u146.p688!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t305, t313, t360, t377, t380, t453, t458, t460, t462, t463, t465, t468, t473, i0.u86.t195, i1.i0.u82.t203, i1.i0.u84.t199, i1.i0.u143.t75, i1.i1.u144.t72, i2.i0.u61.t246, i2.i0.u63.t241, i2.i0.u64.t240, i2.i1.u127.t123, i2.i1.u128.t120, i2.i1.u129.t117, i3.u57.t254, i3.u59.t250, i4.i0.u40.t276, i4.i1.u34.t288, i4.i1.u38.t280, i5.i1.t309, i5.i1.u21.t316, i5.i1.u23.t312, i5.i1.u116.t156, i5.i2.u115.t159, i5.i2.u117.t153, i5.i2.u118.t150, i6.t289, i6.i0.u29.t300, i6.i1.t296, i7.t1, i7.t0, i7.i0.t2, i7.i0.t3, i7.i0.u42.t257, i7.i0.u42.t272, i7.i0.u125.t129, i7.i0.u126.t126, i7.i1.u123.t135, i8.i0.u65.t236, i8.i0.u66.t235, i8.i1.u130.t114, i8.i1.u131.t111, i8.i1.u132.t108, i8.i1.u133.t105, i9.i0.u69.t228, i9.i0.u71.t224, i9.i1.u67.t232, i9.i2.u136.t96, i9.i2.u137.t93, i9.i2.u138.t90, i9.i3.u134.t102, i9.i3.u135.t99, i10.u73.t220, i10.u75.t216, i11.i0.u80.t207, i11.i0.u81.t206, i11.i1.u78.t212, i11.i1.u139.t87, i11.i1.u140.t84, i11.i2.u141.t81, i11.i2.u142.t78, i12.i0.u90.t185, i12.i1.u88.t188, i12.i2.t19, i13.u36.t284, i13.u121.t141, i13.u122.t138, i13.u124.t132, i14.u113.t168, i15.t323, i15.i0.t317, i15.i0.u15.t330, i15.i0.u19.t322, i15.i1.u17.t326, i15.i2.u109.t180, i15.i2.u110.t177, i15.i2.u111.t174, i16.t301, i16.i0.u25.t308, i16.i1.u27.t304, i16.i1.u119.t147, i16.i1.u120.t144, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/329/96/461
Computing Next relation with stutter on 62480 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14786077524112808587
[2021-05-09 08:21:58] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14786077524112808587
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/ltsmin14786077524112808587]
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/ltsmin14786077524112808587] 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/ltsmin14786077524112808587] 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-18-05 finished in 36307 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 477/477 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 538 transition count 470
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 538 transition count 470
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 534 transition count 466
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 531 transition count 463
Applied a total of 28 rules in 120 ms. Remains 531 /545 variables (removed 14) and now considering 463/477 (removed 14) transitions.
// Phase 1: matrix 463 rows 531 cols
[2021-05-09 08:22:00] [INFO ] Computed 106 place invariants in 4 ms
[2021-05-09 08:22:00] [INFO ] Implicit Places using invariants in 398 ms returned []
// Phase 1: matrix 463 rows 531 cols
[2021-05-09 08:22:00] [INFO ] Computed 106 place invariants in 4 ms
[2021-05-09 08:22:01] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
// Phase 1: matrix 463 rows 531 cols
[2021-05-09 08:22:01] [INFO ] Computed 106 place invariants in 9 ms
[2021-05-09 08:22:01] [INFO ] Dead Transitions using invariants and state equation in 228 ms returned []
Finished structural reductions, in 1 iterations. Remains : 531/545 places, 463/477 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-18-06 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(NEQ s67 0), p0:(EQ s313 0)], 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 145 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-06 finished in 1469 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 477/477 transitions.
Graph (trivial) has 262 edges and 545 vertex of which 6 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 539 transition count 406
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 475 transition count 406
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 129 place count 475 transition count 292
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 381 place count 337 transition count 292
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 387 place count 331 transition count 286
Iterating global reduction 2 with 6 rules applied. Total rules applied 393 place count 331 transition count 286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 330 transition count 285
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 330 transition count 285
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 295 rules applied. Total rules applied 690 place count 181 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 692 place count 180 transition count 142
Applied a total of 692 rules in 45 ms. Remains 180 /545 variables (removed 365) and now considering 142/477 (removed 335) transitions.
// Phase 1: matrix 142 rows 180 cols
[2021-05-09 08:22:01] [INFO ] Computed 79 place invariants in 1 ms
[2021-05-09 08:22:01] [INFO ] Implicit Places using invariants in 102 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 104 ms to find 28 implicit places.
[2021-05-09 08:22:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 142 rows 152 cols
[2021-05-09 08:22:01] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-09 08:22:01] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Starting structural reductions, iteration 1 : 152/545 places, 142/477 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2021-05-09 08:22:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 142 rows 152 cols
[2021-05-09 08:22:01] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-09 08:22:01] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 2 iterations. Remains : 152/545 places, 142/477 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-07 finished in 347 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 477/477 transitions.
Graph (trivial) has 263 edges and 545 vertex of which 6 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 539 transition count 406
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 475 transition count 406
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 129 place count 475 transition count 291
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 384 place count 335 transition count 291
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 390 place count 329 transition count 285
Iterating global reduction 2 with 6 rules applied. Total rules applied 396 place count 329 transition count 285
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 328 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 328 transition count 284
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 293 rules applied. Total rules applied 691 place count 180 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 693 place count 179 transition count 142
Applied a total of 693 rules in 42 ms. Remains 179 /545 variables (removed 366) and now considering 142/477 (removed 335) transitions.
// Phase 1: matrix 142 rows 179 cols
[2021-05-09 08:22:01] [INFO ] Computed 78 place invariants in 2 ms
[2021-05-09 08:22:01] [INFO ] Implicit Places using invariants in 129 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 131 ms to find 28 implicit places.
[2021-05-09 08:22:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 142 rows 151 cols
[2021-05-09 08:22:01] [INFO ] Computed 50 place invariants in 5 ms
[2021-05-09 08:22:01] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Starting structural reductions, iteration 1 : 151/545 places, 142/477 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2021-05-09 08:22:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 142 rows 151 cols
[2021-05-09 08:22:01] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-09 08:22:02] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 2 iterations. Remains : 151/545 places, 142/477 transitions.
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-08 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}]], initial=1, aps=[p0:(OR (NEQ s12 1) (NEQ s62 1) (NEQ s137 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12052 reset in 314 ms.
Entered a terminal (fully accepting) state of product in 33704 steps with 4002 reset in 100 ms.
FORMULA BusinessProcesses-PT-18-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-08 finished in 822 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0) U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 477/477 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 538 transition count 470
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 538 transition count 470
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 535 transition count 467
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 535 transition count 467
Applied a total of 20 rules in 26 ms. Remains 535 /545 variables (removed 10) and now considering 467/477 (removed 10) transitions.
// Phase 1: matrix 467 rows 535 cols
[2021-05-09 08:22:02] [INFO ] Computed 106 place invariants in 7 ms
[2021-05-09 08:22:02] [INFO ] Implicit Places using invariants in 200 ms returned []
// Phase 1: matrix 467 rows 535 cols
[2021-05-09 08:22:02] [INFO ] Computed 106 place invariants in 3 ms
[2021-05-09 08:22:03] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
// Phase 1: matrix 467 rows 535 cols
[2021-05-09 08:22:03] [INFO ] Computed 106 place invariants in 3 ms
[2021-05-09 08:22:03] [INFO ] Dead Transitions using invariants and state equation in 230 ms returned []
Finished structural reductions, in 1 iterations. Remains : 535/545 places, 467/477 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s33 1), p0:(EQ s49 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-09 finished in 1130 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 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 477/477 transitions.
Graph (trivial) has 263 edges and 545 vertex of which 6 / 545 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 539 transition count 406
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 475 transition count 406
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 116 Pre rules applied. Total rules applied 129 place count 475 transition count 290
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 386 place count 334 transition count 290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 391 place count 329 transition count 285
Iterating global reduction 2 with 5 rules applied. Total rules applied 396 place count 329 transition count 285
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 328 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 328 transition count 284
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 297 rules applied. Total rules applied 695 place count 178 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 697 place count 177 transition count 140
Applied a total of 697 rules in 61 ms. Remains 177 /545 variables (removed 368) and now considering 140/477 (removed 337) transitions.
// Phase 1: matrix 140 rows 177 cols
[2021-05-09 08:22:03] [INFO ] Computed 78 place invariants in 1 ms
[2021-05-09 08:22:03] [INFO ] Implicit Places using invariants in 133 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 148 ms to find 28 implicit places.
[2021-05-09 08:22:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 140 rows 149 cols
[2021-05-09 08:22:03] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 08:22:03] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Starting structural reductions, iteration 1 : 149/545 places, 140/477 transitions.
Applied a total of 0 rules in 4 ms. Remains 149 /149 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2021-05-09 08:22:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 140 rows 149 cols
[2021-05-09 08:22:03] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 08:22:04] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
Finished structural reductions, in 2 iterations. Remains : 149/545 places, 140/477 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s113 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13692 reset in 211 ms.
Product exploration explored 100000 steps with 13273 reset in 187 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13559 reset in 268 ms.
Product exploration explored 100000 steps with 13609 reset in 229 ms.
[2021-05-09 08:22:05] [INFO ] Flatten gal took : 33 ms
[2021-05-09 08:22:05] [INFO ] Flatten gal took : 24 ms
[2021-05-09 08:22:05] [INFO ] Time to serialize gal into /tmp/LTL16764707437111093523.gal : 3 ms
[2021-05-09 08:22:05] [INFO ] Time to serialize properties into /tmp/LTL15361500090563120083.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/LTL16764707437111093523.gal, -t, CGAL, -LTL, /tmp/LTL15361500090563120083.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/LTL16764707437111093523.gal -t CGAL -LTL /tmp/LTL15361500090563120083.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p607!=1)"))))
Formula 0 simplified : !FG"(p607!=1)"
Reverse transition relation is NOT exact ! Due to transitions t33, t268.t270.t271.t0.t272, t265.t266.t1.t272, t262.t263.t2.t272, t259.t260.t3.t272, t44.t46.t47.t4, t41.t42.t5, t38.t39.t6, t35.t36.t7, t62.t182.t183.t327.t473.t329.t330, t58.t165.t166.t318.t468.t321.t322, t57.t160.t314.t341.t465.t315.t316, t56.t157.t310.t463.t311.t312, t56.t154.t310.t462.t311.t312, t55.t151.t306.t342.t460.t307.t308, t54.t148.t302.t339.t458.t303.t304, t136.t401.t257.t272, t130.t396.t257.t272, t52.t171.t172.t298.t343.t456.t299.t300.t60.t61, t453.t292.t293.t291, t453.t292.t293.t294.t295, t454.t292.t293.t291, t454.t292.t293.t294.t295, t70.t184.t186.t189.t190.t191.t192.t196.t200.t204.t209.t213.t217.t221.t225.t229.t233.t238.t243.t247.t251.t255.t273.t277.t281.t285.t289.t297.t301.t305.t309.t313.t317.t323.t290.t296.t71.t74.t77.t80.t83.t86.t89.t92.t95.t98.t101.t104.t107.t110.t113.t116.t119.t122.t125.t128.t131.t134.t137.t140.t143.t146.t149.t152.t155.t158.t161.t164.t167.t170.t173.t176.t179.t180.t177.t174.t168.t159.t156.t153.t150.t147.t144.t141.t138.t135.t132.t129.t126.t123.t120.t117.t114.t111.t108.t105.t102.t99.t96.t93.t90.t87.t84.t81.t78.t75.t72.t292.t293.t291, t70.t184.t186.t189.t190.t191.t192.t196.t200.t204.t209.t213.t217.t221.t225.t229.t233.t238.t243.t247.t251.t255.t273.t277.t281.t285.t289.t297.t301.t305.t309.t313.t317.t323.t290.t296.t71.t74.t77.t80.t83.t86.t89.t92.t95.t98.t101.t104.t107.t110.t113.t116.t119.t122.t125.t128.t131.t134.t137.t140.t143.t146.t149.t152.t155.t158.t161.t164.t167.t170.t173.t176.t179.t180.t177.t174.t168.t159.t156.t153.t150.t147.t144.t141.t138.t135.t132.t129.t126.t123.t120.t117.t114.t111.t108.t105.t102.t99.t96.t93.t90.t87.t84.t81.t78.t75.t72.t292.t293.t294.t295, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/79/25/140
Computing Next relation with stutter on 62480 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
383 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.87994,107216,1,0,502,429567,273,455,6007,572101,886
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-18-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-18-10 finished in 6096 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(p0)||(p0&&G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 477/477 transitions.
Graph (trivial) has 261 edges and 545 vertex of which 6 / 545 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 539 transition count 407
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 476 transition count 407
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 116 Pre rules applied. Total rules applied 127 place count 476 transition count 291
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 384 place count 335 transition count 291
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 388 place count 331 transition count 287
Iterating global reduction 2 with 4 rules applied. Total rules applied 392 place count 331 transition count 287
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 393 place count 330 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 394 place count 330 transition count 286
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 297 rules applied. Total rules applied 691 place count 180 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 693 place count 179 transition count 142
Applied a total of 693 rules in 68 ms. Remains 179 /545 variables (removed 366) and now considering 142/477 (removed 335) transitions.
// Phase 1: matrix 142 rows 179 cols
[2021-05-09 08:22:09] [INFO ] Computed 78 place invariants in 1 ms
[2021-05-09 08:22:10] [INFO ] Implicit Places using invariants in 170 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 171 ms to find 28 implicit places.
[2021-05-09 08:22:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 142 rows 151 cols
[2021-05-09 08:22:10] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 08:22:10] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Starting structural reductions, iteration 1 : 151/545 places, 142/477 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2021-05-09 08:22:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 142 rows 151 cols
[2021-05-09 08:22:10] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 08:22:10] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 2 iterations. Remains : 151/545 places, 142/477 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(NEQ s100 1), p1:(NEQ s108 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 43757 steps with 5677 reset in 95 ms.
FORMULA BusinessProcesses-PT-18-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-13 finished in 635 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 477/477 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 538 transition count 470
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 538 transition count 470
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 534 transition count 466
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 531 transition count 463
Applied a total of 28 rules in 58 ms. Remains 531 /545 variables (removed 14) and now considering 463/477 (removed 14) transitions.
// Phase 1: matrix 463 rows 531 cols
[2021-05-09 08:22:10] [INFO ] Computed 106 place invariants in 7 ms
[2021-05-09 08:22:10] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 463 rows 531 cols
[2021-05-09 08:22:10] [INFO ] Computed 106 place invariants in 5 ms
[2021-05-09 08:22:11] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
// Phase 1: matrix 463 rows 531 cols
[2021-05-09 08:22:11] [INFO ] Computed 106 place invariants in 4 ms
[2021-05-09 08:22:11] [INFO ] Dead Transitions using invariants and state equation in 287 ms returned []
Finished structural reductions, in 1 iterations. Remains : 531/545 places, 463/477 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-18-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s282 1), p0:(NEQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25044 reset in 313 ms.
Product exploration explored 100000 steps with 24999 reset in 323 ms.
Graph (complete) has 1200 edges and 531 vertex of which 530 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 24931 reset in 261 ms.
Product exploration explored 100000 steps with 24975 reset in 267 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Support contains 2 out of 531 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 531/531 places, 463/463 transitions.
Graph (trivial) has 251 edges and 531 vertex of which 6 / 531 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 526 transition count 457
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 108 Pre rules applied. Total rules applied 60 place count 526 transition count 711
Deduced a syphon composed of 167 places in 1 ms
Iterating global reduction 1 with 108 rules applied. Total rules applied 168 place count 526 transition count 711
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 190 place count 504 transition count 634
Deduced a syphon composed of 145 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 212 place count 504 transition count 634
Performed 149 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 294 places in 1 ms
Iterating global reduction 1 with 149 rules applied. Total rules applied 361 place count 504 transition count 634
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 400 place count 465 transition count 595
Deduced a syphon composed of 255 places in 1 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 439 place count 465 transition count 595
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 256 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 440 place count 465 transition count 607
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 441 place count 464 transition count 605
Deduced a syphon composed of 255 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 442 place count 464 transition count 605
Deduced a syphon composed of 255 places in 1 ms
Applied a total of 442 rules in 110 ms. Remains 464 /531 variables (removed 67) and now considering 605/463 (removed -142) transitions.
[2021-05-09 08:22:13] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 605 rows 464 cols
[2021-05-09 08:22:13] [INFO ] Computed 106 place invariants in 7 ms
[2021-05-09 08:22:21] [INFO ] Dead Transitions using invariants and state equation in 7951 ms returned []
Finished structural reductions, in 1 iterations. Remains : 464/531 places, 605/463 transitions.
Product exploration explored 100000 steps with 24996 reset in 1355 ms.
Product exploration explored 100000 steps with 24977 reset in 913 ms.
[2021-05-09 08:22:23] [INFO ] Flatten gal took : 19 ms
[2021-05-09 08:22:23] [INFO ] Flatten gal took : 44 ms
[2021-05-09 08:22:23] [INFO ] Time to serialize gal into /tmp/LTL4445362332525252805.gal : 3 ms
[2021-05-09 08:22:23] [INFO ] Time to serialize properties into /tmp/LTL9273960216931649715.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/LTL4445362332525252805.gal, -t, CGAL, -LTL, /tmp/LTL9273960216931649715.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/LTL4445362332525252805.gal -t CGAL -LTL /tmp/LTL9273960216931649715.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("(p22!=1)"))U(X(G("(p328!=1)"))))))
Formula 0 simplified : !X(G"(p22!=1)" U XG"(p328!=1)")
Detected timeout of ITS tools.
[2021-05-09 08:22:39] [INFO ] Flatten gal took : 18 ms
[2021-05-09 08:22:39] [INFO ] Applying decomposition
[2021-05-09 08:22:39] [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/graph8317127279727285393.txt, -o, /tmp/graph8317127279727285393.bin, -w, /tmp/graph8317127279727285393.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/graph8317127279727285393.bin, -l, -1, -v, -w, /tmp/graph8317127279727285393.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:22:39] [INFO ] Decomposing Gal with order
[2021-05-09 08:22:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:22:39] [INFO ] Removed a total of 288 redundant transitions.
[2021-05-09 08:22:39] [INFO ] Flatten gal took : 34 ms
[2021-05-09 08:22:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2021-05-09 08:22:39] [INFO ] Time to serialize gal into /tmp/LTL8107177527826970190.gal : 5 ms
[2021-05-09 08:22:39] [INFO ] Time to serialize properties into /tmp/LTL12605716906124977663.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/LTL8107177527826970190.gal, -t, CGAL, -LTL, /tmp/LTL12605716906124977663.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/LTL8107177527826970190.gal -t CGAL -LTL /tmp/LTL12605716906124977663.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G("(i4.i1.u11.p22!=1)"))U(X(G("(i13.i1.u106.p328!=1)"))))))
Formula 0 simplified : !X(G"(i4.i1.u11.p22!=1)" U XG"(i13.i1.u106.p328!=1)")
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t289, t301, t313, t360, t377, t380, t453, t454, t458, t460, t462, t463, t465, t468, t473, i0.i0.u91.t185, i0.i1.u89.t188, i1.i0.u85.t199, i1.i0.u87.t195, i1.i1.u83.t203, i1.i2.u142.t75, i1.i2.u143.t72, i2.u69.t232, i2.u71.t228, i2.u73.t224, i2.u134.t99, i2.u135.t96, i3.u63.t246, i3.u65.t241, i3.u66.t240, i3.u128.t117, i4.i0.u59.t254, i4.i0.u61.t250, i4.i1.u42.t276, i5.u38.t284, i5.u40.t280, i5.u123.t132, i6.i0.t305, i6.i0.t309, i6.i0.u25.t312, i6.i0.u27.t308, i6.i1.u116.t153, i6.i1.u117.t150, i6.i1.u118.t147, i7.i0.u67.t236, i7.i0.u68.t235, i7.i1.u129.t114, i7.i1.u130.t111, i7.i1.u131.t108, i7.i1.u132.t105, i7.i1.u133.t102, i8.i0.u79.t212, i8.i1.u81.t207, i8.i1.u82.t206, i8.i2.u139.t84, i8.i2.u140.t81, i8.i2.u141.t78, i9.i0.u75.t220, i9.i0.u77.t216, i9.i1.u136.t93, i9.i1.u137.t90, i9.i1.u138.t87, i10.u126.t123, i10.u127.t120, i11.i0.t296, i11.i1.u119.t144, i11.i1.u120.t141, i11.i1.u121.t138, i12.i0.u29.t304, i12.i0.u31.t300, i12.i1.u36.t288, i12.i2.u112.t168, i13.i0.t317, i13.i0.t323, i13.i0.u17.t330, i13.i0.u19.t326, i13.i0.u21.t322, i13.i1.u108.t180, i13.i1.u109.t177, i13.i1.u110.t174, i14.i0.u23.t316, i14.i0.u114.t159, i14.i0.u115.t156, i15.t2, i15.t0, i15.i0.t1, i15.i0.t3, i15.i0.u44.t257, i15.i0.u44.t272, i15.i0.u122.t135, i15.i0.u124.t129, i15.i1.u125.t126, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/330/96/462
Computing Next relation with stutter on 62480 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
632 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,6.37276,206544,1,0,368022,976,8560,790598,326,2862,943363
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-18-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-18-14 finished in 36289 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13285786474803595417
[2021-05-09 08:22:46] [INFO ] Applying decomposition
[2021-05-09 08:22:46] [INFO ] Computing symmetric may disable matrix : 477 transitions.
[2021-05-09 08:22:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:22:46] [INFO ] Computing symmetric may enable matrix : 477 transitions.
[2021-05-09 08:22:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:22:46] [INFO ] Flatten gal took : 16 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/graph6847528478337935565.txt, -o, /tmp/graph6847528478337935565.bin, -w, /tmp/graph6847528478337935565.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/graph6847528478337935565.bin, -l, -1, -v, -w, /tmp/graph6847528478337935565.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:22:46] [INFO ] Decomposing Gal with order
[2021-05-09 08:22:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:22:46] [INFO ] Removed a total of 264 redundant transitions.
[2021-05-09 08:22:46] [INFO ] Computing Do-Not-Accords matrix : 477 transitions.
[2021-05-09 08:22:46] [INFO ] Flatten gal took : 29 ms
[2021-05-09 08:22:46] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:22:46] [INFO ] Built C files in 138ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13285786474803595417
[2021-05-09 08:22:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 8 ms.
[2021-05-09 08:22:46] [INFO ] Time to serialize gal into /tmp/LTLFireability2642579871660187404.gal : 4 ms
[2021-05-09 08:22:46] [INFO ] Time to serialize properties into /tmp/LTLFireability9926834989665039457.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/LTLFireability2642579871660187404.gal, -t, CGAL, -LTL, /tmp/LTLFireability9926834989665039457.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
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/ltsmin13285786474803595417]

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/LTLFireability2642579871660187404.gal -t CGAL -LTL /tmp/LTLFireability9926834989665039457.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F("(i4.u18.p47==1)"))||(X(F((X("(i18.u174.p661==1)"))||(G(!("(((i16.i0.u58.p176==1)&&(i16.i0.u128.p437==1))&&(i18.u145.p688==1))")))))))))
Formula 0 simplified : !G(F"(i4.u18.p47==1)" | XF(X"(i18.u174.p661==1)" | G!"(((i16.i0.u58.p176==1)&&(i16.i0.u128.p437==1))&&(i18.u145.p688==1))"))
Compilation finished in 2983 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13285786474803595417]
Link finished in 65 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((<>((LTLAPp0==true))||X(<>((X((LTLAPp1==true))||[]((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13285786474803595417]
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t73, t438, t468, t478, t484, t525, t542, t545, t619, t623, t625, t628, t630, t632, t633, i0.i0.u82.t337, i0.i0.u84.t331, i0.i0.u143.t164, i0.i1.u144.t160, i1.u70.t363, i1.u72.t359, i2.i0.u37.t433, i2.i0.u39.t429, i2.i0.u124.t240, i2.i1.u35.t437, i3.t462, i3.i0.t458, i3.i0.u24.t473, i3.i0.u28.t461, i3.i1.u26.t465, i3.i2.u118.t264, i3.i2.u119.t260, i3.i2.u120.t256, i3.i3.u116.t272, i3.i3.u117.t268, i4.t474, i4.u17.t487, i4.u22.t477, i5.u30.t457, i6.i0.t453, i6.i1.u121.t252, i6.i1.u122.t248, i7.i0.u41.t425, i7.i1.u60.t391, i8.u62.t387, i9.i0.u66.t376, i9.i0.u67.t375, i9.i0.u68.t371, i9.i1.u137.t188, i9.i1.u138.t184, i9.i2.u134.t200, i9.i2.u135.t196, i9.i2.u136.t192, i10.i0.u86.t327, i10.i0.u90.t311, i10.i1.u88.t314, i11.i0.u76.t351, i11.i0.u80.t342, i11.i0.u81.t341, i11.i1.u78.t347, i11.i1.u139.t180, i11.i1.u140.t176, i11.i1.u141.t172, i11.i1.u142.t168, i12.u74.t355, i13.i0.u64.t382, i13.i0.u65.t381, i13.i1.u129.t220, i13.i1.u130.t216, i13.i1.u131.t212, i13.i1.u132.t208, i13.i1.u133.t204, i14.i0.t481, i14.i0.u19.t483, i14.i1.u115.t276, i15.i0.u15.t489, i15.i0.u15.t491, i15.i0.u15.t492, i15.i1.u108.t304, i15.i1.u109.t300, i15.i1.u110.t296, i15.i1.u112.t288, i16.i0.u58.t395, i16.i0.u127.t228, i16.i0.u128.t224, i17.t3, i17.t2, i17.t0, i17.i0.t1, i17.i0.u43.t402, i17.i0.u43.t421, i17.i0.u123.t244, i17.i0.u125.t236, i17.i1.u126.t232, i18.t137, i18.t31, i18.t26, i18.u145.t114, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/335/102/473
Computing Next relation with stutter on 81792 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, []((<>((LTLAPp0==true))||X(<>((X((LTLAPp1==true))||[]((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13285786474803595417]
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, []((<>((LTLAPp0==true))||X(<>((X((LTLAPp1==true))||[]((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13285786474803595417]
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
20407 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,204.132,2177172,1,0,3.85818e+06,1495,8637,8.94901e+06,419,5181,4679734
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-18-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620549072777

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

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