Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 06:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 06:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 144K May 5 16:51 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-00
FORMULA_NAME NoC3x3-PT-4A-01
FORMULA_NAME NoC3x3-PT-4A-02
FORMULA_NAME NoC3x3-PT-4A-03
FORMULA_NAME NoC3x3-PT-4A-04
FORMULA_NAME NoC3x3-PT-4A-05
FORMULA_NAME NoC3x3-PT-4A-06
FORMULA_NAME NoC3x3-PT-4A-07
FORMULA_NAME NoC3x3-PT-4A-08
FORMULA_NAME NoC3x3-PT-4A-09
FORMULA_NAME NoC3x3-PT-4A-10
FORMULA_NAME NoC3x3-PT-4A-11
FORMULA_NAME NoC3x3-PT-4A-12
FORMULA_NAME NoC3x3-PT-4A-13
FORMULA_NAME NoC3x3-PT-4A-14
FORMULA_NAME NoC3x3-PT-4A-15

=== Now, execution of the tool begins

BK_START 1620957503649

Running Version 0
[2021-05-14 01:58:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 01:58:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 01:58:25] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2021-05-14 01:58:25] [INFO ] Transformed 293 places.
[2021-05-14 01:58:25] [INFO ] Transformed 608 transitions.
[2021-05-14 01:58:25] [INFO ] Found NUPN structural information;
[2021-05-14 01:58:25] [INFO ] Parsed PT model containing 293 places and 608 transitions in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 01:58:25] [INFO ] Initial state test concluded for 3 properties.
Ensure Unique test removed 155 transitions
Reduce redundant transitions removed 155 transitions.
Support contains 48 out of 293 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 293/293 places, 453/453 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 244 transition count 377
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 244 transition count 377
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 0 with 45 rules applied. Total rules applied 143 place count 244 transition count 332
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 151 place count 236 transition count 332
Applied a total of 151 rules in 55 ms. Remains 236 /293 variables (removed 57) and now considering 332/453 (removed 121) transitions.
// Phase 1: matrix 332 rows 236 cols
[2021-05-14 01:58:25] [INFO ] Computed 58 place invariants in 13 ms
[2021-05-14 01:58:25] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 332 rows 236 cols
[2021-05-14 01:58:25] [INFO ] Computed 58 place invariants in 6 ms
[2021-05-14 01:58:26] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
// Phase 1: matrix 332 rows 236 cols
[2021-05-14 01:58:26] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-14 01:58:26] [INFO ] Dead Transitions using invariants and state equation in 174 ms returned []
Finished structural reductions, in 1 iterations. Remains : 236/293 places, 332/453 transitions.
[2021-05-14 01:58:26] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-14 01:58:26] [INFO ] Flatten gal took : 68 ms
FORMULA NoC3x3-PT-4A-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 01:58:26] [INFO ] Flatten gal took : 33 ms
[2021-05-14 01:58:26] [INFO ] Input system was already deterministic with 332 transitions.
Finished random walk after 39453 steps, including 1 resets, run visited all 27 properties in 233 ms. (steps per millisecond=169 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 332/332 transitions.
Graph (trivial) has 134 edges and 236 vertex of which 72 / 236 are part of one of the 32 SCC in 3 ms
Free SCC test removed 40 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Graph (complete) has 709 edges and 196 vertex of which 195 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output 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 38 place count 186 transition count 224
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 59 place count 165 transition count 224
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 66 place count 158 transition count 217
Iterating global reduction 2 with 7 rules applied. Total rules applied 73 place count 158 transition count 217
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 97 place count 158 transition count 193
Applied a total of 97 rules in 44 ms. Remains 158 /236 variables (removed 78) and now considering 193/332 (removed 139) transitions.
// Phase 1: matrix 193 rows 158 cols
[2021-05-14 01:58:26] [INFO ] Computed 49 place invariants in 1 ms
[2021-05-14 01:58:27] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 193 rows 158 cols
[2021-05-14 01:58:27] [INFO ] Computed 49 place invariants in 9 ms
[2021-05-14 01:58:27] [INFO ] State equation strengthened by 53 read => feed constraints.
[2021-05-14 01:58:27] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2021-05-14 01:58:27] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 193 rows 158 cols
[2021-05-14 01:58:27] [INFO ] Computed 49 place invariants in 1 ms
[2021-05-14 01:58:27] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Finished structural reductions, in 1 iterations. Remains : 158/236 places, 193/332 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4A-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s130 1) (EQ s144 1)), p1:(OR (EQ s135 0) (EQ s137 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-4A-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-00 finished in 756 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(((F(G(p1)) U p2)&&p0))) U p3))], workingDir=/home/mcc/execution]
Support contains 8 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 332/332 transitions.
Graph (trivial) has 127 edges and 236 vertex of which 67 / 236 are part of one of the 30 SCC in 0 ms
Free SCC test removed 37 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Graph (complete) has 715 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 9 place count 191 transition count 252
Iterating global reduction 0 with 7 rules applied. Total rules applied 16 place count 191 transition count 252
Applied a total of 16 rules in 15 ms. Remains 191 /236 variables (removed 45) and now considering 252/332 (removed 80) transitions.
[2021-05-14 01:58:27] [INFO ] Flow matrix only has 223 transitions (discarded 29 similar events)
// Phase 1: matrix 223 rows 191 cols
[2021-05-14 01:58:27] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:27] [INFO ] Implicit Places using invariants in 92 ms returned []
[2021-05-14 01:58:27] [INFO ] Flow matrix only has 223 transitions (discarded 29 similar events)
// Phase 1: matrix 223 rows 191 cols
[2021-05-14 01:58:27] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:27] [INFO ] State equation strengthened by 90 read => feed constraints.
[2021-05-14 01:58:27] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2021-05-14 01:58:27] [INFO ] Redundant transitions in 10 ms returned []
[2021-05-14 01:58:27] [INFO ] Flow matrix only has 223 transitions (discarded 29 similar events)
// Phase 1: matrix 223 rows 191 cols
[2021-05-14 01:58:27] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 01:58:28] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 191/236 places, 252/332 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p3), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-4A-01 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s19 1) (EQ s35 1)), p0:(AND (EQ s84 1) (EQ s109 1) (OR (EQ s19 0) (EQ s35 0))), p2:(AND (EQ s64 1) (EQ s76 1)), p1:(AND (EQ s174 1) (EQ s189 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-01 finished in 602 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U p1)||X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 332/332 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 228 transition count 325
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 228 transition count 325
Applied a total of 15 rules in 10 ms. Remains 228 /236 variables (removed 8) and now considering 325/332 (removed 7) transitions.
// Phase 1: matrix 325 rows 228 cols
[2021-05-14 01:58:28] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:28] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 325 rows 228 cols
[2021-05-14 01:58:28] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 01:58:28] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 228 cols
[2021-05-14 01:58:28] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 01:58:28] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Finished structural reductions, in 1 iterations. Remains : 228/236 places, 325/332 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-4A-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s131 1), p0:(EQ s155 1), p2:(EQ s128 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 696 steps with 0 reset in 12 ms.
FORMULA NoC3x3-PT-4A-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-02 finished in 527 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G((F(p2)||p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 332/332 transitions.
Graph (trivial) has 131 edges and 236 vertex of which 70 / 236 are part of one of the 31 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Graph (complete) has 711 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 190 transition count 249
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 190 transition count 249
Applied a total of 14 rules in 14 ms. Remains 190 /236 variables (removed 46) and now considering 249/332 (removed 83) transitions.
[2021-05-14 01:58:28] [INFO ] Flow matrix only has 219 transitions (discarded 30 similar events)
// Phase 1: matrix 219 rows 190 cols
[2021-05-14 01:58:28] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:28] [INFO ] Implicit Places using invariants in 87 ms returned []
[2021-05-14 01:58:28] [INFO ] Flow matrix only has 219 transitions (discarded 30 similar events)
// Phase 1: matrix 219 rows 190 cols
[2021-05-14 01:58:28] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:28] [INFO ] State equation strengthened by 98 read => feed constraints.
[2021-05-14 01:58:29] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2021-05-14 01:58:29] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-14 01:58:29] [INFO ] Flow matrix only has 219 transitions (discarded 30 similar events)
// Phase 1: matrix 219 rows 190 cols
[2021-05-14 01:58:29] [INFO ] Computed 57 place invariants in 9 ms
[2021-05-14 01:58:29] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 1 iterations. Remains : 190/236 places, 249/332 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-4A-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s43 1) (NEQ s53 1)), p1:(OR (NEQ s156 1) (NEQ s168 1)), p2:(OR (NEQ s79 1) (NEQ s173 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 61 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4A-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-03 finished in 633 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 332/332 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 229 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 229 transition count 326
Applied a total of 13 rules in 5 ms. Remains 229 /236 variables (removed 7) and now considering 326/332 (removed 6) transitions.
// Phase 1: matrix 326 rows 229 cols
[2021-05-14 01:58:29] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:29] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 326 rows 229 cols
[2021-05-14 01:58:29] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:29] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
// Phase 1: matrix 326 rows 229 cols
[2021-05-14 01:58:29] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:29] [INFO ] Dead Transitions using invariants and state equation in 154 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/236 places, 326/332 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s67 0) (EQ s87 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 537 ms.
Product exploration explored 100000 steps with 33333 reset in 504 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 418 ms.
Product exploration explored 100000 steps with 33333 reset in 440 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 229 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 229/229 places, 326/326 transitions.
Graph (trivial) has 137 edges and 229 vertex of which 73 / 229 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.
Applied a total of 1 rules in 10 ms. Remains 188 /229 variables (removed 41) and now considering 245/326 (removed 81) transitions.
[2021-05-14 01:58:32] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-14 01:58:32] [INFO ] Flow matrix only has 214 transitions (discarded 31 similar events)
// Phase 1: matrix 214 rows 188 cols
[2021-05-14 01:58:32] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:32] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 1 iterations. Remains : 188/229 places, 245/326 transitions.
Product exploration explored 100000 steps with 33333 reset in 1282 ms.
Product exploration explored 100000 steps with 33333 reset in 1230 ms.
[2021-05-14 01:58:34] [INFO ] Flatten gal took : 21 ms
[2021-05-14 01:58:34] [INFO ] Flatten gal took : 22 ms
[2021-05-14 01:58:34] [INFO ] Time to serialize gal into /tmp/LTL17214474776925223797.gal : 13 ms
[2021-05-14 01:58:34] [INFO ] Time to serialize properties into /tmp/LTL16761515410185907662.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17214474776925223797.gal, -t, CGAL, -LTL, /tmp/LTL16761515410185907662.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17214474776925223797.gal -t CGAL -LTL /tmp/LTL16761515410185907662.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((p84==0)||(p111==0))")))))
Formula 0 simplified : !XXF"((p84==0)||(p111==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
59 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.62768,32056,1,0,7,81092,20,0,6247,90966,12
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NoC3x3-PT-4A-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property NoC3x3-PT-4A-06 finished in 6143 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 332/332 transitions.
Graph (trivial) has 134 edges and 236 vertex of which 71 / 236 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.
Graph (complete) has 709 edges and 196 vertex of which 195 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 9 place count 188 transition count 246
Iterating global reduction 0 with 7 rules applied. Total rules applied 16 place count 188 transition count 246
Applied a total of 16 rules in 17 ms. Remains 188 /236 variables (removed 48) and now considering 246/332 (removed 86) transitions.
[2021-05-14 01:58:35] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
// Phase 1: matrix 216 rows 188 cols
[2021-05-14 01:58:35] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:35] [INFO ] Implicit Places using invariants in 106 ms returned []
[2021-05-14 01:58:35] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
// Phase 1: matrix 216 rows 188 cols
[2021-05-14 01:58:35] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:35] [INFO ] State equation strengthened by 99 read => feed constraints.
[2021-05-14 01:58:35] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2021-05-14 01:58:35] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 01:58:35] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
// Phase 1: matrix 216 rows 188 cols
[2021-05-14 01:58:35] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-14 01:58:35] [INFO ] Dead Transitions using invariants and state equation in 133 ms returned []
Finished structural reductions, in 1 iterations. Remains : 188/236 places, 246/332 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-07 automaton TGBA [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:(OR (EQ s103 1) (AND (NEQ s88 0) (NEQ s101 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-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-07 finished in 516 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 332/332 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 230 transition count 327
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 230 transition count 327
Applied a total of 11 rules in 5 ms. Remains 230 /236 variables (removed 6) and now considering 327/332 (removed 5) transitions.
// Phase 1: matrix 327 rows 230 cols
[2021-05-14 01:58:36] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:36] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 327 rows 230 cols
[2021-05-14 01:58:36] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:36] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
// Phase 1: matrix 327 rows 230 cols
[2021-05-14 01:58:36] [INFO ] Computed 57 place invariants in 6 ms
[2021-05-14 01:58:36] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 1 iterations. Remains : 230/236 places, 327/332 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s14 1) (AND (EQ s88 1) (EQ s111 1))), p1:(AND (EQ s23 1) (EQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 0 ms.
FORMULA NoC3x3-PT-4A-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-08 finished in 519 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 332/332 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 229 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 229 transition count 326
Applied a total of 13 rules in 5 ms. Remains 229 /236 variables (removed 7) and now considering 326/332 (removed 6) transitions.
// Phase 1: matrix 326 rows 229 cols
[2021-05-14 01:58:36] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:36] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 326 rows 229 cols
[2021-05-14 01:58:36] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:36] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
// Phase 1: matrix 326 rows 229 cols
[2021-05-14 01:58:36] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:36] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/236 places, 326/332 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s24 1) (EQ s130 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 105 reset in 336 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 1 ms.
FORMULA NoC3x3-PT-4A-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-09 finished in 779 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 332/332 transitions.
Graph (trivial) has 133 edges and 236 vertex of which 70 / 236 are part of one of the 31 SCC in 0 ms
Free SCC test removed 39 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Graph (complete) has 711 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 9 place count 189 transition count 248
Iterating global reduction 0 with 7 rules applied. Total rules applied 16 place count 189 transition count 248
Applied a total of 16 rules in 12 ms. Remains 189 /236 variables (removed 47) and now considering 248/332 (removed 84) transitions.
[2021-05-14 01:58:37] [INFO ] Flow matrix only has 218 transitions (discarded 30 similar events)
// Phase 1: matrix 218 rows 189 cols
[2021-05-14 01:58:37] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:37] [INFO ] Implicit Places using invariants in 81 ms returned []
[2021-05-14 01:58:37] [INFO ] Flow matrix only has 218 transitions (discarded 30 similar events)
// Phase 1: matrix 218 rows 189 cols
[2021-05-14 01:58:37] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:37] [INFO ] State equation strengthened by 97 read => feed constraints.
[2021-05-14 01:58:37] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2021-05-14 01:58:37] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-14 01:58:37] [INFO ] Flow matrix only has 218 transitions (discarded 30 similar events)
// Phase 1: matrix 218 rows 189 cols
[2021-05-14 01:58:37] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:37] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Finished structural reductions, in 1 iterations. Remains : 189/236 places, 248/332 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-10 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s70 1), p0:(OR (EQ s70 0) (AND (EQ s64 1) (EQ s77 1) (EQ s70 1)) (AND (EQ s64 1) (EQ s77 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-10 finished in 470 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 332/332 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 228 transition count 325
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 228 transition count 325
Applied a total of 15 rules in 4 ms. Remains 228 /236 variables (removed 8) and now considering 325/332 (removed 7) transitions.
// Phase 1: matrix 325 rows 228 cols
[2021-05-14 01:58:37] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:37] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 325 rows 228 cols
[2021-05-14 01:58:37] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-14 01:58:38] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 228 cols
[2021-05-14 01:58:38] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:38] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Finished structural reductions, in 1 iterations. Remains : 228/236 places, 325/332 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s175 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4A-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-11 finished in 523 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 332/332 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 228 transition count 325
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 228 transition count 325
Applied a total of 15 rules in 4 ms. Remains 228 /236 variables (removed 8) and now considering 325/332 (removed 7) transitions.
// Phase 1: matrix 325 rows 228 cols
[2021-05-14 01:58:38] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:38] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 325 rows 228 cols
[2021-05-14 01:58:38] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:38] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 228 cols
[2021-05-14 01:58:38] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:38] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 1 iterations. Remains : 228/236 places, 325/332 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s223 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 217 reset in 343 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA NoC3x3-PT-4A-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-12 finished in 773 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 332/332 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 229 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 229 transition count 326
Applied a total of 13 rules in 4 ms. Remains 229 /236 variables (removed 7) and now considering 326/332 (removed 6) transitions.
// Phase 1: matrix 326 rows 229 cols
[2021-05-14 01:58:39] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-14 01:58:39] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 326 rows 229 cols
[2021-05-14 01:58:39] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:58:39] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
// Phase 1: matrix 326 rows 229 cols
[2021-05-14 01:58:39] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-14 01:58:39] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/236 places, 326/332 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4A-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s44 1), p1:(OR (NEQ s151 1) (NEQ s215 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7905 steps with 0 reset in 31 ms.
FORMULA NoC3x3-PT-4A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-13 finished in 497 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U (p1||G(p0))) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 332/332 transitions.
Graph (trivial) has 131 edges and 236 vertex of which 69 / 236 are part of one of the 30 SCC in 0 ms
Free SCC test removed 39 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 190 transition count 248
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 190 transition count 248
Applied a total of 15 rules in 10 ms. Remains 190 /236 variables (removed 46) and now considering 248/332 (removed 84) transitions.
[2021-05-14 01:58:39] [INFO ] Flow matrix only has 219 transitions (discarded 29 similar events)
// Phase 1: matrix 219 rows 190 cols
[2021-05-14 01:58:39] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-14 01:58:39] [INFO ] Implicit Places using invariants in 88 ms returned []
[2021-05-14 01:58:39] [INFO ] Flow matrix only has 219 transitions (discarded 29 similar events)
// Phase 1: matrix 219 rows 190 cols
[2021-05-14 01:58:39] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-14 01:58:39] [INFO ] State equation strengthened by 99 read => feed constraints.
[2021-05-14 01:58:39] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2021-05-14 01:58:39] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 01:58:39] [INFO ] Flow matrix only has 219 transitions (discarded 29 similar events)
// Phase 1: matrix 219 rows 190 cols
[2021-05-14 01:58:39] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-14 01:58:39] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Finished structural reductions, in 1 iterations. Remains : 190/236 places, 248/332 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), true, (NOT p2), (AND p2 (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-4A-14 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s36 1) (EQ s184 1)), p1:(AND (NEQ s36 1) (OR (NEQ s182 1) (NEQ s186 1))), p0:(OR (NEQ s182 1) (NEQ s186 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-14 finished in 500 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 332/332 transitions.
Graph (trivial) has 137 edges and 236 vertex of which 73 / 236 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.
Graph (complete) has 707 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 9 place count 187 transition count 244
Iterating global reduction 0 with 7 rules applied. Total rules applied 16 place count 187 transition count 244
Applied a total of 16 rules in 11 ms. Remains 187 /236 variables (removed 49) and now considering 244/332 (removed 88) transitions.
[2021-05-14 01:58:40] [INFO ] Flow matrix only has 213 transitions (discarded 31 similar events)
// Phase 1: matrix 213 rows 187 cols
[2021-05-14 01:58:40] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-14 01:58:40] [INFO ] Implicit Places using invariants in 87 ms returned []
[2021-05-14 01:58:40] [INFO ] Flow matrix only has 213 transitions (discarded 31 similar events)
// Phase 1: matrix 213 rows 187 cols
[2021-05-14 01:58:40] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-14 01:58:40] [INFO ] State equation strengthened by 103 read => feed constraints.
[2021-05-14 01:58:40] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2021-05-14 01:58:40] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-14 01:58:40] [INFO ] Flow matrix only has 213 transitions (discarded 31 similar events)
// Phase 1: matrix 213 rows 187 cols
[2021-05-14 01:58:40] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-14 01:58:40] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 187/236 places, 244/332 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-15 automaton TGBA [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:(AND (EQ s43 1) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-15 finished in 467 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620957521705

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-4A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-4A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089127600277"
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 ;