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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K 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.4K 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 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 156K 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-14-00
FORMULA_NAME BusinessProcesses-PT-14-01
FORMULA_NAME BusinessProcesses-PT-14-02
FORMULA_NAME BusinessProcesses-PT-14-03
FORMULA_NAME BusinessProcesses-PT-14-04
FORMULA_NAME BusinessProcesses-PT-14-05
FORMULA_NAME BusinessProcesses-PT-14-06
FORMULA_NAME BusinessProcesses-PT-14-07
FORMULA_NAME BusinessProcesses-PT-14-08
FORMULA_NAME BusinessProcesses-PT-14-09
FORMULA_NAME BusinessProcesses-PT-14-10
FORMULA_NAME BusinessProcesses-PT-14-11
FORMULA_NAME BusinessProcesses-PT-14-12
FORMULA_NAME BusinessProcesses-PT-14-13
FORMULA_NAME BusinessProcesses-PT-14-14
FORMULA_NAME BusinessProcesses-PT-14-15

=== Now, execution of the tool begins

BK_START 1620546244689

Running Version 0
[2021-05-09 07:44:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 07:44:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:44:11] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2021-05-09 07:44:11] [INFO ] Transformed 624 places.
[2021-05-09 07:44:11] [INFO ] Transformed 564 transitions.
[2021-05-09 07:44:11] [INFO ] Found NUPN structural information;
[2021-05-09 07:44:11] [INFO ] Parsed PT model containing 624 places and 564 transitions in 375 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 07:44:11] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 8 places in 38 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 616 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 89 place count 527 transition count 472
Iterating global reduction 1 with 84 rules applied. Total rules applied 173 place count 527 transition count 472
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 215 place count 485 transition count 430
Iterating global reduction 1 with 42 rules applied. Total rules applied 257 place count 485 transition count 430
Applied a total of 257 rules in 358 ms. Remains 485 /616 variables (removed 131) and now considering 430/556 (removed 126) transitions.
// Phase 1: matrix 430 rows 485 cols
[2021-05-09 07:44:12] [INFO ] Computed 94 place invariants in 67 ms
[2021-05-09 07:44:14] [INFO ] Implicit Places using invariants in 1371 ms returned []
// Phase 1: matrix 430 rows 485 cols
[2021-05-09 07:44:14] [INFO ] Computed 94 place invariants in 5 ms
[2021-05-09 07:44:15] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 2513 ms to find 0 implicit places.
// Phase 1: matrix 430 rows 485 cols
[2021-05-09 07:44:15] [INFO ] Computed 94 place invariants in 10 ms
[2021-05-09 07:44:15] [INFO ] Dead Transitions using invariants and state equation in 315 ms returned []
Finished structural reductions, in 1 iterations. Remains : 485/616 places, 430/556 transitions.
[2021-05-09 07:44:15] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 07:44:15] [INFO ] Flatten gal took : 168 ms
FORMULA BusinessProcesses-PT-14-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 07:44:15] [INFO ] Flatten gal took : 38 ms
[2021-05-09 07:44:15] [INFO ] Input system was already deterministic with 430 transitions.
Incomplete random walk after 100000 steps, including 684 resets, run finished after 423 ms. (steps per millisecond=236 ) properties (out of 25) seen :12
Running SMT prover for 13 properties.
// Phase 1: matrix 430 rows 485 cols
[2021-05-09 07:44:16] [INFO ] Computed 94 place invariants in 22 ms
[2021-05-09 07:44:16] [INFO ] [Real]Absence check using 55 positive place invariants in 363 ms returned sat
[2021-05-09 07:44:17] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 267 ms returned sat
[2021-05-09 07:44:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:17] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2021-05-09 07:44:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:44:17] [INFO ] [Nat]Absence check using 55 positive place invariants in 370 ms returned sat
[2021-05-09 07:44:18] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 267 ms returned sat
[2021-05-09 07:44:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:18] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2021-05-09 07:44:18] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2021-05-09 07:44:18] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2021-05-09 07:44:19] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:44:19] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:44:19] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2021-05-09 07:44:19] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:44:19] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:44:19] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:44:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 814 ms
[2021-05-09 07:44:19] [INFO ] Computed and/alt/rep : 424/882/424 causal constraints (skipped 5 transitions) in 96 ms.
[2021-05-09 07:44:21] [INFO ] Deduced a trap composed of 86 places in 154 ms of which 1 ms to minimize.
[2021-05-09 07:44:22] [INFO ] Deduced a trap composed of 88 places in 165 ms of which 0 ms to minimize.
[2021-05-09 07:44:22] [INFO ] Deduced a trap composed of 91 places in 157 ms of which 1 ms to minimize.
[2021-05-09 07:44:22] [INFO ] Deduced a trap composed of 93 places in 169 ms of which 1 ms to minimize.
[2021-05-09 07:44:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 955 ms
[2021-05-09 07:44:22] [INFO ] Added : 323 causal constraints over 65 iterations in 3379 ms. Result :sat
[2021-05-09 07:44:22] [INFO ] [Real]Absence check using 55 positive place invariants in 44 ms returned sat
[2021-05-09 07:44:22] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-09 07:44:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:23] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-09 07:44:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:44:23] [INFO ] [Nat]Absence check using 55 positive place invariants in 28 ms returned unsat
[2021-05-09 07:44:23] [INFO ] [Real]Absence check using 55 positive place invariants in 20 ms returned sat
[2021-05-09 07:44:23] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 07:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:23] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2021-05-09 07:44:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:44:23] [INFO ] [Nat]Absence check using 55 positive place invariants in 19 ms returned sat
[2021-05-09 07:44:23] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:44:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:23] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2021-05-09 07:44:24] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 0 ms to minimize.
[2021-05-09 07:44:24] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:44:24] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 1 ms to minimize.
[2021-05-09 07:44:24] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:44:24] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 1 ms to minimize.
[2021-05-09 07:44:24] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2021-05-09 07:44:24] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 1 ms to minimize.
[2021-05-09 07:44:25] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 0 ms to minimize.
[2021-05-09 07:44:25] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 0 ms to minimize.
[2021-05-09 07:44:25] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2021-05-09 07:44:25] [INFO ] Deduced a trap composed of 97 places in 172 ms of which 1 ms to minimize.
[2021-05-09 07:44:25] [INFO ] Deduced a trap composed of 81 places in 152 ms of which 1 ms to minimize.
[2021-05-09 07:44:25] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 0 ms to minimize.
[2021-05-09 07:44:26] [INFO ] Deduced a trap composed of 84 places in 184 ms of which 3 ms to minimize.
[2021-05-09 07:44:26] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:44:26] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:44:26] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2021-05-09 07:44:26] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:44:26] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2021-05-09 07:44:26] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2021-05-09 07:44:26] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2763 ms
[2021-05-09 07:44:26] [INFO ] Computed and/alt/rep : 424/882/424 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-09 07:44:28] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 1 ms to minimize.
[2021-05-09 07:44:29] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 13 ms to minimize.
[2021-05-09 07:44:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 502 ms
[2021-05-09 07:44:29] [INFO ] Added : 294 causal constraints over 59 iterations in 2599 ms. Result :sat
[2021-05-09 07:44:29] [INFO ] [Real]Absence check using 55 positive place invariants in 27 ms returned sat
[2021-05-09 07:44:29] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:44:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:29] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2021-05-09 07:44:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:44:29] [INFO ] [Nat]Absence check using 55 positive place invariants in 19 ms returned sat
[2021-05-09 07:44:29] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:44:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:29] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2021-05-09 07:44:30] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:44:30] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 0 ms to minimize.
[2021-05-09 07:44:30] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:44:30] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 0 ms to minimize.
[2021-05-09 07:44:30] [INFO ] Deduced a trap composed of 88 places in 178 ms of which 0 ms to minimize.
[2021-05-09 07:44:30] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 1 ms to minimize.
[2021-05-09 07:44:31] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:44:31] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 0 ms to minimize.
[2021-05-09 07:44:31] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:44:31] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:44:31] [INFO ] Deduced a trap composed of 97 places in 183 ms of which 1 ms to minimize.
[2021-05-09 07:44:31] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:44:32] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2021-05-09 07:44:32] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:44:32] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2021-05-09 07:44:32] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:44:32] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2021-05-09 07:44:32] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:44:32] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:44:32] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:44:32] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2867 ms
[2021-05-09 07:44:32] [INFO ] Computed and/alt/rep : 424/882/424 causal constraints (skipped 5 transitions) in 30 ms.
[2021-05-09 07:44:34] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 0 ms to minimize.
[2021-05-09 07:44:34] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:44:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 374 ms
[2021-05-09 07:44:34] [INFO ] Added : 294 causal constraints over 59 iterations in 2150 ms. Result :sat
[2021-05-09 07:44:35] [INFO ] [Real]Absence check using 55 positive place invariants in 18 ms returned sat
[2021-05-09 07:44:35] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-09 07:44:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:35] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-09 07:44:35] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 16 ms to minimize.
[2021-05-09 07:44:35] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2021-05-09 07:44:35] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:44:35] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:44:35] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:44:35] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:44:35] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:44:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 675 ms
[2021-05-09 07:44:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:44:36] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2021-05-09 07:44:36] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:44:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:36] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2021-05-09 07:44:36] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2021-05-09 07:44:36] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2021-05-09 07:44:36] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:44:36] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 4 ms to minimize.
[2021-05-09 07:44:36] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:44:36] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 10 ms to minimize.
[2021-05-09 07:44:36] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2021-05-09 07:44:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 609 ms
[2021-05-09 07:44:36] [INFO ] Computed and/alt/rep : 424/882/424 causal constraints (skipped 5 transitions) in 37 ms.
[2021-05-09 07:44:38] [INFO ] Added : 235 causal constraints over 47 iterations in 1519 ms. Result :sat
[2021-05-09 07:44:38] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2021-05-09 07:44:38] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:44:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:38] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-09 07:44:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:44:38] [INFO ] [Nat]Absence check using 55 positive place invariants in 23 ms returned sat
[2021-05-09 07:44:38] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:44:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:38] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2021-05-09 07:44:39] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 1 ms to minimize.
[2021-05-09 07:44:39] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:44:39] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2021-05-09 07:44:39] [INFO ] Deduced a trap composed of 35 places in 23 ms of which 0 ms to minimize.
[2021-05-09 07:44:39] [INFO ] Deduced a trap composed of 35 places in 23 ms of which 0 ms to minimize.
[2021-05-09 07:44:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 409 ms
[2021-05-09 07:44:39] [INFO ] Computed and/alt/rep : 424/882/424 causal constraints (skipped 5 transitions) in 30 ms.
[2021-05-09 07:44:40] [INFO ] Added : 281 causal constraints over 57 iterations in 1463 ms. Result :sat
[2021-05-09 07:44:40] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-09 07:44:40] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 7 ms returned sat
[2021-05-09 07:44:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:40] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-09 07:44:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:44:41] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-09 07:44:41] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 07:44:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:41] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-09 07:44:41] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:44:41] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:44:41] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2021-05-09 07:44:41] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 1 ms to minimize.
[2021-05-09 07:44:41] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2021-05-09 07:44:42] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:44:42] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:44:42] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:44:42] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:44:42] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 0 ms to minimize.
[2021-05-09 07:44:42] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 1 ms to minimize.
[2021-05-09 07:44:42] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 0 ms to minimize.
[2021-05-09 07:44:42] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:44:43] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:44:43] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:44:43] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:44:43] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:44:43] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 0 ms to minimize.
[2021-05-09 07:44:43] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 0 ms to minimize.
[2021-05-09 07:44:44] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:44:44] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:44:44] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:44:44] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:44:44] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:44:44] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:44:44] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:44:44] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 0 ms to minimize.
[2021-05-09 07:44:45] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 0 ms to minimize.
[2021-05-09 07:44:45] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:44:45] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:44:45] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:44:45] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:44:45] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 0 ms to minimize.
[2021-05-09 07:44:45] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:44:45] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:44:45] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:44:46] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:44:46] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:44:46] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 4852 ms
[2021-05-09 07:44:46] [INFO ] Computed and/alt/rep : 424/882/424 causal constraints (skipped 5 transitions) in 50 ms.
[2021-05-09 07:44:47] [INFO ] Added : 245 causal constraints over 49 iterations in 1541 ms. Result :sat
[2021-05-09 07:44:47] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2021-05-09 07:44:47] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:47] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-09 07:44:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:44:48] [INFO ] [Nat]Absence check using 55 positive place invariants in 22 ms returned sat
[2021-05-09 07:44:48] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:48] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2021-05-09 07:44:48] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2021-05-09 07:44:48] [INFO ] Deduced a trap composed of 114 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:44:48] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 1 ms to minimize.
[2021-05-09 07:44:48] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:44:48] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:44:49] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:44:49] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:44:49] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:44:49] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 3 ms to minimize.
[2021-05-09 07:44:49] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:44:49] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:44:49] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2021-05-09 07:44:49] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:44:49] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2021-05-09 07:44:49] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2021-05-09 07:44:50] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:44:50] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1848 ms
[2021-05-09 07:44:50] [INFO ] Computed and/alt/rep : 424/882/424 causal constraints (skipped 5 transitions) in 43 ms.
[2021-05-09 07:44:52] [INFO ] Added : 312 causal constraints over 63 iterations in 2301 ms. Result :sat
[2021-05-09 07:44:52] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2021-05-09 07:44:52] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 7 ms returned sat
[2021-05-09 07:44:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:52] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-09 07:44:52] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:44:52] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2021-05-09 07:44:52] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:44:53] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:44:53] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2021-05-09 07:44:53] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2021-05-09 07:44:53] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:44:53] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:44:53] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 850 ms
[2021-05-09 07:44:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:44:53] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-09 07:44:53] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 07:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:53] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2021-05-09 07:44:53] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:44:54] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:44:54] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:44:54] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2021-05-09 07:44:54] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:44:54] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:44:54] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:44:54] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2021-05-09 07:44:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 776 ms
[2021-05-09 07:44:54] [INFO ] Computed and/alt/rep : 424/882/424 causal constraints (skipped 5 transitions) in 35 ms.
[2021-05-09 07:44:56] [INFO ] Added : 306 causal constraints over 62 iterations in 1728 ms. Result :sat
[2021-05-09 07:44:56] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-09 07:44:56] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 7 ms returned sat
[2021-05-09 07:44:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:56] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-09 07:44:56] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 0 ms to minimize.
[2021-05-09 07:44:56] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:44:56] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:44:56] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:44:57] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:44:57] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2021-05-09 07:44:57] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 0 ms to minimize.
[2021-05-09 07:44:57] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:44:57] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:44:57] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:44:57] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:44:57] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:44:57] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:44:58] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:44:58] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1656 ms
[2021-05-09 07:44:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:44:58] [INFO ] [Nat]Absence check using 55 positive place invariants in 17 ms returned sat
[2021-05-09 07:44:58] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:44:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:44:58] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-09 07:44:58] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 0 ms to minimize.
[2021-05-09 07:44:58] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2021-05-09 07:44:58] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:44:58] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:44:59] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:44:59] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:44:59] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:44:59] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:44:59] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:44:59] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:44:59] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:44:59] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 0 ms to minimize.
[2021-05-09 07:45:00] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:45:00] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:45:00] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:45:00] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:45:00] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 1 ms to minimize.
[2021-05-09 07:45:00] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:45:01] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 0 ms to minimize.
[2021-05-09 07:45:01] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:45:01] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:45:01] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 0 ms to minimize.
[2021-05-09 07:45:01] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 1 ms to minimize.
[2021-05-09 07:45:01] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 1 ms to minimize.
[2021-05-09 07:45:02] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:45:02] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 0 ms to minimize.
[2021-05-09 07:45:02] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:45:02] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:45:02] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:45:02] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:45:03] [INFO ] Deduced a trap composed of 83 places in 988 ms of which 0 ms to minimize.
[2021-05-09 07:45:03] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:45:03] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:45:04] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:45:04] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:45:04] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:45:04] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2021-05-09 07:45:04] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2021-05-09 07:45:04] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 6000 ms
[2021-05-09 07:45:04] [INFO ] Computed and/alt/rep : 424/882/424 causal constraints (skipped 5 transitions) in 29 ms.
[2021-05-09 07:45:05] [INFO ] Added : 229 causal constraints over 46 iterations in 1274 ms. Result :sat
[2021-05-09 07:45:05] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-09 07:45:05] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 7 ms returned sat
[2021-05-09 07:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:45:05] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-09 07:45:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:45:05] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-09 07:45:05] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:45:06] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-09 07:45:06] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:45:06] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:45:06] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:45:06] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2021-05-09 07:45:06] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2021-05-09 07:45:06] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2021-05-09 07:45:06] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:45:06] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:45:06] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2021-05-09 07:45:07] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2021-05-09 07:45:07] [INFO ] Deduced a trap composed of 35 places in 20 ms of which 0 ms to minimize.
[2021-05-09 07:45:07] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2021-05-09 07:45:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 969 ms
[2021-05-09 07:45:07] [INFO ] Computed and/alt/rep : 424/882/424 causal constraints (skipped 5 transitions) in 27 ms.
[2021-05-09 07:45:08] [INFO ] Added : 285 causal constraints over 57 iterations in 1557 ms. Result :sat
[2021-05-09 07:45:08] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-09 07:45:08] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:45:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:45:08] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2021-05-09 07:45:09] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2021-05-09 07:45:09] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2021-05-09 07:45:09] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:45:09] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:45:09] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:45:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 445 ms
[2021-05-09 07:45:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:45:09] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-09 07:45:09] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-09 07:45:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:45:09] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2021-05-09 07:45:09] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:45:09] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:45:09] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:45:10] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:45:10] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:45:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 390 ms
[2021-05-09 07:45:10] [INFO ] Computed and/alt/rep : 424/882/424 causal constraints (skipped 5 transitions) in 30 ms.
[2021-05-09 07:45:11] [INFO ] Added : 204 causal constraints over 42 iterations in 1251 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 471 transition count 416
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 471 transition count 416
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 468 transition count 413
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 468 transition count 413
Applied a total of 34 rules in 81 ms. Remains 468 /485 variables (removed 17) and now considering 413/430 (removed 17) transitions.
// Phase 1: matrix 413 rows 468 cols
[2021-05-09 07:45:11] [INFO ] Computed 94 place invariants in 9 ms
[2021-05-09 07:45:11] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 413 rows 468 cols
[2021-05-09 07:45:11] [INFO ] Computed 94 place invariants in 5 ms
[2021-05-09 07:45:12] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
// Phase 1: matrix 413 rows 468 cols
[2021-05-09 07:45:12] [INFO ] Computed 94 place invariants in 4 ms
[2021-05-09 07:45:12] [INFO ] Dead Transitions using invariants and state equation in 279 ms returned []
Finished structural reductions, in 1 iterations. Remains : 468/485 places, 413/430 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-14-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s406 0) (NEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-14-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-00 finished in 1533 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Graph (trivial) has 231 edges and 485 vertex of which 4 / 485 are part of one of the 1 SCC in 6 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 481 transition count 367
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 422 transition count 367
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 119 place count 422 transition count 268
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 334 place count 306 transition count 268
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 348 place count 292 transition count 254
Iterating global reduction 2 with 14 rules applied. Total rules applied 362 place count 292 transition count 254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 362 place count 292 transition count 253
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 364 place count 291 transition count 253
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 609 place count 166 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 611 place count 165 transition count 137
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 612 place count 165 transition count 137
Applied a total of 612 rules in 124 ms. Remains 165 /485 variables (removed 320) and now considering 137/430 (removed 293) transitions.
// Phase 1: matrix 137 rows 165 cols
[2021-05-09 07:45:13] [INFO ] Computed 72 place invariants in 5 ms
[2021-05-09 07:45:13] [INFO ] Implicit Places using invariants in 123 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 125 ms to find 20 implicit places.
[2021-05-09 07:45:13] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 137 rows 145 cols
[2021-05-09 07:45:13] [INFO ] Computed 52 place invariants in 3 ms
[2021-05-09 07:45:13] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Starting structural reductions, iteration 1 : 145/485 places, 137/430 transitions.
Applied a total of 0 rules in 9 ms. Remains 145 /145 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2021-05-09 07:45:13] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 137 rows 145 cols
[2021-05-09 07:45:13] [INFO ] Computed 52 place invariants in 3 ms
[2021-05-09 07:45:13] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 2 iterations. Remains : 145/485 places, 137/430 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s95 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-01 finished in 545 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 470 transition count 415
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 470 transition count 415
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 466 transition count 411
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 466 transition count 411
Applied a total of 38 rules in 51 ms. Remains 466 /485 variables (removed 19) and now considering 411/430 (removed 19) transitions.
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:45:13] [INFO ] Computed 94 place invariants in 7 ms
[2021-05-09 07:45:13] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:45:13] [INFO ] Computed 94 place invariants in 8 ms
[2021-05-09 07:45:14] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:45:14] [INFO ] Computed 94 place invariants in 8 ms
[2021-05-09 07:45:14] [INFO ] Dead Transitions using invariants and state equation in 222 ms returned []
Finished structural reductions, in 1 iterations. Remains : 466/485 places, 411/430 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-14-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s158 0) (EQ s153 1)), p1:(OR (EQ s158 0) (EQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 679 reset in 420 ms.
Product exploration explored 100000 steps with 682 reset in 347 ms.
Graph (complete) has 1067 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 685 reset in 272 ms.
Product exploration explored 100000 steps with 677 reset in 267 ms.
[2021-05-09 07:45:16] [INFO ] Flatten gal took : 38 ms
[2021-05-09 07:45:16] [INFO ] Flatten gal took : 33 ms
[2021-05-09 07:45:16] [INFO ] Time to serialize gal into /tmp/LTL6866012365603141269.gal : 12 ms
[2021-05-09 07:45:16] [INFO ] Time to serialize properties into /tmp/LTL842094977695559138.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/LTL6866012365603141269.gal, -t, CGAL, -LTL, /tmp/LTL842094977695559138.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/LTL6866012365603141269.gal -t CGAL -LTL /tmp/LTL842094977695559138.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("((p189==0)||(p184==1))")||(X("((p189==0)||(p184==1))")))))
Formula 0 simplified : !G("((p189==0)||(p184==1))" | X"((p189==0)||(p184==1))")
Detected timeout of ITS tools.
[2021-05-09 07:45:31] [INFO ] Flatten gal took : 18 ms
[2021-05-09 07:45:31] [INFO ] Applying decomposition
[2021-05-09 07:45:31] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5968918093471632040.txt, -o, /tmp/graph5968918093471632040.bin, -w, /tmp/graph5968918093471632040.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/graph5968918093471632040.bin, -l, -1, -v, -w, /tmp/graph5968918093471632040.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:45:31] [INFO ] Decomposing Gal with order
[2021-05-09 07:45:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:45:31] [INFO ] Removed a total of 276 redundant transitions.
[2021-05-09 07:45:31] [INFO ] Flatten gal took : 70 ms
[2021-05-09 07:45:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 16 ms.
[2021-05-09 07:45:31] [INFO ] Time to serialize gal into /tmp/LTL3513253724799966640.gal : 8 ms
[2021-05-09 07:45:31] [INFO ] Time to serialize properties into /tmp/LTL15321104642062795784.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/LTL3513253724799966640.gal, -t, CGAL, -LTL, /tmp/LTL15321104642062795784.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/LTL3513253724799966640.gal -t CGAL -LTL /tmp/LTL15321104642062795784.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(("((i15.i2.u58.p189==0)||(i15.i0.u57.p184==1))")||(X("((i15.i2.u58.p189==0)||(i15.i0.u57.p184==1))")))))
Formula 0 simplified : !G("((i15.i2.u58.p189==0)||(i15.i0.u57.p184==1))" | X"((i15.i2.u58.p189==0)||(i15.i0.u57.p184==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16884840354871672509
[2021-05-09 07:45:47] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16884840354871672509
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/ltsmin16884840354871672509]
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/ltsmin16884840354871672509] 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/ltsmin16884840354871672509] 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-14-02 finished in 34650 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Graph (trivial) has 233 edges and 485 vertex of which 7 / 485 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 478 transition count 364
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 420 transition count 364
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 117 place count 420 transition count 265
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 332 place count 304 transition count 265
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 346 place count 290 transition count 251
Iterating global reduction 2 with 14 rules applied. Total rules applied 360 place count 290 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 360 place count 290 transition count 250
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 362 place count 289 transition count 250
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 607 place count 164 transition count 130
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 609 place count 163 transition count 134
Applied a total of 609 rules in 66 ms. Remains 163 /485 variables (removed 322) and now considering 134/430 (removed 296) transitions.
// Phase 1: matrix 134 rows 163 cols
[2021-05-09 07:45:48] [INFO ] Computed 72 place invariants in 2 ms
[2021-05-09 07:45:48] [INFO ] Implicit Places using invariants in 152 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 154 ms to find 20 implicit places.
[2021-05-09 07:45:48] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 134 rows 143 cols
[2021-05-09 07:45:48] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 07:45:48] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Starting structural reductions, iteration 1 : 143/485 places, 134/430 transitions.
Applied a total of 0 rules in 9 ms. Remains 143 /143 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2021-05-09 07:45:48] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 134 rows 143 cols
[2021-05-09 07:45:48] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 07:45:48] [INFO ] Dead Transitions using invariants and state equation in 157 ms returned []
Finished structural reductions, in 2 iterations. Remains : 143/485 places, 134/430 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-03 finished in 611 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 470 transition count 415
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 470 transition count 415
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 466 transition count 411
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 466 transition count 411
Applied a total of 38 rules in 22 ms. Remains 466 /485 variables (removed 19) and now considering 411/430 (removed 19) transitions.
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:45:48] [INFO ] Computed 94 place invariants in 17 ms
[2021-05-09 07:45:49] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:45:49] [INFO ] Computed 94 place invariants in 8 ms
[2021-05-09 07:45:49] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:45:49] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:45:49] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned []
Finished structural reductions, in 1 iterations. Remains : 466/485 places, 411/430 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-14-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NEQ s427 0) (NEQ s105 1)), p0:(OR (EQ s229 0) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-04 finished in 1063 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Graph (trivial) has 230 edges and 485 vertex of which 7 / 485 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 478 transition count 365
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 421 transition count 365
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 115 place count 421 transition count 267
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 328 place count 306 transition count 267
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 341 place count 293 transition count 254
Iterating global reduction 2 with 13 rules applied. Total rules applied 354 place count 293 transition count 254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 354 place count 293 transition count 253
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 356 place count 292 transition count 253
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 241 rules applied. Total rules applied 597 place count 169 transition count 135
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 599 place count 168 transition count 139
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 605 place count 168 transition count 139
Applied a total of 605 rules in 49 ms. Remains 168 /485 variables (removed 317) and now considering 139/430 (removed 291) transitions.
// Phase 1: matrix 139 rows 168 cols
[2021-05-09 07:45:49] [INFO ] Computed 72 place invariants in 1 ms
[2021-05-09 07:45:49] [INFO ] Implicit Places using invariants in 85 ms returned [1, 2, 3, 4, 8, 9, 17, 18, 22, 23, 24, 25, 26, 27, 50, 51, 52, 53, 54]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 86 ms to find 19 implicit places.
[2021-05-09 07:45:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 139 rows 149 cols
[2021-05-09 07:45:49] [INFO ] Computed 53 place invariants in 2 ms
[2021-05-09 07:45:50] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Starting structural reductions, iteration 1 : 149/485 places, 139/430 transitions.
Applied a total of 0 rules in 4 ms. Remains 149 /149 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2021-05-09 07:45:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 139 rows 149 cols
[2021-05-09 07:45:50] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 07:45:50] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 2 iterations. Remains : 149/485 places, 139/430 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s97 0) (EQ s118 1)), p1:(AND (EQ s2 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-05 finished in 390 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 472 transition count 417
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 472 transition count 417
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 469 transition count 414
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 469 transition count 414
Applied a total of 32 rules in 27 ms. Remains 469 /485 variables (removed 16) and now considering 414/430 (removed 16) transitions.
// Phase 1: matrix 414 rows 469 cols
[2021-05-09 07:45:50] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:45:50] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 414 rows 469 cols
[2021-05-09 07:45:50] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:45:50] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
// Phase 1: matrix 414 rows 469 cols
[2021-05-09 07:45:50] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:45:50] [INFO ] Dead Transitions using invariants and state equation in 159 ms returned []
Finished structural reductions, in 1 iterations. Remains : 469/485 places, 414/430 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : BusinessProcesses-PT-14-06 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=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NEQ s402 0) (NEQ s399 1)), p0:(OR (NEQ s397 0) (NEQ s266 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 119 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-06 finished in 830 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(G(p0))||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 472 transition count 417
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 472 transition count 417
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 468 transition count 413
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 468 transition count 413
Applied a total of 34 rules in 23 ms. Remains 468 /485 variables (removed 17) and now considering 413/430 (removed 17) transitions.
// Phase 1: matrix 413 rows 468 cols
[2021-05-09 07:45:51] [INFO ] Computed 94 place invariants in 2 ms
[2021-05-09 07:45:51] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 413 rows 468 cols
[2021-05-09 07:45:51] [INFO ] Computed 94 place invariants in 2 ms
[2021-05-09 07:45:51] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
// Phase 1: matrix 413 rows 468 cols
[2021-05-09 07:45:51] [INFO ] Computed 94 place invariants in 5 ms
[2021-05-09 07:45:51] [INFO ] Dead Transitions using invariants and state equation in 179 ms returned []
Finished structural reductions, in 1 iterations. Remains : 468/485 places, 413/430 transitions.
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-14-07 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (NEQ s328 0) (NEQ s263 1)), p0:(AND (NEQ s466 0) (NEQ s95 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]]
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-07 finished in 1027 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Graph (trivial) has 227 edges and 485 vertex of which 7 / 485 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 478 transition count 367
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 423 transition count 367
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 111 place count 423 transition count 271
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 319 place count 311 transition count 271
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 331 place count 299 transition count 259
Iterating global reduction 2 with 12 rules applied. Total rules applied 343 place count 299 transition count 259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 343 place count 299 transition count 258
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 345 place count 298 transition count 258
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 249 rules applied. Total rules applied 594 place count 171 transition count 136
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 596 place count 170 transition count 140
Applied a total of 596 rules in 62 ms. Remains 170 /485 variables (removed 315) and now considering 140/430 (removed 290) transitions.
// Phase 1: matrix 140 rows 170 cols
[2021-05-09 07:45:52] [INFO ] Computed 73 place invariants in 1 ms
[2021-05-09 07:45:52] [INFO ] Implicit Places using invariants in 180 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 20, 21, 22, 23, 24, 25, 51, 52, 53, 54, 55, 139]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 181 ms to find 21 implicit places.
[2021-05-09 07:45:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 140 rows 149 cols
[2021-05-09 07:45:52] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 07:45:52] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Starting structural reductions, iteration 1 : 149/485 places, 140/430 transitions.
Applied a total of 0 rules in 6 ms. Remains 149 /149 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2021-05-09 07:45:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 140 rows 149 cols
[2021-05-09 07:45:52] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-09 07:45:52] [INFO ] Dead Transitions using invariants and state equation in 186 ms returned []
Finished structural reductions, in 2 iterations. Remains : 149/485 places, 140/430 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : BusinessProcesses-PT-14-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s50 0) (EQ s53 1)), p0:(AND (EQ s12 0) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-08 finished in 640 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 470 transition count 415
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 470 transition count 415
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 466 transition count 411
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 466 transition count 411
Applied a total of 38 rules in 66 ms. Remains 466 /485 variables (removed 19) and now considering 411/430 (removed 19) transitions.
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:45:52] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:45:53] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:45:53] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:45:53] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
// Phase 1: matrix 411 rows 466 cols
[2021-05-09 07:45:53] [INFO ] Computed 94 place invariants in 7 ms
[2021-05-09 07:45:53] [INFO ] Dead Transitions using invariants and state equation in 262 ms returned []
Finished structural reductions, in 1 iterations. Remains : 466/485 places, 411/430 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s465 0) (NEQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 151 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-09 finished in 1258 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(F(p0))&&(X(p1) U (p0&&G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 472 transition count 417
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 472 transition count 417
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 469 transition count 414
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 469 transition count 414
Applied a total of 32 rules in 24 ms. Remains 469 /485 variables (removed 16) and now considering 414/430 (removed 16) transitions.
// Phase 1: matrix 414 rows 469 cols
[2021-05-09 07:45:54] [INFO ] Computed 94 place invariants in 5 ms
[2021-05-09 07:45:54] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 414 rows 469 cols
[2021-05-09 07:45:54] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:45:55] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
// Phase 1: matrix 414 rows 469 cols
[2021-05-09 07:45:55] [INFO ] Computed 94 place invariants in 7 ms
[2021-05-09 07:45:55] [INFO ] Dead Transitions using invariants and state equation in 258 ms returned []
Finished structural reductions, in 1 iterations. Remains : 469/485 places, 414/430 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-14-10 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s228 0) (EQ s45 1)), p1:(OR (EQ s150 0) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1376 reset in 308 ms.
Product exploration explored 100000 steps with 1319 reset in 318 ms.
Graph (complete) has 1072 edges and 469 vertex of which 468 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1375 reset in 332 ms.
Product exploration explored 100000 steps with 1369 reset in 278 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 469 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 469/469 places, 414/414 transitions.
Graph (trivial) has 213 edges and 469 vertex of which 6 / 469 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 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 464 transition count 408
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 95 Pre rules applied. Total rules applied 46 place count 464 transition count 621
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 1 with 95 rules applied. Total rules applied 141 place count 464 transition count 621
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 155 place count 450 transition count 571
Deduced a syphon composed of 126 places in 2 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 169 place count 450 transition count 571
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 256 places in 0 ms
Iterating global reduction 1 with 130 rules applied. Total rules applied 299 place count 450 transition count 571
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 332 place count 417 transition count 538
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 365 place count 417 transition count 538
Deduced a syphon composed of 223 places in 0 ms
Applied a total of 365 rules in 90 ms. Remains 417 /469 variables (removed 52) and now considering 538/414 (removed -124) transitions.
[2021-05-09 07:45:57] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 538 rows 417 cols
[2021-05-09 07:45:57] [INFO ] Computed 94 place invariants in 9 ms
[2021-05-09 07:45:57] [INFO ] Dead Transitions using invariants and state equation in 297 ms returned []
Finished structural reductions, in 1 iterations. Remains : 417/469 places, 538/414 transitions.
Product exploration explored 100000 steps with 22210 reset in 1231 ms.
Product exploration explored 100000 steps with 22324 reset in 1099 ms.
[2021-05-09 07:46:00] [INFO ] Flatten gal took : 25 ms
[2021-05-09 07:46:00] [INFO ] Flatten gal took : 20 ms
[2021-05-09 07:46:00] [INFO ] Time to serialize gal into /tmp/LTL11791120935755533235.gal : 3 ms
[2021-05-09 07:46:00] [INFO ] Time to serialize properties into /tmp/LTL8841253533709175966.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/LTL11791120935755533235.gal, -t, CGAL, -LTL, /tmp/LTL8841253533709175966.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/LTL11791120935755533235.gal -t CGAL -LTL /tmp/LTL8841253533709175966.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X(F("((p265==0)||(p49==1))")))&&((X("((p175==0)||(p52==1))"))U(("((p265==0)||(p49==1))")&&(G("((p175==0)||(p52==1))")))))))
Formula 0 simplified : !F(XF"((p265==0)||(p49==1))" & (X"((p175==0)||(p52==1))" U ("((p265==0)||(p49==1))" & G"((p175==0)||(p52==1))")))
Detected timeout of ITS tools.
[2021-05-09 07:46:15] [INFO ] Flatten gal took : 37 ms
[2021-05-09 07:46:15] [INFO ] Applying decomposition
[2021-05-09 07:46:15] [INFO ] Flatten gal took : 29 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/graph2398451001036146497.txt, -o, /tmp/graph2398451001036146497.bin, -w, /tmp/graph2398451001036146497.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/graph2398451001036146497.bin, -l, -1, -v, -w, /tmp/graph2398451001036146497.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:46:15] [INFO ] Decomposing Gal with order
[2021-05-09 07:46:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:46:15] [INFO ] Removed a total of 269 redundant transitions.
[2021-05-09 07:46:15] [INFO ] Flatten gal took : 36 ms
[2021-05-09 07:46:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2021-05-09 07:46:15] [INFO ] Time to serialize gal into /tmp/LTL13408274137007277717.gal : 6 ms
[2021-05-09 07:46:15] [INFO ] Time to serialize properties into /tmp/LTL10234346572424813147.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/LTL13408274137007277717.gal, -t, CGAL, -LTL, /tmp/LTL10234346572424813147.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/LTL13408274137007277717.gal -t CGAL -LTL /tmp/LTL10234346572424813147.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((X(F("((i11.i1.u86.p265==0)||(i13.u18.p49==1))")))&&((X("((i16.i1.u53.p175==0)||(i13.u18.p52==1))"))U(("((i11.i1.u86.p265==0)||(i13.u18.p49==1))")&&(G("((i16.i1.u53.p175==0)||(i13.u18.p52==1))")))))))
Formula 0 simplified : !F(XF"((i11.i1.u86.p265==0)||(i13.u18.p49==1))" & (X"((i16.i1.u53.p175==0)||(i13.u18.p52==1))" U ("((i11.i1.u86.p265==0)||(i13.u18.p49==1))" & G"((i16.i1.u53.p175==0)||(i13.u18.p52==1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17780049776907365521
[2021-05-09 07:46:30] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17780049776907365521
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/ltsmin17780049776907365521]
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/ltsmin17780049776907365521] 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/ltsmin17780049776907365521] 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-14-10 finished in 37774 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 471 transition count 416
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 471 transition count 416
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 467 transition count 412
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 467 transition count 412
Applied a total of 36 rules in 66 ms. Remains 467 /485 variables (removed 18) and now considering 412/430 (removed 18) transitions.
// Phase 1: matrix 412 rows 467 cols
[2021-05-09 07:46:31] [INFO ] Computed 94 place invariants in 14 ms
[2021-05-09 07:46:32] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 412 rows 467 cols
[2021-05-09 07:46:32] [INFO ] Computed 94 place invariants in 5 ms
[2021-05-09 07:46:32] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
// Phase 1: matrix 412 rows 467 cols
[2021-05-09 07:46:32] [INFO ] Computed 94 place invariants in 2 ms
[2021-05-09 07:46:32] [INFO ] Dead Transitions using invariants and state equation in 173 ms returned []
Finished structural reductions, in 1 iterations. Remains : 467/485 places, 412/430 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s392 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-12 finished in 989 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U (X(G(p0))||(F(p1)&&X(((p1||X(G(p3)))&&p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 471 transition count 416
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 471 transition count 416
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 468 transition count 413
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 468 transition count 413
Applied a total of 34 rules in 36 ms. Remains 468 /485 variables (removed 17) and now considering 413/430 (removed 17) transitions.
// Phase 1: matrix 413 rows 468 cols
[2021-05-09 07:46:32] [INFO ] Computed 94 place invariants in 4 ms
[2021-05-09 07:46:32] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 413 rows 468 cols
[2021-05-09 07:46:32] [INFO ] Computed 94 place invariants in 6 ms
[2021-05-09 07:46:33] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
// Phase 1: matrix 413 rows 468 cols
[2021-05-09 07:46:33] [INFO ] Computed 94 place invariants in 3 ms
[2021-05-09 07:46:33] [INFO ] Dead Transitions using invariants and state equation in 204 ms returned []
Finished structural reductions, in 1 iterations. Remains : 468/485 places, 413/430 transitions.
Stuttering acceptance computed with spot in 381 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), true, (OR (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-14-13 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p1) p0 p2) (AND (NOT p1) p0 p3)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(OR (AND (NOT p1) (NOT p0) p2) (AND (NOT p1) (NOT p0) p3)), acceptance={} source=3 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p0) (NOT p2) p3)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(OR (AND (NOT p1) p0 p2) (AND (NOT p1) p0 p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(OR (AND (NOT p1) (NOT p0) p2) (AND (NOT p0) (NOT p2) p3)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p1) p3), acceptance={0} source=7 dest: 7}, { cond=(AND p1 p3), acceptance={0} source=7 dest: 8}], [{ cond=(NOT p3), acceptance={} source=8 dest: 6}, { cond=p3, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(NEQ s343 1), p0:(AND (EQ s84 0) (EQ s24 1)), p2:(AND (EQ s84 0) (EQ s24 1)), p3:(AND (NEQ s24 0) (NEQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-13 finished in 1288 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-09 07:46:34] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin7202517003152709187
[2021-05-09 07:46:34] [INFO ] Computing symmetric may disable matrix : 430 transitions.
[2021-05-09 07:46:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:46:34] [INFO ] Computing symmetric may enable matrix : 430 transitions.
[2021-05-09 07:46:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:46:34] [INFO ] Flatten gal took : 34 ms
[2021-05-09 07:46:34] [INFO ] Computing Do-Not-Accords matrix : 430 transitions.
[2021-05-09 07:46:34] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:46:34] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7202517003152709187
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/ltsmin7202517003152709187]
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/graph6759686662285935420.txt, -o, /tmp/graph6759686662285935420.bin, -w, /tmp/graph6759686662285935420.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/graph6759686662285935420.bin, -l, -1, -v, -w, /tmp/graph6759686662285935420.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:46:34] [INFO ] Decomposing Gal with order
[2021-05-09 07:46:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:46:34] [INFO ] Removed a total of 278 redundant transitions.
[2021-05-09 07:46:34] [INFO ] Flatten gal took : 58 ms
[2021-05-09 07:46:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-09 07:46:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality17589413304282889367.gal : 12 ms
[2021-05-09 07:46:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality1498158713764217776.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/LTLCardinality17589413304282889367.gal, -t, CGAL, -LTL, /tmp/LTLCardinality1498158713764217776.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/LTLCardinality17589413304282889367.gal -t CGAL -LTL /tmp/LTLCardinality1498158713764217776.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((G(("((i15.i1.u61.p189==0)||(i15.i2.u60.p184==1))")||(X("((i15.i1.u61.p189==0)||(i15.i2.u60.p184==1))")))))
Formula 0 simplified : !G("((i15.i1.u61.p189==0)||(i15.i2.u60.p184==1))" | X"((i15.i1.u61.p189==0)||(i15.i2.u60.p184==1))")
Compilation finished in 2050 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7202517003152709187]
Link finished in 80 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((LTLAPp1==true))||(LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7202517003152709187]
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t286, t366, t408, t422, t533, t534, t544, t551, t556, t557, i0.i0.u130.t157, i0.i0.u131.t153, i0.i1.t290, i0.i1.u72.t301, i0.i1.u76.t293, i1.i0.u78.t289, i1.i0.u82.t276, i1.i1.u80.t279, i1.i2.t150, i1.i2.u133.t151, i2.u48.t343, i2.u50.t339, i3.u36.t365, i3.u38.t361, i4.t402, i4.i0.u23.t401, i4.i1.u21.t405, i4.i1.u22.t406, i4.i2.u100.t257, i5.i1.u118.t201, i5.i1.u119.t197, i5.i1.u120.t193, i6.i0.u25.t395, i6.i1.t389, i7.t370, i7.i1.t379, i7.i2.u115.t213, i7.i2.u116.t209, i7.i2.u117.t205, i8.u44.t351, i8.u46.t347, i9.i0.u40.t357, i9.i1.u128.t165, i9.i1.u129.t161, i9.i2.u123.t185, i9.i2.u124.t181, i9.i3.t190, i9.i3.u121.t191, i10.i0.t415, i10.i0.u19.t413, i10.i1.u108.t237, i10.i2.u105.t245, i10.i3.t242, i10.i3.u107.t243, i11.i0.u12.t430, i11.i0.u13.t431, i11.i1.u96.t272, i11.i1.u97.t269, i12.t416, i12.i0.u14.t427, i12.i1.u16.t420, i12.i1.u17.t419, i12.i2.t254, i12.i2.u102.t255, i13.i0.u52.t335, i13.i0.u54.t331, i13.i1.t250, i13.i1.u104.t251, i14.i0.u74.t297, i14.i1.u112.t225, i14.i1.u113.t221, i14.i1.u114.t217, i14.i2.u109.t233, i14.i3.t230, i14.i3.u110.t231, i15.t3, i15.t2, i15.i0.u126.t173, i15.i1.u125.t177, i15.i2.t4, i15.i2.t5, i15.i2.u56.t304, i15.i2.u56.t306, i15.i2.u56.t308, i15.i2.u56.t327, i15.i2.u127.t169, i16.t86, i16.t63, i16.t6, i16.u143.t89, i16.u143.t99, i16.u143.t143, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/298/96/430
Computing Next relation with stutter on 1206 deadlock states
99 unique states visited
5 strongly connected components in search stack
101 transitions explored
97 items max in DFS search stack
4860 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,48.675,841624,1,0,1.66177e+06,1010,7893,3.11323e+06,346,3991,2528087
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-14-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((X(F("((i5.i1.u88.p265==0)||(i10.i0.u19.p49==1))")))&&((X("((i15.i2.u56.p175==0)||(i10.i0.u19.p52==1))"))U(("((i5.i1.u88.p265==0)||(i10.i0.u19.p49==1))")&&(G("((i15.i2.u56.p175==0)||(i10.i0.u19.p52==1))")))))))
Formula 1 simplified : !F(XF"((i5.i1.u88.p265==0)||(i10.i0.u19.p49==1))" & (X"((i15.i2.u56.p175==0)||(i10.i0.u19.p52==1))" U ("((i5.i1.u88.p265==0)||(i10.i0.u19.p49==1))" & G"((i15.i2.u56.p175==0)||(i10.i0.u19.p52==1))")))
Computing Next relation with stutter on 1206 deadlock states
84 unique states visited
83 strongly connected components in search stack
84 transitions explored
83 items max in DFS search stack
2735 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,76.0305,1227956,1,0,2.49473e+06,1040,8007,4.40305e+06,348,4182,3421459
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-14-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620546588334

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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