Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372700378.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r263-tall-171654372700378
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 07:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 07:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 07:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 07:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 144K May 18 16:43 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 1716690681849

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=gold2023
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 202304061127
[2024-05-26 02:31:23] [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]
[2024-05-26 02:31:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:31:23] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-26 02:31:23] [INFO ] Transformed 293 places.
[2024-05-26 02:31:23] [INFO ] Transformed 608 transitions.
[2024-05-26 02:31:23] [INFO ] Found NUPN structural information;
[2024-05-26 02:31:23] [INFO ] Parsed PT model containing 293 places and 608 transitions and 1905 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 155 transitions
Reduce redundant transitions removed 155 transitions.
FORMULA NoC3x3-PT-4A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 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 43 ms. Remains 234 /293 variables (removed 59) and now considering 331/453 (removed 122) transitions.
// Phase 1: matrix 331 rows 234 cols
[2024-05-26 02:31:23] [INFO ] Computed 57 invariants in 19 ms
[2024-05-26 02:31:24] [INFO ] Implicit Places using invariants in 840 ms returned []
[2024-05-26 02:31:24] [INFO ] Invariant cache hit.
[2024-05-26 02:31:24] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
[2024-05-26 02:31:24] [INFO ] Invariant cache hit.
[2024-05-26 02:31:24] [INFO ] Dead Transitions using invariants and state equation in 155 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 1277 ms. Remains : 234/293 places, 331/453 transitions.
Support contains 42 out of 234 places after structural reductions.
[2024-05-26 02:31:25] [INFO ] Flatten gal took : 55 ms
[2024-05-26 02:31:25] [INFO ] Flatten gal took : 24 ms
[2024-05-26 02:31:25] [INFO ] Input system was already deterministic with 331 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 28) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-26 02:31:25] [INFO ] Invariant cache hit.
[2024-05-26 02:31:25] [INFO ] [Real]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-05-26 02:31:25] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 02:31:25] [INFO ] [Nat]Absence check using 57 positive place invariants in 10 ms returned sat
[2024-05-26 02:31:26] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 02:31:26] [INFO ] After 209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-26 02:31:26] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 141 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=70 )
Parikh walk visited 3 properties in 10 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NoC3x3-PT-4A-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U G(p1))||G(F(p2))))'
Support contains 5 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 131 edges and 234 vertex of which 70 / 234 are part of one of the 31 SCC in 3 ms
Free SCC test removed 39 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 190 transition count 249
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 190 transition count 249
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 190 transition count 246
Applied a total of 14 rules in 32 ms. Remains 190 /234 variables (removed 44) and now considering 246/331 (removed 85) transitions.
[2024-05-26 02:31:26] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
// Phase 1: matrix 216 rows 190 cols
[2024-05-26 02:31:26] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 02:31:26] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-26 02:31:26] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
[2024-05-26 02:31:26] [INFO ] Invariant cache hit.
[2024-05-26 02:31:26] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-05-26 02:31:26] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-26 02:31:26] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-26 02:31:26] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
[2024-05-26 02:31:26] [INFO ] Invariant cache hit.
[2024-05-26 02:31:27] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 190/234 places, 246/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 510 ms. Remains : 190/234 places, 246/331 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 453 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(NOT p1), acceptance={} source=7 dest: 2}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s134 1), p1:(AND (EQ s113 1) (EQ s130 1)), p2:(OR (EQ s85 0) (EQ s129 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 425 steps with 0 reset in 12 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-01 finished in 1040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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 138 edges and 234 vertex of which 75 / 234 are part of one of the 33 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 187 transition count 243
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 187 transition count 243
Applied a total of 11 rules in 18 ms. Remains 187 /234 variables (removed 47) and now considering 243/331 (removed 88) transitions.
[2024-05-26 02:31:27] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
// Phase 1: matrix 211 rows 187 cols
[2024-05-26 02:31:27] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 02:31:27] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-26 02:31:27] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
[2024-05-26 02:31:27] [INFO ] Invariant cache hit.
[2024-05-26 02:31:27] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-05-26 02:31:27] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-05-26 02:31:27] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-26 02:31:27] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
[2024-05-26 02:31:27] [INFO ] Invariant cache hit.
[2024-05-26 02:31:27] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 187/234 places, 243/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 445 ms. Remains : 187/234 places, 243/331 transitions.
Stuttering acceptance computed with spot in 31 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 s72 1) (EQ s91 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 1 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 494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X((G(p1) U (p2||(p2 U p3))))))))'
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 230 transition count 327
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 230 transition count 327
Applied a total of 8 rules in 13 ms. Remains 230 /234 variables (removed 4) and now considering 327/331 (removed 4) transitions.
// Phase 1: matrix 327 rows 230 cols
[2024-05-26 02:31:28] [INFO ] Computed 57 invariants in 7 ms
[2024-05-26 02:31:28] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-26 02:31:28] [INFO ] Invariant cache hit.
[2024-05-26 02:31:28] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-05-26 02:31:28] [INFO ] Invariant cache hit.
[2024-05-26 02:31:28] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/234 places, 327/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 439 ms. Remains : 230/234 places, 327/331 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s88 0) (EQ s108 0)), p2:(AND (EQ s69 1) (EQ s87 1)), p3:(AND (EQ s52 1) (EQ s61 1)), p1:(AND (EQ s88 1) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-04 finished in 708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 5 ms. Remains 228 /234 variables (removed 6) and now considering 325/331 (removed 6) transitions.
// Phase 1: matrix 325 rows 228 cols
[2024-05-26 02:31:28] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 02:31:28] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-26 02:31:28] [INFO ] Invariant cache hit.
[2024-05-26 02:31:29] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-05-26 02:31:29] [INFO ] Invariant cache hit.
[2024-05-26 02:31:29] [INFO ] Dead Transitions using invariants and state equation in 143 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 454 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-06 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 s182 1) (NEQ s197 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 46 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-06 finished in 570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
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 133 edges and 234 vertex of which 71 / 234 are part of one of the 32 SCC in 0 ms
Free SCC test removed 39 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 189 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 189 transition count 248
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 189 transition count 246
Applied a total of 15 rules in 27 ms. Remains 189 /234 variables (removed 45) and now considering 246/331 (removed 85) transitions.
[2024-05-26 02:31:29] [INFO ] Flow matrix only has 215 transitions (discarded 31 similar events)
// Phase 1: matrix 215 rows 189 cols
[2024-05-26 02:31:29] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 02:31:29] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-26 02:31:29] [INFO ] Flow matrix only has 215 transitions (discarded 31 similar events)
[2024-05-26 02:31:29] [INFO ] Invariant cache hit.
[2024-05-26 02:31:29] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-26 02:31:29] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-05-26 02:31:29] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-26 02:31:29] [INFO ] Flow matrix only has 215 transitions (discarded 31 similar events)
[2024-05-26 02:31:29] [INFO ] Invariant cache hit.
[2024-05-26 02:31:29] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 189/234 places, 246/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 555 ms. Remains : 189/234 places, 246/331 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s148 1) (AND (EQ s26 1) (EQ s38 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 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 623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U p1)&&F(p2))))'
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 130 edges and 234 vertex of which 68 / 234 are part of one of the 30 SCC in 1 ms
Free SCC test removed 38 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 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 187 transition count 226
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 60 place count 165 transition count 226
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 159 transition count 220
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 159 transition count 220
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 159 transition count 194
Applied a total of 98 rules in 24 ms. Remains 159 /234 variables (removed 75) and now considering 194/331 (removed 137) transitions.
// Phase 1: matrix 194 rows 159 cols
[2024-05-26 02:31:29] [INFO ] Computed 49 invariants in 2 ms
[2024-05-26 02:31:30] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-26 02:31:30] [INFO ] Invariant cache hit.
[2024-05-26 02:31:30] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 02:31:30] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2024-05-26 02:31:30] [INFO ] Redundant transitions in 74 ms returned []
[2024-05-26 02:31:30] [INFO ] Invariant cache hit.
[2024-05-26 02:31:30] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/234 places, 194/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 442 ms. Remains : 159/234 places, 194/331 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p2) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(EQ s125 1), p2:(EQ s83 1), p1:(AND (EQ s38 1) (EQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 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 722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(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 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 8 ms. Remains 229 /234 variables (removed 5) and now considering 326/331 (removed 5) transitions.
// Phase 1: matrix 326 rows 229 cols
[2024-05-26 02:31:30] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 02:31:30] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-26 02:31:30] [INFO ] Invariant cache hit.
[2024-05-26 02:31:30] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-05-26 02:31:30] [INFO ] Invariant cache hit.
[2024-05-26 02:31:31] [INFO ] Dead Transitions using invariants and state equation in 126 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 406 ms. Remains : 229/234 places, 326/331 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
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=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s30 0) (EQ s36 0)), p1:(AND (EQ s183 1) (EQ s222 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 424 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-09 finished in 980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(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 71 / 234 are part of one of the 31 SCC in 0 ms
Free SCC test removed 40 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 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 184 transition count 219
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 160 transition count 219
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 71 place count 155 transition count 214
Iterating global reduction 2 with 5 rules applied. Total rules applied 76 place count 155 transition count 214
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 155 transition count 190
Applied a total of 100 rules in 22 ms. Remains 155 /234 variables (removed 79) and now considering 190/331 (removed 141) transitions.
// Phase 1: matrix 190 rows 155 cols
[2024-05-26 02:31:31] [INFO ] Computed 48 invariants in 1 ms
[2024-05-26 02:31:31] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-26 02:31:31] [INFO ] Invariant cache hit.
[2024-05-26 02:31:31] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-26 02:31:31] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-26 02:31:31] [INFO ] Redundant transitions in 56 ms returned []
[2024-05-26 02:31:31] [INFO ] Invariant cache hit.
[2024-05-26 02:31:32] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/234 places, 190/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 384 ms. Remains : 155/234 places, 190/331 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s26 0)), p1:(EQ s90 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-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-10 finished in 525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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
[2024-05-26 02:31:32] [INFO ] Computed 48 invariants in 2 ms
[2024-05-26 02:31:32] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-26 02:31:32] [INFO ] Invariant cache hit.
[2024-05-26 02:31:32] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-26 02:31:32] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-26 02:31:32] [INFO ] Redundant transitions in 54 ms returned []
[2024-05-26 02:31:32] [INFO ] Invariant cache hit.
[2024-05-26 02:31:32] [INFO ] Dead Transitions using invariants and state equation in 94 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 375 ms. Remains : 153/234 places, 187/331 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-11 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 s7 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 376 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-11 finished in 428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||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 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
[2024-05-26 02:31:32] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 02:31:32] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-26 02:31:32] [INFO ] Invariant cache hit.
[2024-05-26 02:31:32] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-05-26 02:31:32] [INFO ] Invariant cache hit.
[2024-05-26 02:31:32] [INFO ] Dead Transitions using invariants and state equation in 119 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 391 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s128 1), p0:(AND (EQ s138 1) (EQ s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-12 finished in 515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (p1 U p2))))'
Support contains 6 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 4 ms. Remains 228 /234 variables (removed 6) and now considering 325/331 (removed 6) transitions.
[2024-05-26 02:31:33] [INFO ] Invariant cache hit.
[2024-05-26 02:31:33] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-26 02:31:33] [INFO ] Invariant cache hit.
[2024-05-26 02:31:33] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-05-26 02:31:33] [INFO ] Invariant cache hit.
[2024-05-26 02:31:33] [INFO ] Dead Transitions using invariants and state equation in 137 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 391 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (NOT p2), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s47 1) (EQ s58 1)), p1:(AND (EQ s94 1) (EQ s131 1)), p0:(AND (EQ s217 1) (EQ s222 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 29 reset in 406 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-13 finished in 959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(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 74 / 234 are part of one of the 33 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 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 184 transition count 221
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 58 place count 163 transition count 221
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 157 transition count 215
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 157 transition count 215
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 95 place count 157 transition count 190
Applied a total of 95 rules in 19 ms. Remains 157 /234 variables (removed 77) and now considering 190/331 (removed 141) transitions.
// Phase 1: matrix 190 rows 157 cols
[2024-05-26 02:31:34] [INFO ] Computed 49 invariants in 2 ms
[2024-05-26 02:31:34] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-26 02:31:34] [INFO ] Invariant cache hit.
[2024-05-26 02:31:34] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-26 02:31:34] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-26 02:31:34] [INFO ] Redundant transitions in 55 ms returned []
[2024-05-26 02:31:34] [INFO ] Invariant cache hit.
[2024-05-26 02:31:34] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/234 places, 190/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 375 ms. Remains : 157/234 places, 190/331 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s143 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-14 finished in 466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(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.
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 185 transition count 222
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 60 place count 163 transition count 222
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 157 transition count 216
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 157 transition count 216
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 97 place count 157 transition count 191
Applied a total of 97 rules in 16 ms. Remains 157 /234 variables (removed 77) and now considering 191/331 (removed 140) transitions.
// Phase 1: matrix 191 rows 157 cols
[2024-05-26 02:31:34] [INFO ] Computed 49 invariants in 2 ms
[2024-05-26 02:31:34] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-26 02:31:34] [INFO ] Invariant cache hit.
[2024-05-26 02:31:34] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-26 02:31:34] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-26 02:31:34] [INFO ] Redundant transitions in 57 ms returned []
[2024-05-26 02:31:34] [INFO ] Invariant cache hit.
[2024-05-26 02:31:34] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/234 places, 191/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 389 ms. Remains : 157/234 places, 191/331 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s137 0), p1:(OR (EQ s145 0) (EQ s155 0))], nbAcceptance=2, 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 1123 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-15 finished in 445 ms.
All properties solved by simple procedures.
Total runtime 11696 ms.

BK_STOP 1716690695904

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r263-tall-171654372700378"
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 ;