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

--------------------
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 1620548827642

Running Version 0
[2021-05-09 08:27:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 08:27:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:27:09] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2021-05-09 08:27:09] [INFO ] Transformed 782 places.
[2021-05-09 08:27:09] [INFO ] Transformed 697 transitions.
[2021-05-09 08:27:09] [INFO ] Found NUPN structural information;
[2021-05-09 08:27:09] [INFO ] Parsed PT model containing 782 places and 697 transitions in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 08:27:09] [INFO ] Initial state test concluded for 3 properties.
Deduced a syphon composed of 63 places in 23 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 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 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 114 place count 605 transition count 538
Iterating global reduction 1 with 100 rules applied. Total rules applied 214 place count 605 transition count 538
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 268 place count 551 transition count 484
Iterating global reduction 1 with 54 rules applied. Total rules applied 322 place count 551 transition count 484
Applied a total of 322 rules in 147 ms. Remains 551 /719 variables (removed 168) and now considering 484/638 (removed 154) transitions.
// Phase 1: matrix 484 rows 551 cols
[2021-05-09 08:27:10] [INFO ] Computed 107 place invariants in 49 ms
[2021-05-09 08:27:10] [INFO ] Implicit Places using invariants in 360 ms returned []
// Phase 1: matrix 484 rows 551 cols
[2021-05-09 08:27:10] [INFO ] Computed 107 place invariants in 13 ms
[2021-05-09 08:27:11] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
// Phase 1: matrix 484 rows 551 cols
[2021-05-09 08:27:11] [INFO ] Computed 107 place invariants in 30 ms
[2021-05-09 08:27:11] [INFO ] Dead Transitions using invariants and state equation in 290 ms returned []
Finished structural reductions, in 1 iterations. Remains : 551/719 places, 484/638 transitions.
[2021-05-09 08:27:11] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 08:27:11] [INFO ] Flatten gal took : 84 ms
FORMULA BusinessProcesses-PT-20-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 08:27:11] [INFO ] Flatten gal took : 35 ms
[2021-05-09 08:27:11] [INFO ] Input system was already deterministic with 484 transitions.
Incomplete random walk after 100000 steps, including 501 resets, run finished after 409 ms. (steps per millisecond=244 ) properties (out of 20) seen :12
Running SMT prover for 8 properties.
// Phase 1: matrix 484 rows 551 cols
[2021-05-09 08:27:12] [INFO ] Computed 107 place invariants in 10 ms
[2021-05-09 08:27:12] [INFO ] [Real]Absence check using 64 positive place invariants in 20 ms returned sat
[2021-05-09 08:27:12] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 10 ms returned sat
[2021-05-09 08:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:12] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-09 08:27:12] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 2 ms to minimize.
[2021-05-09 08:27:12] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:27:13] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2021-05-09 08:27:13] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2021-05-09 08:27:13] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2021-05-09 08:27:13] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2021-05-09 08:27:13] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2021-05-09 08:27:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 794 ms
[2021-05-09 08:27:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:27:13] [INFO ] [Nat]Absence check using 64 positive place invariants in 18 ms returned sat
[2021-05-09 08:27:13] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 32 ms returned sat
[2021-05-09 08:27:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:13] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-09 08:27:13] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2021-05-09 08:27:13] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2021-05-09 08:27:14] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2021-05-09 08:27:14] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2021-05-09 08:27:14] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2021-05-09 08:27:15] [INFO ] Deduced a trap composed of 27 places in 1239 ms of which 0 ms to minimize.
[2021-05-09 08:27:15] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2021-05-09 08:27:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1879 ms
[2021-05-09 08:27:15] [INFO ] Computed and/alt/rep : 477/895/477 causal constraints (skipped 6 transitions) in 50 ms.
[2021-05-09 08:27:18] [INFO ] Added : 370 causal constraints over 74 iterations in 2559 ms. Result :sat
[2021-05-09 08:27:18] [INFO ] [Real]Absence check using 64 positive place invariants in 30 ms returned sat
[2021-05-09 08:27:18] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 29 ms returned sat
[2021-05-09 08:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:18] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2021-05-09 08:27:18] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2021-05-09 08:27:18] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2021-05-09 08:27:18] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2021-05-09 08:27:18] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2021-05-09 08:27:18] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2021-05-09 08:27:18] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2021-05-09 08:27:18] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
[2021-05-09 08:27:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 541 ms
[2021-05-09 08:27:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:27:19] [INFO ] [Nat]Absence check using 64 positive place invariants in 18 ms returned sat
[2021-05-09 08:27:19] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 8 ms returned sat
[2021-05-09 08:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:19] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-09 08:27:19] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:27:19] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2021-05-09 08:27:19] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2021-05-09 08:27:19] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 0 ms to minimize.
[2021-05-09 08:27:19] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 4 ms to minimize.
[2021-05-09 08:27:19] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2021-05-09 08:27:19] [INFO ] Deduced a trap composed of 39 places in 16 ms of which 0 ms to minimize.
[2021-05-09 08:27:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 535 ms
[2021-05-09 08:27:19] [INFO ] Computed and/alt/rep : 477/895/477 causal constraints (skipped 6 transitions) in 28 ms.
[2021-05-09 08:27:21] [INFO ] Added : 353 causal constraints over 71 iterations in 1707 ms. Result :sat
[2021-05-09 08:27:21] [INFO ] [Real]Absence check using 64 positive place invariants in 16 ms returned sat
[2021-05-09 08:27:21] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 9 ms returned sat
[2021-05-09 08:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:21] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2021-05-09 08:27:21] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:27:22] [INFO ] Deduced a trap composed of 97 places in 156 ms of which 0 ms to minimize.
[2021-05-09 08:27:22] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:27:22] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:27:22] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:27:22] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2021-05-09 08:27:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 798 ms
[2021-05-09 08:27:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:27:22] [INFO ] [Nat]Absence check using 64 positive place invariants in 47 ms returned sat
[2021-05-09 08:27:22] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 14 ms returned sat
[2021-05-09 08:27:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:22] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2021-05-09 08:27:23] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 5 ms to minimize.
[2021-05-09 08:27:23] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:27:23] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2021-05-09 08:27:23] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:27:23] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:27:23] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:27:23] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 1 ms to minimize.
[2021-05-09 08:27:23] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:27:24] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:27:24] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2021-05-09 08:27:24] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 1 ms to minimize.
[2021-05-09 08:27:24] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:27:24] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:27:24] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:27:24] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2021-05-09 08:27:24] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1961 ms
[2021-05-09 08:27:24] [INFO ] Computed and/alt/rep : 477/895/477 causal constraints (skipped 6 transitions) in 31 ms.
[2021-05-09 08:27:26] [INFO ] Added : 373 causal constraints over 75 iterations in 1964 ms. Result :sat
[2021-05-09 08:27:26] [INFO ] [Real]Absence check using 64 positive place invariants in 25 ms returned sat
[2021-05-09 08:27:26] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 11 ms returned sat
[2021-05-09 08:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:27] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2021-05-09 08:27:27] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2021-05-09 08:27:27] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2021-05-09 08:27:27] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2021-05-09 08:27:27] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2021-05-09 08:27:27] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2021-05-09 08:27:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 343 ms
[2021-05-09 08:27:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:27:27] [INFO ] [Nat]Absence check using 64 positive place invariants in 25 ms returned sat
[2021-05-09 08:27:27] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 10 ms returned sat
[2021-05-09 08:27:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:27] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2021-05-09 08:27:27] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2021-05-09 08:27:27] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2021-05-09 08:27:27] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2021-05-09 08:27:27] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2021-05-09 08:27:28] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2021-05-09 08:27:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 321 ms
[2021-05-09 08:27:28] [INFO ] Computed and/alt/rep : 477/895/477 causal constraints (skipped 6 transitions) in 44 ms.
[2021-05-09 08:27:29] [INFO ] Added : 368 causal constraints over 74 iterations in 1803 ms. Result :sat
[2021-05-09 08:27:29] [INFO ] [Real]Absence check using 64 positive place invariants in 30 ms returned sat
[2021-05-09 08:27:29] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 14 ms returned sat
[2021-05-09 08:27:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:30] [INFO ] [Real]Absence check using state equation in 159 ms returned unsat
[2021-05-09 08:27:30] [INFO ] [Real]Absence check using 64 positive place invariants in 10 ms returned unsat
[2021-05-09 08:27:30] [INFO ] [Real]Absence check using 64 positive place invariants in 23 ms returned sat
[2021-05-09 08:27:30] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 10 ms returned sat
[2021-05-09 08:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:30] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2021-05-09 08:27:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:27:30] [INFO ] [Nat]Absence check using 64 positive place invariants in 20 ms returned sat
[2021-05-09 08:27:30] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 9 ms returned sat
[2021-05-09 08:27:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:30] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2021-05-09 08:27:30] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 1 ms to minimize.
[2021-05-09 08:27:31] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 0 ms to minimize.
[2021-05-09 08:27:31] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:27:31] [INFO ] Deduced a trap composed of 80 places in 158 ms of which 1 ms to minimize.
[2021-05-09 08:27:31] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 1 ms to minimize.
[2021-05-09 08:27:31] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:27:31] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 3 ms to minimize.
[2021-05-09 08:27:32] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 1 ms to minimize.
[2021-05-09 08:27:32] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 6 ms to minimize.
[2021-05-09 08:27:32] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 0 ms to minimize.
[2021-05-09 08:27:32] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 2 ms to minimize.
[2021-05-09 08:27:32] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:27:32] [INFO ] Deduced a trap composed of 69 places in 157 ms of which 0 ms to minimize.
[2021-05-09 08:27:33] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 0 ms to minimize.
[2021-05-09 08:27:33] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 0 ms to minimize.
[2021-05-09 08:27:33] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:27:33] [INFO ] Deduced a trap composed of 78 places in 163 ms of which 0 ms to minimize.
[2021-05-09 08:27:33] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:27:33] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:27:34] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:27:34] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2021-05-09 08:27:34] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 0 ms to minimize.
[2021-05-09 08:27:34] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2021-05-09 08:27:34] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2021-05-09 08:27:34] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 0 ms to minimize.
[2021-05-09 08:27:34] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2021-05-09 08:27:34] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2021-05-09 08:27:34] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2021-05-09 08:27:34] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2021-05-09 08:27:34] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2021-05-09 08:27:34] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2021-05-09 08:27:35] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2021-05-09 08:27:35] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2021-05-09 08:27:35] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
[2021-05-09 08:27:35] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 4353 ms
[2021-05-09 08:27:35] [INFO ] Computed and/alt/rep : 477/895/477 causal constraints (skipped 6 transitions) in 25 ms.
[2021-05-09 08:27:36] [INFO ] Added : 346 causal constraints over 70 iterations in 1711 ms. Result :sat
[2021-05-09 08:27:36] [INFO ] [Real]Absence check using 64 positive place invariants in 16 ms returned sat
[2021-05-09 08:27:36] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 9 ms returned sat
[2021-05-09 08:27:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:37] [INFO ] [Real]Absence check using state equation in 114 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
[2021-05-09 08:27:37] [INFO ] Initial state test concluded for 1 properties.
FORMULA BusinessProcesses-PT-20-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Graph (trivial) has 262 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 545 transition count 409
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 477 transition count 408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 139 place count 476 transition count 408
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 139 place count 476 transition count 297
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 382 place count 344 transition count 297
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 392 place count 334 transition count 287
Iterating global reduction 3 with 10 rules applied. Total rules applied 402 place count 334 transition count 287
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 694 place count 186 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 698 place count 184 transition count 150
Applied a total of 698 rules in 84 ms. Remains 184 /551 variables (removed 367) and now considering 150/484 (removed 334) transitions.
[2021-05-09 08:27:37] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 184 cols
[2021-05-09 08:27:37] [INFO ] Computed 82 place invariants in 1 ms
[2021-05-09 08:27:37] [INFO ] Implicit Places using invariants in 215 ms returned [28, 29, 30, 31, 32, 37, 38, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 54, 55, 56, 57, 58, 59, 60, 154]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 217 ms to find 25 implicit places.
[2021-05-09 08:27:37] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-09 08:27:37] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 159 cols
[2021-05-09 08:27:37] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-09 08:27:37] [INFO ] Dead Transitions using invariants and state equation in 174 ms returned []
Starting structural reductions, iteration 1 : 159/551 places, 150/484 transitions.
Applied a total of 0 rules in 9 ms. Remains 159 /159 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2021-05-09 08:27:37] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 08:27:37] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 159 cols
[2021-05-09 08:27:37] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-09 08:27:37] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 2 iterations. Remains : 159/551 places, 150/484 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-01 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:(NEQ s38 1), p1:(AND (NEQ s36 1) (NEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-01 finished in 958 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Graph (trivial) has 261 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 545 transition count 409
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 477 transition count 409
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 137 place count 477 transition count 298
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 381 place count 344 transition count 298
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 389 place count 336 transition count 290
Iterating global reduction 2 with 8 rules applied. Total rules applied 397 place count 336 transition count 290
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 695 place count 185 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 699 place count 183 transition count 150
Applied a total of 699 rules in 147 ms. Remains 183 /551 variables (removed 368) and now considering 150/484 (removed 334) transitions.
[2021-05-09 08:27:38] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 183 cols
[2021-05-09 08:27:38] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-09 08:27:38] [INFO ] Implicit Places using invariants in 175 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 190 ms to find 24 implicit places.
[2021-05-09 08:27:38] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-09 08:27:38] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 159 cols
[2021-05-09 08:27:38] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-09 08:27:38] [INFO ] Dead Transitions using invariants and state equation in 206 ms returned []
Starting structural reductions, iteration 1 : 159/551 places, 150/484 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2021-05-09 08:27:38] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 08:27:38] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 159 cols
[2021-05-09 08:27:38] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-09 08:27:38] [INFO ] Dead Transitions using invariants and state equation in 136 ms returned []
Finished structural reductions, in 2 iterations. Remains : 159/551 places, 150/484 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-20-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s72 1), p1:(NEQ s102 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-02 finished in 842 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||(F(p0)&&G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Graph (trivial) has 262 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 545 transition count 408
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 139 place count 476 transition count 408
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 139 place count 476 transition count 297
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 383 place count 343 transition count 297
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 392 place count 334 transition count 288
Iterating global reduction 2 with 9 rules applied. Total rules applied 401 place count 334 transition count 288
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 697 place count 184 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 701 place count 182 transition count 149
Applied a total of 701 rules in 54 ms. Remains 182 /551 variables (removed 369) and now considering 149/484 (removed 335) transitions.
[2021-05-09 08:27:38] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 182 cols
[2021-05-09 08:27:38] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-09 08:27:39] [INFO ] Implicit Places using invariants in 221 ms returned [28, 29, 30, 31, 32, 37, 38, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 222 ms to find 24 implicit places.
[2021-05-09 08:27:39] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 08:27:39] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 158 cols
[2021-05-09 08:27:39] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-09 08:27:39] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Starting structural reductions, iteration 1 : 158/551 places, 149/484 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2021-05-09 08:27:39] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 08:27:39] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 158 cols
[2021-05-09 08:27:39] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-09 08:27:39] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
Finished structural reductions, in 2 iterations. Remains : 158/551 places, 149/484 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-03 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (NEQ s34 1) (NEQ s3 1)), p0:(NEQ s34 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 14973 reset in 295 ms.
Product exploration explored 100000 steps with 15093 reset in 236 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 15111 reset in 230 ms.
Product exploration explored 100000 steps with 15290 reset in 210 ms.
[2021-05-09 08:27:40] [INFO ] Flatten gal took : 24 ms
[2021-05-09 08:27:40] [INFO ] Flatten gal took : 22 ms
[2021-05-09 08:27:40] [INFO ] Time to serialize gal into /tmp/LTL895387243856512996.gal : 22 ms
[2021-05-09 08:27:40] [INFO ] Time to serialize properties into /tmp/LTL12960928910679203785.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/LTL895387243856512996.gal, -t, CGAL, -LTL, /tmp/LTL12960928910679203785.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/LTL895387243856512996.gal -t CGAL -LTL /tmp/LTL12960928910679203785.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(p204!=1)")))||((F("(p204!=1)"))&&(G("((p204!=1)||(p55!=1))"))))))
Formula 0 simplified : !F(GF"(p204!=1)" | (F"(p204!=1)" & G"((p204!=1)||(p55!=1))"))
Detected timeout of ITS tools.
[2021-05-09 08:27:55] [INFO ] Flatten gal took : 24 ms
[2021-05-09 08:27:55] [INFO ] Applying decomposition
[2021-05-09 08:27:56] [INFO ] Flatten gal took : 26 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/graph15430086206563043863.txt, -o, /tmp/graph15430086206563043863.bin, -w, /tmp/graph15430086206563043863.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/graph15430086206563043863.bin, -l, -1, -v, -w, /tmp/graph15430086206563043863.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:27:56] [INFO ] Decomposing Gal with order
[2021-05-09 08:27:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:27:56] [INFO ] Removed a total of 188 redundant transitions.
[2021-05-09 08:27:56] [INFO ] Flatten gal took : 85 ms
[2021-05-09 08:27:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 36 ms.
[2021-05-09 08:27:56] [INFO ] Time to serialize gal into /tmp/LTL17834023341364744888.gal : 37 ms
[2021-05-09 08:27:56] [INFO ] Time to serialize properties into /tmp/LTL4912222159323723754.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/LTL17834023341364744888.gal, -t, CGAL, -LTL, /tmp/LTL4912222159323723754.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/LTL17834023341364744888.gal -t CGAL -LTL /tmp/LTL4912222159323723754.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(i1.u3.p204!=1)")))||((F("(i1.u3.p204!=1)"))&&(G("((i1.u3.p204!=1)||(i2.i0.u0.p55!=1))"))))))
Formula 0 simplified : !F(GF"(i1.u3.p204!=1)" | (F"(i1.u3.p204!=1)" & G"((i1.u3.p204!=1)||(i2.i0.u0.p55!=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1395173671049320073
[2021-05-09 08:28:11] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1395173671049320073
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/ltsmin1395173671049320073]
Compilation finished in 823 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1395173671049320073]
Link finished in 52 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)))||(<>((LTLAPp0==true))&&[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin1395173671049320073]
LTSmin run took 958 ms.
FORMULA BusinessProcesses-PT-20-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-20-03 finished in 34329 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Graph (trivial) has 262 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 545 transition count 408
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 139 place count 476 transition count 408
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 139 place count 476 transition count 297
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 243 rules applied. Total rules applied 382 place count 344 transition count 297
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 391 place count 335 transition count 288
Iterating global reduction 2 with 9 rules applied. Total rules applied 400 place count 335 transition count 288
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 294 rules applied. Total rules applied 694 place count 186 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 698 place count 184 transition count 150
Applied a total of 698 rules in 31 ms. Remains 184 /551 variables (removed 367) and now considering 150/484 (removed 334) transitions.
[2021-05-09 08:28:13] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 184 cols
[2021-05-09 08:28:13] [INFO ] Computed 82 place invariants in 4 ms
[2021-05-09 08:28:13] [INFO ] Implicit Places using invariants in 137 ms returned [29, 30, 31, 32, 33, 38, 39, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 137]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 138 ms to find 25 implicit places.
[2021-05-09 08:28:13] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 08:28:13] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 159 cols
[2021-05-09 08:28:13] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-09 08:28:13] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Starting structural reductions, iteration 1 : 159/551 places, 150/484 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 149
Applied a total of 2 rules in 12 ms. Remains 158 /159 variables (removed 1) and now considering 149/150 (removed 1) transitions.
[2021-05-09 08:28:13] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 158 cols
[2021-05-09 08:28:13] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-09 08:28:13] [INFO ] Implicit Places using invariants in 105 ms returned []
[2021-05-09 08:28:13] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 158 cols
[2021-05-09 08:28:13] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-09 08:28:13] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-09 08:28:13] [INFO ] Implicit Places using invariants and state equation in 156 ms returned [5, 46, 48, 50, 58, 92, 94, 96, 98, 100, 102, 104]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 265 ms to find 12 implicit places.
Starting structural reductions, iteration 2 : 146/551 places, 149/484 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 146 transition count 145
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 142 transition count 145
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 140 transition count 142
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 140 transition count 142
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 140 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 139 transition count 141
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 16 place count 137 transition count 139
Iterating global reduction 4 with 2 rules applied. Total rules applied 18 place count 137 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 20 place count 137 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 21 place count 136 transition count 137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 25 place count 134 transition count 135
Applied a total of 25 rules in 12 ms. Remains 134 /146 variables (removed 12) and now considering 135/149 (removed 14) transitions.
[2021-05-09 08:28:13] [INFO ] Flow matrix only has 134 transitions (discarded 1 similar events)
// Phase 1: matrix 134 rows 134 cols
[2021-05-09 08:28:13] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-09 08:28:13] [INFO ] Implicit Places using invariants in 158 ms returned []
[2021-05-09 08:28:13] [INFO ] Flow matrix only has 134 transitions (discarded 1 similar events)
// Phase 1: matrix 134 rows 134 cols
[2021-05-09 08:28:13] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-09 08:28:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 08:28:14] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 134/551 places, 135/484 transitions.
Stuttering acceptance computed with spot in 28 ms :[true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s8 0) (EQ s35 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 16104 reset in 169 ms.
Product exploration explored 100000 steps with 16426 reset in 190 ms.
Graph (complete) has 487 edges and 134 vertex of which 125 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 16342 reset in 221 ms.
Product exploration explored 100000 steps with 16472 reset in 274 ms.
[2021-05-09 08:28:15] [INFO ] Flatten gal took : 14 ms
[2021-05-09 08:28:15] [INFO ] Flatten gal took : 13 ms
[2021-05-09 08:28:15] [INFO ] Time to serialize gal into /tmp/LTL15847896477064338626.gal : 2 ms
[2021-05-09 08:28:15] [INFO ] Time to serialize properties into /tmp/LTL6299959877174939514.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/LTL15847896477064338626.gal, -t, CGAL, -LTL, /tmp/LTL6299959877174939514.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/LTL15847896477064338626.gal -t CGAL -LTL /tmp/LTL6299959877174939514.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("((p88==0)||(p365==0))")))
Formula 0 simplified : !G"((p88==0)||(p365==0))"
Detected timeout of ITS tools.
[2021-05-09 08:28:30] [INFO ] Flatten gal took : 24 ms
[2021-05-09 08:28:30] [INFO ] Applying decomposition
[2021-05-09 08:28:30] [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/graph8855772967466004033.txt, -o, /tmp/graph8855772967466004033.bin, -w, /tmp/graph8855772967466004033.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/graph8855772967466004033.bin, -l, -1, -v, -w, /tmp/graph8855772967466004033.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:28:30] [INFO ] Decomposing Gal with order
[2021-05-09 08:28:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:28:30] [INFO ] Removed a total of 139 redundant transitions.
[2021-05-09 08:28:30] [INFO ] Flatten gal took : 27 ms
[2021-05-09 08:28:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 15 ms.
[2021-05-09 08:28:30] [INFO ] Time to serialize gal into /tmp/LTL11740910702557238091.gal : 4 ms
[2021-05-09 08:28:30] [INFO ] Time to serialize properties into /tmp/LTL185878454060514498.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/LTL11740910702557238091.gal, -t, CGAL, -LTL, /tmp/LTL185878454060514498.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/LTL11740910702557238091.gal -t CGAL -LTL /tmp/LTL185878454060514498.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G("((u10.p88==0)||(i1.i1.u4.p365==0))")))
Formula 0 simplified : !G"((u10.p88==0)||(i1.i1.u4.p365==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15305902241633084002
[2021-05-09 08:28:45] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15305902241633084002
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/ltsmin15305902241633084002]
Compilation finished in 806 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15305902241633084002]
Link finished in 63 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)), --buchi-type=spotba], workingDir=/tmp/ltsmin15305902241633084002]
LTSmin run took 4522 ms.
FORMULA BusinessProcesses-PT-20-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-20-06 finished in 37550 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Graph (trivial) has 263 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 545 transition count 408
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 139 place count 476 transition count 408
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 139 place count 476 transition count 295
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 387 place count 341 transition count 295
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 396 place count 332 transition count 286
Iterating global reduction 2 with 9 rules applied. Total rules applied 405 place count 332 transition count 286
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 294 rules applied. Total rules applied 699 place count 183 transition count 141
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 703 place count 181 transition count 148
Applied a total of 703 rules in 57 ms. Remains 181 /551 variables (removed 370) and now considering 148/484 (removed 336) transitions.
[2021-05-09 08:28:50] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 181 cols
[2021-05-09 08:28:50] [INFO ] Computed 81 place invariants in 3 ms
[2021-05-09 08:28:50] [INFO ] Implicit Places using invariants in 138 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 139 ms to find 24 implicit places.
[2021-05-09 08:28:50] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 08:28:50] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 157 cols
[2021-05-09 08:28:50] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-09 08:28:51] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Starting structural reductions, iteration 1 : 157/551 places, 148/484 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2021-05-09 08:28:51] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 08:28:51] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 157 cols
[2021-05-09 08:28:51] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-09 08:28:51] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 2 iterations. Remains : 157/551 places, 148/484 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s133 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15200 reset in 197 ms.
Product exploration explored 100000 steps with 14995 reset in 270 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14964 reset in 246 ms.
Product exploration explored 100000 steps with 14938 reset in 327 ms.
[2021-05-09 08:28:52] [INFO ] Flatten gal took : 15 ms
[2021-05-09 08:28:52] [INFO ] Flatten gal took : 13 ms
[2021-05-09 08:28:52] [INFO ] Time to serialize gal into /tmp/LTL481585200643797868.gal : 2 ms
[2021-05-09 08:28:52] [INFO ] Time to serialize properties into /tmp/LTL1261053301718964776.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/LTL481585200643797868.gal, -t, CGAL, -LTL, /tmp/LTL1261053301718964776.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/LTL481585200643797868.gal -t CGAL -LTL /tmp/LTL1261053301718964776.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p746!=1)"))))
Formula 0 simplified : !FG"(p746!=1)"
Detected timeout of ITS tools.
[2021-05-09 08:29:07] [INFO ] Flatten gal took : 8 ms
[2021-05-09 08:29:07] [INFO ] Applying decomposition
[2021-05-09 08:29:07] [INFO ] Flatten gal took : 8 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/graph15261064425591101811.txt, -o, /tmp/graph15261064425591101811.bin, -w, /tmp/graph15261064425591101811.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/graph15261064425591101811.bin, -l, -1, -v, -w, /tmp/graph15261064425591101811.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:29:07] [INFO ] Decomposing Gal with order
[2021-05-09 08:29:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:29:07] [INFO ] Removed a total of 186 redundant transitions.
[2021-05-09 08:29:07] [INFO ] Flatten gal took : 18 ms
[2021-05-09 08:29:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 18 ms.
[2021-05-09 08:29:07] [INFO ] Time to serialize gal into /tmp/LTL4933922485690403520.gal : 2 ms
[2021-05-09 08:29:07] [INFO ] Time to serialize properties into /tmp/LTL4829065686062905793.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/LTL4933922485690403520.gal, -t, CGAL, -LTL, /tmp/LTL4829065686062905793.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/LTL4933922485690403520.gal -t CGAL -LTL /tmp/LTL4829065686062905793.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("(i4.u38.p746!=1)"))))
Formula 0 simplified : !FG"(i4.u38.p746!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11049191803744523337
[2021-05-09 08:29:22] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11049191803744523337
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/ltsmin11049191803744523337]
Compilation finished in 861 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11049191803744523337]
Link finished in 31 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin11049191803744523337]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-20-07 finished in 46812 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 542 transition count 475
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 542 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 539 transition count 472
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 539 transition count 472
Applied a total of 24 rules in 37 ms. Remains 539 /551 variables (removed 12) and now considering 472/484 (removed 12) transitions.
// Phase 1: matrix 472 rows 539 cols
[2021-05-09 08:29:37] [INFO ] Computed 107 place invariants in 4 ms
[2021-05-09 08:29:37] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 472 rows 539 cols
[2021-05-09 08:29:37] [INFO ] Computed 107 place invariants in 16 ms
[2021-05-09 08:29:38] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 539 cols
[2021-05-09 08:29:38] [INFO ] Computed 107 place invariants in 4 ms
[2021-05-09 08:29:38] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Finished structural reductions, in 1 iterations. Remains : 539/551 places, 472/484 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s428 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 467 ms.
Product exploration explored 100000 steps with 50000 reset in 384 ms.
Graph (complete) has 1210 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 529 ms.
Product exploration explored 100000 steps with 50000 reset in 446 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Support contains 1 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 252 edges and 539 vertex of which 6 / 539 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.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 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 61 place count 534 transition count 702
Deduced a syphon composed of 169 places in 1 ms
Iterating global reduction 1 with 109 rules applied. Total rules applied 170 place count 534 transition count 702
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 193 place count 511 transition count 627
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 216 place count 511 transition count 627
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 301 places in 0 ms
Iterating global reduction 1 with 155 rules applied. Total rules applied 371 place count 511 transition count 627
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 419 place count 463 transition count 579
Deduced a syphon composed of 253 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 467 place count 463 transition count 579
Deduced a syphon composed of 253 places in 1 ms
Applied a total of 467 rules in 61 ms. Remains 463 /539 variables (removed 76) and now considering 579/472 (removed -107) transitions.
[2021-05-09 08:29:40] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 579 rows 463 cols
[2021-05-09 08:29:40] [INFO ] Computed 107 place invariants in 23 ms
[2021-05-09 08:29:41] [INFO ] Dead Transitions using invariants and state equation in 439 ms returned []
Finished structural reductions, in 1 iterations. Remains : 463/539 places, 579/472 transitions.
Product exploration explored 100000 steps with 50000 reset in 1598 ms.
Product exploration explored 100000 steps with 50000 reset in 1706 ms.
[2021-05-09 08:29:44] [INFO ] Flatten gal took : 14 ms
[2021-05-09 08:29:44] [INFO ] Flatten gal took : 13 ms
[2021-05-09 08:29:44] [INFO ] Time to serialize gal into /tmp/LTL12459808598614808799.gal : 3 ms
[2021-05-09 08:29:44] [INFO ] Time to serialize properties into /tmp/LTL3883088332704178025.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/LTL12459808598614808799.gal, -t, CGAL, -LTL, /tmp/LTL3883088332704178025.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/LTL12459808598614808799.gal -t CGAL -LTL /tmp/LTL3883088332704178025.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p560!=1)"))))
Formula 0 simplified : !XF"(p560!=1)"
Detected timeout of ITS tools.
[2021-05-09 08:29:59] [INFO ] Flatten gal took : 31 ms
[2021-05-09 08:29:59] [INFO ] Applying decomposition
[2021-05-09 08:29:59] [INFO ] Flatten gal took : 23 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/graph15360876804388514648.txt, -o, /tmp/graph15360876804388514648.bin, -w, /tmp/graph15360876804388514648.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/graph15360876804388514648.bin, -l, -1, -v, -w, /tmp/graph15360876804388514648.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:29:59] [INFO ] Decomposing Gal with order
[2021-05-09 08:29:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:30:00] [INFO ] Removed a total of 286 redundant transitions.
[2021-05-09 08:30:00] [INFO ] Flatten gal took : 74 ms
[2021-05-09 08:30:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 26 ms.
[2021-05-09 08:30:00] [INFO ] Time to serialize gal into /tmp/LTL5848480951407832602.gal : 30 ms
[2021-05-09 08:30:00] [INFO ] Time to serialize properties into /tmp/LTL3015577091428783861.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/LTL5848480951407832602.gal, -t, CGAL, -LTL, /tmp/LTL3015577091428783861.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/LTL5848480951407832602.gal -t CGAL -LTL /tmp/LTL3015577091428783861.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i0.i3.u148.p560!=1)"))))
Formula 0 simplified : !XF"(i0.i3.u148.p560!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13610945044086867121
[2021-05-09 08:30:15] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13610945044086867121
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/ltsmin13610945044086867121]
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/ltsmin13610945044086867121] 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/ltsmin13610945044086867121] 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-09 finished in 38600 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X(G((p1||X(p2))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 542 transition count 475
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 542 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 539 transition count 472
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 539 transition count 472
Applied a total of 24 rules in 70 ms. Remains 539 /551 variables (removed 12) and now considering 472/484 (removed 12) transitions.
// Phase 1: matrix 472 rows 539 cols
[2021-05-09 08:30:16] [INFO ] Computed 107 place invariants in 4 ms
[2021-05-09 08:30:16] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 472 rows 539 cols
[2021-05-09 08:30:16] [INFO ] Computed 107 place invariants in 3 ms
[2021-05-09 08:30:17] [INFO ] Implicit Places using invariants and state equation in 1055 ms returned []
Implicit Place search using SMT with State Equation took 1422 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 539 cols
[2021-05-09 08:30:17] [INFO ] Computed 107 place invariants in 3 ms
[2021-05-09 08:30:17] [INFO ] Dead Transitions using invariants and state equation in 228 ms returned []
Finished structural reductions, in 1 iterations. Remains : 539/551 places, 472/484 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-20-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 2}]], initial=0, aps=[p0:(NEQ s432 1), p1:(NEQ s9 0), p2:(NEQ s283 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 20064 reset in 197 ms.
Product exploration explored 100000 steps with 20033 reset in 204 ms.
Graph (complete) has 1210 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 19974 reset in 198 ms.
Product exploration explored 100000 steps with 19915 reset in 203 ms.
[2021-05-09 08:30:19] [INFO ] Flatten gal took : 18 ms
[2021-05-09 08:30:19] [INFO ] Flatten gal took : 30 ms
[2021-05-09 08:30:19] [INFO ] Time to serialize gal into /tmp/LTL11748441382507202417.gal : 3 ms
[2021-05-09 08:30:19] [INFO ] Time to serialize properties into /tmp/LTL3018188997982534510.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/LTL11748441382507202417.gal, -t, CGAL, -LTL, /tmp/LTL3018188997982534510.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/LTL11748441382507202417.gal -t CGAL -LTL /tmp/LTL3018188997982534510.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p565!=1)")&&(X(G(("(p9!=0)")||(X("(p352!=1)")))))))))
Formula 0 simplified : !XF("(p565!=1)" & XG("(p9!=0)" | X"(p352!=1)"))
Detected timeout of ITS tools.
[2021-05-09 08:30:34] [INFO ] Flatten gal took : 52 ms
[2021-05-09 08:30:34] [INFO ] Applying decomposition
[2021-05-09 08:30:34] [INFO ] Flatten gal took : 31 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/graph2956341371616339455.txt, -o, /tmp/graph2956341371616339455.bin, -w, /tmp/graph2956341371616339455.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/graph2956341371616339455.bin, -l, -1, -v, -w, /tmp/graph2956341371616339455.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:30:34] [INFO ] Decomposing Gal with order
[2021-05-09 08:30:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:30:34] [INFO ] Removed a total of 279 redundant transitions.
[2021-05-09 08:30:34] [INFO ] Flatten gal took : 54 ms
[2021-05-09 08:30:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 8 ms.
[2021-05-09 08:30:34] [INFO ] Time to serialize gal into /tmp/LTL8432214222028338183.gal : 12 ms
[2021-05-09 08:30:34] [INFO ] Time to serialize properties into /tmp/LTL17078055544777725631.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/LTL8432214222028338183.gal, -t, CGAL, -LTL, /tmp/LTL17078055544777725631.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/LTL8432214222028338183.gal -t CGAL -LTL /tmp/LTL17078055544777725631.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i18.i4.u147.p565!=1)")&&(X(G(("(i13.i1.u3.p9!=0)")||(X("(i0.u106.p352!=1)")))))))))
Formula 0 simplified : !XF("(i18.i4.u147.p565!=1)" & XG("(i13.i1.u3.p9!=0)" | X"(i0.u106.p352!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13711574148772233833
[2021-05-09 08:30:49] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13711574148772233833
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/ltsmin13711574148772233833]
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/ltsmin13711574148772233833] 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/ltsmin13711574148772233833] 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-10 finished in 34542 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 541 transition count 474
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 541 transition count 474
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 538 transition count 471
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 538 transition count 471
Applied a total of 26 rules in 30 ms. Remains 538 /551 variables (removed 13) and now considering 471/484 (removed 13) transitions.
// Phase 1: matrix 471 rows 538 cols
[2021-05-09 08:30:50] [INFO ] Computed 107 place invariants in 3 ms
[2021-05-09 08:30:51] [INFO ] Implicit Places using invariants in 927 ms returned []
// Phase 1: matrix 471 rows 538 cols
[2021-05-09 08:30:51] [INFO ] Computed 107 place invariants in 4 ms
[2021-05-09 08:30:52] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
// Phase 1: matrix 471 rows 538 cols
[2021-05-09 08:30:52] [INFO ] Computed 107 place invariants in 3 ms
[2021-05-09 08:30:52] [INFO ] Dead Transitions using invariants and state equation in 199 ms returned []
Finished structural reductions, in 1 iterations. Remains : 538/551 places, 471/484 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-13 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:(NEQ s291 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-13 finished in 1772 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(X((G(F(p1))||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 476
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 542 transition count 475
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 542 transition count 475
Applied a total of 18 rules in 25 ms. Remains 542 /551 variables (removed 9) and now considering 475/484 (removed 9) transitions.
// Phase 1: matrix 475 rows 542 cols
[2021-05-09 08:30:52] [INFO ] Computed 107 place invariants in 2 ms
[2021-05-09 08:30:52] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 475 rows 542 cols
[2021-05-09 08:30:52] [INFO ] Computed 107 place invariants in 3 ms
[2021-05-09 08:30:53] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
// Phase 1: matrix 475 rows 542 cols
[2021-05-09 08:30:53] [INFO ] Computed 107 place invariants in 2 ms
[2021-05-09 08:30:53] [INFO ] Dead Transitions using invariants and state equation in 202 ms returned []
Finished structural reductions, in 1 iterations. Remains : 542/551 places, 475/484 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s499 1), p2:(AND (OR (NEQ s187 1) (NEQ s398 1) (NEQ s482 1)) (NEQ s474 1)), p1:(AND (EQ s187 1) (EQ s398 1) (EQ s482 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-15 finished in 1002 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15952509877290473986
[2021-05-09 08:30:53] [INFO ] Computing symmetric may disable matrix : 484 transitions.
[2021-05-09 08:30:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:30:53] [INFO ] Computing symmetric may enable matrix : 484 transitions.
[2021-05-09 08:30:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:30:53] [INFO ] Applying decomposition
[2021-05-09 08:30:53] [INFO ] Computing Do-Not-Accords matrix : 484 transitions.
[2021-05-09 08:30:53] [INFO ] Flatten gal took : 29 ms
[2021-05-09 08:30:53] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:30:53] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15952509877290473986
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/ltsmin15952509877290473986]
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/graph16314015588962674143.txt, -o, /tmp/graph16314015588962674143.bin, -w, /tmp/graph16314015588962674143.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/graph16314015588962674143.bin, -l, -1, -v, -w, /tmp/graph16314015588962674143.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:30:53] [INFO ] Decomposing Gal with order
[2021-05-09 08:30:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:30:53] [INFO ] Removed a total of 281 redundant transitions.
[2021-05-09 08:30:53] [INFO ] Flatten gal took : 51 ms
[2021-05-09 08:30:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2021-05-09 08:30:53] [INFO ] Time to serialize gal into /tmp/LTLFireability17552267732594865016.gal : 16 ms
[2021-05-09 08:30:53] [INFO ] Time to serialize properties into /tmp/LTLFireability12761643981794172882.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/LTLFireability17552267732594865016.gal, -t, CGAL, -LTL, /tmp/LTLFireability12761643981794172882.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/LTLFireability17552267732594865016.gal -t CGAL -LTL /tmp/LTLFireability12761643981794172882.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((F(G("(i20.u186.p746!=1)"))))
Formula 0 simplified : !FG"(i20.u186.p746!=1)"
Compilation finished in 2399 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15952509877290473986]
Link finished in 67 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, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15952509877290473986]
WARNING : LTSmin timed out (>327 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, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15952509877290473986]
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(<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15952509877290473986]
LTSmin run took 2184 ms.
FORMULA BusinessProcesses-PT-20-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((LTLAPp2==true)&&X([](((LTLAPp3==true)||X((LTLAPp4==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15952509877290473986]
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t367, t483, t509, t586, t589, t591, t593, t596, t597, t600, t605, t607, t611, t613, t625, t627, t629, t630, t687, t688, t689, t690, i0.u82.t370, i0.u146.t194, i0.u147.t190, i1.i0.u84.t365, i1.i0.u85.t364, i1.i0.u86.t360, i1.i1.u88.t356, i1.i2.u148.t186, i1.i3.t183, i1.i3.u149.t184, i1.i4.t27, i1.i4.u181.t31, i2.t371, i2.u74.t386, i2.u78.t378, i2.u80.t374, i3.u66.t404, i4.i0.u40.t476, i4.i1.u38.t482, i5.t539, i6.t524, i6.u20.t510, i6.u20.t523, i7.t1, i7.i0.t0, i7.i0.t2, i7.i0.t3, i7.i0.u23.t489, i7.i0.u23.t508, i7.i0.u123.t294, i7.i0.u125.t286, i7.i1.u124.t290, i8.i0.u44.t446, i8.i0.u52.t432, i8.i1.u46.t442, i8.i2.t334, i8.i2.u115.t335, i9.i0.t438, i10.i0.u56.t424, i10.i1.t235, i10.i1.u136.t236, i11.i0.u70.t396, i11.i1.u144.t202, i11.i1.u145.t198, i11.i2.u140.t218, i11.i2.u141.t214, i11.i2.u142.t210, i11.i2.u143.t206, i12.i0.u64.t408, i12.i0.u68.t400, i12.i1.u72.t390, i13.i0.u60.t418, i13.i0.u62.t413, i13.i0.u63.t412, i13.i1.u137.t230, i13.i1.u138.t226, i13.i1.u139.t222, i14.i0.u130.t255, i14.i0.u131.t250, i14.i1.u94.t326, i14.i1.u94.t337, i14.i1.u128.t274, i14.i1.u129.t270, i15.i0.u126.t282, i15.i0.u127.t278, i15.i1.u122.t298, i16.i0.u76.t382, i16.i1.u120.t306, i16.i1.u121.t302, i17.i0.u42.t472, i17.i1.u117.t318, i17.i1.u118.t314, i17.i1.u119.t310, i18.i0.u54.t428, i18.i1.u132.t246, i18.i1.u133.t242, i18.i1.u134.t238, i19.i1.u90.t352, i19.i2.u92.t340, i19.i3.t179, i19.i3.u151.t180, i19.i4.t175, i19.i4.u154.t176, i20.t63, i20.t10, i20.u186.t13, i20.u186.t168, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/333/113/482
Computing Next relation with stutter on 1.99596e+09 deadlock states
WARNING : LTSmin timed out (>327 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(<>(((LTLAPp2==true)&&X([](((LTLAPp3==true)||X((LTLAPp4==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15952509877290473986]
Retrying LTSmin with larger timeout 2616 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, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15952509877290473986]
Detected timeout of ITS tools.
[2021-05-09 08:52:08] [INFO ] Applying decomposition
[2021-05-09 08:52:08] [INFO ] Flatten gal took : 154 ms
[2021-05-09 08:52:08] [INFO ] Decomposing Gal with order
[2021-05-09 08:52:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:52:09] [INFO ] Removed a total of 148 redundant transitions.
[2021-05-09 08:52:09] [INFO ] Flatten gal took : 100 ms
[2021-05-09 08:52:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 322 labels/synchronizations in 953 ms.
[2021-05-09 08:52:10] [INFO ] Time to serialize gal into /tmp/LTLFireability8323764086259118062.gal : 30 ms
[2021-05-09 08:52:10] [INFO ] Time to serialize properties into /tmp/LTLFireability13617622019742994461.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/LTLFireability8323764086259118062.gal, -t, CGAL, -LTL, /tmp/LTLFireability13617622019742994461.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/LTLFireability8323764086259118062.gal -t CGAL -LTL /tmp/LTLFireability13617622019742994461.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((F(G("(i1.u182.p746!=1)"))))
Formula 0 simplified : !FG"(i1.u182.p746!=1)"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: Initializing POR dependencies: labels 489, guards 484
pins2lts-mc-linux64( 5/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.685: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 0.685: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.685: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 1.116: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 1.154: There are 490 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.154: State length is 552, there are 488 groups
pins2lts-mc-linux64( 0/ 8), 1.154: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.154: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.154: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.154: Visible groups: 2 / 488, labels: 1 / 490
pins2lts-mc-linux64( 0/ 8), 1.154: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 1.154: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 1.239: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 3/ 8), 1.296: [Blue] ~238 levels ~1920 states ~2208 transitions
pins2lts-mc-linux64( 7/ 8), 1.337: [Blue] ~329 levels ~3840 states ~4880 transitions
pins2lts-mc-linux64( 4/ 8), 1.372: [Blue] ~284 levels ~7680 states ~9576 transitions
pins2lts-mc-linux64( 5/ 8), 1.432: [Blue] ~813 levels ~15360 states ~20672 transitions
pins2lts-mc-linux64( 7/ 8), 1.571: [Blue] ~1402 levels ~30720 states ~42000 transitions
pins2lts-mc-linux64( 1/ 8), 1.709: [Blue] ~1452 levels ~61440 states ~79224 transitions
pins2lts-mc-linux64( 1/ 8), 2.172: [Blue] ~1452 levels ~122880 states ~154216 transitions
pins2lts-mc-linux64( 7/ 8), 3.248: [Blue] ~1402 levels ~245760 states ~299072 transitions
pins2lts-mc-linux64( 7/ 8), 5.451: [Blue] ~1402 levels ~491520 states ~593728 transitions
pins2lts-mc-linux64( 7/ 8), 9.790: [Blue] ~1402 levels ~983040 states ~1181240 transitions
pins2lts-mc-linux64( 7/ 8), 18.704: [Blue] ~1419 levels ~1966080 states ~2358088 transitions
pins2lts-mc-linux64( 7/ 8), 36.005: [Blue] ~1419 levels ~3932160 states ~4705920 transitions
pins2lts-mc-linux64( 7/ 8), 70.636: [Blue] ~1434 levels ~7864320 states ~9399424 transitions
pins2lts-mc-linux64( 7/ 8), 141.323: [Blue] ~1434 levels ~15728640 states ~18740328 transitions
pins2lts-mc-linux64( 5/ 8), 283.080: [Blue] ~1748 levels ~31457280 states ~37674288 transitions
pins2lts-mc-linux64( 5/ 8), 566.798: [Blue] ~1830 levels ~62914560 states ~75344184 transitions
pins2lts-mc-linux64( 7/ 8), 1363.625: [Blue] ~1434 levels ~125829120 states ~152559592 transitions
pins2lts-mc-linux64( 3/ 8), 1883.464: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1883.607:
pins2lts-mc-linux64( 0/ 8), 1883.607: Explored 131984996 states 149965833 transitions, fanout: 1.136
pins2lts-mc-linux64( 0/ 8), 1883.607: Total exploration time 1882.450 sec (1882.300 sec minimum, 1882.345 sec on average)
pins2lts-mc-linux64( 0/ 8), 1883.607: States per second: 70113, Transitions per second: 79665
pins2lts-mc-linux64( 0/ 8), 1883.607:
pins2lts-mc-linux64( 0/ 8), 1883.607: State space has 128445975 states, 16086 are accepting
pins2lts-mc-linux64( 0/ 8), 1883.607: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1883.607: blue states: 131984996 (102.76%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1883.607: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1883.607: all-red states: 32172 (0.03%), bogus 2 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1883.607:
pins2lts-mc-linux64( 0/ 8), 1883.607: Total memory used for local state coloring: 5.2MB
pins2lts-mc-linux64( 0/ 8), 1883.607:
pins2lts-mc-linux64( 0/ 8), 1883.607: Queue width: 8B, total height: 340814, memory: 2.60MB
pins2lts-mc-linux64( 0/ 8), 1883.607: Tree memory: 1236.0MB, 10.1 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 1883.607: Tree fill ratio (roots/leafs): 95.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1883.607: Stored 486 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1883.607: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1883.607: Est. total memory use: 1238.6MB (~1026.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15952509877290473986]
255
java.lang.RuntimeException: Unexpected exception when executing 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, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15952509877290473986]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-09 09:13:24] [INFO ] Flatten gal took : 32 ms
[2021-05-09 09:13:24] [INFO ] Input system was already deterministic with 484 transitions.
[2021-05-09 09:13:24] [INFO ] Transformed 551 places.
[2021-05-09 09:13:24] [INFO ] Transformed 484 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 09:13:54] [INFO ] Time to serialize gal into /tmp/LTLFireability338643257717718986.gal : 2 ms
[2021-05-09 09:13:54] [INFO ] Time to serialize properties into /tmp/LTLFireability1432050476175069457.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/LTLFireability338643257717718986.gal, -t, CGAL, -LTL, /tmp/LTLFireability1432050476175069457.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLFireability338643257717718986.gal -t CGAL -LTL /tmp/LTLFireability1432050476175069457.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(p746!=1)"))))
Formula 0 simplified : !FG"(p746!=1)"

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143900477"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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