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.r273-smll-162123879800205.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is UtahNoC-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r273-smll-162123879800205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 10 09:44 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:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 14:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 14:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 26 05:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 26 05:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 205K May 5 16:52 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 UtahNoC-PT-none-00
FORMULA_NAME UtahNoC-PT-none-01
FORMULA_NAME UtahNoC-PT-none-02
FORMULA_NAME UtahNoC-PT-none-03
FORMULA_NAME UtahNoC-PT-none-04
FORMULA_NAME UtahNoC-PT-none-05
FORMULA_NAME UtahNoC-PT-none-06
FORMULA_NAME UtahNoC-PT-none-07
FORMULA_NAME UtahNoC-PT-none-08
FORMULA_NAME UtahNoC-PT-none-09
FORMULA_NAME UtahNoC-PT-none-10
FORMULA_NAME UtahNoC-PT-none-11
FORMULA_NAME UtahNoC-PT-none-12
FORMULA_NAME UtahNoC-PT-none-13
FORMULA_NAME UtahNoC-PT-none-14
FORMULA_NAME UtahNoC-PT-none-15

=== Now, execution of the tool begins

BK_START 1621477497857

Running Version 0
[2021-05-20 02:25:00] [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-20 02:25:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-20 02:25:00] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2021-05-20 02:25:00] [INFO ] Transformed 216 places.
[2021-05-20 02:25:00] [INFO ] Transformed 977 transitions.
[2021-05-20 02:25:00] [INFO ] Found NUPN structural information;
[2021-05-20 02:25:00] [INFO ] Parsed PT model containing 216 places and 977 transitions in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-20 02:25:00] [INFO ] Initial state test concluded for 1 properties.
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
FORMULA UtahNoC-PT-none-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 216 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 216/216 places, 829/829 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 180 transition count 693
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 180 transition count 693
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 101 place count 180 transition count 664
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 177 transition count 655
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 177 transition count 655
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 111 place count 177 transition count 651
Applied a total of 111 rules in 92 ms. Remains 177 /216 variables (removed 39) and now considering 651/829 (removed 178) transitions.
[2021-05-20 02:25:01] [INFO ] Flow matrix only has 337 transitions (discarded 314 similar events)
// Phase 1: matrix 337 rows 177 cols
[2021-05-20 02:25:01] [INFO ] Computed 8 place invariants in 22 ms
[2021-05-20 02:25:01] [INFO ] Implicit Places using invariants in 278 ms returned []
[2021-05-20 02:25:01] [INFO ] Flow matrix only has 337 transitions (discarded 314 similar events)
// Phase 1: matrix 337 rows 177 cols
[2021-05-20 02:25:01] [INFO ] Computed 8 place invariants in 5 ms
[2021-05-20 02:25:01] [INFO ] State equation strengthened by 37 read => feed constraints.
[2021-05-20 02:25:01] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2021-05-20 02:25:01] [INFO ] Flow matrix only has 337 transitions (discarded 314 similar events)
// Phase 1: matrix 337 rows 177 cols
[2021-05-20 02:25:01] [INFO ] Computed 8 place invariants in 5 ms
[2021-05-20 02:25:02] [INFO ] Dead Transitions using invariants and state equation in 522 ms returned []
Finished structural reductions, in 1 iterations. Remains : 177/216 places, 651/829 transitions.
[2021-05-20 02:25:02] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-20 02:25:02] [INFO ] Flatten gal took : 151 ms
FORMULA UtahNoC-PT-none-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-20 02:25:02] [INFO ] Flatten gal took : 57 ms
[2021-05-20 02:25:02] [INFO ] Input system was already deterministic with 651 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=257 ) properties (out of 27) seen :26
Running SMT prover for 1 properties.
[2021-05-20 02:25:03] [INFO ] Flow matrix only has 337 transitions (discarded 314 similar events)
// Phase 1: matrix 337 rows 177 cols
[2021-05-20 02:25:03] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-20 02:25:03] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-20 02:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:25:03] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-20 02:25:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2021-05-20 02:25:03] [INFO ] [Real]Added 37 Read/Feed constraints in 14 ms returned sat
[2021-05-20 02:25:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:25:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-20 02:25:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 02:25:03] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-20 02:25:03] [INFO ] [Nat]Added 37 Read/Feed constraints in 13 ms returned sat
[2021-05-20 02:25:03] [INFO ] Computed and/alt/rep : 301/857/301 causal constraints (skipped 35 transitions) in 66 ms.
[2021-05-20 02:25:05] [INFO ] Added : 297 causal constraints over 60 iterations in 1892 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F((p0||(p1&&X(p2))))&&G(!p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 177 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 177/177 places, 651/651 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 156 transition count 552
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 156 transition count 552
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 59 place count 156 transition count 535
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 152 transition count 523
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 152 transition count 523
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 71 place count 152 transition count 519
Applied a total of 71 rules in 39 ms. Remains 152 /177 variables (removed 25) and now considering 519/651 (removed 132) transitions.
[2021-05-20 02:25:05] [INFO ] Flow matrix only has 273 transitions (discarded 246 similar events)
// Phase 1: matrix 273 rows 152 cols
[2021-05-20 02:25:05] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-20 02:25:05] [INFO ] Implicit Places using invariants in 63 ms returned []
[2021-05-20 02:25:05] [INFO ] Flow matrix only has 273 transitions (discarded 246 similar events)
// Phase 1: matrix 273 rows 152 cols
[2021-05-20 02:25:05] [INFO ] Computed 8 place invariants in 10 ms
[2021-05-20 02:25:06] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-20 02:25:06] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2021-05-20 02:25:06] [INFO ] Flow matrix only has 273 transitions (discarded 246 similar events)
// Phase 1: matrix 273 rows 152 cols
[2021-05-20 02:25:06] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-20 02:25:06] [INFO ] Dead Transitions using invariants and state equation in 312 ms returned []
Finished structural reductions, in 1 iterations. Remains : 152/177 places, 519/651 transitions.
Stuttering acceptance computed with spot in 344 ms :[p2, (OR (NOT p0) p2), true, (OR (NOT p0) p2)]
Running random walk in product with property : UtahNoC-PT-none-00 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=p2, acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(OR (NEQ s4 1) (NEQ s83 1)), p0:(NEQ s79 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA UtahNoC-PT-none-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-00 finished in 1072 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U G((F(p1)||(p2&&X(p3))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 177/177 places, 651/651 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 157 transition count 557
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 157 transition count 557
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 57 place count 157 transition count 540
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 153 transition count 528
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 153 transition count 528
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 153 transition count 524
Applied a total of 69 rules in 15 ms. Remains 153 /177 variables (removed 24) and now considering 524/651 (removed 127) transitions.
[2021-05-20 02:25:06] [INFO ] Flow matrix only has 274 transitions (discarded 250 similar events)
// Phase 1: matrix 274 rows 153 cols
[2021-05-20 02:25:06] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-20 02:25:06] [INFO ] Implicit Places using invariants in 53 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
[2021-05-20 02:25:06] [INFO ] Flow matrix only has 274 transitions (discarded 250 similar events)
// Phase 1: matrix 274 rows 152 cols
[2021-05-20 02:25:06] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:07] [INFO ] Dead Transitions using invariants and state equation in 281 ms returned []
Starting structural reductions, iteration 1 : 152/177 places, 524/651 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 147 transition count 499
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 147 transition count 499
Applied a total of 10 rules in 11 ms. Remains 147 /152 variables (removed 5) and now considering 499/524 (removed 25) transitions.
[2021-05-20 02:25:07] [INFO ] Flow matrix only has 269 transitions (discarded 230 similar events)
// Phase 1: matrix 269 rows 147 cols
[2021-05-20 02:25:07] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:07] [INFO ] Implicit Places using invariants in 44 ms returned []
[2021-05-20 02:25:07] [INFO ] Flow matrix only has 269 transitions (discarded 230 similar events)
// Phase 1: matrix 269 rows 147 cols
[2021-05-20 02:25:07] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-20 02:25:07] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-20 02:25:07] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 147/177 places, 499/651 transitions.
Stuttering acceptance computed with spot in 413 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0) p2), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) p2 (NOT p3)))]
Running random walk in product with property : UtahNoC-PT-none-01 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) p2 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p1) p2 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s46 0), p1:(EQ s123 0), p2:(EQ s73 0), p3:(AND (EQ s1 1) (EQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5119 steps with 0 reset in 78 ms.
FORMULA UtahNoC-PT-none-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-01 finished in 1081 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 177/177 places, 651/651 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 155 transition count 547
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 155 transition count 547
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 61 place count 155 transition count 530
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 151 transition count 518
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 151 transition count 518
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 73 place count 151 transition count 514
Applied a total of 73 rules in 21 ms. Remains 151 /177 variables (removed 26) and now considering 514/651 (removed 137) transitions.
[2021-05-20 02:25:07] [INFO ] Flow matrix only has 272 transitions (discarded 242 similar events)
// Phase 1: matrix 272 rows 151 cols
[2021-05-20 02:25:07] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-20 02:25:08] [INFO ] Implicit Places using invariants in 78 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
[2021-05-20 02:25:08] [INFO ] Flow matrix only has 272 transitions (discarded 242 similar events)
// Phase 1: matrix 272 rows 150 cols
[2021-05-20 02:25:08] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-20 02:25:08] [INFO ] Dead Transitions using invariants and state equation in 500 ms returned []
Starting structural reductions, iteration 1 : 150/177 places, 514/651 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 145 transition count 489
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 145 transition count 489
Applied a total of 10 rules in 12 ms. Remains 145 /150 variables (removed 5) and now considering 489/514 (removed 25) transitions.
[2021-05-20 02:25:08] [INFO ] Flow matrix only has 267 transitions (discarded 222 similar events)
// Phase 1: matrix 267 rows 145 cols
[2021-05-20 02:25:08] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:08] [INFO ] Implicit Places using invariants in 55 ms returned []
[2021-05-20 02:25:08] [INFO ] Flow matrix only has 267 transitions (discarded 222 similar events)
// Phase 1: matrix 267 rows 145 cols
[2021-05-20 02:25:08] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-20 02:25:08] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-20 02:25:08] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 145/177 places, 489/651 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtahNoC-PT-none-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s102 1), p0:(NEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 15703 steps with 2 reset in 199 ms.
FORMULA UtahNoC-PT-none-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-04 finished in 1312 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X((G(p1)&&(p0 U (X(p2)||G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 177/177 places, 651/651 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 156 transition count 552
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 156 transition count 552
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 59 place count 156 transition count 535
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 152 transition count 523
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 152 transition count 523
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 71 place count 152 transition count 519
Applied a total of 71 rules in 28 ms. Remains 152 /177 variables (removed 25) and now considering 519/651 (removed 132) transitions.
[2021-05-20 02:25:09] [INFO ] Flow matrix only has 273 transitions (discarded 246 similar events)
// Phase 1: matrix 273 rows 152 cols
[2021-05-20 02:25:09] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-20 02:25:09] [INFO ] Implicit Places using invariants in 498 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 525 ms to find 1 implicit places.
[2021-05-20 02:25:09] [INFO ] Flow matrix only has 273 transitions (discarded 246 similar events)
// Phase 1: matrix 273 rows 151 cols
[2021-05-20 02:25:09] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:10] [INFO ] Dead Transitions using invariants and state equation in 324 ms returned []
Starting structural reductions, iteration 1 : 151/177 places, 519/651 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 494
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 494
Applied a total of 10 rules in 12 ms. Remains 146 /151 variables (removed 5) and now considering 494/519 (removed 25) transitions.
[2021-05-20 02:25:10] [INFO ] Flow matrix only has 268 transitions (discarded 226 similar events)
// Phase 1: matrix 268 rows 146 cols
[2021-05-20 02:25:10] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:10] [INFO ] Implicit Places using invariants in 38 ms returned []
[2021-05-20 02:25:10] [INFO ] Flow matrix only has 268 transitions (discarded 226 similar events)
// Phase 1: matrix 268 rows 146 cols
[2021-05-20 02:25:10] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:10] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-20 02:25:10] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 146/177 places, 494/651 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtahNoC-PT-none-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s64 1), p1:(AND (NEQ s16 0) (NEQ s124 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtahNoC-PT-none-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-06 finished in 1196 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||(p1&&G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 177/177 places, 651/651 transitions.
Graph (trivial) has 274 edges and 177 vertex of which 65 / 177 are part of one of the 16 SCC in 5 ms
Free SCC test removed 49 places
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 191 edges and 126 vertex of which 25 / 126 are part of one of the 4 SCC in 1 ms
Free SCC test removed 21 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 510
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 83 place count 105 transition count 430
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 103 place count 85 transition count 342
Iterating global reduction 2 with 20 rules applied. Total rules applied 123 place count 85 transition count 342
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 147 place count 85 transition count 318
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 152 place count 80 transition count 304
Iterating global reduction 3 with 5 rules applied. Total rules applied 157 place count 80 transition count 304
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 162 place count 80 transition count 299
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 168 place count 77 transition count 296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 172 place count 77 transition count 292
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 174 place count 75 transition count 286
Iterating global reduction 5 with 2 rules applied. Total rules applied 176 place count 75 transition count 286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 178 place count 75 transition count 284
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 194 place count 75 transition count 268
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 195 place count 75 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 196 place count 75 transition count 267
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 197 place count 74 transition count 266
Iterating global reduction 7 with 1 rules applied. Total rules applied 198 place count 74 transition count 266
Applied a total of 198 rules in 125 ms. Remains 74 /177 variables (removed 103) and now considering 266/651 (removed 385) transitions.
[2021-05-20 02:25:10] [INFO ] Flow matrix only has 125 transitions (discarded 141 similar events)
// Phase 1: matrix 125 rows 74 cols
[2021-05-20 02:25:10] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:10] [INFO ] Implicit Places using invariants in 30 ms returned []
[2021-05-20 02:25:10] [INFO ] Flow matrix only has 125 transitions (discarded 141 similar events)
// Phase 1: matrix 125 rows 74 cols
[2021-05-20 02:25:10] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-20 02:25:10] [INFO ] State equation strengthened by 11 read => feed constraints.
[2021-05-20 02:25:10] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2021-05-20 02:25:10] [INFO ] Redundant transitions in 16 ms returned []
[2021-05-20 02:25:10] [INFO ] Flow matrix only has 125 transitions (discarded 141 similar events)
// Phase 1: matrix 125 rows 74 cols
[2021-05-20 02:25:10] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-20 02:25:10] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 1 iterations. Remains : 74/177 places, 266/651 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : UtahNoC-PT-none-07 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s46 1)), p1:(EQ s26 1), p2:(AND (EQ s20 1) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA UtahNoC-PT-none-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-07 finished in 616 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 177/177 places, 651/651 transitions.
Graph (trivial) has 277 edges and 177 vertex of which 69 / 177 are part of one of the 14 SCC in 1 ms
Free SCC test removed 55 places
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 181 edges and 120 vertex of which 25 / 120 are part of one of the 4 SCC in 0 ms
Free SCC test removed 21 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 99 transition count 482
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 83 place count 99 transition count 402
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 103 place count 79 transition count 314
Iterating global reduction 2 with 20 rules applied. Total rules applied 123 place count 79 transition count 314
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 149 place count 79 transition count 288
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 154 place count 74 transition count 276
Iterating global reduction 3 with 5 rules applied. Total rules applied 159 place count 74 transition count 276
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 164 place count 74 transition count 271
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 170 place count 71 transition count 268
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 174 place count 71 transition count 264
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 176 place count 69 transition count 258
Iterating global reduction 5 with 2 rules applied. Total rules applied 178 place count 69 transition count 258
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 180 place count 69 transition count 256
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 188 place count 69 transition count 248
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 69 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 190 place count 69 transition count 247
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 191 place count 68 transition count 246
Iterating global reduction 7 with 1 rules applied. Total rules applied 192 place count 68 transition count 246
Applied a total of 192 rules in 76 ms. Remains 68 /177 variables (removed 109) and now considering 246/651 (removed 405) transitions.
[2021-05-20 02:25:11] [INFO ] Flow matrix only has 116 transitions (discarded 130 similar events)
// Phase 1: matrix 116 rows 68 cols
[2021-05-20 02:25:11] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-20 02:25:11] [INFO ] Implicit Places using invariants in 30 ms returned []
[2021-05-20 02:25:11] [INFO ] Flow matrix only has 116 transitions (discarded 130 similar events)
// Phase 1: matrix 116 rows 68 cols
[2021-05-20 02:25:11] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-20 02:25:11] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-20 02:25:11] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2021-05-20 02:25:11] [INFO ] Redundant transitions in 8 ms returned []
[2021-05-20 02:25:11] [INFO ] Flow matrix only has 116 transitions (discarded 130 similar events)
// Phase 1: matrix 116 rows 68 cols
[2021-05-20 02:25:11] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:11] [INFO ] Dead Transitions using invariants and state equation in 176 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/177 places, 246/651 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Running random walk in product with property : UtahNoC-PT-none-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (NEQ s1 1) (OR (NEQ s11 1) (NEQ s54 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA UtahNoC-PT-none-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-08 finished in 448 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 177/177 places, 651/651 transitions.
Graph (trivial) has 286 edges and 177 vertex of which 77 / 177 are part of one of the 14 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 185 transitions
Reduce isomorphic transitions removed 185 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 172 edges and 112 vertex of which 19 / 112 are part of one of the 6 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 99 transition count 465
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 40 place count 99 transition count 428
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 57 place count 82 transition count 347
Iterating global reduction 2 with 17 rules applied. Total rules applied 74 place count 82 transition count 347
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 99 place count 82 transition count 322
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 103 place count 78 transition count 312
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 78 transition count 312
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 111 place count 78 transition count 308
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 117 place count 75 transition count 305
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 121 place count 75 transition count 301
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 123 place count 73 transition count 295
Iterating global reduction 5 with 2 rules applied. Total rules applied 125 place count 73 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 127 place count 73 transition count 293
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 144 place count 73 transition count 276
Applied a total of 144 rules in 60 ms. Remains 73 /177 variables (removed 104) and now considering 276/651 (removed 375) transitions.
[2021-05-20 02:25:11] [INFO ] Flow matrix only has 120 transitions (discarded 156 similar events)
// Phase 1: matrix 120 rows 73 cols
[2021-05-20 02:25:11] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:11] [INFO ] Implicit Places using invariants in 44 ms returned []
[2021-05-20 02:25:11] [INFO ] Flow matrix only has 120 transitions (discarded 156 similar events)
// Phase 1: matrix 120 rows 73 cols
[2021-05-20 02:25:11] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:11] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-20 02:25:11] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2021-05-20 02:25:11] [INFO ] Redundant transitions in 6 ms returned []
[2021-05-20 02:25:11] [INFO ] Flow matrix only has 120 transitions (discarded 156 similar events)
// Phase 1: matrix 120 rows 73 cols
[2021-05-20 02:25:11] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-20 02:25:11] [INFO ] Dead Transitions using invariants and state equation in 225 ms returned []
Finished structural reductions, in 1 iterations. Remains : 73/177 places, 276/651 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : UtahNoC-PT-none-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s25 1) (AND (EQ s38 1) (EQ s64 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA UtahNoC-PT-none-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-09 finished in 531 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F((p0&&X(F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 177/177 places, 651/651 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 157 transition count 556
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 157 transition count 556
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 57 place count 157 transition count 539
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 153 transition count 527
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 153 transition count 527
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 153 transition count 523
Applied a total of 69 rules in 14 ms. Remains 153 /177 variables (removed 24) and now considering 523/651 (removed 128) transitions.
[2021-05-20 02:25:12] [INFO ] Flow matrix only has 277 transitions (discarded 246 similar events)
// Phase 1: matrix 277 rows 153 cols
[2021-05-20 02:25:12] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-20 02:25:12] [INFO ] Implicit Places using invariants in 78 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
[2021-05-20 02:25:12] [INFO ] Flow matrix only has 277 transitions (discarded 246 similar events)
// Phase 1: matrix 277 rows 152 cols
[2021-05-20 02:25:12] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-20 02:25:12] [INFO ] Dead Transitions using invariants and state equation in 440 ms returned []
Starting structural reductions, iteration 1 : 152/177 places, 523/651 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 147 transition count 498
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 147 transition count 498
Applied a total of 10 rules in 6 ms. Remains 147 /152 variables (removed 5) and now considering 498/523 (removed 25) transitions.
[2021-05-20 02:25:12] [INFO ] Flow matrix only has 272 transitions (discarded 226 similar events)
// Phase 1: matrix 272 rows 147 cols
[2021-05-20 02:25:12] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-20 02:25:12] [INFO ] Implicit Places using invariants in 48 ms returned []
[2021-05-20 02:25:12] [INFO ] Flow matrix only has 272 transitions (discarded 226 similar events)
// Phase 1: matrix 272 rows 147 cols
[2021-05-20 02:25:12] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:12] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-20 02:25:12] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 147/177 places, 498/651 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtahNoC-PT-none-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(AND (EQ s46 0) (EQ s51 1) (EQ s122 1)), p0:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA UtahNoC-PT-none-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-11 finished in 1013 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 177/177 places, 651/651 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 156 transition count 552
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 156 transition count 552
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 59 place count 156 transition count 535
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 152 transition count 523
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 152 transition count 523
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 71 place count 152 transition count 519
Applied a total of 71 rules in 15 ms. Remains 152 /177 variables (removed 25) and now considering 519/651 (removed 132) transitions.
[2021-05-20 02:25:13] [INFO ] Flow matrix only has 273 transitions (discarded 246 similar events)
// Phase 1: matrix 273 rows 152 cols
[2021-05-20 02:25:13] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-20 02:25:13] [INFO ] Implicit Places using invariants in 73 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
[2021-05-20 02:25:13] [INFO ] Flow matrix only has 273 transitions (discarded 246 similar events)
// Phase 1: matrix 273 rows 151 cols
[2021-05-20 02:25:13] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:13] [INFO ] Dead Transitions using invariants and state equation in 379 ms returned []
Starting structural reductions, iteration 1 : 151/177 places, 519/651 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 494
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 494
Applied a total of 10 rules in 6 ms. Remains 146 /151 variables (removed 5) and now considering 494/519 (removed 25) transitions.
[2021-05-20 02:25:13] [INFO ] Flow matrix only has 268 transitions (discarded 226 similar events)
// Phase 1: matrix 268 rows 146 cols
[2021-05-20 02:25:13] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-20 02:25:13] [INFO ] Implicit Places using invariants in 53 ms returned []
[2021-05-20 02:25:13] [INFO ] Flow matrix only has 268 transitions (discarded 226 similar events)
// Phase 1: matrix 268 rows 146 cols
[2021-05-20 02:25:13] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-20 02:25:13] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-20 02:25:13] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 146/177 places, 494/651 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtahNoC-PT-none-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(NEQ s65 0)], 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 1 steps with 0 reset in 0 ms.
FORMULA UtahNoC-PT-none-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-12 finished in 852 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 177/177 places, 651/651 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 157 transition count 557
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 157 transition count 557
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 55 place count 157 transition count 542
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 154 transition count 533
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 154 transition count 533
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 154 transition count 530
Applied a total of 64 rules in 10 ms. Remains 154 /177 variables (removed 23) and now considering 530/651 (removed 121) transitions.
[2021-05-20 02:25:13] [INFO ] Flow matrix only has 280 transitions (discarded 250 similar events)
// Phase 1: matrix 280 rows 154 cols
[2021-05-20 02:25:13] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-20 02:25:13] [INFO ] Implicit Places using invariants in 55 ms returned []
[2021-05-20 02:25:13] [INFO ] Flow matrix only has 280 transitions (discarded 250 similar events)
// Phase 1: matrix 280 rows 154 cols
[2021-05-20 02:25:13] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-20 02:25:14] [INFO ] State equation strengthened by 34 read => feed constraints.
[2021-05-20 02:25:14] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2021-05-20 02:25:14] [INFO ] Flow matrix only has 280 transitions (discarded 250 similar events)
// Phase 1: matrix 280 rows 154 cols
[2021-05-20 02:25:14] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-20 02:25:14] [INFO ] Dead Transitions using invariants and state equation in 384 ms returned []
Finished structural reductions, in 1 iterations. Remains : 154/177 places, 530/651 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtahNoC-PT-none-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s5 1) (EQ s151 1)) (AND (EQ s4 1) (EQ s77 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtahNoC-PT-none-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-13 finished in 749 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(((p1 U (p2||G(p1)))||p0)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 177/177 places, 651/651 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 158 transition count 562
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 158 transition count 562
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 55 place count 158 transition count 545
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 154 transition count 533
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 154 transition count 533
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 67 place count 154 transition count 529
Applied a total of 67 rules in 12 ms. Remains 154 /177 variables (removed 23) and now considering 529/651 (removed 122) transitions.
[2021-05-20 02:25:14] [INFO ] Flow matrix only has 275 transitions (discarded 254 similar events)
// Phase 1: matrix 275 rows 154 cols
[2021-05-20 02:25:14] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-20 02:25:14] [INFO ] Implicit Places using invariants in 78 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
[2021-05-20 02:25:14] [INFO ] Flow matrix only has 275 transitions (discarded 254 similar events)
// Phase 1: matrix 275 rows 153 cols
[2021-05-20 02:25:14] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:15] [INFO ] Dead Transitions using invariants and state equation in 333 ms returned []
Starting structural reductions, iteration 1 : 153/177 places, 529/651 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 148 transition count 504
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 148 transition count 504
Applied a total of 10 rules in 6 ms. Remains 148 /153 variables (removed 5) and now considering 504/529 (removed 25) transitions.
[2021-05-20 02:25:15] [INFO ] Flow matrix only has 270 transitions (discarded 234 similar events)
// Phase 1: matrix 270 rows 148 cols
[2021-05-20 02:25:15] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:15] [INFO ] Implicit Places using invariants in 67 ms returned []
[2021-05-20 02:25:15] [INFO ] Flow matrix only has 270 transitions (discarded 234 similar events)
// Phase 1: matrix 270 rows 148 cols
[2021-05-20 02:25:15] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:15] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-20 02:25:15] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 148/177 places, 504/651 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : UtahNoC-PT-none-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s55 1) (NEQ s107 1)), p2:(AND (NEQ s16 1) (OR (NEQ s77 1) (NEQ s145 1))), p1:(OR (NEQ s77 1) (NEQ s145 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 522 ms.
Product exploration explored 100000 steps with 33333 reset in 583 ms.
Knowledge obtained : [p0, p2, p1]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 33333 reset in 217 ms.
Product exploration explored 100000 steps with 33333 reset in 290 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 148 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 148/148 places, 504/504 transitions.
Graph (trivial) has 235 edges and 148 vertex of which 76 / 148 are part of one of the 14 SCC in 0 ms
Free SCC test removed 62 places
Ensure Unique test removed 193 transitions
Reduce isomorphic transitions removed 193 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 84 transition count 307
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 84 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 83 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 83 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 83 transition count 304
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 83 transition count 304
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 14 place count 83 transition count 300
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 81 transition count 294
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 81 transition count 294
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 79 transition count 291
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 79 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 79 transition count 290
Deduced a syphon composed of 1 places in 0 ms
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 44 place count 79 transition count 269
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 44 rules in 34 ms. Remains 79 /148 variables (removed 69) and now considering 269/504 (removed 235) transitions.
[2021-05-20 02:25:17] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-20 02:25:17] [INFO ] Flow matrix only has 133 transitions (discarded 136 similar events)
// Phase 1: matrix 133 rows 79 cols
[2021-05-20 02:25:17] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-20 02:25:17] [INFO ] Dead Transitions using invariants and state equation in 241 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/148 places, 269/504 transitions.
Product exploration explored 100000 steps with 33333 reset in 1171 ms.
Product exploration explored 100000 steps with 33333 reset in 679 ms.
[2021-05-20 02:25:19] [INFO ] Flatten gal took : 34 ms
[2021-05-20 02:25:20] [INFO ] Flatten gal took : 34 ms
[2021-05-20 02:25:20] [INFO ] Time to serialize gal into /tmp/LTL7113903994664793216.gal : 24 ms
[2021-05-20 02:25:20] [INFO ] Time to serialize properties into /tmp/LTL9404534204005899997.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/LTL7113903994664793216.gal, -t, CGAL, -LTL, /tmp/LTL9404534204005899997.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/LTL7113903994664793216.gal -t CGAL -LTL /tmp/LTL9404534204005899997.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("((p82!=1)||(p160!=1))")||(("((p115!=1)||(p213!=1))")U(("((p23!=1)&&((p115!=1)||(p213!=1)))")||(G("((p115!=1)||(p213!=1))")))))))))
Formula 0 simplified : !XXF("((p82!=1)||(p160!=1))" | ("((p115!=1)||(p213!=1))" U ("((p23!=1)&&((p115!=1)||(p213!=1)))" | G"((p115!=1)||(p213!=1))")))
Reverse transition relation is NOT exact ! Due to transitions t32, t36, t38, t45, t49, t51, t58, t62, t64, t73, t75, t77, t85, t87, t89, t97, t99, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/486/18/504
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
970 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.75848,182712,1,0,628,683121,974,378,6742,736374,952
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtahNoC-PT-none-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtahNoC-PT-none-14 finished in 15875 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(p1)||G((p2&&F(p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 177/177 places, 651/651 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 156 transition count 552
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 156 transition count 552
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 59 place count 156 transition count 535
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 152 transition count 523
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 152 transition count 523
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 71 place count 152 transition count 519
Applied a total of 71 rules in 17 ms. Remains 152 /177 variables (removed 25) and now considering 519/651 (removed 132) transitions.
[2021-05-20 02:25:30] [INFO ] Flow matrix only has 273 transitions (discarded 246 similar events)
// Phase 1: matrix 273 rows 152 cols
[2021-05-20 02:25:30] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-20 02:25:30] [INFO ] Implicit Places using invariants in 57 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
[2021-05-20 02:25:30] [INFO ] Flow matrix only has 273 transitions (discarded 246 similar events)
// Phase 1: matrix 273 rows 151 cols
[2021-05-20 02:25:30] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:30] [INFO ] Dead Transitions using invariants and state equation in 355 ms returned []
Starting structural reductions, iteration 1 : 151/177 places, 519/651 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 494
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 494
Applied a total of 10 rules in 4 ms. Remains 146 /151 variables (removed 5) and now considering 494/519 (removed 25) transitions.
[2021-05-20 02:25:30] [INFO ] Flow matrix only has 268 transitions (discarded 226 similar events)
// Phase 1: matrix 268 rows 146 cols
[2021-05-20 02:25:30] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:31] [INFO ] Implicit Places using invariants in 52 ms returned []
[2021-05-20 02:25:31] [INFO ] Flow matrix only has 268 transitions (discarded 226 similar events)
// Phase 1: matrix 268 rows 146 cols
[2021-05-20 02:25:31] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-20 02:25:31] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-20 02:25:31] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 146/177 places, 494/651 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (OR (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : UtahNoC-PT-none-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s130 1), p1:(OR (NEQ s13 1) (NEQ s105 1)), p2:(EQ s101 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA UtahNoC-PT-none-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-15 finished in 947 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621477532659

--------------------
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="UtahNoC-PT-none"
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 UtahNoC-PT-none, 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 r273-smll-162123879800205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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