About the Execution of 2023-gold for CSRepetitions-PT-07
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
966.107 | 51507.00 | 73770.00 | 643.10 | FTTTFFTFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521600163.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CSRepetitions-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521600163
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.8M
-rw-r--r-- 1 mcc users 136K Apr 12 09:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 09:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 138K Apr 12 09:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 574K Apr 12 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 67K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 120K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 368K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 491K Apr 12 10:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Apr 12 10:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 392K Apr 12 10:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 424K May 18 16:42 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 CSRepetitions-PT-07-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716247067128
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-07
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 23:17:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 23:17:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 23:17:48] [INFO ] Load time of PNML (sax parser for PT used): 269 ms
[2024-05-20 23:17:48] [INFO ] Transformed 498 places.
[2024-05-20 23:17:48] [INFO ] Transformed 833 transitions.
[2024-05-20 23:17:48] [INFO ] Parsed PT model containing 498 places and 833 transitions and 3087 arcs in 336 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA CSRepetitions-PT-07-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 452 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 25 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2024-05-20 23:17:49] [INFO ] Computed 56 invariants in 47 ms
[2024-05-20 23:17:49] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-20 23:17:49] [INFO ] Invariant cache hit.
[2024-05-20 23:17:49] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 23:17:49] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2024-05-20 23:17:49] [INFO ] Invariant cache hit.
[2024-05-20 23:17:50] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 963 ms. Remains : 498/498 places, 833/833 transitions.
Support contains 452 out of 498 places after structural reductions.
[2024-05-20 23:17:50] [INFO ] Flatten gal took : 105 ms
[2024-05-20 23:17:50] [INFO ] Flatten gal took : 87 ms
[2024-05-20 23:17:50] [INFO ] Input system was already deterministic with 833 transitions.
Finished random walk after 6498 steps, including 62 resets, run visited all 18 properties in 151 ms. (steps per millisecond=43 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 56 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 400 transition count 784
Discarding 336 places :
Symmetric choice reduction at 0 with 336 rule applications. Total rules 483 place count 64 transition count 448
Iterating global reduction 0 with 336 rules applied. Total rules applied 819 place count 64 transition count 448
Applied a total of 819 rules in 98 ms. Remains 64 /498 variables (removed 434) and now considering 448/833 (removed 385) transitions.
// Phase 1: matrix 448 rows 64 cols
[2024-05-20 23:17:51] [INFO ] Computed 7 invariants in 4 ms
[2024-05-20 23:17:51] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-20 23:17:51] [INFO ] Invariant cache hit.
[2024-05-20 23:17:51] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-20 23:17:51] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-20 23:17:51] [INFO ] Invariant cache hit.
[2024-05-20 23:17:51] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/498 places, 448/833 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 397 ms. Remains : 64/498 places, 448/833 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s37 1) (LT s52 1)) (OR (LT s23 1) (LT s47 1)) (OR (LT s34 1) (LT s37 1)) (OR (LT s32 1) (LT s63 1)) (OR (LT s11 1) (LT s27 1)) (OR (LT s41...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 7 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-00 finished in 652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 392 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 5 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2024-05-20 23:17:51] [INFO ] Computed 56 invariants in 11 ms
[2024-05-20 23:17:52] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-20 23:17:52] [INFO ] Invariant cache hit.
[2024-05-20 23:17:52] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 23:17:52] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-05-20 23:17:52] [INFO ] Invariant cache hit.
[2024-05-20 23:17:52] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 724 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-07 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s267 1) (GEQ s447 1)) (AND (GEQ s220 1) (GEQ s276 1)) (AND (GEQ s24 1) (GEQ s276 1)) (AND (GEQ s411 1) (GEQ s417 1)) (AND (GEQ s172 1) (G...], 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]]
Product exploration explored 100000 steps with 6047 reset in 2400 ms.
Product exploration explored 100000 steps with 6026 reset in 2384 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-20 23:17:58] [INFO ] Invariant cache hit.
[2024-05-20 23:18:03] [INFO ] [Real]Absence check using 56 positive place invariants in 45 ms returned sat
[2024-05-20 23:18:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:18:03] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2024-05-20 23:18:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:18:08] [INFO ] [Nat]Absence check using 56 positive place invariants in 33 ms returned sat
[2024-05-20 23:18:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 23:18:09] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2024-05-20 23:18:09] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 23:18:09] [INFO ] [Nat]Added 49 Read/Feed constraints in 8 ms returned sat
[2024-05-20 23:18:09] [INFO ] Computed and/alt/rep : 784/1127/784 causal constraints (skipped 0 transitions) in 51 ms.
[2024-05-20 23:18:09] [INFO ] Added : 25 causal constraints over 5 iterations in 343 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 392 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 5 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2024-05-20 23:18:09] [INFO ] Invariant cache hit.
[2024-05-20 23:18:09] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-20 23:18:09] [INFO ] Invariant cache hit.
[2024-05-20 23:18:09] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 23:18:09] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-05-20 23:18:09] [INFO ] Invariant cache hit.
[2024-05-20 23:18:10] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 691 ms. Remains : 498/498 places, 833/833 transitions.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-20 23:18:11] [INFO ] Invariant cache hit.
[2024-05-20 23:18:15] [INFO ] [Real]Absence check using 56 positive place invariants in 46 ms returned sat
[2024-05-20 23:18:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:18:16] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2024-05-20 23:18:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:18:20] [INFO ] [Nat]Absence check using 56 positive place invariants in 32 ms returned sat
[2024-05-20 23:18:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 23:18:21] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2024-05-20 23:18:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 23:18:21] [INFO ] [Nat]Added 49 Read/Feed constraints in 8 ms returned sat
[2024-05-20 23:18:21] [INFO ] Computed and/alt/rep : 784/1127/784 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-20 23:18:21] [INFO ] Added : 25 causal constraints over 5 iterations in 307 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5990 reset in 2280 ms.
Product exploration explored 100000 steps with 6007 reset in 2323 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 392 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 50 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2024-05-20 23:18:26] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-20 23:18:26] [INFO ] Invariant cache hit.
[2024-05-20 23:18:27] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 441 ms. Remains : 498/498 places, 833/833 transitions.
Built C files in :
/tmp/ltsmin14204635826947579956
[2024-05-20 23:18:27] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14204635826947579956
Running compilation step : cd /tmp/ltsmin14204635826947579956;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1450 ms.
Running link step : cd /tmp/ltsmin14204635826947579956;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin14204635826947579956;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8020657889880079623.hoa' '--buchi-type=spotba'
LTSmin run took 800 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-PT-07-LTLFireability-07 finished in 37618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 35 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2024-05-20 23:18:29] [INFO ] Invariant cache hit.
[2024-05-20 23:18:29] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-20 23:18:29] [INFO ] Invariant cache hit.
[2024-05-20 23:18:29] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 23:18:30] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2024-05-20 23:18:30] [INFO ] Invariant cache hit.
[2024-05-20 23:18:30] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1167 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s265 1), p0:(LT s404 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]]
Entered a terminal (fully accepting) state of product in 111 steps with 55 reset in 2 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-08 finished in 1291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||F(p1)))'
Support contains 3 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 15 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2024-05-20 23:18:30] [INFO ] Invariant cache hit.
[2024-05-20 23:18:31] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-20 23:18:31] [INFO ] Invariant cache hit.
[2024-05-20 23:18:31] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 23:18:31] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
[2024-05-20 23:18:31] [INFO ] Invariant cache hit.
[2024-05-20 23:18:32] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1234 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s80 1) (GEQ s301 1)), p0:(GEQ s82 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 424 steps with 7 reset in 10 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-09 finished in 1322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(F(p0)) U p0) U G(p1))))'
Support contains 3 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 13 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2024-05-20 23:18:32] [INFO ] Invariant cache hit.
[2024-05-20 23:18:32] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-20 23:18:32] [INFO ] Invariant cache hit.
[2024-05-20 23:18:32] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 23:18:32] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2024-05-20 23:18:32] [INFO ] Invariant cache hit.
[2024-05-20 23:18:33] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1124 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LT s439 1), p0:(AND (GEQ s109 1) (GEQ s201 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 1724 steps with 406 reset in 28 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-10 finished in 1349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 402 transition count 785
Discarding 329 places :
Symmetric choice reduction at 0 with 329 rule applications. Total rules 473 place count 73 transition count 456
Iterating global reduction 0 with 329 rules applied. Total rules applied 802 place count 73 transition count 456
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 841 place count 34 transition count 144
Iterating global reduction 0 with 39 rules applied. Total rules applied 880 place count 34 transition count 144
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 919 place count 34 transition count 105
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 1 with 14 rules applied. Total rules applied 933 place count 27 transition count 98
Applied a total of 933 rules in 37 ms. Remains 27 /498 variables (removed 471) and now considering 98/833 (removed 735) transitions.
[2024-05-20 23:18:33] [INFO ] Flow matrix only has 44 transitions (discarded 54 similar events)
// Phase 1: matrix 44 rows 27 cols
[2024-05-20 23:18:33] [INFO ] Computed 8 invariants in 0 ms
[2024-05-20 23:18:33] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-20 23:18:33] [INFO ] Flow matrix only has 44 transitions (discarded 54 similar events)
[2024-05-20 23:18:33] [INFO ] Invariant cache hit.
[2024-05-20 23:18:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 23:18:33] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-20 23:18:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 23:18:33] [INFO ] Flow matrix only has 44 transitions (discarded 54 similar events)
[2024-05-20 23:18:33] [INFO ] Invariant cache hit.
[2024-05-20 23:18:33] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/498 places, 98/833 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 283 ms. Remains : 27/498 places, 98/833 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s16 1), p0:(LT s18 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 27 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-11 finished in 563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 400 transition count 784
Discarding 336 places :
Symmetric choice reduction at 0 with 336 rule applications. Total rules 483 place count 64 transition count 448
Iterating global reduction 0 with 336 rules applied. Total rules applied 819 place count 64 transition count 448
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 859 place count 24 transition count 128
Iterating global reduction 0 with 40 rules applied. Total rules applied 899 place count 24 transition count 128
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 939 place count 24 transition count 88
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 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 957 place count 12 transition count 82
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Graph (trivial) has 16 edges and 12 vertex of which 9 / 12 are part of one of the 1 SCC in 1 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 46 rules applied. Total rules applied 1003 place count 4 transition count 37
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 1032 place count 4 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1033 place count 4 transition count 7
Applied a total of 1033 rules in 40 ms. Remains 4 /498 variables (removed 494) and now considering 7/833 (removed 826) transitions.
// Phase 1: matrix 7 rows 4 cols
[2024-05-20 23:18:34] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 23:18:34] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-20 23:18:34] [INFO ] Invariant cache hit.
[2024-05-20 23:18:34] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-20 23:18:34] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-20 23:18:34] [INFO ] Invariant cache hit.
[2024-05-20 23:18:34] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/498 places, 7/833 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 4/498 places, 7/833 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-12 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 s1 1) (LT s2 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 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-12 finished in 178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (F(p1) U X(X(X(p2))))))'
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 16 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2024-05-20 23:18:34] [INFO ] Computed 56 invariants in 10 ms
[2024-05-20 23:18:34] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-20 23:18:34] [INFO ] Invariant cache hit.
[2024-05-20 23:18:34] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 23:18:35] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
[2024-05-20 23:18:35] [INFO ] Invariant cache hit.
[2024-05-20 23:18:35] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1158 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 944 ms :[(AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 17}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 15}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 16}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 17}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 20}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 15}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=2 dest: 16}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 20}], [{ cond=p1, acceptance={} source=3 dest: 7}, { cond=(NOT p1), acceptance={} source=3 dest: 8}], [{ cond=p1, acceptance={} source=4 dest: 15}, { cond=(NOT p1), acceptance={} source=4 dest: 19}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 15}, { cond=(AND p1 p0), acceptance={} source=5 dest: 16}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 19}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 15}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=6 dest: 16}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 19}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 10}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 13}, { cond=(AND p1 p0), acceptance={} source=7 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 13}, { cond=(AND p1 p0), acceptance={} source=8 dest: 14}], [{ cond=p1, acceptance={} source=9 dest: 15}, { cond=(NOT p1), acceptance={} source=9 dest: 18}], [{ cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 15}, { cond=(AND p1 p0), acceptance={} source=10 dest: 16}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 18}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=11 dest: 15}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=11 dest: 18}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=12 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=12 dest: 15}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=12 dest: 16}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=12 dest: 18}], [{ cond=(NOT p1), acceptance={} source=13 dest: 11}, { cond=p1, acceptance={} source=13 dest: 15}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p1) p0), acceptance={} source=14 dest: 12}, { cond=(AND p1 (NOT p0)), acceptance={} source=14 dest: 15}, { cond=(AND p1 p0), acceptance={} source=14 dest: 16}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=15 dest: 11}, { cond=(AND p1 (NOT p2)), acceptance={0} source=15 dest: 15}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=16 dest: 11}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=16 dest: 12}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=16 dest: 15}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=16 dest: 16}], [{ cond=(NOT p1), acceptance={0} source=17 dest: 17}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=18 dest: 15}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=18 dest: 19}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=19 dest: 15}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=19 dest: 20}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=20 dest: 15}, { cond=(AND (NOT p1) p2), acceptance={0} source=20 dest: 17}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=20 dest: 20}]], initial=3, aps=[p1:(GEQ s33 1), p0:(GEQ s86 1), p2:(AND (GEQ s449 1) (GEQ s491 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 4 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-13 finished in 2135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(G(p2))&&p1))&&p0)))'
Support contains 3 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 14 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2024-05-20 23:18:36] [INFO ] Invariant cache hit.
[2024-05-20 23:18:36] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-20 23:18:36] [INFO ] Invariant cache hit.
[2024-05-20 23:18:36] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 23:18:37] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
[2024-05-20 23:18:37] [INFO ] Invariant cache hit.
[2024-05-20 23:18:37] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1102 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s29 1) (GEQ s201 1)), p1:(AND (GEQ s29 1) (GEQ s201 1)), p2:(GEQ s96 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-15 finished in 1323 ms.
All properties solved by simple procedures.
Total runtime 49044 ms.
BK_STOP 1716247118635
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-PT-07"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CSRepetitions-PT-07, 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 r087-tall-171620521600163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-07.tgz
mv CSRepetitions-PT-07 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;