fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r261-smll-167863536100228
Last Updated
May 14, 2023

About the Execution of ITS-Tools for NoC3x3-PT-1A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
312.159 21578.00 38977.00 325.30 FFTFFFFFFFFFFFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r261-smll-167863536100228.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is NoC3x3-PT-1A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536100228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.7K Feb 26 09:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 09:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 09:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 26 09:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 09:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 09:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 81K Mar 5 18:23 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-1A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678806957837

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-1A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-14 15:16:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 15:16:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 15:16:01] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-14 15:16:01] [INFO ] Transformed 165 places.
[2023-03-14 15:16:01] [INFO ] Transformed 355 transitions.
[2023-03-14 15:16:01] [INFO ] Found NUPN structural information;
[2023-03-14 15:16:01] [INFO ] Parsed PT model containing 165 places and 355 transitions and 1069 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 108 transitions
Reduce redundant transitions removed 108 transitions.
FORMULA NoC3x3-PT-1A-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 247/247 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 144 transition count 218
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 144 transition count 218
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 68 place count 144 transition count 192
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 72 place count 140 transition count 192
Applied a total of 72 rules in 62 ms. Remains 140 /165 variables (removed 25) and now considering 192/247 (removed 55) transitions.
// Phase 1: matrix 192 rows 140 cols
[2023-03-14 15:16:01] [INFO ] Computed 36 place invariants in 19 ms
[2023-03-14 15:16:02] [INFO ] Implicit Places using invariants in 471 ms returned []
[2023-03-14 15:16:02] [INFO ] Invariant cache hit.
[2023-03-14 15:16:02] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
[2023-03-14 15:16:02] [INFO ] Invariant cache hit.
[2023-03-14 15:16:02] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 140/165 places, 192/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1280 ms. Remains : 140/165 places, 192/247 transitions.
Support contains 38 out of 140 places after structural reductions.
[2023-03-14 15:16:03] [INFO ] Flatten gal took : 90 ms
[2023-03-14 15:16:03] [INFO ] Flatten gal took : 47 ms
[2023-03-14 15:16:03] [INFO ] Input system was already deterministic with 192 transitions.
Support contains 36 out of 140 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 862 ms. (steps per millisecond=11 ) properties (out of 27) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 15:16:04] [INFO ] Invariant cache hit.
[2023-03-14 15:16:04] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 15:16:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2023-03-14 15:16:04] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 15:16:04] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-14 15:16:04] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 192/192 transitions.
Graph (trivial) has 79 edges and 140 vertex of which 42 / 140 are part of one of the 18 SCC in 8 ms
Free SCC test removed 24 places
Drop transitions removed 54 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 66 transitions.
Graph (complete) has 326 edges and 116 vertex of which 114 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 108 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 108 transition count 120
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 108 transition count 118
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 27 place count 108 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 107 transition count 117
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 20 rules applied. Total rules applied 48 place count 101 transition count 103
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 62 place count 87 transition count 103
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 87 transition count 103
Applied a total of 65 rules in 62 ms. Remains 87 /140 variables (removed 53) and now considering 103/192 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 87/140 places, 103/192 transitions.
Finished random walk after 776 steps, including 0 resets, run visited all 2 properties in 19 ms. (steps per millisecond=40 )
FORMULA NoC3x3-PT-1A-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 444 edges and 140 vertex of which 138 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 192/192 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 138 transition count 192
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 131 transition count 185
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 131 transition count 185
Applied a total of 16 rules in 7 ms. Remains 131 /140 variables (removed 9) and now considering 185/192 (removed 7) transitions.
// Phase 1: matrix 185 rows 131 cols
[2023-03-14 15:16:05] [INFO ] Computed 34 place invariants in 5 ms
[2023-03-14 15:16:05] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-14 15:16:05] [INFO ] Invariant cache hit.
[2023-03-14 15:16:06] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-14 15:16:06] [INFO ] Invariant cache hit.
[2023-03-14 15:16:06] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/140 places, 185/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 567 ms. Remains : 131/140 places, 185/192 transitions.
Stuttering acceptance computed with spot in 397 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s35 1) (NEQ s10 1)), p0:(EQ s10 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 49 steps with 4 reset in 3 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-00 finished in 1054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(p0))&&G(p1)&&F(p2)))))'
Support contains 6 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 192/192 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 138 transition count 192
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 134 transition count 188
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 134 transition count 188
Applied a total of 10 rules in 12 ms. Remains 134 /140 variables (removed 6) and now considering 188/192 (removed 4) transitions.
// Phase 1: matrix 188 rows 134 cols
[2023-03-14 15:16:06] [INFO ] Computed 34 place invariants in 6 ms
[2023-03-14 15:16:06] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-14 15:16:06] [INFO ] Invariant cache hit.
[2023-03-14 15:16:06] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-03-14 15:16:06] [INFO ] Invariant cache hit.
[2023-03-14 15:16:07] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/140 places, 188/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 483 ms. Remains : 134/140 places, 188/192 transitions.
Stuttering acceptance computed with spot in 427 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p2), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 3}]], initial=0, aps=[p1:(AND (EQ s57 1) (EQ s103 1)), p2:(AND (EQ s10 1) (EQ s36 1)), p0:(AND (EQ s5 1) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-01 finished in 934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0)) U (G(p2)&&p1))))'
Support contains 6 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 192/192 transitions.
Graph (trivial) has 76 edges and 140 vertex of which 41 / 140 are part of one of the 18 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Graph (complete) has 398 edges and 117 vertex of which 115 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 7 place count 110 transition count 141
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 110 transition count 141
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 110 transition count 139
Applied a total of 14 rules in 40 ms. Remains 110 /140 variables (removed 30) and now considering 139/192 (removed 53) transitions.
[2023-03-14 15:16:07] [INFO ] Flow matrix only has 122 transitions (discarded 17 similar events)
// Phase 1: matrix 122 rows 110 cols
[2023-03-14 15:16:07] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-14 15:16:07] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-14 15:16:07] [INFO ] Flow matrix only has 122 transitions (discarded 17 similar events)
[2023-03-14 15:16:07] [INFO ] Invariant cache hit.
[2023-03-14 15:16:07] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-14 15:16:07] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-14 15:16:07] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-14 15:16:07] [INFO ] Flow matrix only has 122 transitions (discarded 17 similar events)
[2023-03-14 15:16:07] [INFO ] Invariant cache hit.
[2023-03-14 15:16:08] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/140 places, 139/192 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 584 ms. Remains : 110/140 places, 139/192 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s33 1) (EQ s51 1)), p2:(AND (EQ s50 1) (EQ s30 1)), p0:(AND (EQ s73 1) (EQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-03 finished in 857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 192/192 transitions.
Graph (trivial) has 78 edges and 140 vertex of which 42 / 140 are part of one of the 18 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 396 edges and 116 vertex of which 114 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 108 transition count 138
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 108 transition count 138
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 108 transition count 136
Applied a total of 16 rules in 31 ms. Remains 108 /140 variables (removed 32) and now considering 136/192 (removed 56) transitions.
[2023-03-14 15:16:08] [INFO ] Flow matrix only has 119 transitions (discarded 17 similar events)
// Phase 1: matrix 119 rows 108 cols
[2023-03-14 15:16:08] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-14 15:16:08] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-14 15:16:08] [INFO ] Flow matrix only has 119 transitions (discarded 17 similar events)
[2023-03-14 15:16:08] [INFO ] Invariant cache hit.
[2023-03-14 15:16:08] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 15:16:08] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-14 15:16:08] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-14 15:16:08] [INFO ] Flow matrix only has 119 transitions (discarded 17 similar events)
[2023-03-14 15:16:08] [INFO ] Invariant cache hit.
[2023-03-14 15:16:08] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/140 places, 136/192 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 557 ms. Remains : 108/140 places, 136/192 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s26 1) (OR (NEQ s65 1) (NEQ s71 1)) (OR (NEQ s16 1) (NEQ s76 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-04 finished in 617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 192/192 transitions.
Graph (trivial) has 83 edges and 140 vertex of which 44 / 140 are part of one of the 19 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (complete) has 394 edges and 115 vertex of which 113 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 106 transition count 122
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 41 place count 92 transition count 122
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 48 place count 85 transition count 115
Iterating global reduction 2 with 7 rules applied. Total rules applied 55 place count 85 transition count 115
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 69 place count 85 transition count 101
Applied a total of 69 rules in 20 ms. Remains 85 /140 variables (removed 55) and now considering 101/192 (removed 91) transitions.
// Phase 1: matrix 101 rows 85 cols
[2023-03-14 15:16:09] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-14 15:16:09] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-14 15:16:09] [INFO ] Invariant cache hit.
[2023-03-14 15:16:09] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-14 15:16:09] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-14 15:16:09] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-14 15:16:09] [INFO ] Invariant cache hit.
[2023-03-14 15:16:09] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/140 places, 101/192 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 348 ms. Remains : 85/140 places, 101/192 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s55 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-05 finished in 397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&G(p2)))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 192/192 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 138 transition count 192
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 131 transition count 185
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 131 transition count 185
Applied a total of 16 rules in 4 ms. Remains 131 /140 variables (removed 9) and now considering 185/192 (removed 7) transitions.
// Phase 1: matrix 185 rows 131 cols
[2023-03-14 15:16:09] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-14 15:16:09] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-14 15:16:09] [INFO ] Invariant cache hit.
[2023-03-14 15:16:09] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-14 15:16:09] [INFO ] Invariant cache hit.
[2023-03-14 15:16:10] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/140 places, 185/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 626 ms. Remains : 131/140 places, 185/192 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2), 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=[p0:(EQ s128 1), p1:(EQ s107 1), p2:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 42 steps with 2 reset in 1 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-06 finished in 889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p1))||p0)))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 192/192 transitions.
Graph (trivial) has 80 edges and 140 vertex of which 42 / 140 are part of one of the 18 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 396 edges and 116 vertex of which 114 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 107 transition count 124
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 41 place count 93 transition count 124
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 48 place count 86 transition count 117
Iterating global reduction 2 with 7 rules applied. Total rules applied 55 place count 86 transition count 117
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 69 place count 86 transition count 103
Applied a total of 69 rules in 17 ms. Remains 86 /140 variables (removed 54) and now considering 103/192 (removed 89) transitions.
// Phase 1: matrix 103 rows 86 cols
[2023-03-14 15:16:10] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-14 15:16:10] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-14 15:16:10] [INFO ] Invariant cache hit.
[2023-03-14 15:16:10] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-14 15:16:10] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2023-03-14 15:16:10] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-14 15:16:10] [INFO ] Invariant cache hit.
[2023-03-14 15:16:10] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/140 places, 103/192 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 462 ms. Remains : 86/140 places, 103/192 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s19 0) (EQ s56 0)), p1:(EQ s56 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 8068 steps with 13 reset in 87 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-07 finished in 669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 192/192 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 138 transition count 192
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 131 transition count 185
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 131 transition count 185
Applied a total of 16 rules in 6 ms. Remains 131 /140 variables (removed 9) and now considering 185/192 (removed 7) transitions.
// Phase 1: matrix 185 rows 131 cols
[2023-03-14 15:16:10] [INFO ] Computed 34 place invariants in 4 ms
[2023-03-14 15:16:11] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-14 15:16:11] [INFO ] Invariant cache hit.
[2023-03-14 15:16:11] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-14 15:16:11] [INFO ] Invariant cache hit.
[2023-03-14 15:16:11] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/140 places, 185/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 597 ms. Remains : 131/140 places, 185/192 transitions.
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s54 1) (AND (EQ s45 1) (EQ s53 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-08 finished in 868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&G((p1||F(p0)))))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 192/192 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 138 transition count 192
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 131 transition count 185
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 131 transition count 185
Applied a total of 16 rules in 3 ms. Remains 131 /140 variables (removed 9) and now considering 185/192 (removed 7) transitions.
[2023-03-14 15:16:11] [INFO ] Invariant cache hit.
[2023-03-14 15:16:11] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-14 15:16:11] [INFO ] Invariant cache hit.
[2023-03-14 15:16:12] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-14 15:16:12] [INFO ] Invariant cache hit.
[2023-03-14 15:16:12] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/140 places, 185/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 507 ms. Remains : 131/140 places, 185/192 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s63 0), p1:(EQ s104 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 154 reset in 627 ms.
Stack based approach found an accepted trace after 18229 steps with 44 reset with depth 392 and stack size 380 in 157 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-10 finished in 1483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 192/192 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 138 transition count 192
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 132 transition count 186
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 132 transition count 186
Applied a total of 14 rules in 5 ms. Remains 132 /140 variables (removed 8) and now considering 186/192 (removed 6) transitions.
// Phase 1: matrix 186 rows 132 cols
[2023-03-14 15:16:13] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-14 15:16:13] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-14 15:16:13] [INFO ] Invariant cache hit.
[2023-03-14 15:16:13] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2023-03-14 15:16:13] [INFO ] Invariant cache hit.
[2023-03-14 15:16:13] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/140 places, 186/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 592 ms. Remains : 132/140 places, 186/192 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s20 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 426 ms.
Stack based approach found an accepted trace after 102 steps with 0 reset with depth 103 and stack size 103 in 1 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-11 finished in 1252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G(p1)))'
Support contains 5 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 192/192 transitions.
Graph (trivial) has 79 edges and 140 vertex of which 42 / 140 are part of one of the 18 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 396 edges and 116 vertex of which 115 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 9 place count 108 transition count 137
Iterating global reduction 0 with 7 rules applied. Total rules applied 16 place count 108 transition count 137
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 108 transition count 136
Applied a total of 17 rules in 23 ms. Remains 108 /140 variables (removed 32) and now considering 136/192 (removed 56) transitions.
[2023-03-14 15:16:14] [INFO ] Flow matrix only has 119 transitions (discarded 17 similar events)
// Phase 1: matrix 119 rows 108 cols
[2023-03-14 15:16:14] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-14 15:16:14] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-14 15:16:14] [INFO ] Flow matrix only has 119 transitions (discarded 17 similar events)
[2023-03-14 15:16:14] [INFO ] Invariant cache hit.
[2023-03-14 15:16:14] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 15:16:15] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2023-03-14 15:16:15] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-14 15:16:15] [INFO ] Flow matrix only has 119 transitions (discarded 17 similar events)
[2023-03-14 15:16:15] [INFO ] Invariant cache hit.
[2023-03-14 15:16:15] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/140 places, 136/192 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 681 ms. Remains : 108/140 places, 136/192 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (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=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s48 1), p0:(OR (NOT (AND (EQ s45 1) (EQ s51 1))) (NOT (AND (EQ s30 1) (EQ s49 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-12 finished in 859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||(F(p2)&&F(G(p3)))))'
Support contains 5 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 192/192 transitions.
Graph (trivial) has 78 edges and 140 vertex of which 42 / 140 are part of one of the 18 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 396 edges and 116 vertex of which 114 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 108 transition count 138
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 108 transition count 138
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 108 transition count 136
Applied a total of 16 rules in 23 ms. Remains 108 /140 variables (removed 32) and now considering 136/192 (removed 56) transitions.
[2023-03-14 15:16:15] [INFO ] Flow matrix only has 119 transitions (discarded 17 similar events)
// Phase 1: matrix 119 rows 108 cols
[2023-03-14 15:16:15] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-14 15:16:15] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-14 15:16:15] [INFO ] Flow matrix only has 119 transitions (discarded 17 similar events)
[2023-03-14 15:16:15] [INFO ] Invariant cache hit.
[2023-03-14 15:16:15] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 15:16:15] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2023-03-14 15:16:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 15:16:15] [INFO ] Flow matrix only has 119 transitions (discarded 17 similar events)
[2023-03-14 15:16:15] [INFO ] Invariant cache hit.
[2023-03-14 15:16:16] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/140 places, 136/192 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 646 ms. Remains : 108/140 places, 136/192 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s74 1), p0:(AND (EQ s26 1) (EQ s68 1)), p2:(EQ s74 0), p3:(AND (EQ s30 1) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-13 finished in 919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 192/192 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 138 transition count 192
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 131 transition count 185
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 131 transition count 185
Applied a total of 16 rules in 6 ms. Remains 131 /140 variables (removed 9) and now considering 185/192 (removed 7) transitions.
// Phase 1: matrix 185 rows 131 cols
[2023-03-14 15:16:16] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-14 15:16:16] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-14 15:16:16] [INFO ] Invariant cache hit.
[2023-03-14 15:16:16] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-14 15:16:16] [INFO ] Invariant cache hit.
[2023-03-14 15:16:16] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/140 places, 185/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 567 ms. Remains : 131/140 places, 185/192 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s104 0), p0:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 754 ms.
Product exploration explored 100000 steps with 33333 reset in 498 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-1A-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-1A-LTLFireability-14 finished in 2270 ms.
All properties solved by simple procedures.
Total runtime 17544 ms.

BK_STOP 1678806979415

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-1A"
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-5348"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-1A, 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 r261-smll-167863536100228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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