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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K 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.8K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 192K 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-20-00
FORMULA_NAME BusinessProcesses-PT-20-01
FORMULA_NAME BusinessProcesses-PT-20-02
FORMULA_NAME BusinessProcesses-PT-20-03
FORMULA_NAME BusinessProcesses-PT-20-04
FORMULA_NAME BusinessProcesses-PT-20-05
FORMULA_NAME BusinessProcesses-PT-20-06
FORMULA_NAME BusinessProcesses-PT-20-07
FORMULA_NAME BusinessProcesses-PT-20-08
FORMULA_NAME BusinessProcesses-PT-20-09
FORMULA_NAME BusinessProcesses-PT-20-10
FORMULA_NAME BusinessProcesses-PT-20-11
FORMULA_NAME BusinessProcesses-PT-20-12
FORMULA_NAME BusinessProcesses-PT-20-13
FORMULA_NAME BusinessProcesses-PT-20-14
FORMULA_NAME BusinessProcesses-PT-20-15

=== Now, execution of the tool begins

BK_START 1620548820696

Running Version 0
[2021-05-09 08:27:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 08:27:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:27:02] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2021-05-09 08:27:02] [INFO ] Transformed 782 places.
[2021-05-09 08:27:02] [INFO ] Transformed 697 transitions.
[2021-05-09 08:27:02] [INFO ] Found NUPN structural information;
[2021-05-09 08:27:02] [INFO ] Parsed PT model containing 782 places and 697 transitions in 116 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 08:27:02] [INFO ] Initial state test concluded for 7 properties.
Deduced a syphon composed of 63 places in 13 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 103 places :
Symmetric choice reduction at 1 with 103 rule applications. Total rules 117 place count 602 transition count 535
Iterating global reduction 1 with 103 rules applied. Total rules applied 220 place count 602 transition count 535
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 273 place count 549 transition count 482
Iterating global reduction 1 with 53 rules applied. Total rules applied 326 place count 549 transition count 482
Applied a total of 326 rules in 127 ms. Remains 549 /719 variables (removed 170) and now considering 482/638 (removed 156) transitions.
// Phase 1: matrix 482 rows 549 cols
[2021-05-09 08:27:02] [INFO ] Computed 107 place invariants in 29 ms
[2021-05-09 08:27:03] [INFO ] Implicit Places using invariants in 485 ms returned []
// Phase 1: matrix 482 rows 549 cols
[2021-05-09 08:27:03] [INFO ] Computed 107 place invariants in 24 ms
[2021-05-09 08:27:03] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 1089 ms to find 0 implicit places.
// Phase 1: matrix 482 rows 549 cols
[2021-05-09 08:27:03] [INFO ] Computed 107 place invariants in 15 ms
[2021-05-09 08:27:04] [INFO ] Dead Transitions using invariants and state equation in 292 ms returned []
Finished structural reductions, in 1 iterations. Remains : 549/719 places, 482/638 transitions.
[2021-05-09 08:27:04] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 08:27:04] [INFO ] Flatten gal took : 89 ms
FORMULA BusinessProcesses-PT-20-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 08:27:04] [INFO ] Flatten gal took : 40 ms
[2021-05-09 08:27:04] [INFO ] Input system was already deterministic with 482 transitions.
Incomplete random walk after 100000 steps, including 506 resets, run finished after 425 ms. (steps per millisecond=235 ) properties (out of 11) seen :8
Running SMT prover for 3 properties.
// Phase 1: matrix 482 rows 549 cols
[2021-05-09 08:27:04] [INFO ] Computed 107 place invariants in 13 ms
[2021-05-09 08:27:05] [INFO ] [Real]Absence check using 65 positive place invariants in 22 ms returned sat
[2021-05-09 08:27:05] [INFO ] [Real]Absence check using 65 positive and 42 generalized place invariants in 10 ms returned sat
[2021-05-09 08:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:05] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2021-05-09 08:27:05] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 4 ms to minimize.
[2021-05-09 08:27:05] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2021-05-09 08:27:05] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2021-05-09 08:27:05] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:27:05] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:27:05] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2021-05-09 08:27:05] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2021-05-09 08:27:05] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2021-05-09 08:27:06] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2021-05-09 08:27:06] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2021-05-09 08:27:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 887 ms
[2021-05-09 08:27:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:27:06] [INFO ] [Nat]Absence check using 65 positive place invariants in 18 ms returned sat
[2021-05-09 08:27:06] [INFO ] [Nat]Absence check using 65 positive and 42 generalized place invariants in 8 ms returned sat
[2021-05-09 08:27:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:06] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2021-05-09 08:27:06] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2021-05-09 08:27:06] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2021-05-09 08:27:06] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2021-05-09 08:27:06] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2021-05-09 08:27:06] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2021-05-09 08:27:06] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2021-05-09 08:27:06] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2021-05-09 08:27:06] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2021-05-09 08:27:06] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2021-05-09 08:27:06] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
[2021-05-09 08:27:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 635 ms
[2021-05-09 08:27:07] [INFO ] Computed and/alt/rep : 475/961/475 causal constraints (skipped 6 transitions) in 21 ms.
[2021-05-09 08:27:09] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 1 ms to minimize.
[2021-05-09 08:27:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2021-05-09 08:27:09] [INFO ] Added : 372 causal constraints over 75 iterations in 2556 ms. Result :sat
[2021-05-09 08:27:09] [INFO ] [Real]Absence check using 65 positive place invariants in 27 ms returned sat
[2021-05-09 08:27:09] [INFO ] [Real]Absence check using 65 positive and 42 generalized place invariants in 10 ms returned sat
[2021-05-09 08:27:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:09] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-09 08:27:09] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2021-05-09 08:27:09] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2021-05-09 08:27:10] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 0 ms to minimize.
[2021-05-09 08:27:10] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 0 ms to minimize.
[2021-05-09 08:27:10] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 0 ms to minimize.
[2021-05-09 08:27:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 383 ms
[2021-05-09 08:27:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:27:10] [INFO ] [Nat]Absence check using 65 positive place invariants in 21 ms returned sat
[2021-05-09 08:27:10] [INFO ] [Nat]Absence check using 65 positive and 42 generalized place invariants in 9 ms returned sat
[2021-05-09 08:27:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:10] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-09 08:27:10] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:27:10] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2021-05-09 08:27:10] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2021-05-09 08:27:10] [INFO ] Deduced a trap composed of 74 places in 38 ms of which 0 ms to minimize.
[2021-05-09 08:27:10] [INFO ] Deduced a trap composed of 71 places in 37 ms of which 0 ms to minimize.
[2021-05-09 08:27:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 416 ms
[2021-05-09 08:27:10] [INFO ] Computed and/alt/rep : 475/961/475 causal constraints (skipped 6 transitions) in 35 ms.
[2021-05-09 08:27:13] [INFO ] Deduced a trap composed of 111 places in 148 ms of which 1 ms to minimize.
[2021-05-09 08:27:13] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 1 ms to minimize.
[2021-05-09 08:27:13] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 1 ms to minimize.
[2021-05-09 08:27:13] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:27:14] [INFO ] Deduced a trap composed of 111 places in 151 ms of which 1 ms to minimize.
[2021-05-09 08:27:14] [INFO ] Deduced a trap composed of 100 places in 155 ms of which 0 ms to minimize.
[2021-05-09 08:27:14] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 1 ms to minimize.
[2021-05-09 08:27:14] [INFO ] Deduced a trap composed of 105 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:27:14] [INFO ] Deduced a trap composed of 105 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:27:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1790 ms
[2021-05-09 08:27:14] [INFO ] Added : 355 causal constraints over 71 iterations in 4073 ms. Result :sat
[2021-05-09 08:27:15] [INFO ] [Real]Absence check using 65 positive place invariants in 21 ms returned sat
[2021-05-09 08:27:15] [INFO ] [Real]Absence check using 65 positive and 42 generalized place invariants in 10 ms returned sat
[2021-05-09 08:27:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:15] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-09 08:27:15] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:27:15] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 0 ms to minimize.
[2021-05-09 08:27:15] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2021-05-09 08:27:15] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 0 ms to minimize.
[2021-05-09 08:27:15] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2021-05-09 08:27:15] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2021-05-09 08:27:15] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:27:16] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2021-05-09 08:27:16] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 0 ms to minimize.
[2021-05-09 08:27:16] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 0 ms to minimize.
[2021-05-09 08:27:16] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 0 ms to minimize.
[2021-05-09 08:27:16] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2021-05-09 08:27:16] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2021-05-09 08:27:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1211 ms
[2021-05-09 08:27:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:27:16] [INFO ] [Nat]Absence check using 65 positive place invariants in 24 ms returned sat
[2021-05-09 08:27:16] [INFO ] [Nat]Absence check using 65 positive and 42 generalized place invariants in 9 ms returned sat
[2021-05-09 08:27:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:16] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2021-05-09 08:27:16] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2021-05-09 08:27:16] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2021-05-09 08:27:17] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2021-05-09 08:27:17] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 9 ms to minimize.
[2021-05-09 08:27:17] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2021-05-09 08:27:17] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:27:17] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2021-05-09 08:27:17] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 0 ms to minimize.
[2021-05-09 08:27:17] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
[2021-05-09 08:27:17] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2021-05-09 08:27:17] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2021-05-09 08:27:17] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2021-05-09 08:27:17] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 0 ms to minimize.
[2021-05-09 08:27:17] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1143 ms
[2021-05-09 08:27:17] [INFO ] Computed and/alt/rep : 475/961/475 causal constraints (skipped 6 transitions) in 37 ms.
[2021-05-09 08:27:20] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 3 ms to minimize.
[2021-05-09 08:27:20] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 2 ms to minimize.
[2021-05-09 08:27:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 489 ms
[2021-05-09 08:27:20] [INFO ] Added : 382 causal constraints over 77 iterations in 2705 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||G(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 549 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 541 transition count 474
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 541 transition count 474
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 538 transition count 471
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 538 transition count 471
Applied a total of 22 rules in 67 ms. Remains 538 /549 variables (removed 11) and now considering 471/482 (removed 11) transitions.
// Phase 1: matrix 471 rows 538 cols
[2021-05-09 08:27:20] [INFO ] Computed 107 place invariants in 10 ms
[2021-05-09 08:27:20] [INFO ] Implicit Places using invariants in 188 ms returned []
// Phase 1: matrix 471 rows 538 cols
[2021-05-09 08:27:20] [INFO ] Computed 107 place invariants in 7 ms
[2021-05-09 08:27:21] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
// Phase 1: matrix 471 rows 538 cols
[2021-05-09 08:27:21] [INFO ] Computed 107 place invariants in 9 ms
[2021-05-09 08:27:21] [INFO ] Dead Transitions using invariants and state equation in 292 ms returned []
Finished structural reductions, in 1 iterations. Remains : 538/549 places, 471/482 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s491 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 242 steps with 0 reset in 11 ms.
FORMULA BusinessProcesses-PT-20-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-01 finished in 1526 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F((p1||X(F((p1&&F(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 549 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 542 transition count 475
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 542 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 539 transition count 472
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 539 transition count 472
Applied a total of 20 rules in 35 ms. Remains 539 /549 variables (removed 10) and now considering 472/482 (removed 10) transitions.
// Phase 1: matrix 472 rows 539 cols
[2021-05-09 08:27:22] [INFO ] Computed 107 place invariants in 4 ms
[2021-05-09 08:27:22] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 472 rows 539 cols
[2021-05-09 08:27:22] [INFO ] Computed 107 place invariants in 3 ms
[2021-05-09 08:27:22] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 539 cols
[2021-05-09 08:27:22] [INFO ] Computed 107 place invariants in 3 ms
[2021-05-09 08:27:23] [INFO ] Dead Transitions using invariants and state equation in 312 ms returned []
Finished structural reductions, in 1 iterations. Remains : 539/549 places, 472/482 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s528 0) (EQ s473 1) (EQ s118 1)), p1:(EQ s118 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 240 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-20-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-03 finished in 1100 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 541 transition count 474
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 541 transition count 474
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 538 transition count 471
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 538 transition count 471
Applied a total of 22 rules in 35 ms. Remains 538 /549 variables (removed 11) and now considering 471/482 (removed 11) transitions.
// Phase 1: matrix 471 rows 538 cols
[2021-05-09 08:27:23] [INFO ] Computed 107 place invariants in 4 ms
[2021-05-09 08:27:23] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 471 rows 538 cols
[2021-05-09 08:27:23] [INFO ] Computed 107 place invariants in 6 ms
[2021-05-09 08:27:24] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
// Phase 1: matrix 471 rows 538 cols
[2021-05-09 08:27:24] [INFO ] Computed 107 place invariants in 5 ms
[2021-05-09 08:27:24] [INFO ] Dead Transitions using invariants and state equation in 273 ms returned []
Finished structural reductions, in 1 iterations. Remains : 538/549 places, 471/482 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s23 0) (NEQ s192 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1077 reset in 235 ms.
Stack based approach found an accepted trace after 906 steps with 10 reset with depth 6 and stack size 6 in 3 ms.
FORMULA BusinessProcesses-PT-20-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-05 finished in 1381 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 542 transition count 475
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 542 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 539 transition count 472
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 539 transition count 472
Applied a total of 20 rules in 30 ms. Remains 539 /549 variables (removed 10) and now considering 472/482 (removed 10) transitions.
// Phase 1: matrix 472 rows 539 cols
[2021-05-09 08:27:24] [INFO ] Computed 107 place invariants in 12 ms
[2021-05-09 08:27:24] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 472 rows 539 cols
[2021-05-09 08:27:24] [INFO ] Computed 107 place invariants in 3 ms
[2021-05-09 08:27:25] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 539 cols
[2021-05-09 08:27:25] [INFO ] Computed 107 place invariants in 4 ms
[2021-05-09 08:27:25] [INFO ] Dead Transitions using invariants and state equation in 281 ms returned []
Finished structural reductions, in 1 iterations. Remains : 539/549 places, 472/482 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s435 0) (NEQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-08 finished in 1205 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))&&F(((F(p2)&&p1)||G(F(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 549 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 542 transition count 475
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 542 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 540 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 540 transition count 473
Applied a total of 18 rules in 34 ms. Remains 540 /549 variables (removed 9) and now considering 473/482 (removed 9) transitions.
// Phase 1: matrix 473 rows 540 cols
[2021-05-09 08:27:25] [INFO ] Computed 107 place invariants in 4 ms
[2021-05-09 08:27:26] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 473 rows 540 cols
[2021-05-09 08:27:26] [INFO ] Computed 107 place invariants in 3 ms
[2021-05-09 08:27:26] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
// Phase 1: matrix 473 rows 540 cols
[2021-05-09 08:27:26] [INFO ] Computed 107 place invariants in 9 ms
[2021-05-09 08:27:26] [INFO ] Dead Transitions using invariants and state equation in 298 ms returned []
Finished structural reductions, in 1 iterations. Remains : 540/549 places, 473/482 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-20-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (NEQ s180 0) (NEQ s356 1)), p2:(OR (NEQ s498 0) (NEQ s72 1)), p0:(AND (OR (EQ s72 0) (EQ s498 1)) (OR (EQ s180 0) (EQ s356 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 510 reset in 256 ms.
Entered a terminal (fully accepting) state of product in 23551 steps with 116 reset in 68 ms.
FORMULA BusinessProcesses-PT-20-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-13 finished in 1568 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 549 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 542 transition count 475
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 542 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 539 transition count 472
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 539 transition count 472
Applied a total of 20 rules in 44 ms. Remains 539 /549 variables (removed 10) and now considering 472/482 (removed 10) transitions.
// Phase 1: matrix 472 rows 539 cols
[2021-05-09 08:27:27] [INFO ] Computed 107 place invariants in 2 ms
[2021-05-09 08:27:27] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 472 rows 539 cols
[2021-05-09 08:27:27] [INFO ] Computed 107 place invariants in 3 ms
[2021-05-09 08:27:28] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 539 cols
[2021-05-09 08:27:28] [INFO ] Computed 107 place invariants in 3 ms
[2021-05-09 08:27:28] [INFO ] Dead Transitions using invariants and state equation in 278 ms returned []
Finished structural reductions, in 1 iterations. Remains : 539/549 places, 472/482 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-20-14 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (NEQ s503 0) (NEQ s426 1)), p0:(NEQ s168 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 507 reset in 178 ms.
Product exploration explored 100000 steps with 512 reset in 234 ms.
Graph (complete) has 1211 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 518 reset in 172 ms.
Product exploration explored 100000 steps with 507 reset in 199 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 539 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 250 edges and 539 vertex of which 6 / 539 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 534 transition count 466
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 109 Pre rules applied. Total rules applied 60 place count 534 transition count 700
Deduced a syphon composed of 168 places in 2 ms
Iterating global reduction 1 with 109 rules applied. Total rules applied 169 place count 534 transition count 700
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 192 place count 511 transition count 627
Deduced a syphon composed of 145 places in 2 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 215 place count 511 transition count 627
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 299 places in 0 ms
Iterating global reduction 1 with 154 rules applied. Total rules applied 369 place count 511 transition count 627
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 415 place count 465 transition count 581
Deduced a syphon composed of 253 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 461 place count 465 transition count 581
Deduced a syphon composed of 253 places in 0 ms
Applied a total of 461 rules in 181 ms. Remains 465 /539 variables (removed 74) and now considering 581/472 (removed -109) transitions.
[2021-05-09 08:27:30] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 581 rows 465 cols
[2021-05-09 08:27:30] [INFO ] Computed 107 place invariants in 9 ms
[2021-05-09 08:27:30] [INFO ] Dead Transitions using invariants and state equation in 294 ms returned []
Finished structural reductions, in 1 iterations. Remains : 465/539 places, 581/472 transitions.
Product exploration explored 100000 steps with 16666 reset in 818 ms.
Product exploration explored 100000 steps with 16666 reset in 970 ms.
[2021-05-09 08:27:32] [INFO ] Flatten gal took : 35 ms
[2021-05-09 08:27:32] [INFO ] Flatten gal took : 32 ms
[2021-05-09 08:27:32] [INFO ] Time to serialize gal into /tmp/LTL4418977828023183142.gal : 12 ms
[2021-05-09 08:27:32] [INFO ] Time to serialize properties into /tmp/LTL9251641083489907360.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/LTL4418977828023183142.gal, -t, CGAL, -LTL, /tmp/LTL9251641083489907360.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/LTL4418977828023183142.gal -t CGAL -LTL /tmp/LTL9251641083489907360.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(p223!=1)")))||(G("((p746!=0)&&(p557!=1))")))))
Formula 0 simplified : !X(FG"(p223!=1)" | G"((p746!=0)&&(p557!=1))")
Detected timeout of ITS tools.
[2021-05-09 08:27:47] [INFO ] Flatten gal took : 18 ms
[2021-05-09 08:27:47] [INFO ] Applying decomposition
[2021-05-09 08:27:47] [INFO ] Flatten gal took : 21 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/graph7088458445262092360.txt, -o, /tmp/graph7088458445262092360.bin, -w, /tmp/graph7088458445262092360.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/graph7088458445262092360.bin, -l, -1, -v, -w, /tmp/graph7088458445262092360.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:27:47] [INFO ] Decomposing Gal with order
[2021-05-09 08:27:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:27:47] [INFO ] Removed a total of 285 redundant transitions.
[2021-05-09 08:27:47] [INFO ] Flatten gal took : 91 ms
[2021-05-09 08:27:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 22 ms.
[2021-05-09 08:27:47] [INFO ] Time to serialize gal into /tmp/LTL7974016939892072751.gal : 14 ms
[2021-05-09 08:27:47] [INFO ] Time to serialize properties into /tmp/LTL8979809756671952568.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/LTL7974016939892072751.gal, -t, CGAL, -LTL, /tmp/LTL8979809756671952568.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/LTL7974016939892072751.gal -t CGAL -LTL /tmp/LTL8979809756671952568.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(i10.i0.u65.p223!=1)")))||(G("((i17.u150.p746!=0)&&(i8.i1.u147.p557!=1))")))))
Formula 0 simplified : !X(FG"(i10.i0.u65.p223!=1)" | G"((i17.u150.p746!=0)&&(i8.i1.u147.p557!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15114241543223610738
[2021-05-09 08:28:02] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15114241543223610738
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/ltsmin15114241543223610738]
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/ltsmin15114241543223610738] 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/ltsmin15114241543223610738] 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-20-14 finished in 36447 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8490100111250558765
[2021-05-09 08:28:03] [INFO ] Computing symmetric may disable matrix : 482 transitions.
[2021-05-09 08:28:03] [INFO ] Applying decomposition
[2021-05-09 08:28:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:28:03] [INFO ] Computing symmetric may enable matrix : 482 transitions.
[2021-05-09 08:28:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:28:03] [INFO ] Flatten gal took : 36 ms
[2021-05-09 08:28:04] [INFO ] Computing Do-Not-Accords matrix : 482 transitions.
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/graph942533250823854851.txt, -o, /tmp/graph942533250823854851.bin, -w, /tmp/graph942533250823854851.weights], workingDir=null]
[2021-05-09 08:28:04] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph942533250823854851.bin, -l, -1, -v, -w, /tmp/graph942533250823854851.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:28:04] [INFO ] Built C files in 132ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8490100111250558765
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/ltsmin8490100111250558765]
[2021-05-09 08:28:04] [INFO ] Decomposing Gal with order
[2021-05-09 08:28:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:28:04] [INFO ] Removed a total of 278 redundant transitions.
[2021-05-09 08:28:04] [INFO ] Flatten gal took : 56 ms
[2021-05-09 08:28:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 20 ms.
[2021-05-09 08:28:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality5253970104546889957.gal : 23 ms
[2021-05-09 08:28:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality2729275561804849700.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/LTLCardinality5253970104546889957.gal, -t, CGAL, -LTL, /tmp/LTLCardinality2729275561804849700.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/LTLCardinality5253970104546889957.gal -t CGAL -LTL /tmp/LTLCardinality2729275561804849700.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(((!("((i18.u152.p746==0)||(i0.i2.u147.p557==1))"))||(F(G("(i19.i0.u65.p223!=1)"))))U((((!("((i18.u152.p746==0)||(i0.i2.u147.p557==1))"))&&(F(G("(i19.i0.u65.p223!=1)"))))&&((!("((i18.u152.p746==0)||(i0.i2.u147.p557==1))"))||(F(G("(i19.i0.u65.p223!=1)")))))||(G((!("((i18.u152.p746==0)||(i0.i2.u147.p557==1))"))||(F(G("(i19.i0.u65.p223!=1)")))))))))
Formula 0 simplified : !X((!"((i18.u152.p746==0)||(i0.i2.u147.p557==1))" | FG"(i19.i0.u65.p223!=1)") U ((!"((i18.u152.p746==0)||(i0.i2.u147.p557==1))" & FG"(i19.i0.u65.p223!=1)" & (!"((i18.u152.p746==0)||(i0.i2.u147.p557==1))" | FG"(i19.i0.u65.p223!=1)")) | G(!"((i18.u152.p746==0)||(i0.i2.u147.p557==1))" | FG"(i19.i0.u65.p223!=1)")))
Compilation finished in 2697 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8490100111250558765]
Link finished in 70 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8490100111250558765]
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t483, t509, t572, t586, t588, t591, t593, t600, t605, t607, t611, t613, t625, t627, t630, t688, t689, i0.i0.u91.t352, i0.i1.u93.t340, i0.i2.u147.t182, i0.i2.u148.t178, i0.i2.u149.t174, i1.t371, i1.t367, i1.u79.t378, i1.u81.t374, i1.u83.t370, i2.u75.t386, i2.u77.t382, i3.u71.t396, i3.u73.t390, i3.u142.t202, i4.i0.u53.t432, i4.i0.u55.t428, i4.i1.u133.t238, i4.i1.u134.t234, i4.i2.u131.t246, i4.i2.u132.t242, i5.i0.u45.t446, i5.i0.u47.t442, i5.i0.u113.t333, i6.u43.t472, i7.u120.t302, i7.u121.t298, i8.t2, i8.t0, i8.i0.t1, i8.i0.t3, i8.i0.u23.t489, i8.i0.u23.t508, i8.i0.u123.t290, i8.i1.u122.t294, i8.i2.u124.t286, i9.i0.u41.t476, i9.i1.t524, i10.i0.t438, i11.u87.t360, i11.u89.t356, i12.i0.u85.t365, i12.i0.u86.t364, i12.i1.u145.t190, i12.i1.u146.t186, i12.i2.u143.t198, i12.i2.u144.t194, i13.i0.u69.t400, i13.i1.u67.t404, i13.i1.u138.t218, i13.i1.u139.t214, i13.i1.u140.t210, i13.i1.u141.t206, i14.i0.u57.t424, i14.i1.u61.t418, i14.i2.u135.t230, i14.i2.u136.t226, i15.u115.t326, i15.u115.t337, i15.u129.t263, i15.u130.t250, i16.i0.u39.t482, i16.i1.u125.t282, i16.i1.u126.t278, i16.i1.u127.t274, i16.i1.u128.t270, i17.i0.t539, i17.i1.u116.t318, i17.i1.u117.t314, i17.i1.u118.t310, i17.i1.u119.t306, i18.t63, i18.t10, i18.u152.t12, i18.u152.t13, i18.u152.t66, i18.u152.t135, i18.u152.t146, i18.u152.t168, i19.i0.u63.t413, i19.i0.u64.t412, i19.i0.u65.t408, i19.i0.u137.t222, i19.i1.t65, i19.i1.u165.t69, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/337/105/478
Computing Next relation with stutter on 1.99596e+09 deadlock states
WARNING : LTSmin timed out (>600 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8490100111250558765]
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8490100111250558765]
Detected timeout of ITS tools.
[2021-05-09 08:48:24] [INFO ] Applying decomposition
[2021-05-09 08:48:24] [INFO ] Flatten gal took : 40 ms
[2021-05-09 08:48:24] [INFO ] Decomposing Gal with order
[2021-05-09 08:48:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:48:24] [INFO ] Removed a total of 145 redundant transitions.
[2021-05-09 08:48:24] [INFO ] Flatten gal took : 94 ms
[2021-05-09 08:48:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 256 labels/synchronizations in 493 ms.
[2021-05-09 08:48:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality4963477434556177241.gal : 30 ms
[2021-05-09 08:48:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality17972361234091240264.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/LTLCardinality4963477434556177241.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17972361234091240264.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/LTLCardinality4963477434556177241.gal -t CGAL -LTL /tmp/LTLCardinality17972361234091240264.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(((!("((i1.u182.p746==0)||(i0.i1.i0.i0.u165.p557==1))"))||(F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u69.p223!=1)"))))U((((!("((i1.u182.p746==0)||(i0.i1.i0.i0.u165.p557==1))"))&&(F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u69.p223!=1)"))))&&((!("((i1.u182.p746==0)||(i0.i1.i0.i0.u165.p557==1))"))||(F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u69.p223!=1)")))))||(G((!("((i1.u182.p746==0)||(i0.i1.i0.i0.u165.p557==1))"))||(F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u69.p223!=1)")))))))))
Formula 0 simplified : !X((!"((i1.u182.p746==0)||(i0.i1.i0.i0.u165.p557==1))" | FG"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u69.p223!=1)") U ((!"((i1.u182.p746==0)||(i0.i1.i0.i0.u165.p557==1))" & FG"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u69.p223!=1)" & (!"((i1.u182.p746==0)||(i0.i1.i0.i0.u165.p557==1))" | FG"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u69.p223!=1)")) | G(!"((i1.u182.p746==0)||(i0.i1.i0.i0.u165.p557==1))" | FG"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u69.p223!=1)")))
LTSmin run took 1283758 ms.
FORMULA BusinessProcesses-PT-20-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620550771034

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

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