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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 141K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620545170768

Running Version 0
[2021-05-09 07:26:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 07:26:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:26:12] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2021-05-09 07:26:12] [INFO ] Transformed 567 places.
[2021-05-09 07:26:12] [INFO ] Transformed 508 transitions.
[2021-05-09 07:26:12] [INFO ] Found NUPN structural information;
[2021-05-09 07:26:12] [INFO ] Parsed PT model containing 567 places and 508 transitions in 113 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 07:26:12] [INFO ] Initial state test concluded for 2 properties.
Deduced a syphon composed of 7 places in 13 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 560 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 77 place count 483 transition count 428
Iterating global reduction 1 with 73 rules applied. Total rules applied 150 place count 483 transition count 428
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 185 place count 448 transition count 393
Iterating global reduction 1 with 35 rules applied. Total rules applied 220 place count 448 transition count 393
Applied a total of 220 rules in 106 ms. Remains 448 /560 variables (removed 112) and now considering 393/501 (removed 108) transitions.
// Phase 1: matrix 393 rows 448 cols
[2021-05-09 07:26:12] [INFO ] Computed 91 place invariants in 32 ms
[2021-05-09 07:26:12] [INFO ] Implicit Places using invariants in 303 ms returned []
// Phase 1: matrix 393 rows 448 cols
[2021-05-09 07:26:12] [INFO ] Computed 91 place invariants in 21 ms
[2021-05-09 07:26:13] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
// Phase 1: matrix 393 rows 448 cols
[2021-05-09 07:26:13] [INFO ] Computed 91 place invariants in 12 ms
[2021-05-09 07:26:13] [INFO ] Dead Transitions using invariants and state equation in 187 ms returned []
Finished structural reductions, in 1 iterations. Remains : 448/560 places, 393/501 transitions.
[2021-05-09 07:26:13] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 07:26:13] [INFO ] Flatten gal took : 59 ms
FORMULA BusinessProcesses-PT-11-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 07:26:13] [INFO ] Flatten gal took : 27 ms
[2021-05-09 07:26:13] [INFO ] Input system was already deterministic with 393 transitions.
Incomplete random walk after 100000 steps, including 759 resets, run finished after 277 ms. (steps per millisecond=361 ) properties (out of 29) seen :15
Running SMT prover for 14 properties.
// Phase 1: matrix 393 rows 448 cols
[2021-05-09 07:26:14] [INFO ] Computed 91 place invariants in 18 ms
[2021-05-09 07:26:14] [INFO ] [Real]Absence check using 49 positive place invariants in 13 ms returned sat
[2021-05-09 07:26:14] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 8 ms returned sat
[2021-05-09 07:26:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:14] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2021-05-09 07:26:14] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 3 ms to minimize.
[2021-05-09 07:26:14] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 2 ms to minimize.
[2021-05-09 07:26:14] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:26:15] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 2 ms to minimize.
[2021-05-09 07:26:15] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 2 ms to minimize.
[2021-05-09 07:26:15] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:26:15] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 0 ms to minimize.
[2021-05-09 07:26:15] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2021-05-09 07:26:15] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:26:15] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2021-05-09 07:26:15] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:26:15] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:26:15] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:26:15] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:26:16] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2021-05-09 07:26:16] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2021-05-09 07:26:16] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:26:16] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:26:16] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1901 ms
[2021-05-09 07:26:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:16] [INFO ] [Nat]Absence check using 49 positive place invariants in 17 ms returned sat
[2021-05-09 07:26:16] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 10 ms returned sat
[2021-05-09 07:26:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:16] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2021-05-09 07:26:16] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:26:16] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:26:17] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 6 ms to minimize.
[2021-05-09 07:26:17] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:26:17] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:26:17] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:26:17] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:26:17] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:26:17] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:26:17] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2021-05-09 07:26:17] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:26:17] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2021-05-09 07:26:17] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2021-05-09 07:26:17] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2021-05-09 07:26:17] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2021-05-09 07:26:18] [INFO ] Deduced a trap composed of 29 places in 19 ms of which 1 ms to minimize.
[2021-05-09 07:26:18] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 5 ms to minimize.
[2021-05-09 07:26:18] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 1 ms to minimize.
[2021-05-09 07:26:18] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1598 ms
[2021-05-09 07:26:18] [INFO ] Computed and/alt/rep : 386/816/386 causal constraints (skipped 6 transitions) in 29 ms.
[2021-05-09 07:26:19] [INFO ] Added : 276 causal constraints over 56 iterations in 1350 ms. Result :sat
[2021-05-09 07:26:19] [INFO ] [Real]Absence check using 49 positive place invariants in 25 ms returned sat
[2021-05-09 07:26:19] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 14 ms returned sat
[2021-05-09 07:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:19] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2021-05-09 07:26:19] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:26:20] [INFO ] Deduced a trap composed of 109 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:26:20] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:26:20] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:26:20] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 1 ms to minimize.
[2021-05-09 07:26:20] [INFO ] Deduced a trap composed of 78 places in 158 ms of which 0 ms to minimize.
[2021-05-09 07:26:20] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 1 ms to minimize.
[2021-05-09 07:26:20] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:26:21] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:26:21] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 0 ms to minimize.
[2021-05-09 07:26:21] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:26:21] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:26:21] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:26:21] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 1 ms to minimize.
[2021-05-09 07:26:21] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:26:22] [INFO ] Deduced a trap composed of 100 places in 145 ms of which 0 ms to minimize.
[2021-05-09 07:26:22] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:26:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 2530 ms
[2021-05-09 07:26:22] [INFO ] [Real]Absence check using 49 positive place invariants in 15 ms returned sat
[2021-05-09 07:26:22] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 10 ms returned sat
[2021-05-09 07:26:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:22] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2021-05-09 07:26:22] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2021-05-09 07:26:22] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:26:23] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:26:23] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:26:23] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:26:23] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2021-05-09 07:26:23] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2021-05-09 07:26:23] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:26:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 944 ms
[2021-05-09 07:26:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:23] [INFO ] [Nat]Absence check using 49 positive place invariants in 17 ms returned sat
[2021-05-09 07:26:23] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 10 ms returned sat
[2021-05-09 07:26:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:23] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-09 07:26:23] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:26:24] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:26:24] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:26:24] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2021-05-09 07:26:24] [INFO ] Deduced a trap composed of 59 places in 116 ms of which 0 ms to minimize.
[2021-05-09 07:26:24] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2021-05-09 07:26:24] [INFO ] Deduced a trap composed of 29 places in 20 ms of which 0 ms to minimize.
[2021-05-09 07:26:24] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2021-05-09 07:26:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 812 ms
[2021-05-09 07:26:24] [INFO ] Computed and/alt/rep : 386/816/386 causal constraints (skipped 6 transitions) in 21 ms.
[2021-05-09 07:26:25] [INFO ] Added : 247 causal constraints over 50 iterations in 1094 ms. Result :sat
[2021-05-09 07:26:25] [INFO ] [Real]Absence check using 49 positive place invariants in 17 ms returned unsat
[2021-05-09 07:26:25] [INFO ] [Real]Absence check using 49 positive place invariants in 19 ms returned sat
[2021-05-09 07:26:25] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 12 ms returned sat
[2021-05-09 07:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:25] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 897 ms
[2021-05-09 07:26:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:27] [INFO ] [Nat]Absence check using 49 positive place invariants in 20 ms returned sat
[2021-05-09 07:26:27] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 12 ms returned sat
[2021-05-09 07:26:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:27] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 682 ms
[2021-05-09 07:26:27] [INFO ] Computed and/alt/rep : 386/816/386 causal constraints (skipped 6 transitions) in 32 ms.
[2021-05-09 07:26:29] [INFO ] Added : 246 causal constraints over 50 iterations in 1249 ms. Result :sat
[2021-05-09 07:26:29] [INFO ] [Real]Absence check using 49 positive place invariants in 12 ms returned sat
[2021-05-09 07:26:29] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 8 ms returned sat
[2021-05-09 07:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:29] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2021-05-09 07:26:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:29] [INFO ] [Nat]Absence check using 49 positive place invariants in 20 ms returned sat
[2021-05-09 07:26:29] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 16 ms returned sat
[2021-05-09 07:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:29] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-09 07:26:29] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2021-05-09 07:26:29] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:26:29] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:26:29] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2021-05-09 07:26:30] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2021-05-09 07:26:30] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:26:30] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:26:30] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:26:30] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:26:30] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:26:30] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:26:30] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:26:30] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1015 ms
[2021-05-09 07:26:30] [INFO ] Computed and/alt/rep : 386/816/386 causal constraints (skipped 6 transitions) in 21 ms.
[2021-05-09 07:26:31] [INFO ] Added : 236 causal constraints over 48 iterations in 802 ms. Result :sat
[2021-05-09 07:26:31] [INFO ] [Real]Absence check using 49 positive place invariants in 11 ms returned unsat
[2021-05-09 07:26:31] [INFO ] [Real]Absence check using 49 positive place invariants in 17 ms returned sat
[2021-05-09 07:26:31] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-09 07:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:31] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 29 places in 22 ms of which 0 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 612 ms
[2021-05-09 07:26:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:32] [INFO ] [Nat]Absence check using 49 positive place invariants in 11 ms returned sat
[2021-05-09 07:26:32] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 7 ms returned sat
[2021-05-09 07:26:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:32] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:26:33] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:26:33] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:26:33] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2021-05-09 07:26:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 674 ms
[2021-05-09 07:26:33] [INFO ] Computed and/alt/rep : 386/816/386 causal constraints (skipped 6 transitions) in 28 ms.
[2021-05-09 07:26:34] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:26:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2021-05-09 07:26:34] [INFO ] Added : 255 causal constraints over 51 iterations in 1320 ms. Result :sat
[2021-05-09 07:26:34] [INFO ] [Real]Absence check using 49 positive place invariants in 19 ms returned sat
[2021-05-09 07:26:34] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 12 ms returned sat
[2021-05-09 07:26:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:34] [INFO ] [Real]Absence check using state equation in 142 ms returned unsat
[2021-05-09 07:26:34] [INFO ] [Real]Absence check using 49 positive place invariants in 15 ms returned sat
[2021-05-09 07:26:34] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-09 07:26:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:34] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2021-05-09 07:26:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:35] [INFO ] [Nat]Absence check using 49 positive place invariants in 12 ms returned unsat
[2021-05-09 07:26:35] [INFO ] [Real]Absence check using 49 positive place invariants in 15 ms returned sat
[2021-05-09 07:26:35] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 10 ms returned sat
[2021-05-09 07:26:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:35] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-09 07:26:35] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:26:35] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:26:35] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:26:35] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:26:35] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 1 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 1 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2167 ms
[2021-05-09 07:26:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:37] [INFO ] [Nat]Absence check using 49 positive place invariants in 16 ms returned sat
[2021-05-09 07:26:37] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 19 ms returned sat
[2021-05-09 07:26:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:37] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 1 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2187 ms
[2021-05-09 07:26:39] [INFO ] Computed and/alt/rep : 386/816/386 causal constraints (skipped 6 transitions) in 25 ms.
[2021-05-09 07:26:41] [INFO ] Added : 247 causal constraints over 50 iterations in 1354 ms. Result :sat
[2021-05-09 07:26:41] [INFO ] [Real]Absence check using 49 positive place invariants in 21 ms returned sat
[2021-05-09 07:26:41] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 13 ms returned sat
[2021-05-09 07:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:41] [INFO ] [Real]Absence check using state equation in 199 ms returned unsat
[2021-05-09 07:26:41] [INFO ] [Real]Absence check using 49 positive place invariants in 14 ms returned sat
[2021-05-09 07:26:41] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 10 ms returned sat
[2021-05-09 07:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:41] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-09 07:26:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:41] [INFO ] [Nat]Absence check using 49 positive place invariants in 15 ms returned sat
[2021-05-09 07:26:41] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 10 ms returned sat
[2021-05-09 07:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:42] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2021-05-09 07:26:42] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:26:42] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:26:42] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2021-05-09 07:26:42] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 1 ms to minimize.
[2021-05-09 07:26:42] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 0 ms to minimize.
[2021-05-09 07:26:42] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 0 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 0 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 0 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 0 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:26:45] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:26:45] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:26:45] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:26:45] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:26:45] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:26:45] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2021-05-09 07:26:45] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3370 ms
[2021-05-09 07:26:45] [INFO ] Computed and/alt/rep : 386/816/386 causal constraints (skipped 6 transitions) in 26 ms.
[2021-05-09 07:26:47] [INFO ] Added : 273 causal constraints over 55 iterations in 1547 ms. Result :sat
[2021-05-09 07:26:47] [INFO ] [Real]Absence check using 49 positive place invariants in 19 ms returned sat
[2021-05-09 07:26:47] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 12 ms returned sat
[2021-05-09 07:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:47] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 571 ms
[2021-05-09 07:26:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:47] [INFO ] [Nat]Absence check using 49 positive place invariants in 13 ms returned sat
[2021-05-09 07:26:47] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 8 ms returned sat
[2021-05-09 07:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:48] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 0 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 566 ms
[2021-05-09 07:26:48] [INFO ] Computed and/alt/rep : 386/816/386 causal constraints (skipped 6 transitions) in 29 ms.
[2021-05-09 07:26:49] [INFO ] Added : 239 causal constraints over 48 iterations in 1330 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
[2021-05-09 07:26:49] [INFO ] Initial state test concluded for 3 properties.
FORMULA BusinessProcesses-PT-11-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 393/393 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 443 transition count 388
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 443 transition count 388
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 440 transition count 385
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 440 transition count 385
Applied a total of 16 rules in 56 ms. Remains 440 /448 variables (removed 8) and now considering 385/393 (removed 8) transitions.
// Phase 1: matrix 385 rows 440 cols
[2021-05-09 07:26:50] [INFO ] Computed 91 place invariants in 4 ms
[2021-05-09 07:26:50] [INFO ] Implicit Places using invariants in 336 ms returned []
// Phase 1: matrix 385 rows 440 cols
[2021-05-09 07:26:50] [INFO ] Computed 91 place invariants in 4 ms
[2021-05-09 07:26:50] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
// Phase 1: matrix 385 rows 440 cols
[2021-05-09 07:26:50] [INFO ] Computed 91 place invariants in 11 ms
[2021-05-09 07:26:51] [INFO ] Dead Transitions using invariants and state equation in 206 ms returned []
Finished structural reductions, in 1 iterations. Remains : 440/448 places, 385/393 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-11-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s387 0), p0:(AND (EQ s387 1) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 325 steps with 1 reset in 8 ms.
FORMULA BusinessProcesses-PT-11-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-00 finished in 1519 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((G(p0) U p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 393/393 transitions.
Graph (trivial) has 203 edges and 448 vertex of which 6 / 448 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 442 transition count 337
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 393 transition count 337
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 91 Pre rules applied. Total rules applied 99 place count 393 transition count 246
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 299 place count 284 transition count 246
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 305 place count 278 transition count 240
Iterating global reduction 2 with 6 rules applied. Total rules applied 311 place count 278 transition count 240
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 229 rules applied. Total rules applied 540 place count 162 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 542 place count 161 transition count 131
Applied a total of 542 rules in 91 ms. Remains 161 /448 variables (removed 287) and now considering 131/393 (removed 262) transitions.
// Phase 1: matrix 131 rows 161 cols
[2021-05-09 07:26:51] [INFO ] Computed 70 place invariants in 1 ms
[2021-05-09 07:26:51] [INFO ] Implicit Places using invariants in 110 ms returned [1, 4, 5, 30, 31, 32, 33, 40, 41, 42, 48, 49, 50, 51, 52, 53, 54, 55]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 112 ms to find 18 implicit places.
[2021-05-09 07:26:51] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 131 rows 143 cols
[2021-05-09 07:26:51] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-09 07:26:51] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Starting structural reductions, iteration 1 : 143/448 places, 131/393 transitions.
Applied a total of 0 rules in 8 ms. Remains 143 /143 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2021-05-09 07:26:51] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 131 rows 143 cols
[2021-05-09 07:26:51] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 07:26:51] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 2 iterations. Remains : 143/448 places, 131/393 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-11-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s53 1) (AND (EQ s22 1) (EQ s25 1))), p0:(EQ s35 1)], nbAcceptance=2, 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 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-01 finished in 593 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&(F(p1)||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 393/393 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 442 transition count 387
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 442 transition count 387
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 438 transition count 383
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 438 transition count 383
Applied a total of 20 rules in 26 ms. Remains 438 /448 variables (removed 10) and now considering 383/393 (removed 10) transitions.
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:26:52] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-09 07:26:52] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:26:52] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-09 07:26:52] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:26:52] [INFO ] Computed 91 place invariants in 7 ms
[2021-05-09 07:26:52] [INFO ] Dead Transitions using invariants and state equation in 185 ms returned []
Finished structural reductions, in 1 iterations. Remains : 438/448 places, 383/393 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-11-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (NEQ s61 1) (NEQ s367 1)), p1:(NEQ s149 1), p2:(NEQ s213 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 441 ms.
Product exploration explored 100000 steps with 50000 reset in 509 ms.
Graph (complete) has 992 edges and 438 vertex of which 437 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 540 ms.
Product exploration explored 100000 steps with 50000 reset in 492 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 438 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 438/438 places, 383/383 transitions.
Graph (trivial) has 194 edges and 438 vertex of which 6 / 438 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 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 433 transition count 377
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 90 Pre rules applied. Total rules applied 45 place count 433 transition count 572
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 135 place count 433 transition count 572
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 151 place count 417 transition count 515
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 167 place count 417 transition count 515
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 233 places in 1 ms
Iterating global reduction 1 with 115 rules applied. Total rules applied 282 place count 417 transition count 515
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 310 place count 389 transition count 487
Deduced a syphon composed of 205 places in 1 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 338 place count 389 transition count 487
Deduced a syphon composed of 205 places in 1 ms
Applied a total of 338 rules in 90 ms. Remains 389 /438 variables (removed 49) and now considering 487/383 (removed -104) transitions.
[2021-05-09 07:26:55] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 487 rows 389 cols
[2021-05-09 07:26:55] [INFO ] Computed 91 place invariants in 16 ms
[2021-05-09 07:26:56] [INFO ] Dead Transitions using invariants and state equation in 313 ms returned []
Finished structural reductions, in 1 iterations. Remains : 389/438 places, 487/383 transitions.
Product exploration explored 100000 steps with 50000 reset in 1520 ms.
Product exploration explored 100000 steps with 50000 reset in 1543 ms.
[2021-05-09 07:26:59] [INFO ] Flatten gal took : 23 ms
[2021-05-09 07:26:59] [INFO ] Flatten gal took : 24 ms
[2021-05-09 07:26:59] [INFO ] Time to serialize gal into /tmp/LTL17045564575305593883.gal : 12 ms
[2021-05-09 07:26:59] [INFO ] Time to serialize properties into /tmp/LTL12858912042960112998.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/LTL17045564575305593883.gal, -t, CGAL, -LTL, /tmp/LTL12858912042960112998.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/LTL17045564575305593883.gal -t CGAL -LTL /tmp/LTL12858912042960112998.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((p79!=1)||(p455!=1))"))&&((F("(p169!=1)"))||(G("(p242!=1)"))))))
Formula 0 simplified : !X(F"((p79!=1)||(p455!=1))" & (F"(p169!=1)" | G"(p242!=1)"))
Detected timeout of ITS tools.
[2021-05-09 07:27:14] [INFO ] Flatten gal took : 19 ms
[2021-05-09 07:27:14] [INFO ] Applying decomposition
[2021-05-09 07:27:14] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4126667104383109625.txt, -o, /tmp/graph4126667104383109625.bin, -w, /tmp/graph4126667104383109625.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/graph4126667104383109625.bin, -l, -1, -v, -w, /tmp/graph4126667104383109625.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:27:14] [INFO ] Decomposing Gal with order
[2021-05-09 07:27:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:27:14] [INFO ] Removed a total of 247 redundant transitions.
[2021-05-09 07:27:14] [INFO ] Flatten gal took : 61 ms
[2021-05-09 07:27:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 13 ms.
[2021-05-09 07:27:14] [INFO ] Time to serialize gal into /tmp/LTL13799047146220621510.gal : 8 ms
[2021-05-09 07:27:14] [INFO ] Time to serialize properties into /tmp/LTL1410398702047665846.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/LTL13799047146220621510.gal, -t, CGAL, -LTL, /tmp/LTL1410398702047665846.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/LTL13799047146220621510.gal -t CGAL -LTL /tmp/LTL1410398702047665846.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("((i14.i0.u23.p79!=1)||(i14.i0.u124.p455!=1))"))&&((F("(i8.i1.u55.p169!=1)"))||(G("(i10.i1.u79.p242!=1)"))))))
Formula 0 simplified : !X(F"((i14.i0.u23.p79!=1)||(i14.i0.u124.p455!=1))" & (F"(i8.i1.u55.p169!=1)" | G"(i10.i1.u79.p242!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t160, t168, t180, t184, t188, t200, t208, t220, t232, t250, t258, t384, t386, t388, i0.i0.u76.t155, i0.i1.u72.t163, i0.i1.u74.t158, i1.t196, i1.u50.t203, i1.u52.t199, i2.i0.t204, i2.i0.u43.t215, i2.i0.u48.t207, i2.i2.u103.t114, i2.i2.u104.t111, i3.i0.t216, i3.i0.u39.t223, i3.i0.u41.t219, i3.i0.u101.t120, i3.i1.u99.t126, i3.i1.u100.t123, i3.i1.u102.t117, i4.t228, i4.t224, i4.u18.t253, i4.u35.t231, i4.u37.t227, i5.i0.t254, i5.i0.u16.t257, i5.i1.t265, i6.i0.u11.t268, i6.i1.u92.t147, i7.t10, i7.u118.t67, i8.i0.u54.t195, i9.i0.t164, i9.i0.u68.t171, i9.i0.u70.t167, i9.i0.u114.t80, i9.i1.u113.t83, i9.i1.u115.t77, i9.i1.u116.t74, i9.i1.u117.t71, i10.i0.t172, i10.i0.u62.t183, i10.i0.u64.t179, i10.i0.u66.t175, i10.i1.u112.t86, i11.u60.t187, i11.u109.t96, i11.u110.t93, i12.u105.t108, i12.u106.t105, i12.u107.t102, i12.u108.t99, i13.i0.u97.t132, i13.i0.u98.t129, i13.i1.u93.t144, i13.i1.u94.t141, i14.t2, i14.t0, i14.i0.t1, i14.i0.t3, i14.i0.u20.t234, i14.i0.u20.t249, i14.i0.u95.t138, i14.i1.u90.t152, i14.i2.u96.t135, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/263/82/381
Computing Next relation with stutter on 1212 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
380 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.84346,157628,1,0,278679,669,6204,550027,289,1858,855355
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-11-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-11-02 finished in 27144 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U ((p1&&X(p0))||X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 393/393 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 442 transition count 387
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 442 transition count 387
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 438 transition count 383
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 438 transition count 383
Applied a total of 20 rules in 72 ms. Remains 438 /448 variables (removed 10) and now considering 383/393 (removed 10) transitions.
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:27:19] [INFO ] Computed 91 place invariants in 12 ms
[2021-05-09 07:27:19] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:27:19] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-09 07:27:20] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:27:20] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-09 07:27:20] [INFO ] Dead Transitions using invariants and state equation in 196 ms returned []
Finished structural reductions, in 1 iterations. Remains : 438/448 places, 383/393 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-11-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s390 1), p1:(NEQ s372 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33300 reset in 276 ms.
Product exploration explored 100000 steps with 33352 reset in 363 ms.
Graph (complete) has 992 edges and 438 vertex of which 437 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 33317 reset in 342 ms.
Product exploration explored 100000 steps with 33407 reset in 294 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), true]
Support contains 2 out of 438 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 438/438 places, 383/383 transitions.
Graph (trivial) has 195 edges and 438 vertex of which 6 / 438 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 433 transition count 377
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 90 Pre rules applied. Total rules applied 45 place count 433 transition count 581
Deduced a syphon composed of 134 places in 1 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 135 place count 433 transition count 581
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 151 place count 417 transition count 528
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 167 place count 417 transition count 528
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 236 places in 1 ms
Iterating global reduction 1 with 118 rules applied. Total rules applied 285 place count 417 transition count 528
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 314 place count 388 transition count 499
Deduced a syphon composed of 207 places in 1 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 343 place count 388 transition count 499
Deduced a syphon composed of 207 places in 0 ms
Applied a total of 343 rules in 72 ms. Remains 388 /438 variables (removed 50) and now considering 499/383 (removed -116) transitions.
[2021-05-09 07:27:22] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 499 rows 388 cols
[2021-05-09 07:27:22] [INFO ] Computed 91 place invariants in 10 ms
[2021-05-09 07:27:22] [INFO ] Dead Transitions using invariants and state equation in 238 ms returned []
Finished structural reductions, in 1 iterations. Remains : 388/438 places, 499/383 transitions.
Product exploration explored 100000 steps with 33351 reset in 1036 ms.
Product exploration explored 100000 steps with 33382 reset in 1016 ms.
[2021-05-09 07:27:24] [INFO ] Flatten gal took : 19 ms
[2021-05-09 07:27:24] [INFO ] Flatten gal took : 18 ms
[2021-05-09 07:27:24] [INFO ] Time to serialize gal into /tmp/LTL17511829373769756265.gal : 2 ms
[2021-05-09 07:27:24] [INFO ] Time to serialize properties into /tmp/LTL10756414999536124043.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/LTL17511829373769756265.gal, -t, CGAL, -LTL, /tmp/LTL10756414999536124043.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/LTL17511829373769756265.gal -t CGAL -LTL /tmp/LTL10756414999536124043.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("(p507!=1)"))U((X(G("(p507!=1)")))||(("(p464!=0)")&&(X("(p507!=1)"))))))
Formula 0 simplified : !(X"(p507!=1)" U (XG"(p507!=1)" | ("(p464!=0)" & X"(p507!=1)")))
Detected timeout of ITS tools.
[2021-05-09 07:27:39] [INFO ] Flatten gal took : 13 ms
[2021-05-09 07:27:39] [INFO ] Applying decomposition
[2021-05-09 07:27:39] [INFO ] Flatten gal took : 12 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/graph15414574742834896320.txt, -o, /tmp/graph15414574742834896320.bin, -w, /tmp/graph15414574742834896320.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/graph15414574742834896320.bin, -l, -1, -v, -w, /tmp/graph15414574742834896320.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:27:39] [INFO ] Decomposing Gal with order
[2021-05-09 07:27:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:27:39] [INFO ] Removed a total of 248 redundant transitions.
[2021-05-09 07:27:39] [INFO ] Flatten gal took : 81 ms
[2021-05-09 07:27:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 22 ms.
[2021-05-09 07:27:39] [INFO ] Time to serialize gal into /tmp/LTL14500350935032229314.gal : 6 ms
[2021-05-09 07:27:39] [INFO ] Time to serialize properties into /tmp/LTL14917286596312602861.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/LTL14500350935032229314.gal, -t, CGAL, -LTL, /tmp/LTL14917286596312602861.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/LTL14500350935032229314.gal -t CGAL -LTL /tmp/LTL14917286596312602861.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X("(i7.i0.u136.p507!=1)"))U((X(G("(i7.i0.u136.p507!=1)")))||(("(i4.u127.p464!=0)")&&(X("(i7.i0.u136.p507!=1)"))))))
Formula 0 simplified : !(X"(i7.i0.u136.p507!=1)" U (XG"(i7.i0.u136.p507!=1)" | ("(i4.u127.p464!=0)" & X"(i7.i0.u136.p507!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t160, t168, t180, t188, t200, t204, t216, t224, t232, t258, t385, t386, t388, i0.i0.u73.t163, i0.i0.u77.t155, i0.i1.u75.t158, i0.i2.u115.t77, i0.i2.u116.t74, i0.i3.u117.t71, i1.t196, i1.u49.t207, i1.u53.t199, i2.i0.u11.t268, i2.i1.u92.t147, i3.t250, i3.i0.t228, i3.i0.t254, i3.i0.u16.t257, i3.i0.u36.t231, i3.i1.u18.t253, i4.t220, i4.u38.t227, i4.u40.t223, i4.u100.t123, i5.i0.t208, i5.i0.u44.t215, i6.i0.t184, i6.i0.u55.t195, i6.i0.u61.t187, i7.t172, i7.i0.u65.t179, i7.i1.u67.t175, i8.t164, i8.u69.t171, i8.u71.t167, i8.u114.t80, i9.u63.t183, i9.u112.t86, i9.u113.t83, i10.u108.t99, i10.u109.t96, i10.u110.t93, i11.u51.t203, i11.u104.t111, i11.u105.t108, i11.u106.t105, i11.u107.t102, i12.u42.t219, i12.u101.t120, i12.u102.t117, i12.u103.t114, i13.i0.u99.t126, i13.i1.u97.t132, i13.i1.u98.t129, i14.i0.t265, i14.i1.u93.t144, i14.i1.u94.t141, i15.t1, i15.t0, i15.i0.t2, i15.i0.t3, i15.i0.t234, i15.i0.u20.t249, i15.i0.u96.t135, i15.i1.u90.t152, i15.i2.u95.t138, i16.t10, i16.u118.t67, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/264/82/382
Computing Next relation with stutter on 1212 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15343931728294073661
[2021-05-09 07:27:54] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15343931728294073661
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/ltsmin15343931728294073661]
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/ltsmin15343931728294073661] 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/ltsmin15343931728294073661] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BusinessProcesses-PT-11-04 finished in 36610 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((p0 U p1))&&X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 393/393 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 442 transition count 387
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 442 transition count 387
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 438 transition count 383
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 438 transition count 383
Applied a total of 20 rules in 42 ms. Remains 438 /448 variables (removed 10) and now considering 383/393 (removed 10) transitions.
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:27:55] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-09 07:27:56] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:27:56] [INFO ] Computed 91 place invariants in 5 ms
[2021-05-09 07:27:56] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 438 cols
[2021-05-09 07:27:56] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-09 07:27:56] [INFO ] Dead Transitions using invariants and state equation in 250 ms returned []
Finished structural reductions, in 1 iterations. Remains : 438/448 places, 383/393 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-11-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={1} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR p1 p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={1} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s76 1) (EQ s257 1) (EQ s413 1)), p0:(EQ s431 1), p2:(NEQ s30 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 163 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-05 finished in 1018 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 393/393 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 442 transition count 387
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 442 transition count 387
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 439 transition count 384
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 439 transition count 384
Applied a total of 18 rules in 23 ms. Remains 439 /448 variables (removed 9) and now considering 384/393 (removed 9) transitions.
// Phase 1: matrix 384 rows 439 cols
[2021-05-09 07:27:56] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-09 07:27:57] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 384 rows 439 cols
[2021-05-09 07:27:57] [INFO ] Computed 91 place invariants in 5 ms
[2021-05-09 07:27:57] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
// Phase 1: matrix 384 rows 439 cols
[2021-05-09 07:27:57] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-09 07:27:57] [INFO ] Dead Transitions using invariants and state equation in 289 ms returned []
Finished structural reductions, in 1 iterations. Remains : 439/448 places, 384/393 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s371 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 751 reset in 226 ms.
Product exploration explored 100000 steps with 755 reset in 291 ms.
Graph (complete) has 993 edges and 439 vertex of which 438 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 746 reset in 167 ms.
Product exploration explored 100000 steps with 749 reset in 180 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 439 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 439/439 places, 384/384 transitions.
Graph (trivial) has 197 edges and 439 vertex of which 6 / 439 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 434 transition count 378
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 92 Pre rules applied. Total rules applied 45 place count 434 transition count 592
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 1 with 92 rules applied. Total rules applied 137 place count 434 transition count 592
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 153 place count 418 transition count 535
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 169 place count 418 transition count 535
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 238 places in 0 ms
Iterating global reduction 1 with 118 rules applied. Total rules applied 287 place count 418 transition count 535
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 316 place count 389 transition count 506
Deduced a syphon composed of 209 places in 1 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 345 place count 389 transition count 506
Deduced a syphon composed of 209 places in 0 ms
Applied a total of 345 rules in 77 ms. Remains 389 /439 variables (removed 50) and now considering 506/384 (removed -122) transitions.
[2021-05-09 07:27:59] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 506 rows 389 cols
[2021-05-09 07:27:59] [INFO ] Computed 91 place invariants in 7 ms
[2021-05-09 07:27:59] [INFO ] Dead Transitions using invariants and state equation in 350 ms returned []
Finished structural reductions, in 1 iterations. Remains : 389/439 places, 506/384 transitions.
Product exploration explored 100000 steps with 14388 reset in 775 ms.
Product exploration explored 100000 steps with 14361 reset in 498 ms.
[2021-05-09 07:28:01] [INFO ] Flatten gal took : 13 ms
[2021-05-09 07:28:01] [INFO ] Flatten gal took : 12 ms
[2021-05-09 07:28:01] [INFO ] Time to serialize gal into /tmp/LTL4914320754502122110.gal : 2 ms
[2021-05-09 07:28:01] [INFO ] Time to serialize properties into /tmp/LTL9799596818043971287.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/LTL4914320754502122110.gal, -t, CGAL, -LTL, /tmp/LTL9799596818043971287.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/LTL4914320754502122110.gal -t CGAL -LTL /tmp/LTL9799596818043971287.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(p462!=1)")))))
Formula 0 simplified : !XXG"(p462!=1)"
Detected timeout of ITS tools.
[2021-05-09 07:28:16] [INFO ] Flatten gal took : 31 ms
[2021-05-09 07:28:16] [INFO ] Applying decomposition
[2021-05-09 07:28:16] [INFO ] Flatten gal took : 25 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/graph16141590187930233546.txt, -o, /tmp/graph16141590187930233546.bin, -w, /tmp/graph16141590187930233546.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/graph16141590187930233546.bin, -l, -1, -v, -w, /tmp/graph16141590187930233546.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:28:16] [INFO ] Decomposing Gal with order
[2021-05-09 07:28:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:28:16] [INFO ] Removed a total of 250 redundant transitions.
[2021-05-09 07:28:16] [INFO ] Flatten gal took : 33 ms
[2021-05-09 07:28:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2021-05-09 07:28:16] [INFO ] Time to serialize gal into /tmp/LTL5034456342522331799.gal : 4 ms
[2021-05-09 07:28:16] [INFO ] Time to serialize properties into /tmp/LTL1731581396572846840.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/LTL5034456342522331799.gal, -t, CGAL, -LTL, /tmp/LTL1731581396572846840.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/LTL5034456342522331799.gal -t CGAL -LTL /tmp/LTL1731581396572846840.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i0.u117.p462!=1)")))))
Formula 0 simplified : !XXG"(i0.u117.p462!=1)"
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t160, t172, t180, t188, t200, t208, t224, t232, t258, t384, t386, t388, i0.t10, i0.u117.t36, i0.u117.t67, i1.u67.t175, i2.u63.t183, i2.u65.t179, i2.u111.t86, i2.u109.t93, i2.u112.t83, i3.t196, i3.u51.t203, i3.u53.t199, i4.t228, i4.u36.t231, i4.u97.t129, i4.u98.t126, i5.t254, i5.t250, i5.u17.t257, i5.u19.t253, i6.u12.t268, i6.u91.t147, i6.u92.t144, i6.u93.t141, i7.t265, i8.t204, i8.u44.t215, i8.u49.t207, i9.i0.i0.t184, i9.i0.i0.u55.t195, i9.i0.i0.u61.t187, i9.i1.i0.u105.t105, i9.i1.i0.u106.t102, i9.i1.i0.u107.t99, i9.i1.i0.u108.t96, i10.u96.t132, i11.u116.t71, i11.u75.t158, i11.u73.t163, i11.u77.t155, i12.u101.t117, i12.u102.t114, i12.u103.t111, i12.u104.t108, i13.t220, i13.t216, i13.u38.t227, i13.u40.t223, i13.u42.t219, i13.u99.t123, i13.u100.t120, i14.t168, i14.t164, i14.u71.t167, i14.u69.t171, i14.u113.t80, i14.u114.t77, i14.u115.t74, i15.t3, i15.t2, i15.t1, i15.t0, i15.u21.t234, i15.u21.t249, i15.u89.t152, i15.u94.t138, i15.u95.t135, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/263/83/382
Computing Next relation with stutter on 1212 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
881 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.87114,330528,1,0,513830,1372,6841,1.87424e+06,350,4166,1179655
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-11-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-11-08 finished in 30139 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 393/393 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 443 transition count 388
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 443 transition count 388
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 440 transition count 385
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 440 transition count 385
Applied a total of 16 rules in 42 ms. Remains 440 /448 variables (removed 8) and now considering 385/393 (removed 8) transitions.
// Phase 1: matrix 385 rows 440 cols
[2021-05-09 07:28:27] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-09 07:28:27] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 385 rows 440 cols
[2021-05-09 07:28:27] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-09 07:28:27] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
// Phase 1: matrix 385 rows 440 cols
[2021-05-09 07:28:27] [INFO ] Computed 91 place invariants in 6 ms
[2021-05-09 07:28:27] [INFO ] Dead Transitions using invariants and state equation in 218 ms returned []
Finished structural reductions, in 1 iterations. Remains : 440/448 places, 385/393 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s371 1) (EQ s40 0) (AND (EQ s201 1) (EQ s264 1) (EQ s401 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 323 ms.
Product exploration explored 100000 steps with 25000 reset in 304 ms.
Graph (complete) has 994 edges and 440 vertex of which 439 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 322 ms.
Product exploration explored 100000 steps with 25000 reset in 292 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 440 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 440/440 places, 385/385 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 440 transition count 385
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 93 Pre rules applied. Total rules applied 44 place count 440 transition count 599
Deduced a syphon composed of 137 places in 1 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 137 place count 440 transition count 599
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 153 place count 424 transition count 542
Deduced a syphon composed of 121 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 169 place count 424 transition count 542
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 236 places in 0 ms
Iterating global reduction 1 with 115 rules applied. Total rules applied 284 place count 424 transition count 542
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 311 place count 397 transition count 515
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 338 place count 397 transition count 515
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 340 place count 397 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 341 place count 397 transition count 518
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 343 place count 395 transition count 514
Deduced a syphon composed of 209 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 345 place count 395 transition count 514
Deduced a syphon composed of 209 places in 0 ms
Applied a total of 345 rules in 80 ms. Remains 395 /440 variables (removed 45) and now considering 514/385 (removed -129) transitions.
[2021-05-09 07:28:29] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 514 rows 395 cols
[2021-05-09 07:28:29] [INFO ] Computed 91 place invariants in 8 ms
[2021-05-09 07:28:30] [INFO ] Dead Transitions using invariants and state equation in 336 ms returned []
Finished structural reductions, in 1 iterations. Remains : 395/440 places, 514/385 transitions.
Product exploration explored 100000 steps with 25000 reset in 1112 ms.
Product exploration explored 100000 steps with 25000 reset in 835 ms.
[2021-05-09 07:28:32] [INFO ] Flatten gal took : 11 ms
[2021-05-09 07:28:32] [INFO ] Flatten gal took : 11 ms
[2021-05-09 07:28:32] [INFO ] Time to serialize gal into /tmp/LTL4852409294295478525.gal : 2 ms
[2021-05-09 07:28:32] [INFO ] Time to serialize properties into /tmp/LTL3961568879211266755.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/LTL4852409294295478525.gal, -t, CGAL, -LTL, /tmp/LTL3961568879211266755.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/LTL4852409294295478525.gal -t CGAL -LTL /tmp/LTL3961568879211266755.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(((p461==1)||(p50==0))||(((p229==1)&&(p301==1))&&(p528==1)))"))))))
Formula 0 simplified : !XXXF"(((p461==1)||(p50==0))||(((p229==1)&&(p301==1))&&(p528==1)))"
Detected timeout of ITS tools.
[2021-05-09 07:28:47] [INFO ] Flatten gal took : 26 ms
[2021-05-09 07:28:47] [INFO ] Applying decomposition
[2021-05-09 07:28:47] [INFO ] Flatten gal took : 22 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/graph12872132148837435658.txt, -o, /tmp/graph12872132148837435658.bin, -w, /tmp/graph12872132148837435658.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/graph12872132148837435658.bin, -l, -1, -v, -w, /tmp/graph12872132148837435658.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:28:47] [INFO ] Decomposing Gal with order
[2021-05-09 07:28:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:28:47] [INFO ] Removed a total of 249 redundant transitions.
[2021-05-09 07:28:47] [INFO ] Flatten gal took : 31 ms
[2021-05-09 07:28:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 24 ms.
[2021-05-09 07:28:47] [INFO ] Time to serialize gal into /tmp/LTL2840807387705520603.gal : 3 ms
[2021-05-09 07:28:47] [INFO ] Time to serialize properties into /tmp/LTL11279402764754676969.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/LTL2840807387705520603.gal, -t, CGAL, -LTL, /tmp/LTL11279402764754676969.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/LTL2840807387705520603.gal -t CGAL -LTL /tmp/LTL11279402764754676969.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(((i15.u128.p461==1)||(i6.u18.p50==0))||(((i11.i1.u76.p229==1)&&(i4.i1.u97.p301==1))&&(i15.u118.p528==1)))"))))))
Formula 0 simplified : !XXXF"(((i15.u128.p461==1)||(i6.u18.p50==0))||(((i11.i1.u76.p229==1)&&(i4.i1.u97.p301==1))&&(i15.u118.p528==1)))"
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t160, t172, t184, t196, t204, t216, t224, t232, t258, t384, t386, t388, i0.t168, i0.i0.u70.t171, i0.i0.u113.t83, i0.i0.u114.t80, i0.i1.t164, i0.i1.u68.t175, i0.i1.u72.t167, i0.i1.u115.t77, i1.t180, i1.u64.t183, i1.u66.t179, i1.u112.t86, i2.i0.u54.t199, i2.i1.u104.t111, i2.i1.u105.t108, i2.i1.u106.t105, i2.i1.u107.t102, i2.i1.u108.t99, i3.i0.t188, i3.i0.t200, i3.i0.u52.t203, i3.i0.u56.t195, i4.i1.u97.t132, i4.i1.u98.t129, i5.t228, i5.u37.t231, i6.t254, i6.t250, i6.u12.t268, i6.u18.t257, i6.u20.t253, i7.t265, i8.i0.t220, i8.i0.u39.t227, i8.i0.u41.t223, i8.i0.u100.t123, i8.i1.u99.t126, i8.i1.u101.t120, i8.i1.u102.t117, i8.i1.u103.t114, i9.i0.t208, i9.i0.u43.t219, i9.i0.u45.t215, i10.u50.t207, i11.i0.u74.t163, i11.i0.u78.t155, i11.i0.u116.t74, i11.i0.u117.t71, i11.i1.u76.t158, i12.i0.u93.t144, i12.i0.u94.t141, i12.i1.u92.t147, i13.t3, i13.t0, i13.i0.t1, i13.i0.t2, i13.i0.u22.t234, i13.i0.u22.t249, i13.i0.u90.t152, i13.i1.u95.t138, i13.i2.u96.t135, i14.i0.u62.t187, i14.i0.u109.t96, i14.i0.u110.t93, i15.t37, i15.t10, i15.u118.t67, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/265/83/384
Computing Next relation with stutter on 1212 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
390 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.97754,125124,1,0,214007,740,6241,518758,295,1910,520338
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-11-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-11-11 finished in 25204 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 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 393/393 transitions.
Graph (trivial) has 206 edges and 448 vertex of which 6 / 448 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 442 transition count 338
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 394 transition count 337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 393 transition count 337
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 99 place count 393 transition count 243
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 304 place count 282 transition count 243
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 310 place count 276 transition count 237
Iterating global reduction 3 with 6 rules applied. Total rules applied 316 place count 276 transition count 237
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 231 rules applied. Total rules applied 547 place count 159 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 549 place count 158 transition count 127
Applied a total of 549 rules in 68 ms. Remains 158 /448 variables (removed 290) and now considering 127/393 (removed 266) transitions.
// Phase 1: matrix 127 rows 158 cols
[2021-05-09 07:28:52] [INFO ] Computed 71 place invariants in 3 ms
[2021-05-09 07:28:52] [INFO ] Implicit Places using invariants in 177 ms returned [1, 4, 5, 28, 29, 32, 33, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53, 54, 120]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 180 ms to find 19 implicit places.
[2021-05-09 07:28:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 127 rows 139 cols
[2021-05-09 07:28:52] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-09 07:28:52] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Starting structural reductions, iteration 1 : 139/448 places, 127/393 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2021-05-09 07:28:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 127 rows 139 cols
[2021-05-09 07:28:52] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 07:28:52] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Finished structural reductions, in 2 iterations. Remains : 139/448 places, 127/393 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-14 finished in 672 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U X(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 393/393 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 444 transition count 389
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 444 transition count 389
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 442 transition count 387
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 442 transition count 387
Applied a total of 12 rules in 22 ms. Remains 442 /448 variables (removed 6) and now considering 387/393 (removed 6) transitions.
// Phase 1: matrix 387 rows 442 cols
[2021-05-09 07:28:52] [INFO ] Computed 91 place invariants in 4 ms
[2021-05-09 07:28:53] [INFO ] Implicit Places using invariants in 201 ms returned []
// Phase 1: matrix 387 rows 442 cols
[2021-05-09 07:28:53] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-09 07:28:53] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
// Phase 1: matrix 387 rows 442 cols
[2021-05-09 07:28:53] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-09 07:28:53] [INFO ] Dead Transitions using invariants and state equation in 178 ms returned []
Finished structural reductions, in 1 iterations. Remains : 442/448 places, 387/393 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-11-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s397 1), p1:(EQ s354 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-15 finished in 1108 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11064343956602150310
[2021-05-09 07:28:53] [INFO ] Computing symmetric may disable matrix : 393 transitions.
[2021-05-09 07:28:53] [INFO ] Applying decomposition
[2021-05-09 07:28:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:28:54] [INFO ] Computing symmetric may enable matrix : 393 transitions.
[2021-05-09 07:28:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:28:54] [INFO ] Flatten gal took : 42 ms
[2021-05-09 07:28:54] [INFO ] Computing Do-Not-Accords matrix : 393 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12014984022802324411.txt, -o, /tmp/graph12014984022802324411.bin, -w, /tmp/graph12014984022802324411.weights], workingDir=null]
[2021-05-09 07:28:54] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12014984022802324411.bin, -l, -1, -v, -w, /tmp/graph12014984022802324411.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:28:54] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11064343956602150310
[2021-05-09 07:28:54] [INFO ] Decomposing Gal with order
[2021-05-09 07:28:54] [INFO ] Rewriting arrays to variables to allow decomposition.
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/ltsmin11064343956602150310]
[2021-05-09 07:28:54] [INFO ] Removed a total of 248 redundant transitions.
[2021-05-09 07:28:54] [INFO ] Flatten gal took : 52 ms
[2021-05-09 07:28:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 24 ms.
[2021-05-09 07:28:54] [INFO ] Time to serialize gal into /tmp/LTLFireability10413924119315619509.gal : 8 ms
[2021-05-09 07:28:54] [INFO ] Time to serialize properties into /tmp/LTLFireability6753403246603972255.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/LTLFireability10413924119315619509.gal, -t, CGAL, -LTL, /tmp/LTLFireability6753403246603972255.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/LTLFireability10413924119315619509.gal -t CGAL -LTL /tmp/LTLFireability6753403246603972255.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((X("(i16.i0.u141.p507!=1)"))U((("(i2.u131.p464!=0)")&&(X("(i16.i0.u141.p507!=1)")))||(G(X("(i16.i0.u141.p507!=1)")))))U(((X(X(F("((i16.i0.u141.p507!=1)||(i17.u130.p462!=1))"))))&&((X("(i16.i0.u141.p507!=1)"))U((("(i2.u131.p464!=0)")&&(X("(i16.i0.u141.p507!=1)")))||(G(X("(i16.i0.u141.p507!=1)"))))))||(G((X("(i16.i0.u141.p507!=1)"))U((("(i2.u131.p464!=0)")&&(X("(i16.i0.u141.p507!=1)")))||(G(X("(i16.i0.u141.p507!=1)")))))))))
Formula 0 simplified : !((X"(i16.i0.u141.p507!=1)" U (("(i2.u131.p464!=0)" & X"(i16.i0.u141.p507!=1)") | GX"(i16.i0.u141.p507!=1)")) U (((X"(i16.i0.u141.p507!=1)" U (("(i2.u131.p464!=0)" & X"(i16.i0.u141.p507!=1)") | GX"(i16.i0.u141.p507!=1)")) & XXF"((i16.i0.u141.p507!=1)||(i17.u130.p462!=1))") | G(X"(i16.i0.u141.p507!=1)" U (("(i2.u131.p464!=0)" & X"(i16.i0.u141.p507!=1)") | GX"(i16.i0.u141.p507!=1)"))))
Compilation finished in 2008 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11064343956602150310]
Link finished in 69 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X((LTLAPp0==true)) U (((LTLAPp1==true)&&X((LTLAPp0==true)))||X([]((LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11064343956602150310]
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t10, t250, t264, t278, t282, t298, t302, t314, t320, t328, t362, t500, t501, i0.i0.u116.t136, i0.i0.u117.t132, i0.i1.u73.t253, i0.i1.u77.t243, i0.i2.u75.t246, i1.u67.t267, i2.t310, i2.u38.t323, i2.u42.t313, i3.t358, i3.t354, i3.u17.t361, i3.u19.t357, i4.i0.u12.t382, i4.i1.u91.t232, i4.i1.u92.t228, i5.t379, i6.t3, i6.t2, i6.t0, i6.i0.u95.t216, i6.i1.t1, i6.i1.u21.t334, i6.i1.u21.t353, i6.i1.u89.t239, i6.i1.u94.t220, i7.t324, i7.u36.t327, i8.i0.u44.t309, i9.i0.t254, i9.i0.t260, i9.i0.u69.t263, i9.i0.u71.t259, i9.i0.u114.t144, i9.i1.u113.t148, i9.i1.u115.t140, i10.u61.t281, i10.u108.t164, i10.u109.t160, i11.t294, i11.i0.t290, i11.i0.u49.t301, i11.i0.u53.t293, i11.i1.u51.t297, i12.u100.t196, i12.u101.t192, i12.u102.t188, i12.u103.t184, i13.i0.u40.t319, i13.i1.u98.t204, i13.i1.u99.t200, i14.u93.t224, i14.u96.t212, i14.u97.t208, i15.i1.u104.t180, i15.i1.u105.t176, i15.i2.u106.t172, i15.i2.u107.t168, i16.i0.t274, i16.i0.u55.t289, i16.i0.u63.t277, i16.i0.u65.t271, i16.i1.t153, i16.i1.u112.t154, i17.t113, i17.t70, i17.t34, i17.t22, i17.u122.t105, i17.u122.t126, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/269/87/392
Computing Next relation with stutter on 1212 deadlock states
6 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
1733 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,17.4066,392236,1,0,470839,836,7220,3.03087e+06,292,2737,1132732
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-11-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620545377078

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

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