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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
428.960 25487.00 43591.00 468.60 FTFFFFFFFFTFFFFF 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-167863536100276.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-4A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536100276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 10:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 10:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:11 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.3K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:21 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 144K 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-4A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678842659033

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-4A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-15 01:11:02] [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-15 01:11:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 01:11:02] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-15 01:11:02] [INFO ] Transformed 293 places.
[2023-03-15 01:11:02] [INFO ] Transformed 608 transitions.
[2023-03-15 01:11:02] [INFO ] Found NUPN structural information;
[2023-03-15 01:11:02] [INFO ] Parsed PT model containing 293 places and 608 transitions and 1905 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 155 transitions
Reduce redundant transitions removed 155 transitions.
FORMULA NoC3x3-PT-4A-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 453/453 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 243 transition count 373
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 243 transition count 373
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 142 place count 243 transition count 331
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 151 place count 234 transition count 331
Applied a total of 151 rules in 73 ms. Remains 234 /293 variables (removed 59) and now considering 331/453 (removed 122) transitions.
// Phase 1: matrix 331 rows 234 cols
[2023-03-15 01:11:02] [INFO ] Computed 57 place invariants in 27 ms
[2023-03-15 01:11:03] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-15 01:11:03] [INFO ] Invariant cache hit.
[2023-03-15 01:11:03] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
[2023-03-15 01:11:03] [INFO ] Invariant cache hit.
[2023-03-15 01:11:03] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/293 places, 331/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1262 ms. Remains : 234/293 places, 331/453 transitions.
Support contains 43 out of 234 places after structural reductions.
[2023-03-15 01:11:04] [INFO ] Flatten gal took : 84 ms
[2023-03-15 01:11:04] [INFO ] Flatten gal took : 38 ms
[2023-03-15 01:11:04] [INFO ] Input system was already deterministic with 331 transitions.
Support contains 40 out of 234 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 30) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 01:11:04] [INFO ] Invariant cache hit.
[2023-03-15 01:11:04] [INFO ] [Real]Absence check using 57 positive place invariants in 27 ms returned sat
[2023-03-15 01:11:05] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 01:11:05] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-15 01:11:05] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 01:11:05] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-15 01:11:05] [INFO ] After 454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 63 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=21 )
Parikh walk visited 2 properties in 13 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
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(G(p0)))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 228 transition count 325
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 228 transition count 325
Applied a total of 12 rules in 14 ms. Remains 228 /234 variables (removed 6) and now considering 325/331 (removed 6) transitions.
// Phase 1: matrix 325 rows 228 cols
[2023-03-15 01:11:05] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 01:11:06] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-15 01:11:06] [INFO ] Invariant cache hit.
[2023-03-15 01:11:06] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2023-03-15 01:11:06] [INFO ] Invariant cache hit.
[2023-03-15 01:11:06] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/234 places, 325/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 863 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-00 automaton TGBA Formula[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 (NEQ s193 1) (NEQ s203 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][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 673 ms.
Entered a terminal (fully accepting) state of product in 67803 steps with 0 reset in 412 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-00 finished in 2255 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(X(F(p0))))))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Graph (trivial) has 137 edges and 234 vertex of which 73 / 234 are part of one of the 32 SCC in 3 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 183 transition count 217
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 159 transition count 217
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 71 place count 154 transition count 212
Iterating global reduction 2 with 5 rules applied. Total rules applied 76 place count 154 transition count 212
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 100 place count 154 transition count 188
Applied a total of 100 rules in 40 ms. Remains 154 /234 variables (removed 80) and now considering 188/331 (removed 143) transitions.
// Phase 1: matrix 188 rows 154 cols
[2023-03-15 01:11:08] [INFO ] Computed 48 place invariants in 3 ms
[2023-03-15 01:11:08] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-15 01:11:08] [INFO ] Invariant cache hit.
[2023-03-15 01:11:08] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-15 01:11:08] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-15 01:11:08] [INFO ] Redundant transitions in 91 ms returned []
[2023-03-15 01:11:08] [INFO ] Invariant cache hit.
[2023-03-15 01:11:08] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/234 places, 188/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 620 ms. Remains : 154/234 places, 188/331 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s28 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 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-02 finished in 676 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(G((G((X(p2)||p1))||p0))))'
Support contains 5 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 228 transition count 325
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 228 transition count 325
Applied a total of 12 rules in 11 ms. Remains 228 /234 variables (removed 6) and now considering 325/331 (removed 6) transitions.
// Phase 1: matrix 325 rows 228 cols
[2023-03-15 01:11:08] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 01:11:08] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-15 01:11:08] [INFO ] Invariant cache hit.
[2023-03-15 01:11:09] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2023-03-15 01:11:09] [INFO ] Invariant cache hit.
[2023-03-15 01:11:09] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/234 places, 325/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 820 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(EQ s119 1), p1:(OR (EQ s144 0) (EQ s159 0)), p0:(OR (EQ s119 1) (AND (EQ s112 1) (EQ s131 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-03 finished in 1047 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((G(F(p0)) U p1)))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 228 transition count 325
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 228 transition count 325
Applied a total of 12 rules in 9 ms. Remains 228 /234 variables (removed 6) and now considering 325/331 (removed 6) transitions.
[2023-03-15 01:11:09] [INFO ] Invariant cache hit.
[2023-03-15 01:11:10] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-15 01:11:10] [INFO ] Invariant cache hit.
[2023-03-15 01:11:10] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
[2023-03-15 01:11:10] [INFO ] Invariant cache hit.
[2023-03-15 01:11:10] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/234 places, 325/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 834 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s41 1), p0:(EQ s11 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][false, false, false, false]]
Product exploration explored 100000 steps with 161 reset in 472 ms.
Stack based approach found an accepted trace after 144 steps with 1 reset with depth 100 and stack size 100 in 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-04 finished in 1521 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||G(p1)))))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Graph (trivial) has 134 edges and 234 vertex of which 72 / 234 are part of one of the 32 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 189 transition count 247
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 189 transition count 247
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 189 transition count 245
Applied a total of 13 rules in 25 ms. Remains 189 /234 variables (removed 45) and now considering 245/331 (removed 86) transitions.
[2023-03-15 01:11:11] [INFO ] Flow matrix only has 214 transitions (discarded 31 similar events)
// Phase 1: matrix 214 rows 189 cols
[2023-03-15 01:11:11] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-15 01:11:11] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-15 01:11:11] [INFO ] Flow matrix only has 214 transitions (discarded 31 similar events)
[2023-03-15 01:11:11] [INFO ] Invariant cache hit.
[2023-03-15 01:11:11] [INFO ] State equation strengthened by 101 read => feed constraints.
[2023-03-15 01:11:11] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2023-03-15 01:11:11] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-15 01:11:11] [INFO ] Flow matrix only has 214 transitions (discarded 31 similar events)
[2023-03-15 01:11:11] [INFO ] Invariant cache hit.
[2023-03-15 01:11:12] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 189/234 places, 245/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 811 ms. Remains : 189/234 places, 245/331 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s53 1), p0:(AND (EQ s128 1) (EQ s182 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-05 finished in 910 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) U X((G(p1) U p2))))'
Support contains 5 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 229 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 229 transition count 326
Applied a total of 10 rules in 7 ms. Remains 229 /234 variables (removed 5) and now considering 326/331 (removed 5) transitions.
// Phase 1: matrix 326 rows 229 cols
[2023-03-15 01:11:12] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-15 01:11:12] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-15 01:11:12] [INFO ] Invariant cache hit.
[2023-03-15 01:11:12] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2023-03-15 01:11:12] [INFO ] Invariant cache hit.
[2023-03-15 01:11:13] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/234 places, 326/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 794 ms. Remains : 229/234 places, 326/331 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s201 1), p2:(AND (EQ s199 1) (EQ s213 1)), p1:(AND (EQ s133 1) (EQ s159 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-06 finished in 1080 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&&(G(p1) U p2)&&X(p3))))'
Support contains 7 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 229 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 229 transition count 326
Applied a total of 10 rules in 6 ms. Remains 229 /234 variables (removed 5) and now considering 326/331 (removed 5) transitions.
// Phase 1: matrix 326 rows 229 cols
[2023-03-15 01:11:13] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 01:11:13] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-15 01:11:13] [INFO ] Invariant cache hit.
[2023-03-15 01:11:13] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2023-03-15 01:11:13] [INFO ] Invariant cache hit.
[2023-03-15 01:11:14] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/234 places, 326/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 692 ms. Remains : 229/234 places, 326/331 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}]], initial=0, aps=[p0:(EQ s60 0), p2:(AND (EQ s219 1) (EQ s226 1)), p1:(AND (EQ s3 1) (EQ s13 1)), p3:(OR (EQ s184 0) (EQ s199 0))], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-07 finished in 976 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) U X(X(X(X(G(p1)))))))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 229 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 229 transition count 326
Applied a total of 10 rules in 7 ms. Remains 229 /234 variables (removed 5) and now considering 326/331 (removed 5) transitions.
// Phase 1: matrix 326 rows 229 cols
[2023-03-15 01:11:14] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-15 01:11:14] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-15 01:11:14] [INFO ] Invariant cache hit.
[2023-03-15 01:11:14] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2023-03-15 01:11:14] [INFO ] Invariant cache hit.
[2023-03-15 01:11:14] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/234 places, 326/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 615 ms. Remains : 229/234 places, 326/331 transitions.
Stuttering acceptance computed with spot in 384 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 10}], [{ cond=(NOT p0), acceptance={} source=9 dest: 0}, { cond=p0, acceptance={} source=9 dest: 1}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 5}, { cond=(AND p0 p1), acceptance={} source=10 dest: 10}]], initial=9, aps=[p0:(AND (EQ s185 1) (EQ s222 1)), p1:(NEQ s89 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-08 finished in 1035 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&&F(G(p1)))))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Graph (trivial) has 133 edges and 234 vertex of which 70 / 234 are part of one of the 31 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 186 transition count 224
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 60 place count 164 transition count 224
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 158 transition count 218
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 158 transition count 218
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 98 place count 158 transition count 192
Applied a total of 98 rules in 25 ms. Remains 158 /234 variables (removed 76) and now considering 192/331 (removed 139) transitions.
// Phase 1: matrix 192 rows 158 cols
[2023-03-15 01:11:15] [INFO ] Computed 49 place invariants in 1 ms
[2023-03-15 01:11:15] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-15 01:11:15] [INFO ] Invariant cache hit.
[2023-03-15 01:11:15] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-15 01:11:15] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-03-15 01:11:15] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-15 01:11:15] [INFO ] Invariant cache hit.
[2023-03-15 01:11:16] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/234 places, 192/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 719 ms. Remains : 158/234 places, 192/331 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s29 0), p1:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-09 finished in 883 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((G(p0)||G(F(p1))||(p2&&F(p1))))))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 228 transition count 325
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 228 transition count 325
Applied a total of 12 rules in 6 ms. Remains 228 /234 variables (removed 6) and now considering 325/331 (removed 6) transitions.
// Phase 1: matrix 325 rows 228 cols
[2023-03-15 01:11:16] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-15 01:11:16] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-15 01:11:16] [INFO ] Invariant cache hit.
[2023-03-15 01:11:16] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-15 01:11:16] [INFO ] Invariant cache hit.
[2023-03-15 01:11:16] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/234 places, 325/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 657 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p2:(NEQ s86 1), p0:(EQ s10 0), p1:(NEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 857 ms.
Product exploration explored 100000 steps with 50000 reset in 788 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 p2 p0 p1), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))))
Knowledge based reduction with 7 factoid took 139 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-4A-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-4A-LTLFireability-10 finished in 2627 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((G(!p0) U (G(!p0)&&p1))))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 228 transition count 325
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 228 transition count 325
Applied a total of 12 rules in 6 ms. Remains 228 /234 variables (removed 6) and now considering 325/331 (removed 6) transitions.
[2023-03-15 01:11:18] [INFO ] Invariant cache hit.
[2023-03-15 01:11:19] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-15 01:11:19] [INFO ] Invariant cache hit.
[2023-03-15 01:11:19] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2023-03-15 01:11:19] [INFO ] Invariant cache hit.
[2023-03-15 01:11:19] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/234 places, 325/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 693 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 148 ms :[p0, (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s131 1) (EQ s61 1)), p1:(AND (EQ s146 1) (EQ s149 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 22 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-11 finished in 861 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(F(!p1)))))))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 228 transition count 325
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 228 transition count 325
Applied a total of 12 rules in 5 ms. Remains 228 /234 variables (removed 6) and now considering 325/331 (removed 6) transitions.
[2023-03-15 01:11:19] [INFO ] Invariant cache hit.
[2023-03-15 01:11:19] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-15 01:11:19] [INFO ] Invariant cache hit.
[2023-03-15 01:11:20] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2023-03-15 01:11:20] [INFO ] Invariant cache hit.
[2023-03-15 01:11:20] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/234 places, 325/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 787 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s223 1), p1:(NEQ s10 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][false, false]]
Product exploration explored 100000 steps with 540 reset in 392 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-12 finished in 1278 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 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Graph (trivial) has 137 edges and 234 vertex of which 73 / 234 are part of one of the 32 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 183 transition count 217
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 159 transition count 217
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 153 transition count 211
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 153 transition count 211
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 102 place count 153 transition count 187
Applied a total of 102 rules in 24 ms. Remains 153 /234 variables (removed 81) and now considering 187/331 (removed 144) transitions.
// Phase 1: matrix 187 rows 153 cols
[2023-03-15 01:11:21] [INFO ] Computed 48 place invariants in 2 ms
[2023-03-15 01:11:21] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-15 01:11:21] [INFO ] Invariant cache hit.
[2023-03-15 01:11:21] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-15 01:11:21] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-15 01:11:21] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-15 01:11:21] [INFO ] Invariant cache hit.
[2023-03-15 01:11:21] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/234 places, 187/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 642 ms. Remains : 153/234 places, 187/331 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-13 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 s150 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-13 finished in 702 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((G(F(p0))&&(F(G(p1)) U G(!p2)))))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 229 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 229 transition count 326
Applied a total of 10 rules in 6 ms. Remains 229 /234 variables (removed 5) and now considering 326/331 (removed 5) transitions.
// Phase 1: matrix 326 rows 229 cols
[2023-03-15 01:11:21] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-15 01:11:21] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-15 01:11:21] [INFO ] Invariant cache hit.
[2023-03-15 01:11:22] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2023-03-15 01:11:22] [INFO ] Invariant cache hit.
[2023-03-15 01:11:22] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/234 places, 326/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 906 ms. Remains : 229/234 places, 326/331 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p0), (NOT p1), p2]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=p2, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s202 1) (EQ s205 1)), p2:(AND (EQ s59 1) (EQ s148 1)), p1:(EQ s205 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 536 ms.
Stack based approach found an accepted trace after 44 steps with 0 reset with depth 45 and stack size 45 in 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-14 finished in 1728 ms.
All properties solved by simple procedures.
Total runtime 21395 ms.

BK_STOP 1678842684520

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

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