Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 7.2K Apr 29 12:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 29 12:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 173K May 10 09:33 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 CANConstruction-PT-010-LTLFireability-00
FORMULA_NAME CANConstruction-PT-010-LTLFireability-01
FORMULA_NAME CANConstruction-PT-010-LTLFireability-02
FORMULA_NAME CANConstruction-PT-010-LTLFireability-03
FORMULA_NAME CANConstruction-PT-010-LTLFireability-04
FORMULA_NAME CANConstruction-PT-010-LTLFireability-05
FORMULA_NAME CANConstruction-PT-010-LTLFireability-06
FORMULA_NAME CANConstruction-PT-010-LTLFireability-07
FORMULA_NAME CANConstruction-PT-010-LTLFireability-08
FORMULA_NAME CANConstruction-PT-010-LTLFireability-09
FORMULA_NAME CANConstruction-PT-010-LTLFireability-10
FORMULA_NAME CANConstruction-PT-010-LTLFireability-11
FORMULA_NAME CANConstruction-PT-010-LTLFireability-12
FORMULA_NAME CANConstruction-PT-010-LTLFireability-13
FORMULA_NAME CANConstruction-PT-010-LTLFireability-14
FORMULA_NAME CANConstruction-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652642823859

Running Version 202205111006
[2022-05-15 19:27:04] [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]
[2022-05-15 19:27:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 19:27:05] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2022-05-15 19:27:05] [INFO ] Transformed 322 places.
[2022-05-15 19:27:05] [INFO ] Transformed 480 transitions.
[2022-05-15 19:27:05] [INFO ] Parsed PT model containing 322 places and 480 transitions in 206 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 2 formulas.
FORMULA CANConstruction-PT-010-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 480/480 transitions.
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 74 place count 248 transition count 332
Iterating global reduction 0 with 74 rules applied. Total rules applied 148 place count 248 transition count 332
Applied a total of 148 rules in 73 ms. Remains 248 /322 variables (removed 74) and now considering 332/480 (removed 148) transitions.
// Phase 1: matrix 332 rows 248 cols
[2022-05-15 19:27:05] [INFO ] Computed 21 place invariants in 23 ms
[2022-05-15 19:27:05] [INFO ] Implicit Places using invariants in 289 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 316 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 238/322 places, 332/480 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 228 transition count 322
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 228 transition count 322
Applied a total of 20 rules in 21 ms. Remains 228 /238 variables (removed 10) and now considering 322/332 (removed 10) transitions.
// Phase 1: matrix 322 rows 228 cols
[2022-05-15 19:27:05] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 19:27:05] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 322 rows 228 cols
[2022-05-15 19:27:05] [INFO ] Computed 11 place invariants in 6 ms
[2022-05-15 19:27:05] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-05-15 19:27:06] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 228/322 places, 322/480 transitions.
Finished structural reductions, in 2 iterations. Remains : 228/322 places, 322/480 transitions.
Support contains 35 out of 228 places after structural reductions.
[2022-05-15 19:27:06] [INFO ] Flatten gal took : 48 ms
[2022-05-15 19:27:06] [INFO ] Flatten gal took : 20 ms
[2022-05-15 19:27:06] [INFO ] Input system was already deterministic with 322 transitions.
Support contains 34 out of 228 places (down from 35) after GAL structural reductions.
Finished random walk after 3864 steps, including 23 resets, run visited all 26 properties in 204 ms. (steps per millisecond=18 )
Computed a total of 31 stabilizing places and 40 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F(p0)))))'
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 322/322 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 223 transition count 312
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 223 transition count 312
Applied a total of 10 rules in 14 ms. Remains 223 /228 variables (removed 5) and now considering 312/322 (removed 10) transitions.
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:07] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:07] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:07] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:07] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-05-15 19:27:07] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:07] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:07] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 223/228 places, 312/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/228 places, 312/322 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-00 automaton TGBA Formula[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:(GEQ s207 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][false, false, false]]
Stuttering criterion allowed to conclude after 130 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-00 finished in 910 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(X(X(p0))) U ((X(p1)&&p2) U (G(p2) U p0))))'
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 322/322 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 222 transition count 310
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 222 transition count 310
Applied a total of 12 rules in 16 ms. Remains 222 /228 variables (removed 6) and now considering 310/322 (removed 12) transitions.
// Phase 1: matrix 310 rows 222 cols
[2022-05-15 19:27:08] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 19:27:08] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 310 rows 222 cols
[2022-05-15 19:27:08] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 19:27:08] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-05-15 19:27:08] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
// Phase 1: matrix 310 rows 222 cols
[2022-05-15 19:27:08] [INFO ] Computed 11 place invariants in 6 ms
[2022-05-15 19:27:08] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/228 places, 310/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 222/228 places, 310/322 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), p0, (AND p0 (NOT p2) (NOT p1)), p0, true, (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 4}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s66 1) (GEQ s83 1)), p2:(GEQ s82 1), p1:(AND (GEQ s66 1) (GEQ s209 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 405 steps with 2 reset in 8 ms.
FORMULA CANConstruction-PT-010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-01 finished in 853 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!X(X(!p0))&&p1)) U p2)))'
Support contains 6 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 322/322 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 223 transition count 312
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 223 transition count 312
Applied a total of 10 rules in 11 ms. Remains 223 /228 variables (removed 5) and now considering 312/322 (removed 10) transitions.
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:09] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:09] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:09] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-15 19:27:09] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-05-15 19:27:09] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:09] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 19:27:09] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 223/228 places, 312/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/228 places, 312/322 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (NOT p2), true, (OR (NOT p1) (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p2:(GEQ s192 1), p1:(OR (AND (GEQ s18 1) (GEQ s59 1)) (AND (GEQ s11 1) (GEQ s90 1))), p0:(AND (GEQ s11 1) (GEQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-02 finished in 672 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 322/322 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 223 transition count 312
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 223 transition count 312
Applied a total of 10 rules in 10 ms. Remains 223 /228 variables (removed 5) and now considering 312/322 (removed 10) transitions.
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:09] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-15 19:27:09] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:09] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-15 19:27:09] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-05-15 19:27:10] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:10] [INFO ] Computed 11 place invariants in 7 ms
[2022-05-15 19:27:10] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 223/228 places, 312/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/228 places, 312/322 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 199 steps with 1 reset in 2 ms.
FORMULA CANConstruction-PT-010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-03 finished in 611 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U (G((F(p1)&&!p2))||!p3)))'
Support contains 7 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 322/322 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 228 transition count 269
Reduce places removed 53 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 63 rules applied. Total rules applied 116 place count 175 transition count 259
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 126 place count 165 transition count 259
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 126 place count 165 transition count 249
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 146 place count 155 transition count 249
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 152 place count 149 transition count 237
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 149 transition count 237
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 163 place count 149 transition count 232
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 168 place count 144 transition count 232
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 184 place count 136 transition count 224
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 204 place count 126 transition count 294
Applied a total of 204 rules in 47 ms. Remains 126 /228 variables (removed 102) and now considering 294/322 (removed 28) transitions.
// Phase 1: matrix 294 rows 126 cols
[2022-05-15 19:27:10] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:10] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 294 rows 126 cols
[2022-05-15 19:27:10] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:10] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-05-15 19:27:10] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2022-05-15 19:27:10] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 294 rows 126 cols
[2022-05-15 19:27:10] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 19:27:10] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/228 places, 294/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/228 places, 294/322 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p3) (AND p1 (NOT p2))), true, (AND (NOT p2) p1)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p3), acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND p3 (NOT p2) p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s46 1)), p3:(AND (GEQ s1 1) (GEQ s33 1)), p2:(AND (GEQ s21 1) (GEQ s31 1)), p1:(LT s26 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 90 steps with 2 reset in 3 ms.
FORMULA CANConstruction-PT-010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-04 finished in 628 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(X(X((G((X(p1)&&p0))&&G(p2)))))))))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 322/322 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 228 transition count 260
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 125 place count 166 transition count 259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 165 transition count 259
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 126 place count 165 transition count 249
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 146 place count 155 transition count 249
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 152 place count 149 transition count 237
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 149 transition count 237
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 163 place count 149 transition count 232
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 168 place count 144 transition count 232
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 188 place count 134 transition count 302
Applied a total of 188 rules in 38 ms. Remains 134 /228 variables (removed 94) and now considering 302/322 (removed 20) transitions.
// Phase 1: matrix 302 rows 134 cols
[2022-05-15 19:27:10] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:11] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 302 rows 134 cols
[2022-05-15 19:27:11] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:11] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-05-15 19:27:11] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2022-05-15 19:27:11] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 302 rows 134 cols
[2022-05-15 19:27:11] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 19:27:11] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/228 places, 302/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/228 places, 302/322 transitions.
Stuttering acceptance computed with spot in 55 ms :[(OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s24 1)), p1:(AND (GEQ s0 1) (GEQ s24 1)), p2:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-05 finished in 582 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(!F(p0)&&p1) U X(p2)))'
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 322/322 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 223 transition count 312
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 223 transition count 312
Applied a total of 10 rules in 10 ms. Remains 223 /228 variables (removed 5) and now considering 312/322 (removed 10) transitions.
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:11] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-15 19:27:11] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:11] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 19:27:11] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-05-15 19:27:11] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:11] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:12] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 223/228 places, 312/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/228 places, 312/322 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s23 1) (GEQ s78 1)) (GEQ s197 1)), p0:(AND (GEQ s102 1) (GEQ s175 1)), p2:(GEQ s197 1)], nbAcceptance=0, 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 103 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-06 finished in 711 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(p0 U (!F(p1)&&X(F(p2)))))))'
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 322/322 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 223 transition count 312
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 223 transition count 312
Applied a total of 10 rules in 9 ms. Remains 223 /228 variables (removed 5) and now considering 312/322 (removed 10) transitions.
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:12] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:12] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:12] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 19:27:12] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-05-15 19:27:12] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:12] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 19:27:12] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 223/228 places, 312/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/228 places, 312/322 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), false]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s42 1) (GEQ s207 1)), p1:(GEQ s211 1), p2:(AND (GEQ s114 1) (GEQ s149 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 635 reset in 292 ms.
Stack based approach found an accepted trace after 13533 steps with 84 reset with depth 159 and stack size 159 in 30 ms.
FORMULA CANConstruction-PT-010-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-07 finished in 1033 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 322/322 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 228 transition count 259
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 165 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 164 transition count 258
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 128 place count 164 transition count 249
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 146 place count 155 transition count 249
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 152 place count 149 transition count 237
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 149 transition count 237
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 163 place count 149 transition count 232
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 168 place count 144 transition count 232
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 186 place count 135 transition count 223
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 206 place count 125 transition count 293
Applied a total of 206 rules in 37 ms. Remains 125 /228 variables (removed 103) and now considering 293/322 (removed 29) transitions.
// Phase 1: matrix 293 rows 125 cols
[2022-05-15 19:27:13] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:13] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 293 rows 125 cols
[2022-05-15 19:27:13] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:13] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-05-15 19:27:13] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2022-05-15 19:27:13] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 293 rows 125 cols
[2022-05-15 19:27:13] [INFO ] Computed 11 place invariants in 8 ms
[2022-05-15 19:27:13] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/228 places, 293/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/228 places, 293/322 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-08 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=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s10 1) (GEQ s109 1)), p0:(LT s17 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 250 steps with 10 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-08 finished in 589 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X(F(X(p0)))))))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 322/322 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 228 transition count 258
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 164 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 163 transition count 257
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 130 place count 163 transition count 247
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 150 place count 153 transition count 247
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 156 place count 147 transition count 235
Iterating global reduction 3 with 6 rules applied. Total rules applied 162 place count 147 transition count 235
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 167 place count 147 transition count 230
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 172 place count 142 transition count 230
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 192 place count 132 transition count 300
Applied a total of 192 rules in 23 ms. Remains 132 /228 variables (removed 96) and now considering 300/322 (removed 22) transitions.
// Phase 1: matrix 300 rows 132 cols
[2022-05-15 19:27:13] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:13] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 300 rows 132 cols
[2022-05-15 19:27:13] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:13] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-05-15 19:27:14] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2022-05-15 19:27:14] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 300 rows 132 cols
[2022-05-15 19:27:14] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-15 19:27:14] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/228 places, 300/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/228 places, 300/322 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-09 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:(AND (GEQ s0 1) (GEQ s22 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 80 steps with 4 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-09 finished in 594 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!F(X(X(X(p0)))) U X(p1))))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 322/322 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 222 transition count 310
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 222 transition count 310
Applied a total of 12 rules in 7 ms. Remains 222 /228 variables (removed 6) and now considering 310/322 (removed 12) transitions.
// Phase 1: matrix 310 rows 222 cols
[2022-05-15 19:27:14] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:14] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 310 rows 222 cols
[2022-05-15 19:27:14] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:14] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-05-15 19:27:14] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
// Phase 1: matrix 310 rows 222 cols
[2022-05-15 19:27:14] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-15 19:27:14] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/228 places, 310/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 222/228 places, 310/322 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) p0), p0, true]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=true, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s66 1) (GEQ s145 1)), p0:(AND (GEQ s66 1) (GEQ s119 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 259 steps with 1 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-10 finished in 706 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 322/322 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 228 transition count 257
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 163 transition count 257
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 130 place count 163 transition count 247
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 150 place count 153 transition count 247
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 155 place count 148 transition count 237
Iterating global reduction 2 with 5 rules applied. Total rules applied 160 place count 148 transition count 237
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 164 place count 148 transition count 233
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 168 place count 144 transition count 233
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 190 place count 133 transition count 222
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 210 place count 123 transition count 291
Applied a total of 210 rules in 29 ms. Remains 123 /228 variables (removed 105) and now considering 291/322 (removed 31) transitions.
// Phase 1: matrix 291 rows 123 cols
[2022-05-15 19:27:15] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 19:27:15] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 291 rows 123 cols
[2022-05-15 19:27:15] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:15] [INFO ] State equation strengthened by 279 read => feed constraints.
[2022-05-15 19:27:15] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2022-05-15 19:27:15] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 291 rows 123 cols
[2022-05-15 19:27:15] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 19:27:15] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/228 places, 291/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/228 places, 291/322 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-11 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:(GEQ s92 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 52 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-11 finished in 580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(X(p0))))))'
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 322/322 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 223 transition count 312
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 223 transition count 312
Applied a total of 10 rules in 8 ms. Remains 223 /228 variables (removed 5) and now considering 312/322 (removed 10) transitions.
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:15] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:15] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:15] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:15] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-05-15 19:27:16] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
// Phase 1: matrix 312 rows 223 cols
[2022-05-15 19:27:16] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-15 19:27:16] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 223/228 places, 312/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/228 places, 312/322 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-14 automaton TGBA Formula[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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LT s197 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 481 steps with 3 reset in 3 ms.
FORMULA CANConstruction-PT-010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-14 finished in 682 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 322/322 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 228 transition count 258
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 164 transition count 258
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 128 place count 164 transition count 248
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 148 place count 154 transition count 248
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 154 place count 148 transition count 236
Iterating global reduction 2 with 6 rules applied. Total rules applied 160 place count 148 transition count 236
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 165 place count 148 transition count 231
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 170 place count 143 transition count 231
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 188 place count 134 transition count 222
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 208 place count 124 transition count 292
Applied a total of 208 rules in 25 ms. Remains 124 /228 variables (removed 104) and now considering 292/322 (removed 30) transitions.
// Phase 1: matrix 292 rows 124 cols
[2022-05-15 19:27:16] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 19:27:16] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 292 rows 124 cols
[2022-05-15 19:27:16] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:16] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-05-15 19:27:16] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2022-05-15 19:27:16] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 292 rows 124 cols
[2022-05-15 19:27:16] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 19:27:16] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/228 places, 292/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/228 places, 292/322 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s20 1) (LT s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2005 reset in 329 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 41 in 1 ms.
FORMULA CANConstruction-PT-010-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-15 finished in 900 ms.
All properties solved by simple procedures.
Total runtime 12287 ms.

BK_STOP 1652642837346

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="CANConstruction-PT-010"
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 CANConstruction-PT-010, 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 r024-tall-165251918600492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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