Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127700349.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 NoC3x3-PT-8B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127700349
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 104K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 07:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 07:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 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 3.0M 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 NoC3x3-PT-8B-00
FORMULA_NAME NoC3x3-PT-8B-01
FORMULA_NAME NoC3x3-PT-8B-02
FORMULA_NAME NoC3x3-PT-8B-03
FORMULA_NAME NoC3x3-PT-8B-04
FORMULA_NAME NoC3x3-PT-8B-05
FORMULA_NAME NoC3x3-PT-8B-06
FORMULA_NAME NoC3x3-PT-8B-07
FORMULA_NAME NoC3x3-PT-8B-08
FORMULA_NAME NoC3x3-PT-8B-09
FORMULA_NAME NoC3x3-PT-8B-10
FORMULA_NAME NoC3x3-PT-8B-11
FORMULA_NAME NoC3x3-PT-8B-12
FORMULA_NAME NoC3x3-PT-8B-13
FORMULA_NAME NoC3x3-PT-8B-14
FORMULA_NAME NoC3x3-PT-8B-15

=== Now, execution of the tool begins

BK_START 1620976185577

Running Version 0
[2021-05-14 07:09:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 07:09:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 07:09:50] [INFO ] Load time of PNML (sax parser for PT used): 360 ms
[2021-05-14 07:09:50] [INFO ] Transformed 9140 places.
[2021-05-14 07:09:50] [INFO ] Transformed 14577 transitions.
[2021-05-14 07:09:50] [INFO ] Found NUPN structural information;
[2021-05-14 07:09:50] [INFO ] Parsed PT model containing 9140 places and 14577 transitions in 504 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 07:09:50] [INFO ] Initial state test concluded for 2 properties.
FORMULA NoC3x3-PT-8B-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 9140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 9107 transition count 14577
Discarding 5502 places :
Symmetric choice reduction at 1 with 5502 rule applications. Total rules 5535 place count 3605 transition count 9075
Iterating global reduction 1 with 5502 rules applied. Total rules applied 11037 place count 3605 transition count 9075
Ensure Unique test removed 3050 transitions
Reduce isomorphic transitions removed 3050 transitions.
Iterating post reduction 1 with 3050 rules applied. Total rules applied 14087 place count 3605 transition count 6025
Discarding 1998 places :
Symmetric choice reduction at 2 with 1998 rule applications. Total rules 16085 place count 1607 transition count 4027
Iterating global reduction 2 with 1998 rules applied. Total rules applied 18083 place count 1607 transition count 4027
Ensure Unique test removed 1869 transitions
Reduce isomorphic transitions removed 1869 transitions.
Iterating post reduction 2 with 1869 rules applied. Total rules applied 19952 place count 1607 transition count 2158
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 20018 place count 1541 transition count 2092
Iterating global reduction 3 with 66 rules applied. Total rules applied 20084 place count 1541 transition count 2092
Applied a total of 20084 rules in 1740 ms. Remains 1541 /9140 variables (removed 7599) and now considering 2092/14577 (removed 12485) transitions.
// Phase 1: matrix 2092 rows 1541 cols
[2021-05-14 07:09:52] [INFO ] Computed 66 place invariants in 30 ms
[2021-05-14 07:09:53] [INFO ] Implicit Places using invariants in 602 ms returned []
// Phase 1: matrix 2092 rows 1541 cols
[2021-05-14 07:09:53] [INFO ] Computed 66 place invariants in 12 ms
[2021-05-14 07:09:54] [INFO ] Implicit Places using invariants and state equation in 1196 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
// Phase 1: matrix 2092 rows 1541 cols
[2021-05-14 07:09:54] [INFO ] Computed 66 place invariants in 20 ms
[2021-05-14 07:09:55] [INFO ] Dead Transitions using invariants and state equation in 928 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1541/9140 places, 2092/14577 transitions.
[2021-05-14 07:09:55] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 07:09:55] [INFO ] Flatten gal took : 157 ms
FORMULA NoC3x3-PT-8B-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 07:09:55] [INFO ] Flatten gal took : 98 ms
[2021-05-14 07:09:56] [INFO ] Input system was already deterministic with 2092 transitions.
Incomplete random walk after 100000 steps, including 42 resets, run finished after 498 ms. (steps per millisecond=200 ) properties (out of 32) seen :30
Running SMT prover for 2 properties.
// Phase 1: matrix 2092 rows 1541 cols
[2021-05-14 07:09:56] [INFO ] Computed 66 place invariants in 15 ms
[2021-05-14 07:09:56] [INFO ] [Real]Absence check using 66 positive place invariants in 33 ms returned sat
[2021-05-14 07:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:09:57] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2021-05-14 07:09:57] [INFO ] Deduced a trap composed of 61 places in 330 ms of which 21 ms to minimize.
[2021-05-14 07:09:58] [INFO ] Deduced a trap composed of 84 places in 337 ms of which 2 ms to minimize.
[2021-05-14 07:09:58] [INFO ] Deduced a trap composed of 98 places in 252 ms of which 1 ms to minimize.
[2021-05-14 07:09:58] [INFO ] Deduced a trap composed of 77 places in 224 ms of which 1 ms to minimize.
[2021-05-14 07:09:59] [INFO ] Deduced a trap composed of 113 places in 198 ms of which 1 ms to minimize.
[2021-05-14 07:09:59] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 1 ms to minimize.
[2021-05-14 07:09:59] [INFO ] Deduced a trap composed of 112 places in 182 ms of which 1 ms to minimize.
[2021-05-14 07:09:59] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 0 ms to minimize.
[2021-05-14 07:10:00] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 0 ms to minimize.
[2021-05-14 07:10:00] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 0 ms to minimize.
[2021-05-14 07:10:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2799 ms
[2021-05-14 07:10:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:10:01] [INFO ] [Nat]Absence check using 66 positive place invariants in 35 ms returned sat
[2021-05-14 07:10:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:10:02] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2021-05-14 07:10:02] [INFO ] Deduced a trap composed of 61 places in 257 ms of which 0 ms to minimize.
[2021-05-14 07:10:02] [INFO ] Deduced a trap composed of 84 places in 258 ms of which 1 ms to minimize.
[2021-05-14 07:10:03] [INFO ] Deduced a trap composed of 98 places in 242 ms of which 1 ms to minimize.
[2021-05-14 07:10:03] [INFO ] Deduced a trap composed of 77 places in 227 ms of which 0 ms to minimize.
[2021-05-14 07:10:03] [INFO ] Deduced a trap composed of 113 places in 173 ms of which 1 ms to minimize.
[2021-05-14 07:10:03] [INFO ] Deduced a trap composed of 162 places in 180 ms of which 0 ms to minimize.
[2021-05-14 07:10:04] [INFO ] Deduced a trap composed of 112 places in 168 ms of which 1 ms to minimize.
[2021-05-14 07:10:04] [INFO ] Deduced a trap composed of 132 places in 166 ms of which 0 ms to minimize.
[2021-05-14 07:10:04] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 0 ms to minimize.
[2021-05-14 07:10:04] [INFO ] Deduced a trap composed of 66 places in 156 ms of which 0 ms to minimize.
[2021-05-14 07:10:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2625 ms
[2021-05-14 07:10:04] [INFO ] Computed and/alt/rep : 2051/3626/2051 causal constraints (skipped 40 transitions) in 115 ms.
[2021-05-14 07:10:21] [INFO ] Deduced a trap composed of 11 places in 645 ms of which 2 ms to minimize.
[2021-05-14 07:10:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-14 07:10:21] [INFO ] [Real]Absence check using 66 positive place invariants in 34 ms returned sat
[2021-05-14 07:10:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:10:21] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2021-05-14 07:10:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:10:22] [INFO ] [Nat]Absence check using 66 positive place invariants in 35 ms returned sat
[2021-05-14 07:10:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:10:22] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2021-05-14 07:10:23] [INFO ] Deduced a trap composed of 51 places in 352 ms of which 3 ms to minimize.
[2021-05-14 07:10:23] [INFO ] Deduced a trap composed of 90 places in 339 ms of which 1 ms to minimize.
[2021-05-14 07:10:23] [INFO ] Deduced a trap composed of 60 places in 296 ms of which 0 ms to minimize.
[2021-05-14 07:10:24] [INFO ] Deduced a trap composed of 74 places in 292 ms of which 1 ms to minimize.
[2021-05-14 07:10:24] [INFO ] Deduced a trap composed of 82 places in 292 ms of which 1 ms to minimize.
[2021-05-14 07:10:24] [INFO ] Deduced a trap composed of 84 places in 338 ms of which 0 ms to minimize.
[2021-05-14 07:10:25] [INFO ] Deduced a trap composed of 98 places in 306 ms of which 0 ms to minimize.
[2021-05-14 07:10:25] [INFO ] Deduced a trap composed of 66 places in 306 ms of which 1 ms to minimize.
[2021-05-14 07:10:26] [INFO ] Deduced a trap composed of 169 places in 265 ms of which 0 ms to minimize.
[2021-05-14 07:10:26] [INFO ] Deduced a trap composed of 174 places in 289 ms of which 1 ms to minimize.
[2021-05-14 07:10:26] [INFO ] Deduced a trap composed of 144 places in 271 ms of which 0 ms to minimize.
[2021-05-14 07:10:27] [INFO ] Deduced a trap composed of 83 places in 274 ms of which 1 ms to minimize.
[2021-05-14 07:10:27] [INFO ] Deduced a trap composed of 81 places in 272 ms of which 1 ms to minimize.
[2021-05-14 07:10:27] [INFO ] Deduced a trap composed of 165 places in 310 ms of which 5 ms to minimize.
[2021-05-14 07:10:28] [INFO ] Deduced a trap composed of 107 places in 222 ms of which 0 ms to minimize.
[2021-05-14 07:10:28] [INFO ] Deduced a trap composed of 97 places in 224 ms of which 0 ms to minimize.
[2021-05-14 07:10:28] [INFO ] Deduced a trap composed of 101 places in 202 ms of which 0 ms to minimize.
[2021-05-14 07:10:28] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5944 ms
[2021-05-14 07:10:28] [INFO ] Computed and/alt/rep : 2051/3626/2051 causal constraints (skipped 40 transitions) in 136 ms.
[2021-05-14 07:10:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1541/1541 places, 2092/2092 transitions.
Graph (trivial) has 1348 edges and 1541 vertex of which 474 / 1541 are part of one of the 32 SCC in 14 ms
Free SCC test removed 442 places
Ensure Unique test removed 474 transitions
Reduce isomorphic transitions removed 474 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 213 place count 1098 transition count 1405
Reduce places removed 212 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 241 rules applied. Total rules applied 454 place count 886 transition count 1376
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 22 rules applied. Total rules applied 476 place count 875 transition count 1365
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 482 place count 870 transition count 1364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 483 place count 869 transition count 1364
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 97 Pre rules applied. Total rules applied 483 place count 869 transition count 1267
Deduced a syphon composed of 97 places in 3 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 5 with 194 rules applied. Total rules applied 677 place count 772 transition count 1267
Discarding 58 places :
Symmetric choice reduction at 5 with 58 rule applications. Total rules 735 place count 714 transition count 1117
Iterating global reduction 5 with 58 rules applied. Total rules applied 793 place count 714 transition count 1117
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 5 with 32 rules applied. Total rules applied 825 place count 714 transition count 1085
Performed 226 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 226 places in 1 ms
Reduce places removed 226 places and 0 transitions.
Iterating global reduction 6 with 452 rules applied. Total rules applied 1277 place count 488 transition count 835
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 6 with 70 rules applied. Total rules applied 1347 place count 488 transition count 765
Discarding 38 places :
Symmetric choice reduction at 7 with 38 rule applications. Total rules 1385 place count 450 transition count 727
Iterating global reduction 7 with 38 rules applied. Total rules applied 1423 place count 450 transition count 727
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 7 with 38 rules applied. Total rules applied 1461 place count 450 transition count 689
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1463 place count 450 transition count 687
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1464 place count 450 transition count 687
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1465 place count 449 transition count 686
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1466 place count 448 transition count 685
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 8 with 33 rules applied. Total rules applied 1499 place count 439 transition count 661
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 9 with 47 rules applied. Total rules applied 1546 place count 415 transition count 638
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1547 place count 415 transition count 637
Applied a total of 1547 rules in 366 ms. Remains 415 /1541 variables (removed 1126) and now considering 637/2092 (removed 1455) transitions.
[2021-05-14 07:10:46] [INFO ] Flow matrix only has 606 transitions (discarded 31 similar events)
// Phase 1: matrix 606 rows 415 cols
[2021-05-14 07:10:46] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 07:10:46] [INFO ] Implicit Places using invariants in 191 ms returned []
[2021-05-14 07:10:46] [INFO ] Flow matrix only has 606 transitions (discarded 31 similar events)
// Phase 1: matrix 606 rows 415 cols
[2021-05-14 07:10:46] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 07:10:47] [INFO ] State equation strengthened by 29 read => feed constraints.
[2021-05-14 07:10:47] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
[2021-05-14 07:10:47] [INFO ] Redundant transitions in 37 ms returned []
[2021-05-14 07:10:47] [INFO ] Flow matrix only has 606 transitions (discarded 31 similar events)
// Phase 1: matrix 606 rows 415 cols
[2021-05-14 07:10:47] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 07:10:47] [INFO ] Dead Transitions using invariants and state equation in 274 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/1541 places, 637/2092 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s399 1), p1:(EQ s277 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 2 ms.
FORMULA NoC3x3-PT-8B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-01 finished in 5973 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 1541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1541/1541 places, 2092/2092 transitions.
Graph (trivial) has 1350 edges and 1541 vertex of which 485 / 1541 are part of one of the 33 SCC in 2 ms
Free SCC test removed 452 places
Ensure Unique test removed 484 transitions
Reduce isomorphic transitions removed 484 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 209 place count 1088 transition count 1399
Reduce places removed 208 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 237 rules applied. Total rules applied 446 place count 880 transition count 1370
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 22 rules applied. Total rules applied 468 place count 869 transition count 1359
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 473 place count 864 transition count 1359
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 95 Pre rules applied. Total rules applied 473 place count 864 transition count 1264
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 663 place count 769 transition count 1264
Discarding 58 places :
Symmetric choice reduction at 4 with 58 rule applications. Total rules 721 place count 711 transition count 1114
Iterating global reduction 4 with 58 rules applied. Total rules applied 779 place count 711 transition count 1114
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 811 place count 711 transition count 1082
Performed 225 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 225 places in 0 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 5 with 450 rules applied. Total rules applied 1261 place count 486 transition count 833
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 5 with 72 rules applied. Total rules applied 1333 place count 486 transition count 761
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 1371 place count 448 transition count 723
Iterating global reduction 6 with 38 rules applied. Total rules applied 1409 place count 448 transition count 723
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 6 with 38 rules applied. Total rules applied 1447 place count 448 transition count 685
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1448 place count 448 transition count 684
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1449 place count 448 transition count 684
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1450 place count 447 transition count 683
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1451 place count 446 transition count 682
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 7 with 33 rules applied. Total rules applied 1484 place count 437 transition count 658
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 48 rules applied. Total rules applied 1532 place count 413 transition count 634
Applied a total of 1532 rules in 209 ms. Remains 413 /1541 variables (removed 1128) and now considering 634/2092 (removed 1458) transitions.
[2021-05-14 07:10:48] [INFO ] Flow matrix only has 602 transitions (discarded 32 similar events)
// Phase 1: matrix 602 rows 413 cols
[2021-05-14 07:10:48] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 07:10:48] [INFO ] Implicit Places using invariants in 203 ms returned []
[2021-05-14 07:10:48] [INFO ] Flow matrix only has 602 transitions (discarded 32 similar events)
// Phase 1: matrix 602 rows 413 cols
[2021-05-14 07:10:48] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 07:10:48] [INFO ] State equation strengthened by 29 read => feed constraints.
[2021-05-14 07:10:49] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2021-05-14 07:10:49] [INFO ] Redundant transitions in 15 ms returned []
[2021-05-14 07:10:49] [INFO ] Flow matrix only has 602 transitions (discarded 32 similar events)
// Phase 1: matrix 602 rows 413 cols
[2021-05-14 07:10:49] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 07:10:49] [INFO ] Dead Transitions using invariants and state equation in 266 ms returned []
Finished structural reductions, in 1 iterations. Remains : 413/1541 places, 634/2092 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-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:(NEQ s159 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 430 steps with 2 reset in 7 ms.
FORMULA NoC3x3-PT-8B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-03 finished in 1392 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1541/1541 places, 2092/2092 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1521 transition count 2072
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1521 transition count 2072
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 60 place count 1521 transition count 2052
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 69 place count 1512 transition count 2043
Iterating global reduction 1 with 9 rules applied. Total rules applied 78 place count 1512 transition count 2043
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 87 place count 1512 transition count 2034
Applied a total of 87 rules in 119 ms. Remains 1512 /1541 variables (removed 29) and now considering 2034/2092 (removed 58) transitions.
// Phase 1: matrix 2034 rows 1512 cols
[2021-05-14 07:10:49] [INFO ] Computed 66 place invariants in 6 ms
[2021-05-14 07:10:49] [INFO ] Implicit Places using invariants in 390 ms returned []
// Phase 1: matrix 2034 rows 1512 cols
[2021-05-14 07:10:49] [INFO ] Computed 66 place invariants in 6 ms
[2021-05-14 07:10:51] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1611 ms to find 0 implicit places.
// Phase 1: matrix 2034 rows 1512 cols
[2021-05-14 07:10:51] [INFO ] Computed 66 place invariants in 6 ms
[2021-05-14 07:10:52] [INFO ] Dead Transitions using invariants and state equation in 1005 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1512/1541 places, 2034/2092 transitions.
Stuttering acceptance computed with spot in 318 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8B-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1170 1), p1:(EQ s332 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 4606 steps with 2 reset in 25 ms.
FORMULA NoC3x3-PT-8B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-04 finished in 3099 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((X(p0)||(p1&&F(p2))) U (G((X(p0)||(p1&&F(p2))))||(!p2&&(X(p0)||(p1&&F(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1541/1541 places, 2092/2092 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1520 transition count 2071
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1520 transition count 2071
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 63 place count 1520 transition count 2050
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 72 place count 1511 transition count 2041
Iterating global reduction 1 with 9 rules applied. Total rules applied 81 place count 1511 transition count 2041
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 90 place count 1511 transition count 2032
Applied a total of 90 rules in 113 ms. Remains 1511 /1541 variables (removed 30) and now considering 2032/2092 (removed 60) transitions.
// Phase 1: matrix 2032 rows 1511 cols
[2021-05-14 07:10:52] [INFO ] Computed 66 place invariants in 6 ms
[2021-05-14 07:10:52] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 2032 rows 1511 cols
[2021-05-14 07:10:52] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:10:54] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
// Phase 1: matrix 2032 rows 1511 cols
[2021-05-14 07:10:54] [INFO ] Computed 66 place invariants in 16 ms
[2021-05-14 07:10:54] [INFO ] Dead Transitions using invariants and state equation in 879 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1511/1541 places, 2032/2092 transitions.
Stuttering acceptance computed with spot in 6990 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : NoC3x3-PT-8B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s1094 1) (EQ s1193 1)), p1:(NEQ s604 0), p0:(EQ s371 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 232 reset in 411 ms.
Product exploration explored 100000 steps with 229 reset in 477 ms.
Graph (complete) has 3172 edges and 1511 vertex of which 1510 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Knowledge obtained : [(NOT p2), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 228 reset in 333 ms.
Product exploration explored 100000 steps with 228 reset in 350 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 4 out of 1511 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1511/1511 places, 2032/2032 transitions.
Graph (trivial) has 1286 edges and 1511 vertex of which 467 / 1511 are part of one of the 33 SCC in 1 ms
Free SCC test removed 434 places
Ensure Unique test removed 458 transitions
Reduce isomorphic transitions removed 458 transitions.
Performed 207 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 207 rules applied. Total rules applied 208 place count 1077 transition count 1574
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 95 Pre rules applied. Total rules applied 208 place count 1077 transition count 1851
Deduced a syphon composed of 302 places in 4 ms
Iterating global reduction 1 with 95 rules applied. Total rules applied 303 place count 1077 transition count 1851
Discarding 152 places :
Symmetric choice reduction at 1 with 152 rule applications. Total rules 455 place count 925 transition count 1578
Deduced a syphon composed of 203 places in 4 ms
Iterating global reduction 1 with 152 rules applied. Total rules applied 607 place count 925 transition count 1578
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 634 place count 925 transition count 1551
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 660 place count 899 transition count 1431
Deduced a syphon composed of 177 places in 3 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 686 place count 899 transition count 1431
Performed 203 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 380 places in 0 ms
Iterating global reduction 2 with 203 rules applied. Total rules applied 889 place count 899 transition count 1383
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 962 place count 899 transition count 1310
Discarding 145 places :
Symmetric choice reduction at 3 with 145 rule applications. Total rules 1107 place count 754 transition count 1127
Deduced a syphon composed of 273 places in 0 ms
Iterating global reduction 3 with 145 rules applied. Total rules applied 1252 place count 754 transition count 1127
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 1290 place count 754 transition count 1089
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -216
Deduced a syphon composed of 298 places in 0 ms
Iterating global reduction 4 with 25 rules applied. Total rules applied 1315 place count 754 transition count 1305
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 1340 place count 754 transition count 1280
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1365 place count 729 transition count 1147
Deduced a syphon composed of 273 places in 0 ms
Iterating global reduction 5 with 25 rules applied. Total rules applied 1390 place count 729 transition count 1147
Deduced a syphon composed of 273 places in 1 ms
Applied a total of 1390 rules in 388 ms. Remains 729 /1511 variables (removed 782) and now considering 1147/2032 (removed 885) transitions.
[2021-05-14 07:11:04] [INFO ] Redundant transitions in 15 ms returned []
[2021-05-14 07:11:04] [INFO ] Flow matrix only has 1115 transitions (discarded 32 similar events)
// Phase 1: matrix 1115 rows 729 cols
[2021-05-14 07:11:04] [INFO ] Computed 66 place invariants in 8 ms
[2021-05-14 07:11:04] [INFO ] Dead Transitions using invariants and state equation in 519 ms returned []
Finished structural reductions, in 1 iterations. Remains : 729/1511 places, 1147/2032 transitions.
Product exploration explored 100000 steps with 232 reset in 342 ms.
Stuttering criterion allowed to conclude after 27824 steps with 63 reset in 109 ms.
FORMULA NoC3x3-PT-8B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-05 finished in 12977 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(p0))||G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1541/1541 places, 2092/2092 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1520 transition count 2071
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1520 transition count 2071
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 63 place count 1520 transition count 2050
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 72 place count 1511 transition count 2041
Iterating global reduction 1 with 9 rules applied. Total rules applied 81 place count 1511 transition count 2041
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 90 place count 1511 transition count 2032
Applied a total of 90 rules in 144 ms. Remains 1511 /1541 variables (removed 30) and now considering 2032/2092 (removed 60) transitions.
// Phase 1: matrix 2032 rows 1511 cols
[2021-05-14 07:11:05] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 07:11:05] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 2032 rows 1511 cols
[2021-05-14 07:11:05] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:07] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1557 ms to find 0 implicit places.
// Phase 1: matrix 2032 rows 1511 cols
[2021-05-14 07:11:07] [INFO ] Computed 66 place invariants in 6 ms
[2021-05-14 07:11:08] [INFO ] Dead Transitions using invariants and state equation in 910 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1511/1541 places, 2032/2092 transitions.
Stuttering acceptance computed with spot in 7617 ms :[(NOT p0), false, false, (NOT p0), true, false, p0]
Running random walk in product with property : NoC3x3-PT-8B-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 3}], [{ cond=p0, acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(EQ s462 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24267 steps with 9 reset in 96 ms.
FORMULA NoC3x3-PT-8B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-06 finished in 10349 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))&&F(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 1541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1541/1541 places, 2092/2092 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1519 transition count 2070
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1519 transition count 2070
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 66 place count 1519 transition count 2048
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 75 place count 1510 transition count 2039
Iterating global reduction 1 with 9 rules applied. Total rules applied 84 place count 1510 transition count 2039
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 93 place count 1510 transition count 2030
Applied a total of 93 rules in 133 ms. Remains 1510 /1541 variables (removed 31) and now considering 2030/2092 (removed 62) transitions.
// Phase 1: matrix 2030 rows 1510 cols
[2021-05-14 07:11:15] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:16] [INFO ] Implicit Places using invariants in 428 ms returned []
// Phase 1: matrix 2030 rows 1510 cols
[2021-05-14 07:11:16] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:17] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
// Phase 1: matrix 2030 rows 1510 cols
[2021-05-14 07:11:17] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 07:11:18] [INFO ] Dead Transitions using invariants and state equation in 920 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1510/1541 places, 2030/2092 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, true, p0, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s567 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1969 steps with 0 reset in 11 ms.
FORMULA NoC3x3-PT-8B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-07 finished in 2768 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0)) U (G(p2)||p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1541/1541 places, 2092/2092 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1521 transition count 2072
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1521 transition count 2072
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 60 place count 1521 transition count 2052
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 69 place count 1512 transition count 2043
Iterating global reduction 1 with 9 rules applied. Total rules applied 78 place count 1512 transition count 2043
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 87 place count 1512 transition count 2034
Applied a total of 87 rules in 135 ms. Remains 1512 /1541 variables (removed 29) and now considering 2034/2092 (removed 58) transitions.
// Phase 1: matrix 2034 rows 1512 cols
[2021-05-14 07:11:18] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:19] [INFO ] Implicit Places using invariants in 420 ms returned []
// Phase 1: matrix 2034 rows 1512 cols
[2021-05-14 07:11:19] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:20] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1655 ms to find 0 implicit places.
// Phase 1: matrix 2034 rows 1512 cols
[2021-05-14 07:11:20] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:21] [INFO ] Dead Transitions using invariants and state equation in 923 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1512/1541 places, 2034/2092 transitions.
Stuttering acceptance computed with spot in 7393 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : NoC3x3-PT-8B-08 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s333 1) (EQ s1041 1)), p2:(EQ s116 1), p0:(EQ s333 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-08 finished in 10142 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 1541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1541/1541 places, 2092/2092 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1520 transition count 2071
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1520 transition count 2071
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 63 place count 1520 transition count 2050
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 71 place count 1512 transition count 2042
Iterating global reduction 1 with 8 rules applied. Total rules applied 79 place count 1512 transition count 2042
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 87 place count 1512 transition count 2034
Applied a total of 87 rules in 138 ms. Remains 1512 /1541 variables (removed 29) and now considering 2034/2092 (removed 58) transitions.
// Phase 1: matrix 2034 rows 1512 cols
[2021-05-14 07:11:28] [INFO ] Computed 66 place invariants in 6 ms
[2021-05-14 07:11:29] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 2034 rows 1512 cols
[2021-05-14 07:11:29] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:30] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 1600 ms to find 0 implicit places.
// Phase 1: matrix 2034 rows 1512 cols
[2021-05-14 07:11:30] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:31] [INFO ] Dead Transitions using invariants and state equation in 897 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1512/1541 places, 2034/2092 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s332 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 4557 steps with 1 reset in 18 ms.
FORMULA NoC3x3-PT-8B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-09 finished in 2716 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((G(p1)&&p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1541/1541 places, 2092/2092 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1520 transition count 2071
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1520 transition count 2071
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 63 place count 1520 transition count 2050
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 71 place count 1512 transition count 2042
Iterating global reduction 1 with 8 rules applied. Total rules applied 79 place count 1512 transition count 2042
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 87 place count 1512 transition count 2034
Applied a total of 87 rules in 134 ms. Remains 1512 /1541 variables (removed 29) and now considering 2034/2092 (removed 58) transitions.
// Phase 1: matrix 2034 rows 1512 cols
[2021-05-14 07:11:31] [INFO ] Computed 66 place invariants in 6 ms
[2021-05-14 07:11:32] [INFO ] Implicit Places using invariants in 431 ms returned []
// Phase 1: matrix 2034 rows 1512 cols
[2021-05-14 07:11:32] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 07:11:33] [INFO ] Implicit Places using invariants and state equation in 1223 ms returned []
Implicit Place search using SMT with State Equation took 1654 ms to find 0 implicit places.
// Phase 1: matrix 2034 rows 1512 cols
[2021-05-14 07:11:33] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:34] [INFO ] Dead Transitions using invariants and state equation in 968 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1512/1541 places, 2034/2092 transitions.
Stuttering acceptance computed with spot in 808 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1272 1) (EQ s1171 1)), p1:(EQ s116 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 2487 steps with 0 reset in 11 ms.
FORMULA NoC3x3-PT-8B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-10 finished in 3597 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||(p1 U (p2||G(p1)))) U X(p3)))], workingDir=/home/mcc/execution]
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1541/1541 places, 2092/2092 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1522 transition count 2073
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1522 transition count 2073
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 57 place count 1522 transition count 2054
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 65 place count 1514 transition count 2046
Iterating global reduction 1 with 8 rules applied. Total rules applied 73 place count 1514 transition count 2046
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 81 place count 1514 transition count 2038
Applied a total of 81 rules in 134 ms. Remains 1514 /1541 variables (removed 27) and now considering 2038/2092 (removed 54) transitions.
// Phase 1: matrix 2038 rows 1514 cols
[2021-05-14 07:11:35] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:35] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 2038 rows 1514 cols
[2021-05-14 07:11:35] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 07:11:36] [INFO ] Implicit Places using invariants and state equation in 1218 ms returned []
Implicit Place search using SMT with State Equation took 1602 ms to find 0 implicit places.
// Phase 1: matrix 2038 rows 1514 cols
[2021-05-14 07:11:36] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:37] [INFO ] Dead Transitions using invariants and state equation in 909 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1514/1541 places, 2038/2092 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p1) (NOT p3)), true, (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8B-11 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p0 p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s258 0), p2:(AND (NEQ s1434 1) (NEQ s463 1)), p1:(NEQ s463 1), p3:(EQ s1434 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2645 steps with 0 reset in 12 ms.
FORMULA NoC3x3-PT-8B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-11 finished in 2842 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||G(p1)||X((p2||X((p3 U p4))))) U (p5 U !p1)))], workingDir=/home/mcc/execution]
Support contains 6 out of 1541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1541/1541 places, 2092/2092 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1521 transition count 2072
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1521 transition count 2072
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 60 place count 1521 transition count 2052
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 69 place count 1512 transition count 2043
Iterating global reduction 1 with 9 rules applied. Total rules applied 78 place count 1512 transition count 2043
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 87 place count 1512 transition count 2034
Applied a total of 87 rules in 134 ms. Remains 1512 /1541 variables (removed 29) and now considering 2034/2092 (removed 58) transitions.
// Phase 1: matrix 2034 rows 1512 cols
[2021-05-14 07:11:38] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:38] [INFO ] Implicit Places using invariants in 432 ms returned []
// Phase 1: matrix 2034 rows 1512 cols
[2021-05-14 07:11:38] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:39] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
// Phase 1: matrix 2034 rows 1512 cols
[2021-05-14 07:11:39] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:40] [INFO ] Dead Transitions using invariants and state equation in 972 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1512/1541 places, 2034/2092 transitions.
Stuttering acceptance computed with spot in 3945 ms :[p1, false, (AND (NOT p1) (NOT p2) (NOT p4)), false, (AND (NOT p1) (NOT p4)), (NOT p4), true, (NOT p1), false]
Running random walk in product with property : NoC3x3-PT-8B-12 automaton TGBA [mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 p5 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p5) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=(AND p1 p5 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p5) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p5 (NOT p4) p3), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p5) (NOT p4) p3), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p5) (NOT p4) (NOT p3)), acceptance={} source=3 dest: 7}, { cond=(AND p1 p5 (NOT p4) (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(AND p1 (NOT p4) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p4) p3), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p4) p3), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND p1 (NOT p5)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p5), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(NEQ s1506 1), p5:(EQ s369 1), p0:(AND (EQ s1480 1) (EQ s1495 1)), p2:(EQ s1041 1), p4:(AND (EQ s871 1) (EQ s1041 1)), p3:(EQ s871 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 58 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-12 finished in 6755 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (p1||(p2&&X((p2||G(p3))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1541/1541 places, 2092/2092 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1522 transition count 2073
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1522 transition count 2073
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 57 place count 1522 transition count 2054
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 65 place count 1514 transition count 2046
Iterating global reduction 1 with 8 rules applied. Total rules applied 73 place count 1514 transition count 2046
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 81 place count 1514 transition count 2038
Applied a total of 81 rules in 139 ms. Remains 1514 /1541 variables (removed 27) and now considering 2038/2092 (removed 54) transitions.
// Phase 1: matrix 2038 rows 1514 cols
[2021-05-14 07:11:44] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:45] [INFO ] Implicit Places using invariants in 416 ms returned []
// Phase 1: matrix 2038 rows 1514 cols
[2021-05-14 07:11:45] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:46] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned []
Implicit Place search using SMT with State Equation took 1643 ms to find 0 implicit places.
// Phase 1: matrix 2038 rows 1514 cols
[2021-05-14 07:11:46] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:11:47] [INFO ] Dead Transitions using invariants and state equation in 984 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1514/1541 places, 2038/2092 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-8B-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) p3), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0 p3), acceptance={} source=4 dest: 6}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p2 p0 p3), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) p3), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s1172 0), p2:(EQ s604 1), p0:(EQ s1172 1), p3:(EQ s761 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1258 ms.
Product exploration explored 100000 steps with 50000 reset in 1249 ms.
Graph (complete) has 3178 edges and 1514 vertex of which 1513 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [p1, (NOT p2), (NOT p0), (NOT p3)]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 50000 reset in 1244 ms.
Product exploration explored 100000 steps with 50000 reset in 1217 ms.
Applying partial POR strategy [false, false, true, true, false, true, false]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3))]
Support contains 3 out of 1514 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1514/1514 places, 2038/2038 transitions.
Graph (trivial) has 1292 edges and 1514 vertex of which 480 / 1514 are part of one of the 33 SCC in 1 ms
Free SCC test removed 447 places
Ensure Unique test removed 474 transitions
Reduce isomorphic transitions removed 474 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 1067 transition count 1564
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 94 Pre rules applied. Total rules applied 199 place count 1067 transition count 1841
Deduced a syphon composed of 292 places in 3 ms
Iterating global reduction 1 with 94 rules applied. Total rules applied 293 place count 1067 transition count 1841
Discarding 151 places :
Symmetric choice reduction at 1 with 151 rule applications. Total rules 444 place count 916 transition count 1564
Deduced a syphon composed of 199 places in 3 ms
Iterating global reduction 1 with 151 rules applied. Total rules applied 595 place count 916 transition count 1564
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 627 place count 916 transition count 1532
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 653 place count 890 transition count 1412
Deduced a syphon composed of 173 places in 3 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 679 place count 890 transition count 1412
Performed 203 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 376 places in 1 ms
Iterating global reduction 2 with 203 rules applied. Total rules applied 882 place count 890 transition count 1364
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 954 place count 890 transition count 1292
Discarding 143 places :
Symmetric choice reduction at 3 with 143 rule applications. Total rules 1097 place count 747 transition count 1111
Deduced a syphon composed of 271 places in 1 ms
Iterating global reduction 3 with 143 rules applied. Total rules applied 1240 place count 747 transition count 1111
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 1278 place count 747 transition count 1073
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -211
Deduced a syphon composed of 296 places in 0 ms
Iterating global reduction 4 with 25 rules applied. Total rules applied 1303 place count 747 transition count 1284
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 1327 place count 747 transition count 1260
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1352 place count 722 transition count 1130
Deduced a syphon composed of 271 places in 1 ms
Iterating global reduction 5 with 25 rules applied. Total rules applied 1377 place count 722 transition count 1130
Deduced a syphon composed of 271 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1380 place count 722 transition count 1127
Deduced a syphon composed of 271 places in 0 ms
Applied a total of 1380 rules in 222 ms. Remains 722 /1514 variables (removed 792) and now considering 1127/2038 (removed 911) transitions.
[2021-05-14 07:12:02] [INFO ] Redundant transitions in 10 ms returned []
[2021-05-14 07:12:02] [INFO ] Flow matrix only has 1095 transitions (discarded 32 similar events)
// Phase 1: matrix 1095 rows 722 cols
[2021-05-14 07:12:02] [INFO ] Computed 66 place invariants in 11 ms
[2021-05-14 07:12:03] [INFO ] Dead Transitions using invariants and state equation in 482 ms returned []
Finished structural reductions, in 1 iterations. Remains : 722/1514 places, 1127/2038 transitions.
Product exploration explored 100000 steps with 50000 reset in 1230 ms.
Product exploration explored 100000 steps with 50000 reset in 1226 ms.
[2021-05-14 07:12:05] [INFO ] Flatten gal took : 76 ms
[2021-05-14 07:12:06] [INFO ] Flatten gal took : 72 ms
[2021-05-14 07:12:06] [INFO ] Time to serialize gal into /tmp/LTL8328979345914107383.gal : 32 ms
[2021-05-14 07:12:06] [INFO ] Time to serialize properties into /tmp/LTL11411300655869987052.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/LTL8328979345914107383.gal, -t, CGAL, -LTL, /tmp/LTL11411300655869987052.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/LTL8328979345914107383.gal -t CGAL -LTL /tmp/LTL11411300655869987052.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p6856==1)")U(("(p6856==0)")||(("(p3272==1)")&&(X(("(p3272==1)")||(G("(p4245==1)")))))))))
Formula 0 simplified : !X("(p6856==1)" U ("(p6856==0)" | ("(p3272==1)" & X("(p3272==1)" | G"(p4245==1)"))))
Detected timeout of ITS tools.
[2021-05-14 07:12:21] [INFO ] Flatten gal took : 96 ms
[2021-05-14 07:12:21] [INFO ] Applying decomposition
[2021-05-14 07:12:21] [INFO ] Flatten gal took : 63 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/graph15227604519981300745.txt, -o, /tmp/graph15227604519981300745.bin, -w, /tmp/graph15227604519981300745.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/graph15227604519981300745.bin, -l, -1, -v, -w, /tmp/graph15227604519981300745.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 07:12:21] [INFO ] Decomposing Gal with order
[2021-05-14 07:12:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 07:12:21] [INFO ] Removed a total of 1054 redundant transitions.
[2021-05-14 07:12:21] [INFO ] Flatten gal took : 165 ms
[2021-05-14 07:12:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 389 labels/synchronizations in 52 ms.
[2021-05-14 07:12:21] [INFO ] Time to serialize gal into /tmp/LTL14483257544371958650.gal : 24 ms
[2021-05-14 07:12:21] [INFO ] Time to serialize properties into /tmp/LTL9079235253506771299.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/LTL14483257544371958650.gal, -t, CGAL, -LTL, /tmp/LTL9079235253506771299.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/LTL14483257544371958650.gal -t CGAL -LTL /tmp/LTL9079235253506771299.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i16.u387.p6856==1)")U(("(i16.u387.p6856==0)")||(("(i7.i1.i6.u201.p3272==1)")&&(X(("(i7.i1.i6.u201.p3272==1)")||(G("(i12.i0.i7.u257.p4245==1)")))))))))
Formula 0 simplified : !X("(i16.u387.p6856==1)" U ("(i16.u387.p6856==0)" | ("(i7.i1.i6.u201.p3272==1)" & X("(i7.i1.i6.u201.p3272==1)" | G"(i12.i0.i7.u257.p4245==1)"))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2071180885005070266
[2021-05-14 07:12:37] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2071180885005070266
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/ltsmin2071180885005070266]
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/ltsmin2071180885005070266] 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/ltsmin2071180885005070266] 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 NoC3x3-PT-8B-14 finished in 53415 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1541/1541 places, 2092/2092 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1521 transition count 2072
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1521 transition count 2072
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 60 place count 1521 transition count 2052
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 68 place count 1513 transition count 2044
Iterating global reduction 1 with 8 rules applied. Total rules applied 76 place count 1513 transition count 2044
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 84 place count 1513 transition count 2036
Applied a total of 84 rules in 159 ms. Remains 1513 /1541 variables (removed 28) and now considering 2036/2092 (removed 56) transitions.
// Phase 1: matrix 2036 rows 1513 cols
[2021-05-14 07:12:38] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 07:12:38] [INFO ] Implicit Places using invariants in 504 ms returned []
// Phase 1: matrix 2036 rows 1513 cols
[2021-05-14 07:12:38] [INFO ] Computed 66 place invariants in 9 ms
[2021-05-14 07:12:39] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
// Phase 1: matrix 2036 rows 1513 cols
[2021-05-14 07:12:39] [INFO ] Computed 66 place invariants in 8 ms
[2021-05-14 07:12:40] [INFO ] Dead Transitions using invariants and state equation in 896 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1513/1541 places, 2036/2092 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s872 1), p1:(NEQ s188 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12860 steps with 15 reset in 40 ms.
FORMULA NoC3x3-PT-8B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-15 finished in 2995 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12199974315330049368
[2021-05-14 07:12:41] [INFO ] Too many transitions (2092) to apply POR reductions. Disabling POR matrices.
[2021-05-14 07:12:41] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12199974315330049368
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/ltsmin12199974315330049368]
[2021-05-14 07:12:41] [INFO ] Applying decomposition
[2021-05-14 07:12:41] [INFO ] Flatten gal took : 125 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/graph5132344991919793727.txt, -o, /tmp/graph5132344991919793727.bin, -w, /tmp/graph5132344991919793727.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/graph5132344991919793727.bin, -l, -1, -v, -w, /tmp/graph5132344991919793727.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 07:12:41] [INFO ] Decomposing Gal with order
[2021-05-14 07:12:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 07:12:41] [INFO ] Removed a total of 1044 redundant transitions.
[2021-05-14 07:12:41] [INFO ] Flatten gal took : 120 ms
[2021-05-14 07:12:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 353 labels/synchronizations in 76 ms.
[2021-05-14 07:12:41] [INFO ] Time to serialize gal into /tmp/LTLFireability4511005267891731034.gal : 25 ms
[2021-05-14 07:12:51] [INFO ] Time to serialize properties into /tmp/LTLFireability6640468670340990662.ltl : 9758 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/LTLFireability4511005267891731034.gal, -t, CGAL, -LTL, /tmp/LTLFireability6640468670340990662.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/LTLFireability4511005267891731034.gal -t CGAL -LTL /tmp/LTLFireability6640468670340990662.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i19.u396.p6856==1)")U(("(i19.u396.p6856==0)")||(("(i9.i1.i2.u217.p3272==1)")&&(X(("(i9.i1.i2.u217.p3272==1)")||(G("(i12.u268.p4245==1)")))))))))
Formula 0 simplified : !X("(i19.u396.p6856==1)" U ("(i19.u396.p6856==0)" | ("(i9.i1.i2.u217.p3272==1)" & X("(i9.i1.i2.u217.p3272==1)" | G"(i12.u268.p4245==1)"))))
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/ltsmin12199974315330049368] killed by timeout after 27 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/ltsmin12199974315330049368] killed by timeout after 27 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-14 07:33:50] [INFO ] Applying decomposition
[2021-05-14 07:33:50] [INFO ] Flatten gal took : 401 ms
[2021-05-14 07:34:21] [INFO ] Decomposing Gal with order
[2021-05-14 07:34:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 07:34:21] [INFO ] Removed a total of 770 redundant transitions.
[2021-05-14 07:34:21] [INFO ] Flatten gal took : 112 ms
[2021-05-14 07:34:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2326 labels/synchronizations in 130 ms.
[2021-05-14 07:34:21] [INFO ] Time to serialize gal into /tmp/LTLFireability14641619864938019986.gal : 13 ms
[2021-05-14 07:34:21] [INFO ] Time to serialize properties into /tmp/LTLFireability667399976383519736.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/LTLFireability14641619864938019986.gal, -t, CGAL, -LTL, /tmp/LTLFireability667399976383519736.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/LTLFireability14641619864938019986.gal -t CGAL -LTL /tmp/LTLFireability667399976383519736.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u165.p6856==1)")U(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u165.p6856==0)")||(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u114.p3272==1)")&&(X(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u114.p3272==1)")||(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u128.p4245==1)")))))))))
Formula 0 simplified : !X("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u165.p6856==1)" U ("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u165.p6856==0)" | ("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u114.p3272==1)" & X("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u114.p3272==1)" | G"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u128.p4245==1)"))))
Detected timeout of ITS tools.
[2021-05-14 07:55:21] [INFO ] Flatten gal took : 707 ms
[2021-05-14 07:55:21] [INFO ] Input system was already deterministic with 2092 transitions.
[2021-05-14 07:55:21] [INFO ] Transformed 1541 places.
[2021-05-14 07:55:21] [INFO ] Transformed 2092 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-14 07:55:21] [INFO ] Time to serialize gal into /tmp/LTLFireability15179746651024754490.gal : 11 ms
[2021-05-14 07:55:21] [INFO ] Time to serialize properties into /tmp/LTLFireability14125791562781659364.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/LTLFireability15179746651024754490.gal, -t, CGAL, -LTL, /tmp/LTLFireability14125791562781659364.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability15179746651024754490.gal -t CGAL -LTL /tmp/LTLFireability14125791562781659364.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(("(p6856==1)")U(("(p6856==0)")||(("(p3272==1)")&&(X(("(p3272==1)")||(G("(p4245==1)")))))))))
Formula 0 simplified : !X("(p6856==1)" U ("(p6856==0)" | ("(p3272==1)" & X("(p3272==1)" | G"(p4245==1)"))))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-8B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089127700349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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