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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.7K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:14 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 141K 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-11-00
FORMULA_NAME BusinessProcesses-PT-11-01
FORMULA_NAME BusinessProcesses-PT-11-02
FORMULA_NAME BusinessProcesses-PT-11-03
FORMULA_NAME BusinessProcesses-PT-11-04
FORMULA_NAME BusinessProcesses-PT-11-05
FORMULA_NAME BusinessProcesses-PT-11-06
FORMULA_NAME BusinessProcesses-PT-11-07
FORMULA_NAME BusinessProcesses-PT-11-08
FORMULA_NAME BusinessProcesses-PT-11-09
FORMULA_NAME BusinessProcesses-PT-11-10
FORMULA_NAME BusinessProcesses-PT-11-11
FORMULA_NAME BusinessProcesses-PT-11-12
FORMULA_NAME BusinessProcesses-PT-11-13
FORMULA_NAME BusinessProcesses-PT-11-14
FORMULA_NAME BusinessProcesses-PT-11-15

=== Now, execution of the tool begins

BK_START 1620545145559

Running Version 0
[2021-05-09 07:25:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 07:25:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:25:47] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2021-05-09 07:25:47] [INFO ] Transformed 567 places.
[2021-05-09 07:25:47] [INFO ] Transformed 508 transitions.
[2021-05-09 07:25:47] [INFO ] Found NUPN structural information;
[2021-05-09 07:25:47] [INFO ] Parsed PT model containing 567 places and 508 transitions in 115 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 07:25:47] [INFO ] Initial state test concluded for 5 properties.
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 560 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 78 place count 482 transition count 427
Iterating global reduction 1 with 74 rules applied. Total rules applied 152 place count 482 transition count 427
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 187 place count 447 transition count 392
Iterating global reduction 1 with 35 rules applied. Total rules applied 222 place count 447 transition count 392
Applied a total of 222 rules in 94 ms. Remains 447 /560 variables (removed 113) and now considering 392/501 (removed 109) transitions.
// Phase 1: matrix 392 rows 447 cols
[2021-05-09 07:25:47] [INFO ] Computed 91 place invariants in 29 ms
[2021-05-09 07:25:48] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 392 rows 447 cols
[2021-05-09 07:25:48] [INFO ] Computed 91 place invariants in 19 ms
[2021-05-09 07:25:48] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
// Phase 1: matrix 392 rows 447 cols
[2021-05-09 07:25:48] [INFO ] Computed 91 place invariants in 8 ms
[2021-05-09 07:25:48] [INFO ] Dead Transitions using invariants and state equation in 222 ms returned []
Finished structural reductions, in 1 iterations. Remains : 447/560 places, 392/501 transitions.
[2021-05-09 07:25:48] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 07:25:48] [INFO ] Flatten gal took : 61 ms
FORMULA BusinessProcesses-PT-11-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 07:25:49] [INFO ] Flatten gal took : 28 ms
[2021-05-09 07:25:49] [INFO ] Input system was already deterministic with 392 transitions.
Incomplete random walk after 100000 steps, including 751 resets, run finished after 273 ms. (steps per millisecond=366 ) properties (out of 16) seen :8
Running SMT prover for 8 properties.
// Phase 1: matrix 392 rows 447 cols
[2021-05-09 07:25:49] [INFO ] Computed 91 place invariants in 4 ms
[2021-05-09 07:25:49] [INFO ] [Real]Absence check using 49 positive place invariants in 12 ms returned sat
[2021-05-09 07:25:49] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 8 ms returned sat
[2021-05-09 07:25:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:49] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-09 07:25:49] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 5 ms to minimize.
[2021-05-09 07:25:49] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:25:49] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2021-05-09 07:25:50] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2021-05-09 07:25:50] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:25:50] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2021-05-09 07:25:50] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:25:50] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 1 ms to minimize.
[2021-05-09 07:25:50] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 1 ms to minimize.
[2021-05-09 07:25:50] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:25:50] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2021-05-09 07:25:50] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2021-05-09 07:25:50] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:25:50] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2021-05-09 07:25:50] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2021-05-09 07:25:50] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1361 ms
[2021-05-09 07:25:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:25:51] [INFO ] [Nat]Absence check using 49 positive place invariants in 13 ms returned sat
[2021-05-09 07:25:51] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 7 ms returned sat
[2021-05-09 07:25:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:51] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-09 07:25:51] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:25:51] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:25:51] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2021-05-09 07:25:51] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:25:51] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2021-05-09 07:25:51] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2021-05-09 07:25:51] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:25:51] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 0 ms to minimize.
[2021-05-09 07:25:52] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 1 ms to minimize.
[2021-05-09 07:25:52] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2021-05-09 07:25:52] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2021-05-09 07:25:52] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2021-05-09 07:25:52] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2021-05-09 07:25:52] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2021-05-09 07:25:52] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2021-05-09 07:25:52] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1171 ms
[2021-05-09 07:25:52] [INFO ] Computed and/alt/rep : 386/799/386 causal constraints (skipped 5 transitions) in 19 ms.
[2021-05-09 07:25:53] [INFO ] Added : 265 causal constraints over 53 iterations in 1523 ms. Result :sat
[2021-05-09 07:25:53] [INFO ] [Real]Absence check using 49 positive place invariants in 21 ms returned sat
[2021-05-09 07:25:53] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 8 ms returned sat
[2021-05-09 07:25:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:54] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2021-05-09 07:25:54] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:25:54] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 0 ms to minimize.
[2021-05-09 07:25:54] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:25:54] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:25:54] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:25:54] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:25:54] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:25:55] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:25:55] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:25:55] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:25:55] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:25:55] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 1 ms to minimize.
[2021-05-09 07:25:55] [INFO ] Deduced a trap composed of 84 places in 181 ms of which 0 ms to minimize.
[2021-05-09 07:25:56] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:25:56] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:25:56] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:25:56] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 1 ms to minimize.
[2021-05-09 07:25:56] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:25:56] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:25:56] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2021-05-09 07:25:56] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2021-05-09 07:25:56] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2021-05-09 07:25:56] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2021-05-09 07:25:57] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:25:57] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2992 ms
[2021-05-09 07:25:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:25:57] [INFO ] [Nat]Absence check using 49 positive place invariants in 17 ms returned sat
[2021-05-09 07:25:57] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 13 ms returned sat
[2021-05-09 07:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:57] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2021-05-09 07:25:57] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:25:57] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 0 ms to minimize.
[2021-05-09 07:25:57] [INFO ] Deduced a trap composed of 74 places in 161 ms of which 4 ms to minimize.
[2021-05-09 07:25:58] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:25:58] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 0 ms to minimize.
[2021-05-09 07:25:58] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2021-05-09 07:25:58] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:25:58] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 1 ms to minimize.
[2021-05-09 07:25:58] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:25:58] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2021-05-09 07:25:58] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:25:58] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 1 ms to minimize.
[2021-05-09 07:25:58] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:25:59] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2021-05-09 07:25:59] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 8 ms to minimize.
[2021-05-09 07:25:59] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
[2021-05-09 07:25:59] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:25:59] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:25:59] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2021-05-09 07:25:59] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1962 ms
[2021-05-09 07:25:59] [INFO ] Computed and/alt/rep : 386/799/386 causal constraints (skipped 5 transitions) in 32 ms.
[2021-05-09 07:26:00] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 0 ms to minimize.
[2021-05-09 07:26:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2021-05-09 07:26:00] [INFO ] Added : 267 causal constraints over 54 iterations in 1645 ms. Result :sat
[2021-05-09 07:26:01] [INFO ] [Real]Absence check using 49 positive place invariants in 13 ms returned sat
[2021-05-09 07:26:01] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 8 ms returned sat
[2021-05-09 07:26:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:01] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-09 07:26:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:01] [INFO ] [Nat]Absence check using 49 positive place invariants in 18 ms returned sat
[2021-05-09 07:26:01] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-09 07:26:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:01] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-09 07:26:01] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:26:01] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2021-05-09 07:26:01] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:26:02] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:26:02] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2021-05-09 07:26:02] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2021-05-09 07:26:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 692 ms
[2021-05-09 07:26:02] [INFO ] Computed and/alt/rep : 386/799/386 causal constraints (skipped 5 transitions) in 30 ms.
[2021-05-09 07:26:03] [INFO ] Added : 250 causal constraints over 50 iterations in 1313 ms. Result :sat
[2021-05-09 07:26:03] [INFO ] [Real]Absence check using 49 positive place invariants in 11 ms returned sat
[2021-05-09 07:26:03] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 8 ms returned sat
[2021-05-09 07:26:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:03] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-09 07:26:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:03] [INFO ] [Nat]Absence check using 49 positive place invariants in 13 ms returned sat
[2021-05-09 07:26:03] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 8 ms returned sat
[2021-05-09 07:26:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:03] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2021-05-09 07:26:03] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2021-05-09 07:26:04] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2021-05-09 07:26:04] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2021-05-09 07:26:04] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:26:04] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:26:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 418 ms
[2021-05-09 07:26:04] [INFO ] Computed and/alt/rep : 386/799/386 causal constraints (skipped 5 transitions) in 23 ms.
[2021-05-09 07:26:05] [INFO ] Added : 241 causal constraints over 49 iterations in 993 ms. Result :sat
[2021-05-09 07:26:05] [INFO ] [Real]Absence check using 49 positive place invariants in 12 ms returned sat
[2021-05-09 07:26:05] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 9 ms returned sat
[2021-05-09 07:26:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:05] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2021-05-09 07:26:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:05] [INFO ] [Nat]Absence check using 49 positive place invariants in 18 ms returned sat
[2021-05-09 07:26:05] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 14 ms returned sat
[2021-05-09 07:26:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:05] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-09 07:26:05] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:26:06] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:26:06] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 1 ms to minimize.
[2021-05-09 07:26:06] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 0 ms to minimize.
[2021-05-09 07:26:06] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 0 ms to minimize.
[2021-05-09 07:26:06] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 0 ms to minimize.
[2021-05-09 07:26:06] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:26:06] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:26:07] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:26:07] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2021-05-09 07:26:07] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:26:07] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:26:07] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:26:07] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:26:07] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:26:07] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:26:07] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2021-05-09 07:26:07] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:26:07] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:26:07] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2180 ms
[2021-05-09 07:26:07] [INFO ] Computed and/alt/rep : 386/799/386 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-09 07:26:09] [INFO ] Added : 245 causal constraints over 49 iterations in 1297 ms. Result :sat
[2021-05-09 07:26:09] [INFO ] [Real]Absence check using 49 positive place invariants in 16 ms returned sat
[2021-05-09 07:26:09] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 10 ms returned sat
[2021-05-09 07:26:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:09] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-09 07:26:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:09] [INFO ] [Nat]Absence check using 49 positive place invariants in 18 ms returned sat
[2021-05-09 07:26:09] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 12 ms returned sat
[2021-05-09 07:26:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:09] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-09 07:26:09] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:26:09] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2021-05-09 07:26:09] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:26:10] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2021-05-09 07:26:10] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:26:10] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:26:10] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2021-05-09 07:26:10] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:26:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 730 ms
[2021-05-09 07:26:10] [INFO ] Computed and/alt/rep : 386/799/386 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-09 07:26:11] [INFO ] Added : 196 causal constraints over 40 iterations in 1065 ms. Result :sat
[2021-05-09 07:26:11] [INFO ] [Real]Absence check using 49 positive place invariants in 14 ms returned sat
[2021-05-09 07:26:11] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 10 ms returned sat
[2021-05-09 07:26:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:11] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-09 07:26:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:11] [INFO ] [Nat]Absence check using 49 positive place invariants in 13 ms returned sat
[2021-05-09 07:26:11] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 9 ms returned sat
[2021-05-09 07:26:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:11] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2021-05-09 07:26:12] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2021-05-09 07:26:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2021-05-09 07:26:12] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2021-05-09 07:26:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 197 ms
[2021-05-09 07:26:12] [INFO ] Computed and/alt/rep : 386/799/386 causal constraints (skipped 5 transitions) in 33 ms.
[2021-05-09 07:26:13] [INFO ] Added : 209 causal constraints over 42 iterations in 1069 ms. Result :sat
[2021-05-09 07:26:13] [INFO ] [Real]Absence check using 49 positive place invariants in 12 ms returned sat
[2021-05-09 07:26:13] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 8 ms returned sat
[2021-05-09 07:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:13] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-09 07:26:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:13] [INFO ] [Nat]Absence check using 49 positive place invariants in 20 ms returned sat
[2021-05-09 07:26:13] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-09 07:26:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:13] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-09 07:26:13] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:26:13] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2021-05-09 07:26:13] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:26:14] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:26:14] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2021-05-09 07:26:14] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:26:14] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:26:14] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:26:14] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:26:14] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:26:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 912 ms
[2021-05-09 07:26:14] [INFO ] Computed and/alt/rep : 386/799/386 causal constraints (skipped 5 transitions) in 24 ms.
[2021-05-09 07:26:16] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:26:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2021-05-09 07:26:16] [INFO ] Added : 257 causal constraints over 52 iterations in 1582 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 392/392 transitions.
Graph (trivial) has 205 edges and 447 vertex of which 6 / 447 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 441 transition count 338
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 394 transition count 338
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 95 place count 394 transition count 244
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 301 place count 282 transition count 244
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 306 place count 277 transition count 239
Iterating global reduction 2 with 5 rules applied. Total rules applied 311 place count 277 transition count 239
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 311 place count 277 transition count 238
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 313 place count 276 transition count 238
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 233 rules applied. Total rules applied 546 place count 158 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 548 place count 157 transition count 127
Applied a total of 548 rules in 98 ms. Remains 157 /447 variables (removed 290) and now considering 127/392 (removed 265) transitions.
// Phase 1: matrix 127 rows 157 cols
[2021-05-09 07:26:16] [INFO ] Computed 70 place invariants in 1 ms
[2021-05-09 07:26:16] [INFO ] Implicit Places using invariants in 188 ms returned [1, 4, 5, 28, 29, 30, 31, 38, 39, 40, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 190 ms to find 18 implicit places.
[2021-05-09 07:26:16] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 127 rows 139 cols
[2021-05-09 07:26:16] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 07:26:16] [INFO ] Dead Transitions using invariants and state equation in 341 ms returned []
Starting structural reductions, iteration 1 : 139/447 places, 127/392 transitions.
Applied a total of 0 rules in 8 ms. Remains 139 /139 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2021-05-09 07:26:16] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 127 rows 139 cols
[2021-05-09 07:26:16] [INFO ] Computed 52 place invariants in 12 ms
[2021-05-09 07:26:17] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 2 iterations. Remains : 139/447 places, 127/392 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s88 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 1 ms.
FORMULA BusinessProcesses-PT-11-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-01 finished in 1025 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 392/392 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 441 transition count 386
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 441 transition count 386
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 438 transition count 383
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 438 transition count 383
Applied a total of 18 rules in 78 ms. Remains 438 /447 variables (removed 9) and now considering 383/392 (removed 9) transitions.
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:26:17] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-09 07:26:17] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:26:17] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-09 07:26:17] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:26:17] [INFO ] Computed 91 place invariants in 7 ms
[2021-05-09 07:26:18] [INFO ] Dead Transitions using invariants and state equation in 244 ms returned []
Finished structural reductions, in 1 iterations. Remains : 438/447 places, 383/392 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(AND (EQ s10 0) (EQ s81 1))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-02 finished in 1023 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)||X(X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 392/392 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 441 transition count 386
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 441 transition count 386
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 438 transition count 383
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 438 transition count 383
Applied a total of 18 rules in 35 ms. Remains 438 /447 variables (removed 9) and now considering 383/392 (removed 9) transitions.
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:26:18] [INFO ] Computed 91 place invariants in 5 ms
[2021-05-09 07:26:18] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:26:18] [INFO ] Computed 91 place invariants in 4 ms
[2021-05-09 07:26:18] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:26:18] [INFO ] Computed 91 place invariants in 4 ms
[2021-05-09 07:26:19] [INFO ] Dead Transitions using invariants and state equation in 200 ms returned []
Finished structural reductions, in 1 iterations. Remains : 438/447 places, 383/392 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-03 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 p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s427 1), p1:(OR (EQ s197 0) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24986 reset in 409 ms.
Product exploration explored 100000 steps with 24917 reset in 267 ms.
Graph (complete) has 992 edges and 438 vertex of which 437 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 25020 reset in 291 ms.
Product exploration explored 100000 steps with 24950 reset in 262 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 438 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 438/438 places, 383/383 transitions.
Graph (trivial) has 195 edges and 438 vertex of which 6 / 438 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 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 433 transition count 377
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 91 Pre rules applied. Total rules applied 45 place count 433 transition count 590
Deduced a syphon composed of 135 places in 1 ms
Iterating global reduction 1 with 91 rules applied. Total rules applied 136 place count 433 transition count 590
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 152 place count 417 transition count 533
Deduced a syphon composed of 119 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 168 place count 417 transition count 533
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 234 places in 0 ms
Iterating global reduction 1 with 115 rules applied. Total rules applied 283 place count 417 transition count 533
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 311 place count 389 transition count 505
Deduced a syphon composed of 206 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 339 place count 389 transition count 505
Deduced a syphon composed of 206 places in 0 ms
Applied a total of 339 rules in 116 ms. Remains 389 /438 variables (removed 49) and now considering 505/383 (removed -122) transitions.
[2021-05-09 07:26:21] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 505 rows 389 cols
[2021-05-09 07:26:21] [INFO ] Computed 91 place invariants in 10 ms
[2021-05-09 07:26:21] [INFO ] Dead Transitions using invariants and state equation in 437 ms returned []
Finished structural reductions, in 1 iterations. Remains : 389/438 places, 505/383 transitions.
Product exploration explored 100000 steps with 24959 reset in 1073 ms.
Product exploration explored 100000 steps with 25052 reset in 817 ms.
[2021-05-09 07:26:23] [INFO ] Flatten gal took : 35 ms
[2021-05-09 07:26:23] [INFO ] Flatten gal took : 29 ms
[2021-05-09 07:26:23] [INFO ] Time to serialize gal into /tmp/LTL8833230260912453871.gal : 13 ms
[2021-05-09 07:26:23] [INFO ] Time to serialize properties into /tmp/LTL13835203091002516364.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/LTL8833230260912453871.gal, -t, CGAL, -LTL, /tmp/LTL13835203091002516364.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/LTL8833230260912453871.gal -t CGAL -LTL /tmp/LTL13835203091002516364.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("(p556==1)"))||(X(X(G("((p221==0)||(p16==1))")))))))
Formula 0 simplified : !G(F"(p556==1)" | XXG"((p221==0)||(p16==1))")
Detected timeout of ITS tools.
[2021-05-09 07:26:38] [INFO ] Flatten gal took : 52 ms
[2021-05-09 07:26:38] [INFO ] Applying decomposition
[2021-05-09 07:26:38] [INFO ] Flatten gal took : 33 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/graph16983615696424199187.txt, -o, /tmp/graph16983615696424199187.bin, -w, /tmp/graph16983615696424199187.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/graph16983615696424199187.bin, -l, -1, -v, -w, /tmp/graph16983615696424199187.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:26:39] [INFO ] Decomposing Gal with order
[2021-05-09 07:26:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:26:39] [INFO ] Removed a total of 247 redundant transitions.
[2021-05-09 07:26:39] [INFO ] Flatten gal took : 96 ms
[2021-05-09 07:26:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2021-05-09 07:26:39] [INFO ] Time to serialize gal into /tmp/LTL6159836510322418271.gal : 10 ms
[2021-05-09 07:26:39] [INFO ] Time to serialize properties into /tmp/LTL5469785453373291742.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/LTL6159836510322418271.gal, -t, CGAL, -LTL, /tmp/LTL5469785453373291742.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/LTL6159836510322418271.gal -t CGAL -LTL /tmp/LTL5469785453373291742.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F("(i15.u152.p556==1)"))||(X(X(G("((i9.u73.p221==0)||(i1.u7.p16==1))")))))))
Formula 0 simplified : !G(F"(i15.u152.p556==1)" | XXG"((i9.u73.p221==0)||(i1.u7.p16==1))")
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t164, t168, t176, t184, t192, t200, t204, t216, t224, t228, t246, t254, t383, t385, t387, i0.t180, i0.u55.t191, i0.u61.t183, i1.t212, i1.t196, i1.u42.t215, i1.u51.t199, i2.t220, i2.u18.t249, i2.u38.t223, i3.t264, i3.t250, i3.u16.t253, i4.u40.t219, i4.u100.t119, i4.u101.t116, i5.i0.i0.u44.t211, i5.i1.i0.u104.t107, i5.i1.i0.u105.t104, i5.i1.i1.u102.t113, i5.i1.i1.u103.t110, i6.u53.t195, i7.u63.t179, i7.u65.t175, i7.u112.t83, i8.u117.t68, i8.u75.t154, i8.u77.t151, i9.t160, i9.t156, i9.u71.t163, i9.u73.t159, i9.u67.t171, i9.u115.t74, i9.u116.t71, i10.u108.t95, i10.u109.t92, i10.u110.t89, i11.u49.t203, i11.u106.t101, i11.u107.t98, i12.u36.t227, i12.u98.t125, i12.u99.t122, i13.u93.t140, i13.u94.t137, i13.u97.t128, i14.u11.t267, i14.u92.t143, i15.t3, i15.t2, i15.t1, i15.t0, i15.u90.t148, i15.u95.t134, i15.u20.t230, i15.u20.t245, i15.u96.t131, i16.u69.t167, i16.u113.t80, i16.u114.t77, i17.t10, i17.u118.t64, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/264/82/382
Computing Next relation with stutter on 1212 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4787376459761637432
[2021-05-09 07:26:54] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4787376459761637432
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/ltsmin4787376459761637432]
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/ltsmin4787376459761637432] 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/ltsmin4787376459761637432] 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-11-03 finished in 37070 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F((F(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 392/392 transitions.
Graph (trivial) has 202 edges and 447 vertex of which 6 / 447 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 441 transition count 339
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 395 transition count 339
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 93 place count 395 transition count 246
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 297 place count 284 transition count 246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 301 place count 280 transition count 242
Iterating global reduction 2 with 4 rules applied. Total rules applied 305 place count 280 transition count 242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 305 place count 280 transition count 241
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 307 place count 279 transition count 241
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 227 rules applied. Total rules applied 534 place count 164 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 536 place count 163 transition count 133
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 542 place count 163 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 543 place count 162 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 544 place count 161 transition count 132
Applied a total of 544 rules in 67 ms. Remains 161 /447 variables (removed 286) and now considering 132/392 (removed 260) transitions.
// Phase 1: matrix 132 rows 161 cols
[2021-05-09 07:26:55] [INFO ] Computed 69 place invariants in 3 ms
[2021-05-09 07:26:55] [INFO ] Implicit Places using invariants in 128 ms returned [34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 129 ms to find 12 implicit places.
[2021-05-09 07:26:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 132 rows 149 cols
[2021-05-09 07:26:55] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-09 07:26:55] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Starting structural reductions, iteration 1 : 149/447 places, 132/392 transitions.
Applied a total of 0 rules in 6 ms. Remains 149 /149 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2021-05-09 07:26:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 132 rows 149 cols
[2021-05-09 07:26:55] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-09 07:26:55] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Finished structural reductions, in 2 iterations. Remains : 149/447 places, 132/392 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-04 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(NEQ s45 1), p1:(AND (NEQ s13 0) (NEQ s4 1)), p0:(OR (EQ s1 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-04 finished in 594 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 392/392 transitions.
Graph (trivial) has 203 edges and 447 vertex of which 6 / 447 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 441 transition count 339
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 395 transition count 339
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 93 place count 395 transition count 246
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 203 rules applied. Total rules applied 296 place count 285 transition count 246
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 301 place count 280 transition count 241
Iterating global reduction 2 with 5 rules applied. Total rules applied 306 place count 280 transition count 241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 306 place count 280 transition count 240
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 308 place count 279 transition count 240
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 231 rules applied. Total rules applied 539 place count 162 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 541 place count 161 transition count 130
Applied a total of 541 rules in 77 ms. Remains 161 /447 variables (removed 286) and now considering 130/392 (removed 262) transitions.
// Phase 1: matrix 130 rows 161 cols
[2021-05-09 07:26:56] [INFO ] Computed 71 place invariants in 1 ms
[2021-05-09 07:26:56] [INFO ] Implicit Places using invariants in 171 ms returned [1, 4, 5, 30, 31, 32, 33, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53, 54, 121]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 173 ms to find 19 implicit places.
[2021-05-09 07:26:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 130 rows 142 cols
[2021-05-09 07:26:56] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-09 07:26:56] [INFO ] Dead Transitions using invariants and state equation in 328 ms returned []
Starting structural reductions, iteration 1 : 142/447 places, 130/392 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2021-05-09 07:26:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 130 rows 142 cols
[2021-05-09 07:26:56] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 07:26:56] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 2 iterations. Remains : 142/447 places, 130/392 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-11-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s43 1)), p1:(OR (EQ s102 0) (EQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 17643 reset in 225 ms.
Product exploration explored 100000 steps with 17812 reset in 297 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 17735 reset in 212 ms.
Product exploration explored 100000 steps with 17633 reset in 229 ms.
[2021-05-09 07:26:57] [INFO ] Flatten gal took : 11 ms
[2021-05-09 07:26:57] [INFO ] Flatten gal took : 10 ms
[2021-05-09 07:26:57] [INFO ] Time to serialize gal into /tmp/LTL11626052781850913963.gal : 2 ms
[2021-05-09 07:26:57] [INFO ] Time to serialize properties into /tmp/LTL5621372572673212798.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/LTL11626052781850913963.gal, -t, CGAL, -LTL, /tmp/LTL5621372572673212798.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/LTL11626052781850913963.gal -t CGAL -LTL /tmp/LTL5621372572673212798.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("((p79==0)||(p277==1))"))&&(F(G("((p454==0)||(p440==1))"))))))
Formula 0 simplified : !G(F"((p79==0)||(p277==1))" & FG"((p454==0)||(p440==1))")
Reverse transition relation is NOT exact ! Due to transitions t48, t241.t243.t244.t0.t245, t238.t239.t1.t245, t235.t236.t2.t245, t232.t233.t3.t245, t187.t189.t190.t5.t191, t50.t52.t53.t6, t43.t44.t8, t40.t41.t9, t25.t27.t28.t10, t56.t146.t147.t265.t277.t387.t266.t267.t64, t149.t338.t230.t245.t64, t135.t333.t230.t245.t64, t132.t328.t230.t245.t64, t17.t86.t87.t169.t282.t294.t170.t171.t64, t388.t153.t284.t154.t64, t66.t150.t152.t155.t156.t160.t164.t168.t172.t176.t180.t184.t192.t196.t200.t204.t212.t216.t220.t224.t228.t246.t250.t254.t255.t264.t205.t207.t67.t70.t73.t76.t79.t82.t85.t88.t91.t94.t97.t100.t103.t106.t109.t112.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t143.t140.t137.t134.t131.t128.t125.t122.t119.t116.t113.t110.t107.t104.t101.t98.t95.t92.t89.t83.t80.t77.t74.t71.t68.t260.t261.t256, t66.t150.t152.t155.t156.t160.t164.t168.t172.t176.t180.t184.t192.t196.t200.t204.t212.t216.t220.t224.t228.t246.t250.t254.t255.t264.t205.t207.t67.t70.t73.t76.t79.t82.t85.t88.t91.t94.t97.t100.t103.t106.t109.t112.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t143.t140.t137.t134.t131.t128.t125.t122.t119.t116.t113.t110.t107.t104.t101.t98.t95.t92.t89.t83.t80.t77.t74.t71.t68.t260.t261.t262.t263, t383.t64.t260.t261.t256, t383.t64.t260.t261.t262.t263, t384.t64.t260.t261.t256, t384.t64.t260.t261.t262.t263, t385.t64.t260.t261.t256, t385.t64.t260.t261.t262.t263, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/70/24/130
Computing Next relation with stutter on 1212 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
88 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.910091,49384,1,0,195,107337,266,110,5739,83298,310
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-11-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-11-05 finished in 3005 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 392/392 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 441 transition count 386
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 441 transition count 386
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 438 transition count 383
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 438 transition count 383
Applied a total of 18 rules in 43 ms. Remains 438 /447 variables (removed 9) and now considering 383/392 (removed 9) transitions.
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:26:59] [INFO ] Computed 91 place invariants in 7 ms
[2021-05-09 07:26:59] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:26:59] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-09 07:26:59] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:26:59] [INFO ] Computed 91 place invariants in 4 ms
[2021-05-09 07:26:59] [INFO ] Dead Transitions using invariants and state equation in 229 ms returned []
Finished structural reductions, in 1 iterations. Remains : 438/447 places, 383/392 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s300 0) (NEQ s306 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-06 finished in 1122 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 392/392 transitions.
Graph (trivial) has 204 edges and 447 vertex of which 6 / 447 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 441 transition count 339
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 395 transition count 339
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 93 place count 395 transition count 244
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 301 place count 282 transition count 244
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 305 place count 278 transition count 240
Iterating global reduction 2 with 4 rules applied. Total rules applied 309 place count 278 transition count 240
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 231 rules applied. Total rules applied 540 place count 161 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 542 place count 160 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 543 place count 159 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 544 place count 158 transition count 129
Applied a total of 544 rules in 54 ms. Remains 158 /447 variables (removed 289) and now considering 129/392 (removed 263) transitions.
// Phase 1: matrix 129 rows 158 cols
[2021-05-09 07:27:00] [INFO ] Computed 69 place invariants in 1 ms
[2021-05-09 07:27:00] [INFO ] Implicit Places using invariants in 125 ms returned [43, 48, 49, 50, 51, 52, 53, 54]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 126 ms to find 8 implicit places.
[2021-05-09 07:27:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 129 rows 150 cols
[2021-05-09 07:27:00] [INFO ] Computed 61 place invariants in 1 ms
[2021-05-09 07:27:00] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Starting structural reductions, iteration 1 : 150/447 places, 129/392 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2021-05-09 07:27:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 129 rows 150 cols
[2021-05-09 07:27:00] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-09 07:27:00] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/447 places, 129/392 transitions.
Stuttering acceptance computed with spot in 32 ms :[true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-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 (EQ s1 0) (EQ s4 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-08 finished in 382 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 392/392 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 441 transition count 386
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 441 transition count 386
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 438 transition count 383
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 438 transition count 383
Applied a total of 18 rules in 34 ms. Remains 438 /447 variables (removed 9) and now considering 383/392 (removed 9) transitions.
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:27:00] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-09 07:27:00] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:27:00] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-09 07:27:01] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:27:01] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-09 07:27:01] [INFO ] Dead Transitions using invariants and state equation in 167 ms returned []
Finished structural reductions, in 1 iterations. Remains : 438/447 places, 383/392 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s143 0) (EQ s264 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 392 ms.
Product exploration explored 100000 steps with 50000 reset in 314 ms.
Graph (complete) has 992 edges and 438 vertex of which 437 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 322 ms.
Product exploration explored 100000 steps with 50000 reset in 335 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 438 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 438/438 places, 383/383 transitions.
Graph (trivial) has 196 edges and 438 vertex of which 6 / 438 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 43 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 433 transition count 377
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 92 Pre rules applied. Total rules applied 44 place count 433 transition count 585
Deduced a syphon composed of 135 places in 1 ms
Iterating global reduction 1 with 92 rules applied. Total rules applied 136 place count 433 transition count 585
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 151 place count 418 transition count 532
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 166 place count 418 transition count 532
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 238 places in 10 ms
Iterating global reduction 1 with 118 rules applied. Total rules applied 284 place count 418 transition count 532
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 313 place count 389 transition count 503
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 342 place count 389 transition count 503
Deduced a syphon composed of 209 places in 0 ms
Applied a total of 342 rules in 154 ms. Remains 389 /438 variables (removed 49) and now considering 503/383 (removed -120) transitions.
[2021-05-09 07:27:03] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 503 rows 389 cols
[2021-05-09 07:27:03] [INFO ] Computed 91 place invariants in 10 ms
[2021-05-09 07:27:03] [INFO ] Dead Transitions using invariants and state equation in 304 ms returned []
Finished structural reductions, in 1 iterations. Remains : 389/438 places, 503/383 transitions.
Product exploration explored 100000 steps with 50000 reset in 1883 ms.
Product exploration explored 100000 steps with 50000 reset in 1701 ms.
[2021-05-09 07:27:07] [INFO ] Flatten gal took : 14 ms
[2021-05-09 07:27:07] [INFO ] Flatten gal took : 13 ms
[2021-05-09 07:27:07] [INFO ] Time to serialize gal into /tmp/LTL1896630023779763520.gal : 2 ms
[2021-05-09 07:27:07] [INFO ] Time to serialize properties into /tmp/LTL13196505680652091914.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/LTL1896630023779763520.gal, -t, CGAL, -LTL, /tmp/LTL13196505680652091914.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/LTL1896630023779763520.gal -t CGAL -LTL /tmp/LTL13196505680652091914.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p163==0)||(p301==1))"))))
Formula 0 simplified : !XF"((p163==0)||(p301==1))"
Detected timeout of ITS tools.
[2021-05-09 07:27:22] [INFO ] Flatten gal took : 25 ms
[2021-05-09 07:27:22] [INFO ] Applying decomposition
[2021-05-09 07:27:22] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14877835069597465442.txt, -o, /tmp/graph14877835069597465442.bin, -w, /tmp/graph14877835069597465442.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/graph14877835069597465442.bin, -l, -1, -v, -w, /tmp/graph14877835069597465442.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:27:22] [INFO ] Decomposing Gal with order
[2021-05-09 07:27:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:27:22] [INFO ] Removed a total of 251 redundant transitions.
[2021-05-09 07:27:22] [INFO ] Flatten gal took : 29 ms
[2021-05-09 07:27:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 10 ms.
[2021-05-09 07:27:22] [INFO ] Time to serialize gal into /tmp/LTL12333715351937914885.gal : 5 ms
[2021-05-09 07:27:22] [INFO ] Time to serialize properties into /tmp/LTL14081945686964366022.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/LTL12333715351937914885.gal, -t, CGAL, -LTL, /tmp/LTL14081945686964366022.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/LTL12333715351937914885.gal -t CGAL -LTL /tmp/LTL14081945686964366022.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i1.u56.p163==0)||(i9.u99.p301==1))"))))
Formula 0 simplified : !XF"((i1.u56.p163==0)||(i9.u99.p301==1))"
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t156, t164, t176, t192, t200, t212, t220, t228, t254, t383, t385, t387, i0.t168, i0.u67.t175, i0.u69.t171, i1.u55.t195, i2.t196, i2.u51.t203, i2.u53.t199, i3.i0.t204, i3.i0.u44.t215, i3.i0.u46.t211, i4.t250, i4.t246, i4.t224, i4.u12.t267, i4.u17.t253, i4.u19.t249, i4.u38.t227, i6.t3, i6.t0, i6.i0.t1, i6.i0.t2, i6.i0.t230, i6.i0.u21.t245, i6.i0.u92.t148, i6.i1.u97.t134, i6.i2.u98.t131, i7.i0.t216, i7.i0.u40.t223, i7.i0.u42.t219, i7.i0.u102.t119, i7.i1.u101.t122, i7.i1.u103.t116, i8.i1.u108.t101, i8.i1.u109.t98, i8.i1.u110.t95, i8.i1.u111.t92, i9.u99.t128, i9.u100.t125, i10.i0.u119.t68, i10.i1.u77.t154, i10.i2.u75.t159, i10.i2.u79.t151, i11.i0.u106.t107, i11.i0.u107.t104, i11.i1.u104.t113, i11.i1.u105.t110, i12.i0.u95.t140, i12.i0.u96.t137, i12.i1.u94.t143, i13.i0.u65.t179, i13.i0.u114.t83, i13.i0.u115.t80, i13.i1.u112.t89, i14.i0.t160, i14.i0.u71.t167, i14.i0.u73.t163, i14.i0.u116.t77, i14.i1.u117.t74, i14.i1.u118.t71, i15.i0.t264, i15.i1.t10, i15.i1.u121.t64, i16.i0.t180, i16.i0.t184, i16.i0.u57.t191, i16.i0.u63.t183, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/264/82/382
Computing Next relation with stutter on 1212 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
351 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.5708,115984,1,0,200291,618,6131,435192,203,1550,582508
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-11-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-11-09 finished in 26232 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 392/392 transitions.
Graph (trivial) has 203 edges and 447 vertex of which 6 / 447 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 441 transition count 339
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 395 transition count 339
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 93 place count 395 transition count 245
Deduced a syphon composed of 94 places in 2 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 299 place count 283 transition count 245
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 303 place count 279 transition count 241
Iterating global reduction 2 with 4 rules applied. Total rules applied 307 place count 279 transition count 241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 307 place count 279 transition count 240
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 309 place count 278 transition count 240
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 231 rules applied. Total rules applied 540 place count 161 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 542 place count 160 transition count 130
Applied a total of 542 rules in 41 ms. Remains 160 /447 variables (removed 287) and now considering 130/392 (removed 262) transitions.
// Phase 1: matrix 130 rows 160 cols
[2021-05-09 07:27:26] [INFO ] Computed 70 place invariants in 2 ms
[2021-05-09 07:27:26] [INFO ] Implicit Places using invariants in 139 ms returned [1, 4, 5, 28, 29, 30, 31, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 142 ms to find 18 implicit places.
[2021-05-09 07:27:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 130 rows 142 cols
[2021-05-09 07:27:26] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-09 07:27:27] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Starting structural reductions, iteration 1 : 142/447 places, 130/392 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2021-05-09 07:27:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 130 rows 142 cols
[2021-05-09 07:27:27] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 07:27:27] [INFO ] Dead Transitions using invariants and state equation in 218 ms returned []
Finished structural reductions, in 2 iterations. Remains : 142/447 places, 130/392 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s30 1) (OR (EQ s101 0) (EQ s133 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-12 finished in 674 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(G((F(p2)||p1)))&&p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 392/392 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 441 transition count 386
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 441 transition count 386
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 438 transition count 383
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 438 transition count 383
Applied a total of 18 rules in 24 ms. Remains 438 /447 variables (removed 9) and now considering 383/392 (removed 9) transitions.
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:27:27] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-09 07:27:27] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:27:27] [INFO ] Computed 91 place invariants in 5 ms
[2021-05-09 07:27:28] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:27:28] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-09 07:27:28] [INFO ] Dead Transitions using invariants and state equation in 224 ms returned []
Finished structural reductions, in 1 iterations. Remains : 438/447 places, 383/392 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-11-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s86 0) (OR (NEQ s47 0) (NEQ s324 1))), p1:(OR (EQ s425 0) (EQ s195 1)), p2:(OR (EQ s324 0) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 754 reset in 208 ms.
Product exploration explored 100000 steps with 750 reset in 215 ms.
Graph (complete) has 992 edges and 438 vertex of which 437 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 758 reset in 211 ms.
Product exploration explored 100000 steps with 751 reset in 227 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 5 out of 438 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 438/438 places, 383/383 transitions.
Graph (trivial) has 193 edges and 438 vertex of which 6 / 438 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 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 433 transition count 377
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 91 Pre rules applied. Total rules applied 43 place count 433 transition count 585
Deduced a syphon composed of 133 places in 2 ms
Iterating global reduction 1 with 91 rules applied. Total rules applied 134 place count 433 transition count 585
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 150 place count 417 transition count 530
Deduced a syphon composed of 117 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 166 place count 417 transition count 530
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 232 places in 0 ms
Iterating global reduction 1 with 115 rules applied. Total rules applied 281 place count 417 transition count 530
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 307 place count 391 transition count 504
Deduced a syphon composed of 206 places in 1 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 333 place count 391 transition count 504
Deduced a syphon composed of 206 places in 0 ms
Applied a total of 333 rules in 58 ms. Remains 391 /438 variables (removed 47) and now considering 504/383 (removed -121) transitions.
[2021-05-09 07:27:30] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 504 rows 391 cols
[2021-05-09 07:27:30] [INFO ] Computed 91 place invariants in 9 ms
[2021-05-09 07:27:30] [INFO ] Dead Transitions using invariants and state equation in 277 ms returned []
Finished structural reductions, in 1 iterations. Remains : 391/438 places, 504/383 transitions.
Product exploration explored 100000 steps with 12578 reset in 625 ms.
Product exploration explored 100000 steps with 12597 reset in 467 ms.
[2021-05-09 07:27:31] [INFO ] Flatten gal took : 13 ms
[2021-05-09 07:27:31] [INFO ] Flatten gal took : 13 ms
[2021-05-09 07:27:31] [INFO ] Time to serialize gal into /tmp/LTL14511279453486181419.gal : 2 ms
[2021-05-09 07:27:31] [INFO ] Time to serialize properties into /tmp/LTL13037637360368910413.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/LTL14511279453486181419.gal, -t, CGAL, -LTL, /tmp/LTL13037637360368910413.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/LTL14511279453486181419.gal -t CGAL -LTL /tmp/LTL13037637360368910413.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((("(p104==0)")&&(X(G(("((p554==0)||(p219==1))")||(F("((p377==0)||(p57==1))"))))))&&("((p57!=0)||(p377!=1))"))))
Formula 0 simplified : !G("((p57!=0)||(p377!=1))" & "(p104==0)" & XG("((p554==0)||(p219==1))" | F"((p377==0)||(p57==1))"))
Detected timeout of ITS tools.
[2021-05-09 07:27:46] [INFO ] Flatten gal took : 32 ms
[2021-05-09 07:27:46] [INFO ] Applying decomposition
[2021-05-09 07:27:46] [INFO ] Flatten gal took : 24 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/graph13380874552074266311.txt, -o, /tmp/graph13380874552074266311.bin, -w, /tmp/graph13380874552074266311.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/graph13380874552074266311.bin, -l, -1, -v, -w, /tmp/graph13380874552074266311.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:27:46] [INFO ] Decomposing Gal with order
[2021-05-09 07:27:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:27:46] [INFO ] Removed a total of 250 redundant transitions.
[2021-05-09 07:27:46] [INFO ] Flatten gal took : 86 ms
[2021-05-09 07:27:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2021-05-09 07:27:46] [INFO ] Time to serialize gal into /tmp/LTL2230568261862484185.gal : 18 ms
[2021-05-09 07:27:46] [INFO ] Time to serialize properties into /tmp/LTL12360748163252625923.ltl : 13 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/LTL2230568261862484185.gal, -t, CGAL, -LTL, /tmp/LTL12360748163252625923.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/LTL2230568261862484185.gal -t CGAL -LTL /tmp/LTL12360748163252625923.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((("(i14.i2.u34.p104==0)")&&(X(G(("((i14.i2.u150.p554==0)||(i0.i1.u73.p219==1))")||(F("((i9.u111.p377==0)||(i5.u18.p57==1))"))))))&&("((i5.u18.p57!=0)||(i9.u111.p377!=1))"))))
Formula 0 simplified : !G("((i5.u18.p57!=0)||(i9.u111.p377!=1))" & "(i14.i2.u34.p104==0)" & XG("((i14.i2.u150.p554==0)||(i0.i1.u73.p219==1))" | F"((i9.u111.p377==0)||(i5.u18.p57==1))"))
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t156, t164, t176, t184, t192, t200, t204, t212, t216, t220, t228, t246, t254, t383, t384, t385, t387, i0.i0.u116.t68, i0.i1.u73.t159, i0.i1.u77.t151, i0.i2.u75.t154, i0.i3.u114.t74, i0.i3.u115.t71, i1.t168, i1.u65.t175, i1.u67.t171, i2.i0.t180, i2.i0.u55.t191, i2.i0.u61.t183, i2.i2.u107.t95, i2.i2.u108.t92, i2.i2.u109.t89, i3.t196, i3.u38.t223, i3.u51.t199, i4.i0.t250, i4.i0.u16.t253, i4.i1.u11.t267, i4.i2.u91.t143, i4.i2.u92.t140, i5.t224, i5.u18.t249, i5.u36.t227, i6.u42.t215, i7.i0.u44.t211, i8.u53.t195, i9.u63.t179, i9.u111.t83, i9.u112.t80, i10.u103.t107, i10.u104.t104, i10.u105.t101, i10.u106.t98, i11.i0.u49.t203, i11.i1.u101.t113, i11.i1.u102.t110, i12.i0.u40.t219, i12.i1.u98.t122, i12.i1.u99.t119, i12.i1.u100.t116, i13.i0.u96.t128, i13.i0.u97.t125, i13.i1.u93.t137, i14.t1, i14.t0, i14.i0.u89.t148, i14.i1.u94.t134, i14.i2.t2, i14.i2.t3, i14.i2.u20.t230, i14.i2.u20.t245, i14.i2.u95.t131, i15.t160, i15.u69.t167, i15.u71.t163, i15.u113.t77, i16.i0.t264, i16.i1.t10, i16.i1.u118.t64, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/263/83/382
Computing Next relation with stutter on 1212 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
447 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.58551,163088,1,0,287543,836,6917,710339,256,2652,693461
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-11-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-11-13 finished in 25238 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin880069936884700895
[2021-05-09 07:27:52] [INFO ] Applying decomposition
[2021-05-09 07:27:52] [INFO ] Flatten gal took : 10 ms
[2021-05-09 07:27:52] [INFO ] Computing symmetric may disable matrix : 392 transitions.
[2021-05-09 07:27:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:27:52] [INFO ] Computing symmetric may enable matrix : 392 transitions.
[2021-05-09 07:27:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph4385725023666443891.txt, -o, /tmp/graph4385725023666443891.bin, -w, /tmp/graph4385725023666443891.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/graph4385725023666443891.bin, -l, -1, -v, -w, /tmp/graph4385725023666443891.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:27:52] [INFO ] Decomposing Gal with order
[2021-05-09 07:27:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:27:52] [INFO ] Computing Do-Not-Accords matrix : 392 transitions.
[2021-05-09 07:27:52] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:27:52] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin880069936884700895
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/ltsmin880069936884700895]
[2021-05-09 07:27:52] [INFO ] Removed a total of 248 redundant transitions.
[2021-05-09 07:27:52] [INFO ] Flatten gal took : 90 ms
[2021-05-09 07:27:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 40 ms.
[2021-05-09 07:27:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality15428750237611557213.gal : 5 ms
[2021-05-09 07:27:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality5495757470987876778.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/LTLCardinality15428750237611557213.gal, -t, CGAL, -LTL, /tmp/LTLCardinality5495757470987876778.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/LTLCardinality15428750237611557213.gal -t CGAL -LTL /tmp/LTLCardinality5495757470987876778.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F("(i6.i1.u157.p556==1)"))||(X(X(G("((i0.i2.u75.p221==0)||(i2.u6.p16==1))")))))))
Formula 0 simplified : !G(F"(i6.i1.u157.p556==1)" | XXG"((i0.i2.u75.p221==0)||(i2.u6.p16==1))")
Compilation finished in 2095 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin880069936884700895]
Link finished in 55 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)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin880069936884700895]
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t250, t254, t260, t278, t294, t302, t310, t314, t324, t328, t354, t362, t499, t503, i0.i0.u119.t132, i0.i1.u77.t246, i0.i2.u75.t253, i0.i2.u79.t243, i1.t274, i1.t264, i1.u65.t277, i1.u67.t271, i1.u69.t267, i1.u114.t152, i2.t298, i2.u42.t319, i2.u51.t301, i3.u20.t357, i4.t358, i4.u11.t382, i4.u18.t361, i5.t375, i5.t374, i5.t371, i5.u13.t379, i5.u15.t372, i6.t3, i6.t2, i6.t0, i6.i0.t1, i6.i0.u22.t334, i6.i0.u22.t353, i6.i0.u92.t239, i6.i1.u98.t216, i6.i2.u97.t220, i7.i0.u46.t309, i8.i0.t282, i8.i0.t290, i8.i0.u53.t297, i8.i0.u55.t293, i8.i0.u57.t289, i8.i2.u109.t172, i8.i2.u110.t168, i9.i0.u73.t259, i9.i1.u117.t140, i9.i1.u118.t136, i10.i0.u71.t263, i10.i1.u115.t148, i10.i1.u116.t144, i11.u63.t281, i11.u111.t164, i11.u112.t160, i12.u106.t184, i12.u107.t180, i12.u108.t176, i13.u44.t313, i13.u103.t196, i13.u104.t192, i13.u105.t188, i14.i0.t320, i14.i0.u38.t327, i14.i0.u40.t323, i14.i1.u101.t204, i14.i1.u102.t200, i14.i2.u99.t212, i14.i2.u100.t208, i15.i0.u95.t228, i15.i0.u96.t224, i15.i1.u94.t232, i16.t70, i16.t37, i16.t10, i16.u120.t21, i16.u120.t92, i16.u120.t126, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/267/88/391
Computing Next relation with stutter on 1212 deadlock states
LTSmin run took 97478 ms.
FORMULA BusinessProcesses-PT-11-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620545372576

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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