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.r265-smll-167863539800276.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 ltsminxred
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 r265-smll-167863539800276
=====================================================================

--------------------
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 1678899329006

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-4A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 16:55:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 16:55:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 16:55:31] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2023-03-15 16:55:31] [INFO ] Transformed 293 places.
[2023-03-15 16:55:31] [INFO ] Transformed 608 transitions.
[2023-03-15 16:55:31] [INFO ] Found NUPN structural information;
[2023-03-15 16:55:31] [INFO ] Parsed PT model containing 293 places and 608 transitions and 1905 arcs in 320 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 88 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 16:55:32] [INFO ] Computed 57 place invariants in 16 ms
[2023-03-15 16:55:32] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-03-15 16:55:32] [INFO ] Invariant cache hit.
[2023-03-15 16:55:33] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
[2023-03-15 16:55:33] [INFO ] Invariant cache hit.
[2023-03-15 16:55:33] [INFO ] Dead Transitions using invariants and state equation in 277 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 1599 ms. Remains : 234/293 places, 331/453 transitions.
Support contains 43 out of 234 places after structural reductions.
[2023-03-15 16:55:34] [INFO ] Flatten gal took : 82 ms
[2023-03-15 16:55:34] [INFO ] Flatten gal took : 38 ms
[2023-03-15 16:55:34] [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 576 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 16:55:34] [INFO ] Invariant cache hit.
[2023-03-15 16:55:35] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-15 16:55:35] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 16:55:35] [INFO ] [Nat]Absence check using 57 positive place invariants in 15 ms returned sat
[2023-03-15 16:55:35] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 16:55:35] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-15 16:55:35] [INFO ] After 429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 7 ms.
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 4 ms
Free SCC test removed 41 places
Drop transitions removed 90 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 113 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 188 transition count 213
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 188 transition count 213
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 188 transition count 212
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 34 place count 188 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 187 transition count 211
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 33 rules applied. Total rules applied 68 place count 178 transition count 187
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 92 place count 154 transition count 187
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 154 transition count 187
Applied a total of 94 rules in 75 ms. Remains 154 /234 variables (removed 80) and now considering 187/331 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 154/234 places, 187/331 transitions.
Finished random walk after 891 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=63 )
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 13 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 16:55:36] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 16:55:36] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-15 16:55:36] [INFO ] Invariant cache hit.
[2023-03-15 16:55:36] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2023-03-15 16:55:36] [INFO ] Invariant cache hit.
[2023-03-15 16:55:36] [INFO ] Dead Transitions using invariants and state equation in 232 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 747 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 314 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]]
Entered a terminal (fully accepting) state of product in 1581 steps with 0 reset in 37 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-00 finished in 1171 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 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 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 56 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 16:55:37] [INFO ] Computed 48 place invariants in 3 ms
[2023-03-15 16:55:37] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-15 16:55:37] [INFO ] Invariant cache hit.
[2023-03-15 16:55:37] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-15 16:55:37] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2023-03-15 16:55:37] [INFO ] Redundant transitions in 116 ms returned []
[2023-03-15 16:55:37] [INFO ] Invariant cache hit.
[2023-03-15 16:55:37] [INFO ] Dead Transitions using invariants and state equation in 160 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 760 ms. Remains : 154/234 places, 188/331 transitions.
Stuttering acceptance computed with spot in 39 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 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-02 finished in 815 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 9 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 16:55:38] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-15 16:55:38] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-15 16:55:38] [INFO ] Invariant cache hit.
[2023-03-15 16:55:38] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2023-03-15 16:55:38] [INFO ] Invariant cache hit.
[2023-03-15 16:55:38] [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 858 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 198 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 10 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 1079 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 7 ms. Remains 228 /234 variables (removed 6) and now considering 325/331 (removed 6) transitions.
[2023-03-15 16:55:39] [INFO ] Invariant cache hit.
[2023-03-15 16:55:39] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-15 16:55:39] [INFO ] Invariant cache hit.
[2023-03-15 16:55:39] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-15 16:55:39] [INFO ] Invariant cache hit.
[2023-03-15 16:55:39] [INFO ] Dead Transitions using invariants and state equation in 245 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 711 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 168 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 261 reset in 695 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-04 finished in 1600 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 0 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 26 ms. Remains 189 /234 variables (removed 45) and now considering 245/331 (removed 86) transitions.
[2023-03-15 16:55:40] [INFO ] Flow matrix only has 214 transitions (discarded 31 similar events)
// Phase 1: matrix 214 rows 189 cols
[2023-03-15 16:55:40] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-15 16:55:40] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-15 16:55:40] [INFO ] Flow matrix only has 214 transitions (discarded 31 similar events)
[2023-03-15 16:55:40] [INFO ] Invariant cache hit.
[2023-03-15 16:55:41] [INFO ] State equation strengthened by 101 read => feed constraints.
[2023-03-15 16:55:41] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
[2023-03-15 16:55:41] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-15 16:55:41] [INFO ] Flow matrix only has 214 transitions (discarded 31 similar events)
[2023-03-15 16:55:41] [INFO ] Invariant cache hit.
[2023-03-15 16:55:41] [INFO ] Dead Transitions using invariants and state equation in 191 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 943 ms. Remains : 189/234 places, 245/331 transitions.
Stuttering acceptance computed with spot in 85 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 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' '!((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 16:55:41] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 16:55:41] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-15 16:55:41] [INFO ] Invariant cache hit.
[2023-03-15 16:55:42] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-15 16:55:42] [INFO ] Invariant cache hit.
[2023-03-15 16:55:42] [INFO ] Dead Transitions using invariants and state equation in 225 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 699 ms. Remains : 229/234 places, 326/331 transitions.
Stuttering acceptance computed with spot in 298 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 1026 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 10 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 16:55:42] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-15 16:55:42] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-15 16:55:42] [INFO ] Invariant cache hit.
[2023-03-15 16:55:43] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2023-03-15 16:55:43] [INFO ] Invariant cache hit.
[2023-03-15 16:55:43] [INFO ] Dead Transitions using invariants and state equation in 251 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 709 ms. Remains : 229/234 places, 326/331 transitions.
Stuttering acceptance computed with spot in 252 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 984 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 16:55:43] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-15 16:55:43] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-15 16:55:43] [INFO ] Invariant cache hit.
[2023-03-15 16:55:44] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-15 16:55:44] [INFO ] Invariant cache hit.
[2023-03-15 16:55:44] [INFO ] Dead Transitions using invariants and state equation in 240 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 707 ms. Remains : 229/234 places, 326/331 transitions.
Stuttering acceptance computed with spot in 423 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 549 steps with 0 reset in 5 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-08 finished in 1162 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 28 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 16:55:44] [INFO ] Computed 49 place invariants in 2 ms
[2023-03-15 16:55:45] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-15 16:55:45] [INFO ] Invariant cache hit.
[2023-03-15 16:55:45] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-15 16:55:45] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-15 16:55:45] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-15 16:55:45] [INFO ] Invariant cache hit.
[2023-03-15 16:55:45] [INFO ] Dead Transitions using invariants and state equation in 156 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 685 ms. Remains : 158/234 places, 192/331 transitions.
Stuttering acceptance computed with spot in 121 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 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-09 finished in 823 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 5 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 16:55:45] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 16:55:45] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-15 16:55:45] [INFO ] Invariant cache hit.
[2023-03-15 16:55:46] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-15 16:55:46] [INFO ] Invariant cache hit.
[2023-03-15 16:55:46] [INFO ] Dead Transitions using invariants and state equation in 220 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 686 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 123 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 846 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 (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))))]
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 146 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 2691 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 5 ms. Remains 228 /234 variables (removed 6) and now considering 325/331 (removed 6) transitions.
[2023-03-15 16:55:48] [INFO ] Invariant cache hit.
[2023-03-15 16:55:48] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-15 16:55:48] [INFO ] Invariant cache hit.
[2023-03-15 16:55:48] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2023-03-15 16:55:48] [INFO ] Invariant cache hit.
[2023-03-15 16:55:49] [INFO ] Dead Transitions using invariants and state equation in 246 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 723 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 128 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 8 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 866 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 8 ms. Remains 228 /234 variables (removed 6) and now considering 325/331 (removed 6) transitions.
[2023-03-15 16:55:49] [INFO ] Invariant cache hit.
[2023-03-15 16:55:49] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-15 16:55:49] [INFO ] Invariant cache hit.
[2023-03-15 16:55:49] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-15 16:55:49] [INFO ] Invariant cache hit.
[2023-03-15 16:55:49] [INFO ] Dead Transitions using invariants and state equation in 246 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 723 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 75 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 523 reset in 405 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-12 finished in 1221 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 0 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 20 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 16:55:50] [INFO ] Computed 48 place invariants in 1 ms
[2023-03-15 16:55:50] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-15 16:55:50] [INFO ] Invariant cache hit.
[2023-03-15 16:55:50] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-15 16:55:50] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2023-03-15 16:55:50] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-15 16:55:50] [INFO ] Invariant cache hit.
[2023-03-15 16:55:51] [INFO ] Dead Transitions using invariants and state equation in 126 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 581 ms. Remains : 153/234 places, 187/331 transitions.
Stuttering acceptance computed with spot in 40 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 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-13 finished in 636 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 5 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 16:55:51] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 16:55:51] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-15 16:55:51] [INFO ] Invariant cache hit.
[2023-03-15 16:55:51] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-03-15 16:55:51] [INFO ] Invariant cache hit.
[2023-03-15 16:55:51] [INFO ] Dead Transitions using invariants and state equation in 218 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 677 ms. Remains : 229/234 places, 326/331 transitions.
Stuttering acceptance computed with spot in 245 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 0 reset in 347 ms.
Stack based approach found an accepted trace after 4330 steps with 0 reset with depth 4331 and stack size 4164 in 20 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-14 finished in 1318 ms.
All properties solved by simple procedures.
Total runtime 20912 ms.
ITS solved all properties within timeout

BK_STOP 1678899353463

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="ltsminxred"
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 ltsminxred"
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 r265-smll-167863539800276"
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 ;