About the Execution of 2023-gold for NoC3x3-PT-1B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
368.899 | 18059.00 | 32175.00 | 389.80 | FFFTFFFFFFFFFFFF | normal |
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-171654372600353.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-1B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372600353
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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 May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 12 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 07:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 07:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 362K 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-1B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716689467836
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-1B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 02:11:09] [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:11:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:11:09] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-26 02:11:09] [INFO ] Transformed 1416 places.
[2024-05-26 02:11:09] [INFO ] Transformed 1640 transitions.
[2024-05-26 02:11:09] [INFO ] Found NUPN structural information;
[2024-05-26 02:11:09] [INFO ] Parsed PT model containing 1416 places and 1640 transitions and 3639 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA NoC3x3-PT-1B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Discarding 351 places :
Symmetric choice reduction at 0 with 351 rule applications. Total rules 351 place count 1065 transition count 1289
Iterating global reduction 0 with 351 rules applied. Total rules applied 702 place count 1065 transition count 1289
Discarding 193 places :
Symmetric choice reduction at 0 with 193 rule applications. Total rules 895 place count 872 transition count 1096
Iterating global reduction 0 with 193 rules applied. Total rules applied 1088 place count 872 transition count 1096
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 0 with 81 rules applied. Total rules applied 1169 place count 872 transition count 1015
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 1206 place count 835 transition count 978
Iterating global reduction 1 with 37 rules applied. Total rules applied 1243 place count 835 transition count 978
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1261 place count 835 transition count 960
Applied a total of 1261 rules in 285 ms. Remains 835 /1416 variables (removed 581) and now considering 960/1640 (removed 680) transitions.
// Phase 1: matrix 960 rows 835 cols
[2024-05-26 02:11:10] [INFO ] Computed 40 invariants in 33 ms
[2024-05-26 02:11:10] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-26 02:11:10] [INFO ] Invariant cache hit.
[2024-05-26 02:11:11] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
[2024-05-26 02:11:11] [INFO ] Invariant cache hit.
[2024-05-26 02:11:11] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 835/1416 places, 960/1640 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1861 ms. Remains : 835/1416 places, 960/1640 transitions.
Support contains 37 out of 835 places after structural reductions.
[2024-05-26 02:11:11] [INFO ] Flatten gal took : 76 ms
[2024-05-26 02:11:11] [INFO ] Flatten gal took : 47 ms
[2024-05-26 02:11:11] [INFO ] Input system was already deterministic with 960 transitions.
Support contains 34 out of 835 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 27) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-26 02:11:12] [INFO ] Invariant cache hit.
[2024-05-26 02:11:12] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-26 02:11:12] [INFO ] After 603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 02:11:12] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2024-05-26 02:11:13] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 02:11:13] [INFO ] After 546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 101 ms.
[2024-05-26 02:11:13] [INFO ] After 836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 23 ms.
Support contains 6 out of 835 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 835/835 places, 960/960 transitions.
Graph (trivial) has 765 edges and 835 vertex of which 540 / 835 are part of one of the 20 SCC in 4 ms
Free SCC test removed 520 places
Drop transitions removed 605 transitions
Reduce isomorphic transitions removed 605 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 315 transition count 350
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 310 transition count 349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 309 transition count 349
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 13 place count 309 transition count 331
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 49 place count 291 transition count 331
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 62 place count 278 transition count 306
Iterating global reduction 3 with 13 rules applied. Total rules applied 75 place count 278 transition count 306
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 201 place count 215 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 202 place count 215 transition count 242
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 206 place count 213 transition count 259
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 209 place count 213 transition count 256
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 215 place count 213 transition count 250
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 217 place count 212 transition count 261
Free-agglomeration rule applied 99 times.
Iterating global reduction 5 with 99 rules applied. Total rules applied 316 place count 212 transition count 162
Reduce places removed 99 places and 0 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 322 edges and 113 vertex of which 63 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Iterating post reduction 5 with 118 rules applied. Total rules applied 434 place count 63 transition count 124
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 6 with 38 rules applied. Total rules applied 472 place count 63 transition count 86
Applied a total of 472 rules in 88 ms. Remains 63 /835 variables (removed 772) and now considering 86/960 (removed 874) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 63/835 places, 86/960 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Finished Best-First random walk after 56 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Parikh walk visited 0 properties in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 41 stabilizing places and 41 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(F(p0)))'
Support contains 1 out of 835 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Graph (trivial) has 770 edges and 835 vertex of which 542 / 835 are part of one of the 20 SCC in 1 ms
Free SCC test removed 522 places
Ensure Unique test removed 588 transitions
Reduce isomorphic transitions removed 588 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 312 transition count 366
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 307 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 306 transition count 365
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 13 place count 306 transition count 347
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 49 place count 288 transition count 347
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 63 place count 274 transition count 320
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 274 transition count 320
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 201 place count 212 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 202 place count 212 transition count 257
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 204 place count 211 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 205 place count 211 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 206 place count 210 transition count 260
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 142 edges and 204 vertex of which 26 / 204 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 5 with 7 rules applied. Total rules applied 213 place count 191 transition count 260
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 239 place count 191 transition count 234
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 241 place count 190 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 244 place count 190 transition count 230
Applied a total of 244 rules in 63 ms. Remains 190 /835 variables (removed 645) and now considering 230/960 (removed 730) transitions.
[2024-05-26 02:11:14] [INFO ] Flow matrix only has 211 transitions (discarded 19 similar events)
// Phase 1: matrix 211 rows 190 cols
[2024-05-26 02:11:14] [INFO ] Computed 34 invariants in 1 ms
[2024-05-26 02:11:14] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-26 02:11:14] [INFO ] Flow matrix only has 211 transitions (discarded 19 similar events)
[2024-05-26 02:11:14] [INFO ] Invariant cache hit.
[2024-05-26 02:11:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-26 02:11:14] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-26 02:11:14] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-26 02:11:14] [INFO ] Flow matrix only has 211 transitions (discarded 19 similar events)
[2024-05-26 02:11:14] [INFO ] Invariant cache hit.
[2024-05-26 02:11:14] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 190/835 places, 230/960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 410 ms. Remains : 190/835 places, 230/960 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 191 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-00 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 s82 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 28 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-00 finished in 659 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((X((p0 U p1))&&(G(p2)||F(p3)))))'
Support contains 4 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 821 transition count 946
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 821 transition count 946
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 816 transition count 941
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 816 transition count 941
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 816 transition count 939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 815 transition count 938
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 815 transition count 938
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 815 transition count 937
Applied a total of 43 rules in 71 ms. Remains 815 /835 variables (removed 20) and now considering 937/960 (removed 23) transitions.
// Phase 1: matrix 937 rows 815 cols
[2024-05-26 02:11:14] [INFO ] Computed 40 invariants in 6 ms
[2024-05-26 02:11:15] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-26 02:11:15] [INFO ] Invariant cache hit.
[2024-05-26 02:11:15] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2024-05-26 02:11:15] [INFO ] Invariant cache hit.
[2024-05-26 02:11:15] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 815/835 places, 937/960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1111 ms. Remains : 815/835 places, 937/960 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), true]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s431 1), p3:(EQ s396 1), p1:(EQ s326 1), p0:(EQ s198 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]]
Stuttering criterion allowed to conclude after 1818 steps with 1 reset in 13 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-02 finished in 1310 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 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 822 transition count 947
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 822 transition count 947
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 817 transition count 942
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 817 transition count 942
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 817 transition count 940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 816 transition count 939
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 816 transition count 939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 816 transition count 938
Applied a total of 41 rules in 82 ms. Remains 816 /835 variables (removed 19) and now considering 938/960 (removed 22) transitions.
// Phase 1: matrix 938 rows 816 cols
[2024-05-26 02:11:16] [INFO ] Computed 40 invariants in 12 ms
[2024-05-26 02:11:16] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-26 02:11:16] [INFO ] Invariant cache hit.
[2024-05-26 02:11:16] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2024-05-26 02:11:16] [INFO ] Invariant cache hit.
[2024-05-26 02:11:17] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 816/835 places, 938/960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1164 ms. Remains : 816/835 places, 938/960 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-04 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 (EQ s438 0) (EQ s783 0))], 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 1874 steps with 2 reset in 8 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-04 finished in 1285 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)&&(!p0||X(((p0||F(p2)) U (!p0&&(p0||F(p2)))))))))'
Support contains 3 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 822 transition count 947
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 822 transition count 947
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 817 transition count 942
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 817 transition count 942
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 817 transition count 940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 816 transition count 939
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 816 transition count 939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 816 transition count 938
Applied a total of 41 rules in 65 ms. Remains 816 /835 variables (removed 19) and now considering 938/960 (removed 22) transitions.
// Phase 1: matrix 938 rows 816 cols
[2024-05-26 02:11:17] [INFO ] Computed 40 invariants in 11 ms
[2024-05-26 02:11:17] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-26 02:11:17] [INFO ] Invariant cache hit.
[2024-05-26 02:11:18] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2024-05-26 02:11:18] [INFO ] Invariant cache hit.
[2024-05-26 02:11:18] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 816/835 places, 938/960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1185 ms. Remains : 816/835 places, 938/960 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) p0), true, true, true]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 5}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(EQ s258 0), p2:(EQ s263 1), p0:(EQ s431 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, 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-1B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-05 finished in 1432 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 835 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Graph (trivial) has 768 edges and 835 vertex of which 542 / 835 are part of one of the 20 SCC in 3 ms
Free SCC test removed 522 places
Ensure Unique test removed 588 transitions
Reduce isomorphic transitions removed 588 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 312 transition count 366
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 307 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 306 transition count 365
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 13 place count 306 transition count 348
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 47 place count 289 transition count 348
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 60 place count 276 transition count 323
Iterating global reduction 3 with 13 rules applied. Total rules applied 73 place count 276 transition count 323
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 197 place count 214 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 198 place count 214 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 213 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 213 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 212 transition count 261
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 142 edges and 206 vertex of which 28 / 206 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Iterating post reduction 5 with 7 rules applied. Total rules applied 209 place count 192 transition count 261
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 237 place count 192 transition count 233
Applied a total of 237 rules in 50 ms. Remains 192 /835 variables (removed 643) and now considering 233/960 (removed 727) transitions.
[2024-05-26 02:11:18] [INFO ] Flow matrix only has 214 transitions (discarded 19 similar events)
// Phase 1: matrix 214 rows 192 cols
[2024-05-26 02:11:18] [INFO ] Computed 34 invariants in 1 ms
[2024-05-26 02:11:19] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-26 02:11:19] [INFO ] Flow matrix only has 214 transitions (discarded 19 similar events)
[2024-05-26 02:11:19] [INFO ] Invariant cache hit.
[2024-05-26 02:11:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-26 02:11:19] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-05-26 02:11:19] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-26 02:11:19] [INFO ] Flow matrix only has 214 transitions (discarded 19 similar events)
[2024-05-26 02:11:19] [INFO ] Invariant cache hit.
[2024-05-26 02:11:19] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 192/835 places, 233/960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 471 ms. Remains : 192/835 places, 233/960 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s23 1) (EQ s141 1) (EQ s148 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-1B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-07 finished in 521 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(((p1||G(p2))&&p0)))'
Support contains 5 out of 835 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Graph (trivial) has 771 edges and 835 vertex of which 551 / 835 are part of one of the 20 SCC in 1 ms
Free SCC test removed 531 places
Ensure Unique test removed 599 transitions
Reduce isomorphic transitions removed 599 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 303 transition count 359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 302 transition count 359
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 3 place count 302 transition count 342
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 37 place count 285 transition count 342
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 50 place count 272 transition count 316
Iterating global reduction 2 with 13 rules applied. Total rules applied 63 place count 272 transition count 316
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 183 place count 212 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 211 transition count 255
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 145 edges and 205 vertex of which 28 / 205 are part of one of the 14 SCC in 8 ms
Free SCC test removed 14 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 191 place count 191 transition count 255
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 219 place count 191 transition count 227
Applied a total of 219 rules in 48 ms. Remains 191 /835 variables (removed 644) and now considering 227/960 (removed 733) transitions.
[2024-05-26 02:11:19] [INFO ] Flow matrix only has 208 transitions (discarded 19 similar events)
// Phase 1: matrix 208 rows 191 cols
[2024-05-26 02:11:19] [INFO ] Computed 34 invariants in 2 ms
[2024-05-26 02:11:19] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-26 02:11:19] [INFO ] Flow matrix only has 208 transitions (discarded 19 similar events)
[2024-05-26 02:11:19] [INFO ] Invariant cache hit.
[2024-05-26 02:11:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-26 02:11:19] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-26 02:11:19] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-26 02:11:19] [INFO ] Flow matrix only has 208 transitions (discarded 19 similar events)
[2024-05-26 02:11:19] [INFO ] Invariant cache hit.
[2024-05-26 02:11:19] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 191/835 places, 227/960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 191/835 places, 227/960 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s97 1) (EQ s132 1) (EQ s68 1)), p1:(AND (EQ s113 1) (EQ s169 1)), p2:(EQ s68 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-08 finished in 528 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&&X(F((X(p2)||p1))))))'
Support contains 4 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 823 transition count 948
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 823 transition count 948
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 818 transition count 943
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 818 transition count 943
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 818 transition count 941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 817 transition count 940
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 817 transition count 940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 817 transition count 939
Applied a total of 39 rules in 68 ms. Remains 817 /835 variables (removed 18) and now considering 939/960 (removed 21) transitions.
// Phase 1: matrix 939 rows 817 cols
[2024-05-26 02:11:20] [INFO ] Computed 40 invariants in 8 ms
[2024-05-26 02:11:20] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-26 02:11:20] [INFO ] Invariant cache hit.
[2024-05-26 02:11:20] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2024-05-26 02:11:20] [INFO ] Invariant cache hit.
[2024-05-26 02:11:21] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 817/835 places, 939/960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1108 ms. Remains : 817/835 places, 939/960 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (EQ s486 1) (EQ s690 1)), p2:(OR (EQ s430 0) (EQ s691 1)), p0:(EQ s486 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-10 finished in 1326 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((F(p0)&&(p1 U p2)))))'
Support contains 4 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 822 transition count 947
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 822 transition count 947
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 817 transition count 942
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 817 transition count 942
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 817 transition count 940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 816 transition count 939
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 816 transition count 939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 816 transition count 938
Applied a total of 41 rules in 65 ms. Remains 816 /835 variables (removed 19) and now considering 938/960 (removed 22) transitions.
// Phase 1: matrix 938 rows 816 cols
[2024-05-26 02:11:21] [INFO ] Computed 40 invariants in 9 ms
[2024-05-26 02:11:21] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-26 02:11:21] [INFO ] Invariant cache hit.
[2024-05-26 02:11:21] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2024-05-26 02:11:21] [INFO ] Invariant cache hit.
[2024-05-26 02:11:22] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 816/835 places, 938/960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1091 ms. Remains : 816/835 places, 938/960 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p2:(AND (EQ s437 1) (EQ s540 1)), p1:(EQ s781 1), p0:(EQ s543 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-11 finished in 1337 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)&&F(G(p1)))))'
Support contains 3 out of 835 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Graph (trivial) has 769 edges and 835 vertex of which 529 / 835 are part of one of the 20 SCC in 1 ms
Free SCC test removed 509 places
Ensure Unique test removed 572 transitions
Reduce isomorphic transitions removed 572 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 325 transition count 375
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 313 transition count 375
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 25 place count 313 transition count 358
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 59 place count 296 transition count 358
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 73 place count 282 transition count 331
Iterating global reduction 2 with 14 rules applied. Total rules applied 87 place count 282 transition count 331
Performed 66 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 219 place count 216 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 221 place count 216 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 215 transition count 263
Applied a total of 223 rules in 38 ms. Remains 215 /835 variables (removed 620) and now considering 263/960 (removed 697) transitions.
[2024-05-26 02:11:22] [INFO ] Flow matrix only has 244 transitions (discarded 19 similar events)
// Phase 1: matrix 244 rows 215 cols
[2024-05-26 02:11:22] [INFO ] Computed 40 invariants in 3 ms
[2024-05-26 02:11:22] [INFO ] Implicit Places using invariants in 104 ms returned [10, 38, 73, 122, 165, 195]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 106 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 209/835 places, 263/960 transitions.
Graph (trivial) has 147 edges and 209 vertex of which 26 / 209 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 196 transition count 236
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 195 transition count 235
Applied a total of 4 rules in 12 ms. Remains 195 /209 variables (removed 14) and now considering 235/263 (removed 28) transitions.
[2024-05-26 02:11:22] [INFO ] Flow matrix only has 216 transitions (discarded 19 similar events)
// Phase 1: matrix 216 rows 195 cols
[2024-05-26 02:11:22] [INFO ] Computed 34 invariants in 0 ms
[2024-05-26 02:11:22] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-26 02:11:22] [INFO ] Flow matrix only has 216 transitions (discarded 19 similar events)
[2024-05-26 02:11:22] [INFO ] Invariant cache hit.
[2024-05-26 02:11:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-26 02:11:22] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 195/835 places, 235/960 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 391 ms. Remains : 195/835 places, 235/960 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-13 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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s132 1), p1:(OR (EQ s67 1) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-13 finished in 528 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(((X(p0) U p1)&&F(p0)&&F(G(p2))))))'
Support contains 3 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 823 transition count 948
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 823 transition count 948
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 819 transition count 944
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 819 transition count 944
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 819 transition count 942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 818 transition count 941
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 818 transition count 941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 818 transition count 940
Applied a total of 37 rules in 70 ms. Remains 818 /835 variables (removed 17) and now considering 940/960 (removed 20) transitions.
// Phase 1: matrix 940 rows 818 cols
[2024-05-26 02:11:23] [INFO ] Computed 40 invariants in 7 ms
[2024-05-26 02:11:23] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-26 02:11:23] [INFO ] Invariant cache hit.
[2024-05-26 02:11:23] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2024-05-26 02:11:23] [INFO ] Invariant cache hit.
[2024-05-26 02:11:24] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 818/835 places, 940/960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1101 ms. Remains : 818/835 places, 940/960 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s262 1), p1:(EQ s617 1), p2:(EQ s816 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]]
Stuttering criterion allowed to conclude after 659 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-14 finished in 1391 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) U G((p1&&F(!p2)))))'
Support contains 4 out of 835 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Graph (trivial) has 765 edges and 835 vertex of which 536 / 835 are part of one of the 20 SCC in 1 ms
Free SCC test removed 516 places
Ensure Unique test removed 580 transitions
Reduce isomorphic transitions removed 580 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 318 transition count 372
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 311 transition count 370
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 309 transition count 370
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 19 place count 309 transition count 352
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 55 place count 291 transition count 352
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 69 place count 277 transition count 325
Iterating global reduction 3 with 14 rules applied. Total rules applied 83 place count 277 transition count 325
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 205 place count 216 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 207 place count 216 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 209 place count 215 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 210 place count 215 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 214 transition count 263
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 134 edges and 211 vertex of which 14 / 211 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 5 with 4 rules applied. Total rules applied 215 place count 204 transition count 263
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 229 place count 204 transition count 249
Applied a total of 229 rules in 37 ms. Remains 204 /835 variables (removed 631) and now considering 249/960 (removed 711) transitions.
[2024-05-26 02:11:24] [INFO ] Flow matrix only has 230 transitions (discarded 19 similar events)
// Phase 1: matrix 230 rows 204 cols
[2024-05-26 02:11:24] [INFO ] Computed 37 invariants in 1 ms
[2024-05-26 02:11:24] [INFO ] Implicit Places using invariants in 85 ms returned [10, 40, 77]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 87 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/835 places, 249/960 transitions.
Graph (trivial) has 127 edges and 201 vertex of which 14 / 201 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Applied a total of 1 rules in 13 ms. Remains 194 /201 variables (removed 7) and now considering 235/249 (removed 14) transitions.
[2024-05-26 02:11:24] [INFO ] Flow matrix only has 216 transitions (discarded 19 similar events)
// Phase 1: matrix 216 rows 194 cols
[2024-05-26 02:11:24] [INFO ] Computed 34 invariants in 1 ms
[2024-05-26 02:11:24] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-26 02:11:24] [INFO ] Flow matrix only has 216 transitions (discarded 19 similar events)
[2024-05-26 02:11:24] [INFO ] Invariant cache hit.
[2024-05-26 02:11:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-26 02:11:24] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 194/835 places, 235/960 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 356 ms. Remains : 194/835 places, 235/960 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) p2), (NOT p0), p2]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s24 1), p0:(EQ s54 1), p2:(AND (EQ s96 1) (EQ s133 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-15 finished in 478 ms.
All properties solved by simple procedures.
Total runtime 15778 ms.
BK_STOP 1716689485895
--------------------
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-1B"
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-1B, 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-171654372600353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-1B.tgz
mv NoC3x3-PT-1B 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 '
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 ;