Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690600620.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r037-tajo-167813690600620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 21:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 21:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 21:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 21:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 21:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 21:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 173K Mar 5 18:22 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 1678366502435

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-010
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 12:55:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 12:55:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:55:04] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2023-03-09 12:55:04] [INFO ] Transformed 322 places.
[2023-03-09 12:55:04] [INFO ] Transformed 480 transitions.
[2023-03-09 12:55:04] [INFO ] Parsed PT model containing 322 places and 480 transitions and 1400 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANConstruction-PT-010-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 480/480 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 256 transition count 348
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 256 transition count 348
Applied a total of 132 rules in 84 ms. Remains 256 /322 variables (removed 66) and now considering 348/480 (removed 132) transitions.
// Phase 1: matrix 348 rows 256 cols
[2023-03-09 12:55:05] [INFO ] Computed 21 place invariants in 27 ms
[2023-03-09 12:55:05] [INFO ] Implicit Places using invariants in 368 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 401 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/322 places, 348/480 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 239 transition count 341
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 239 transition count 341
Applied a total of 14 rules in 44 ms. Remains 239 /246 variables (removed 7) and now considering 341/348 (removed 7) transitions.
// Phase 1: matrix 341 rows 239 cols
[2023-03-09 12:55:05] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-09 12:55:05] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-09 12:55:05] [INFO ] Invariant cache hit.
[2023-03-09 12:55:05] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 12:55:06] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 239/322 places, 341/480 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1130 ms. Remains : 239/322 places, 341/480 transitions.
Support contains 36 out of 239 places after structural reductions.
[2023-03-09 12:55:06] [INFO ] Flatten gal took : 66 ms
[2023-03-09 12:55:06] [INFO ] Flatten gal took : 22 ms
[2023-03-09 12:55:06] [INFO ] Input system was already deterministic with 341 transitions.
Support contains 34 out of 239 places (down from 36) after GAL structural reductions.
Finished random walk after 2507 steps, including 14 resets, run visited all 26 properties in 190 ms. (steps per millisecond=13 )
Computed a total of 34 stabilizing places and 43 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))))))'
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 341/341 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 223 transition count 312
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 223 transition count 312
Applied a total of 32 rules in 23 ms. Remains 223 /239 variables (removed 16) and now considering 312/341 (removed 29) transitions.
// Phase 1: matrix 312 rows 223 cols
[2023-03-09 12:55:07] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 12:55:07] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-09 12:55:07] [INFO ] Invariant cache hit.
[2023-03-09 12:55:07] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 12:55:07] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2023-03-09 12:55:07] [INFO ] Invariant cache hit.
[2023-03-09 12:55:07] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 223/239 places, 312/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 863 ms. Remains : 223/239 places, 312/341 transitions.
Stuttering acceptance computed with spot in 413 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s165 1), p1:(AND (GEQ s1 1) (GEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 591 steps with 3 reset in 15 ms.
FORMULA CANConstruction-PT-010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-00 finished in 1376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 341/341 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 239 transition count 277
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 175 transition count 277
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 175 transition count 267
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 165 transition count 267
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 161 place count 152 transition count 241
Iterating global reduction 2 with 13 rules applied. Total rules applied 174 place count 152 transition count 241
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 185 place count 152 transition count 230
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 196 place count 141 transition count 230
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 4 with 16 rules applied. Total rules applied 212 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 232 place count 123 transition count 291
Applied a total of 232 rules in 116 ms. Remains 123 /239 variables (removed 116) and now considering 291/341 (removed 50) transitions.
// Phase 1: matrix 291 rows 123 cols
[2023-03-09 12:55:08] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-09 12:55:08] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-09 12:55:08] [INFO ] Invariant cache hit.
[2023-03-09 12:55:08] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-03-09 12:55:08] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2023-03-09 12:55:09] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-09 12:55:09] [INFO ] Invariant cache hit.
[2023-03-09 12:55:09] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/239 places, 291/341 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 858 ms. Remains : 123/239 places, 291/341 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
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}]], initial=0, aps=[p0:(GEQ s107 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-01 finished in 924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 341/341 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 239 transition count 278
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 176 transition count 278
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 126 place count 176 transition count 268
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 146 place count 166 transition count 268
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 161 place count 151 transition count 239
Iterating global reduction 2 with 15 rules applied. Total rules applied 176 place count 151 transition count 239
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 187 place count 151 transition count 228
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 198 place count 140 transition count 228
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 212 place count 133 transition count 221
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 232 place count 123 transition count 291
Applied a total of 232 rules in 56 ms. Remains 123 /239 variables (removed 116) and now considering 291/341 (removed 50) transitions.
// Phase 1: matrix 291 rows 123 cols
[2023-03-09 12:55:09] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 12:55:09] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-09 12:55:09] [INFO ] Invariant cache hit.
[2023-03-09 12:55:09] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-09 12:55:09] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2023-03-09 12:55:09] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 12:55:09] [INFO ] Invariant cache hit.
[2023-03-09 12:55:10] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/239 places, 291/341 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 721 ms. Remains : 123/239 places, 291/341 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-03 finished in 798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((X(!p0) U p1)))))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 341/341 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 222 transition count 310
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 222 transition count 310
Applied a total of 34 rules in 10 ms. Remains 222 /239 variables (removed 17) and now considering 310/341 (removed 31) transitions.
// Phase 1: matrix 310 rows 222 cols
[2023-03-09 12:55:10] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 12:55:10] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-09 12:55:10] [INFO ] Invariant cache hit.
[2023-03-09 12:55:10] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 12:55:10] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-09 12:55:10] [INFO ] Invariant cache hit.
[2023-03-09 12:55:10] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/239 places, 310/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 481 ms. Remains : 222/239 places, 310/341 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s54 1) (GEQ s119 1)), p0:(AND (GEQ s30 1) (GEQ s179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 350 steps with 1 reset in 2 ms.
FORMULA CANConstruction-PT-010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-04 finished in 596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 341/341 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 239 transition count 277
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 175 transition count 277
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 175 transition count 267
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 165 transition count 267
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 161 place count 152 transition count 241
Iterating global reduction 2 with 13 rules applied. Total rules applied 174 place count 152 transition count 241
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 184 place count 152 transition count 231
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 194 place count 142 transition count 231
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 212 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 232 place count 123 transition count 291
Applied a total of 232 rules in 45 ms. Remains 123 /239 variables (removed 116) and now considering 291/341 (removed 50) transitions.
// Phase 1: matrix 291 rows 123 cols
[2023-03-09 12:55:10] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-09 12:55:10] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-09 12:55:10] [INFO ] Invariant cache hit.
[2023-03-09 12:55:10] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-03-09 12:55:11] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2023-03-09 12:55:11] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 12:55:11] [INFO ] Invariant cache hit.
[2023-03-09 12:55:11] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/239 places, 291/341 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 602 ms. Remains : 123/239 places, 291/341 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s100 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 2109 reset in 432 ms.
Stack based approach found an accepted trace after 2098 steps with 46 reset with depth 41 and stack size 40 in 33 ms.
FORMULA CANConstruction-PT-010-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-05 finished in 1123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1&&G(!p0)))))'
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 341/341 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 223 transition count 312
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 223 transition count 312
Applied a total of 32 rules in 11 ms. Remains 223 /239 variables (removed 16) and now considering 312/341 (removed 29) transitions.
// Phase 1: matrix 312 rows 223 cols
[2023-03-09 12:55:11] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-09 12:55:12] [INFO ] Implicit Places using invariants in 607 ms returned []
[2023-03-09 12:55:12] [INFO ] Invariant cache hit.
[2023-03-09 12:55:12] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 12:55:12] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
[2023-03-09 12:55:12] [INFO ] Invariant cache hit.
[2023-03-09 12:55:13] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 223/239 places, 312/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1275 ms. Remains : 223/239 places, 312/341 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (OR (NOT p1) p0), p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 2}, { cond=p0, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s6 1) (GEQ s59 1)), p1:(GEQ s170 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][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-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-06 finished in 1509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F(p1))))))'
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 341/341 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 224 transition count 314
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 224 transition count 314
Applied a total of 30 rules in 6 ms. Remains 224 /239 variables (removed 15) and now considering 314/341 (removed 27) transitions.
// Phase 1: matrix 314 rows 224 cols
[2023-03-09 12:55:13] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 12:55:13] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-09 12:55:13] [INFO ] Invariant cache hit.
[2023-03-09 12:55:13] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 12:55:13] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2023-03-09 12:55:13] [INFO ] Invariant cache hit.
[2023-03-09 12:55:13] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 224/239 places, 314/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 638 ms. Remains : 224/239 places, 314/341 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s211 1), p1:(GEQ s184 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1946 steps with 11 reset in 6 ms.
FORMULA CANConstruction-PT-010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-08 finished in 809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 341/341 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 239 transition count 277
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 175 transition count 277
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 175 transition count 267
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 148 place count 165 transition count 267
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 161 place count 152 transition count 241
Iterating global reduction 2 with 13 rules applied. Total rules applied 174 place count 152 transition count 241
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 185 place count 152 transition count 230
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 196 place count 141 transition count 230
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 4 with 16 rules applied. Total rules applied 212 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 232 place count 123 transition count 291
Applied a total of 232 rules in 49 ms. Remains 123 /239 variables (removed 116) and now considering 291/341 (removed 50) transitions.
// Phase 1: matrix 291 rows 123 cols
[2023-03-09 12:55:14] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 12:55:14] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 12:55:14] [INFO ] Invariant cache hit.
[2023-03-09 12:55:14] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-03-09 12:55:14] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-03-09 12:55:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 12:55:14] [INFO ] Invariant cache hit.
[2023-03-09 12:55:14] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/239 places, 291/341 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 693 ms. Remains : 123/239 places, 291/341 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s37 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 50 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-09 finished in 771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(p1||G(p2))))))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 341/341 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 224 transition count 313
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 224 transition count 313
Applied a total of 30 rules in 10 ms. Remains 224 /239 variables (removed 15) and now considering 313/341 (removed 28) transitions.
// Phase 1: matrix 313 rows 224 cols
[2023-03-09 12:55:14] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 12:55:15] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-09 12:55:15] [INFO ] Invariant cache hit.
[2023-03-09 12:55:15] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 12:55:15] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2023-03-09 12:55:15] [INFO ] Invariant cache hit.
[2023-03-09 12:55:15] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 224/239 places, 313/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 590 ms. Remains : 224/239 places, 313/341 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
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=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LT s101 1), p0:(OR (LT s30 1) (LT s47 1)), p2:(LT s148 1)], nbAcceptance=1, 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 612 reset in 192 ms.
Stack based approach found an accepted trace after 814 steps with 4 reset with depth 165 and stack size 165 in 2 ms.
FORMULA CANConstruction-PT-010-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-10 finished in 1012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((p0 U p1))) U X(!((p0 U p2)&&p3)))))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 341/341 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 225 transition count 316
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 225 transition count 316
Applied a total of 28 rules in 11 ms. Remains 225 /239 variables (removed 14) and now considering 316/341 (removed 25) transitions.
// Phase 1: matrix 316 rows 225 cols
[2023-03-09 12:55:15] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 12:55:16] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-09 12:55:16] [INFO ] Invariant cache hit.
[2023-03-09 12:55:16] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 12:55:16] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2023-03-09 12:55:16] [INFO ] Invariant cache hit.
[2023-03-09 12:55:16] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/239 places, 316/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 689 ms. Remains : 225/239 places, 316/341 transitions.
Stuttering acceptance computed with spot in 367 ms :[(AND p2 p3), (AND p2 p3), (NOT p1), (AND p2 p3), (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p3 p2), acceptance={} source=1 dest: 2}, { cond=(AND p3 p2), acceptance={} source=1 dest: 3}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p3 p0 p2 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=(AND p3 p2), acceptance={} source=3 dest: 2}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p3 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p3 p0 p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=p2, acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(GEQ s88 1), p2:(LT s163 1), p0:(GEQ s129 1), p1:(GEQ s210 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7174 steps with 41 reset in 25 ms.
FORMULA CANConstruction-PT-010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-11 finished in 1135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((F(p1)&&G(p2)))))'
Support contains 5 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 341/341 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 225 transition count 314
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 225 transition count 314
Applied a total of 28 rules in 10 ms. Remains 225 /239 variables (removed 14) and now considering 314/341 (removed 27) transitions.
// Phase 1: matrix 314 rows 225 cols
[2023-03-09 12:55:17] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 12:55:17] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-09 12:55:17] [INFO ] Invariant cache hit.
[2023-03-09 12:55:17] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 12:55:17] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-03-09 12:55:17] [INFO ] Invariant cache hit.
[2023-03-09 12:55:17] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/239 places, 314/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 694 ms. Remains : 225/239 places, 314/341 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s196 1), p2:(AND (LT s17 1) (OR (LT s104 1) (LT s138 1))), p1:(LT s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1155 steps with 7 reset in 2 ms.
FORMULA CANConstruction-PT-010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-12 finished in 932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 341/341 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 239 transition count 278
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 176 transition count 278
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 126 place count 176 transition count 268
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 146 place count 166 transition count 268
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 160 place count 152 transition count 240
Iterating global reduction 2 with 14 rules applied. Total rules applied 174 place count 152 transition count 240
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 186 place count 152 transition count 228
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 198 place count 140 transition count 228
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 210 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 230 place count 124 transition count 292
Applied a total of 230 rules in 50 ms. Remains 124 /239 variables (removed 115) and now considering 292/341 (removed 49) transitions.
// Phase 1: matrix 292 rows 124 cols
[2023-03-09 12:55:18] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-09 12:55:18] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-09 12:55:18] [INFO ] Invariant cache hit.
[2023-03-09 12:55:18] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-09 12:55:18] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-09 12:55:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 12:55:18] [INFO ] Invariant cache hit.
[2023-03-09 12:55:18] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/239 places, 292/341 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 815 ms. Remains : 124/239 places, 292/341 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-13 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 s8 1) (GEQ s11 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 118 steps with 1 reset in 0 ms.
FORMULA CANConstruction-PT-010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-13 finished in 948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 341/341 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 239 transition count 279
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 177 transition count 279
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 124 place count 177 transition count 269
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 144 place count 167 transition count 269
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 159 place count 152 transition count 240
Iterating global reduction 2 with 15 rules applied. Total rules applied 174 place count 152 transition count 240
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 185 place count 152 transition count 229
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 196 place count 141 transition count 229
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 208 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 4 with 20 rules applied. Total rules applied 228 place count 125 transition count 293
Applied a total of 228 rules in 35 ms. Remains 125 /239 variables (removed 114) and now considering 293/341 (removed 48) transitions.
// Phase 1: matrix 293 rows 125 cols
[2023-03-09 12:55:18] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 12:55:19] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-09 12:55:19] [INFO ] Invariant cache hit.
[2023-03-09 12:55:19] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-09 12:55:19] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2023-03-09 12:55:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 12:55:19] [INFO ] Invariant cache hit.
[2023-03-09 12:55:19] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/239 places, 293/341 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 735 ms. Remains : 125/239 places, 293/341 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s22 1) (GEQ s85 1)), p1:(OR (LT s27 1) (LT s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 85 steps with 1 reset in 0 ms.
FORMULA CANConstruction-PT-010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-14 finished in 820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 341/341 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 222 transition count 310
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 222 transition count 310
Applied a total of 34 rules in 5 ms. Remains 222 /239 variables (removed 17) and now considering 310/341 (removed 31) transitions.
// Phase 1: matrix 310 rows 222 cols
[2023-03-09 12:55:19] [INFO ] Computed 11 place invariants in 14 ms
[2023-03-09 12:55:19] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-09 12:55:19] [INFO ] Invariant cache hit.
[2023-03-09 12:55:20] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 12:55:20] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-09 12:55:20] [INFO ] Invariant cache hit.
[2023-03-09 12:55:20] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/239 places, 310/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 585 ms. Remains : 222/239 places, 310/341 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 47 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-15 finished in 705 ms.
All properties solved by simple procedures.
Total runtime 16088 ms.

BK_STOP 1678366520743

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="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-5348"
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 r037-tajo-167813690600620"
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 ;