fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r461-smll-171701122900108
Last Updated
July 7, 2024

About the Execution of 2023-gold for UtilityControlRoom-PT-Z2T3N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1689.815 100240.00 212740.00 843.40 FFFFFFTFFFFFFFFF 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.r461-smll-171701122900108.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 UtilityControlRoom-PT-Z2T3N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r461-smll-171701122900108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 28K Apr 13 05:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 13 05:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 13 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 155K Apr 13 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 51K Apr 13 05:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 256K Apr 13 05:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 13 05:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 333K Apr 13 05:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.4K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 116K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717175798065

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=UtilityControlRoom-PT-Z2T3N10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 17:16:41] [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-31 17:16:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 17:16:41] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2024-05-31 17:16:41] [INFO ] Transformed 174 places.
[2024-05-31 17:16:41] [INFO ] Transformed 270 transitions.
[2024-05-31 17:16:41] [INFO ] Parsed PT model containing 174 places and 270 transitions and 850 arcs in 368 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2024-05-31 17:16:41] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-31 17:16:41] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-31 17:16:41] [INFO ] Reduced 10 identical enabling conditions.
Ensure Unique test removed 40 transitions
Reduce redundant transitions removed 40 transitions.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 125 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 28 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2024-05-31 17:16:41] [INFO ] Computed 23 invariants in 34 ms
[2024-05-31 17:16:42] [INFO ] Implicit Places using invariants in 422 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 480 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/174 places, 230/230 transitions.
Applied a total of 0 rules in 9 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 518 ms. Remains : 173/174 places, 230/230 transitions.
Support contains 125 out of 173 places after structural reductions.
[2024-05-31 17:16:42] [INFO ] Flatten gal took : 93 ms
[2024-05-31 17:16:42] [INFO ] Flatten gal took : 48 ms
[2024-05-31 17:16:43] [INFO ] Input system was already deterministic with 230 transitions.
Support contains 124 out of 173 places (down from 125) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 24) seen :23
Finished Best-First random walk after 3786 steps, including 1 resets, run visited all 1 properties in 10 ms. (steps per millisecond=378 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 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)))'
Support contains 23 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
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 160 place count 103 transition count 140
Applied a total of 160 rules in 52 ms. Remains 103 /173 variables (removed 70) and now considering 140/230 (removed 90) transitions.
// Phase 1: matrix 140 rows 103 cols
[2024-05-31 17:16:43] [INFO ] Computed 22 invariants in 2 ms
[2024-05-31 17:16:43] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-31 17:16:43] [INFO ] Invariant cache hit.
[2024-05-31 17:16:44] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-31 17:16:44] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-31 17:16:44] [INFO ] Invariant cache hit.
[2024-05-31 17:16:44] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/173 places, 140/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 619 ms. Remains : 103/173 places, 140/230 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 262 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-00 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 (AND (GEQ s0 1) (GEQ s17 1) (GEQ s52 1)) (AND (GEQ s1 1) (GEQ s14 1) (GEQ s52 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s52 1)) (AND (GEQ s0 1) (GEQ s2 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 0 reset in 1063 ms.
Stack based approach found an accepted trace after 845 steps with 0 reset with depth 846 and stack size 846 in 7 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-00 finished in 2017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 40 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 132 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 132 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 122 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 122 transition count 140
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 163 place count 101 transition count 120
Applied a total of 163 rules in 30 ms. Remains 101 /173 variables (removed 72) and now considering 120/230 (removed 110) transitions.
// Phase 1: matrix 120 rows 101 cols
[2024-05-31 17:16:45] [INFO ] Computed 21 invariants in 2 ms
[2024-05-31 17:16:45] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 17:16:45] [INFO ] Invariant cache hit.
[2024-05-31 17:16:45] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-31 17:16:45] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 17:16:45] [INFO ] Invariant cache hit.
[2024-05-31 17:16:46] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/173 places, 120/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 351 ms. Remains : 101/173 places, 120/230 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(AND (OR (LT s59 1) (LT s95 1)) (OR (LT s64 1) (LT s97 1)) (OR (LT s54 1) (LT s92 1)) (OR (LT s69 1) (LT s100 1)) (OR (LT s57 1) (LT s94 1)) (OR (LT s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-01 finished in 495 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 40 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 173 transition count 210
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 153 transition count 210
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 120 place count 113 transition count 170
Applied a total of 120 rules in 35 ms. Remains 113 /173 variables (removed 60) and now considering 170/230 (removed 60) transitions.
// Phase 1: matrix 170 rows 113 cols
[2024-05-31 17:16:46] [INFO ] Computed 22 invariants in 5 ms
[2024-05-31 17:16:46] [INFO ] Implicit Places using invariants in 182 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 185 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/173 places, 170/230 transitions.
Applied a total of 0 rules in 12 ms. Remains 112 /112 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 233 ms. Remains : 112/173 places, 170/230 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s65 1) (LT s64 1) (LT s67 1) (LT s66 1) (LT s69 1) (LT s68 1) (LT s71 1) (LT s70 1) (LT s73 1) (LT s72 1) (LT s75 1) (LT s74 1) (LT s77 1) (LT...], 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 0 reset in 721 ms.
Stack based approach found an accepted trace after 989 steps with 0 reset with depth 990 and stack size 990 in 11 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-02 finished in 1220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 30 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 132 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 132 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 122 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 122 transition count 140
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 61 rules applied. Total rules applied 183 place count 91 transition count 110
Applied a total of 183 rules in 39 ms. Remains 91 /173 variables (removed 82) and now considering 110/230 (removed 120) transitions.
// Phase 1: matrix 110 rows 91 cols
[2024-05-31 17:16:47] [INFO ] Computed 21 invariants in 1 ms
[2024-05-31 17:16:47] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-31 17:16:47] [INFO ] Invariant cache hit.
[2024-05-31 17:16:47] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-31 17:16:47] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 17:16:47] [INFO ] Invariant cache hit.
[2024-05-31 17:16:47] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/173 places, 110/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 403 ms. Remains : 91/173 places, 110/230 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s66 1) (LT s78 1)) (OR (LT s63 1) (LT s77 1)) (OR (LT s51 1) (LT s71 1)) (OR (LT s61 1) (LT s76 1)) (OR (LT s53 1) (LT s72 1)) (OR (LT s58...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1170 reset in 573 ms.
Stack based approach found an accepted trace after 13237 steps with 146 reset with depth 36 and stack size 36 in 55 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-03 finished in 1156 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 (G(p2)||p1)))'
Support contains 33 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 7 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-05-31 17:16:48] [INFO ] Computed 22 invariants in 3 ms
[2024-05-31 17:16:48] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-31 17:16:48] [INFO ] Invariant cache hit.
[2024-05-31 17:16:48] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-05-31 17:16:48] [INFO ] Invariant cache hit.
[2024-05-31 17:16:49] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 503 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p2)), true, (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=(AND p2 p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s27 1) (GEQ s102 1)) (AND (GEQ s1 1) (GEQ s24 1) (GEQ s102 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s102 1)) (AND (GEQ s0 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-04 finished in 738 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((X(F(!p0)) U (X(!p2)||p1)))))'
Support contains 30 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 5 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
[2024-05-31 17:16:49] [INFO ] Invariant cache hit.
[2024-05-31 17:16:49] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-31 17:16:49] [INFO ] Invariant cache hit.
[2024-05-31 17:16:49] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-05-31 17:16:49] [INFO ] Invariant cache hit.
[2024-05-31 17:16:49] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 554 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s113 1) (GEQ s114 1) (GEQ s117 1) (GEQ s118 1) (GEQ s115 1) (GEQ s116 1) (GEQ s121 1) (GEQ s122 1) (GEQ s119 1) (GEQ s120 1)), p2:(OR (GEQ s10...], 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 7032 reset in 467 ms.
Product exploration explored 100000 steps with 7020 reset in 650 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2 p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 221 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p1) p2), (AND (NOT p1) p0 p2), (AND (NOT p1) p2), (AND (NOT p1) p0 p2)]
Finished random walk after 56 steps, including 0 resets, run visited all 7 properties in 8 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2 p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (AND p2 (NOT p1))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND p0 p2)), (F (AND p0 p2 (NOT p1)))]
Knowledge based reduction with 10 factoid took 643 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) p2), (AND (NOT p1) p0 p2), (AND (NOT p1) p2), (AND (NOT p1) p0 p2)]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) p2), (AND (NOT p1) p0 p2), (AND (NOT p1) p2), (AND (NOT p1) p0 p2)]
Support contains 30 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-31 17:16:52] [INFO ] Invariant cache hit.
[2024-05-31 17:16:52] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-31 17:16:52] [INFO ] Invariant cache hit.
[2024-05-31 17:16:53] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-05-31 17:16:53] [INFO ] Invariant cache hit.
[2024-05-31 17:16:53] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 716 ms. Remains : 153/153 places, 210/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 326 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) p2), (AND (NOT p1) p0 p2), (AND (NOT p1) p2), (AND (NOT p1) p0 p2)]
Finished random walk after 35 steps, including 0 resets, run visited all 7 properties in 5 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (AND (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND p0 p2)), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 10 factoid took 621 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) p2), (AND (NOT p1) p0 p2), (AND (NOT p1) p2), (AND (NOT p1) p0 p2)]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) p2), (AND (NOT p1) p0 p2), (AND (NOT p1) p2), (AND (NOT p1) p0 p2)]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) p2), (AND (NOT p1) p0 p2), (AND (NOT p1) p2), (AND (NOT p1) p0 p2)]
Product exploration explored 100000 steps with 6850 reset in 325 ms.
Product exploration explored 100000 steps with 6868 reset in 308 ms.
Built C files in :
/tmp/ltsmin16015219293613533724
[2024-05-31 17:16:56] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16015219293613533724
Running compilation step : cd /tmp/ltsmin16015219293613533724;'/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 1149 ms.
Running link step : cd /tmp/ltsmin16015219293613533724;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin16015219293613533724;'/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/stateBased16376504315095857121.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 30 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-31 17:17:11] [INFO ] Invariant cache hit.
[2024-05-31 17:17:11] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-31 17:17:11] [INFO ] Invariant cache hit.
[2024-05-31 17:17:11] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-31 17:17:11] [INFO ] Invariant cache hit.
[2024-05-31 17:17:11] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 550 ms. Remains : 153/153 places, 210/210 transitions.
Built C files in :
/tmp/ltsmin5040811824092309124
[2024-05-31 17:17:11] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5040811824092309124
Running compilation step : cd /tmp/ltsmin5040811824092309124;'/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 569 ms.
Running link step : cd /tmp/ltsmin5040811824092309124;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5040811824092309124;'/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/stateBased17651571090884777297.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 17:17:27] [INFO ] Flatten gal took : 31 ms
[2024-05-31 17:17:27] [INFO ] Flatten gal took : 34 ms
[2024-05-31 17:17:27] [INFO ] Time to serialize gal into /tmp/LTL6123899160097340967.gal : 6 ms
[2024-05-31 17:17:27] [INFO ] Time to serialize properties into /tmp/LTL7206010391618685377.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6123899160097340967.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6215410578451137833.hoa' '-atoms' '/tmp/LTL7206010391618685377.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7206010391618685377.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6215410578451137833.hoa
Detected timeout of ITS tools.
[2024-05-31 17:17:42] [INFO ] Flatten gal took : 17 ms
[2024-05-31 17:17:42] [INFO ] Flatten gal took : 16 ms
[2024-05-31 17:17:42] [INFO ] Time to serialize gal into /tmp/LTL6944237855450258899.gal : 3 ms
[2024-05-31 17:17:42] [INFO ] Time to serialize properties into /tmp/LTL17506025839599596471.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6944237855450258899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17506025839599596471.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((X(F(!("(((((ControlRoomDispatch_2<1)&&(ControlRoomDispatch_3<1))&&((ControlRoomDispatch_0<1)&&(ControlRoomDispatch_1<1)))&&(((...786
Formula 0 simplified : GF(XG"(((((ControlRoomDispatch_2<1)&&(ControlRoomDispatch_3<1))&&((ControlRoomDispatch_0<1)&&(ControlRoomDispatch_1<1)))&&(((Control...765
Detected timeout of ITS tools.
[2024-05-31 17:17:57] [INFO ] Flatten gal took : 15 ms
[2024-05-31 17:17:57] [INFO ] Applying decomposition
[2024-05-31 17:17:57] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7393499221923236201.txt' '-o' '/tmp/graph7393499221923236201.bin' '-w' '/tmp/graph7393499221923236201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7393499221923236201.bin' '-l' '-1' '-v' '-w' '/tmp/graph7393499221923236201.weights' '-q' '0' '-e' '0.001'
[2024-05-31 17:17:57] [INFO ] Decomposing Gal with order
[2024-05-31 17:17:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 17:17:57] [INFO ] Removed a total of 245 redundant transitions.
[2024-05-31 17:17:57] [INFO ] Flatten gal took : 112 ms
[2024-05-31 17:17:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 27 ms.
[2024-05-31 17:17:57] [INFO ] Time to serialize gal into /tmp/LTL4183744443177686535.gal : 11 ms
[2024-05-31 17:17:57] [INFO ] Time to serialize properties into /tmp/LTL3439752097615310426.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4183744443177686535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3439752097615310426.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G((X(F(!("(((((i4.i0.u35.ControlRoomDispatch_2<1)&&(i1.i0.u36.ControlRoomDispatch_3<1))&&((i2.i0.u4.ControlRoomDispatch_0<1)&&(i6...1080
Formula 0 simplified : GF(XG"(((((i4.i0.u35.ControlRoomDispatch_2<1)&&(i1.i0.u36.ControlRoomDispatch_3<1))&&((i2.i0.u4.ControlRoomDispatch_0<1)&&(i6.i0.u34...1059
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
400 unique states visited
0 strongly connected components in search stack
784 transitions explored
66 items max in DFS search stack
820 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.26732,238464,1,0,452710,168,2042,306929,97,500,666757
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-06 finished in 77964 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(((G((!p1||G(p1)))&&F(!p2))||p0))))'
Support contains 73 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 173 cols
[2024-05-31 17:18:07] [INFO ] Computed 22 invariants in 2 ms
[2024-05-31 17:18:07] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-31 17:18:07] [INFO ] Invariant cache hit.
[2024-05-31 17:18:07] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-31 17:18:07] [INFO ] Invariant cache hit.
[2024-05-31 17:18:07] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 578 ms. Remains : 173/173 places, 230/230 transitions.
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), false, p2, true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (GEQ s133 1) (GEQ s134 1) (GEQ s137 1) (GEQ s138 1) (GEQ s135 1) (GEQ s136 1) (GEQ s141 1) (GEQ s142 1) (GEQ s139 1) (GEQ s140 1)), p1:(OR (AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 474 steps with 146 reset in 4 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-07 finished in 973 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(((!p1 U (p2||G(!p1)))&&p0)))'
Support contains 7 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 154 transition count 211
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 154 transition count 211
Applied a total of 38 rules in 10 ms. Remains 154 /173 variables (removed 19) and now considering 211/230 (removed 19) transitions.
// Phase 1: matrix 211 rows 154 cols
[2024-05-31 17:18:08] [INFO ] Computed 22 invariants in 3 ms
[2024-05-31 17:18:08] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-31 17:18:08] [INFO ] Invariant cache hit.
[2024-05-31 17:18:08] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2024-05-31 17:18:08] [INFO ] Invariant cache hit.
[2024-05-31 17:18:08] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/173 places, 211/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 726 ms. Remains : 154/173 places, 211/230 transitions.
Stuttering acceptance computed with spot in 260 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (AND (NOT p2) p1), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(AND (LT s63 1) (NOT (AND (GEQ s90 1) (GEQ s122 1) (GEQ s0 1) (GEQ s23 1) (GEQ s103 1)))), p1:(AND (GEQ s90 1) (GEQ s122 1) (GEQ s0 1) (GEQ s23 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-08 finished in 1011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||(p1&&F(p2)))))))'
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 5 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-05-31 17:18:09] [INFO ] Computed 22 invariants in 3 ms
[2024-05-31 17:18:09] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-31 17:18:09] [INFO ] Invariant cache hit.
[2024-05-31 17:18:09] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-05-31 17:18:09] [INFO ] Invariant cache hit.
[2024-05-31 17:18:09] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 702 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(LT s3 1), p1:(GEQ s111 1), p2:(OR (LT s1 1) (LT s12 1) (LT s102 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]]
Product exploration explored 100000 steps with 7318 reset in 389 ms.
Product exploration explored 100000 steps with 7179 reset in 392 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Finished random walk after 3219 steps, including 0 resets, run visited all 3 properties in 37 ms. (steps per millisecond=87 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 204 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2024-05-31 17:18:11] [INFO ] Invariant cache hit.
[2024-05-31 17:18:12] [INFO ] [Real]Absence check using 22 positive place invariants in 15 ms returned unsat
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 2 factoid took 311 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-09 finished in 3272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 176 place count 95 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 94 transition count 131
Applied a total of 178 rules in 32 ms. Remains 94 /173 variables (removed 79) and now considering 131/230 (removed 99) transitions.
// Phase 1: matrix 131 rows 94 cols
[2024-05-31 17:18:12] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 17:18:12] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-31 17:18:12] [INFO ] Invariant cache hit.
[2024-05-31 17:18:12] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-05-31 17:18:12] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-31 17:18:12] [INFO ] Invariant cache hit.
[2024-05-31 17:18:12] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/173 places, 131/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 438 ms. Remains : 94/173 places, 131/230 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-10 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 s1 1) (GEQ s14 1) (GEQ s53 1)), p1:(GEQ s52 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]]
Product exploration explored 100000 steps with 1290 reset in 229 ms.
Stack based approach found an accepted trace after 20931 steps with 261 reset with depth 157 and stack size 157 in 55 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-10 finished in 833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 173 transition count 192
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 96 place count 135 transition count 172
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 96 place count 135 transition count 152
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 136 place count 115 transition count 152
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 174 place count 96 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 176 place count 95 transition count 132
Applied a total of 176 rules in 21 ms. Remains 95 /173 variables (removed 78) and now considering 132/230 (removed 98) transitions.
// Phase 1: matrix 132 rows 95 cols
[2024-05-31 17:18:13] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 17:18:13] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-31 17:18:13] [INFO ] Invariant cache hit.
[2024-05-31 17:18:13] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-05-31 17:18:13] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 17:18:13] [INFO ] Invariant cache hit.
[2024-05-31 17:18:13] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/173 places, 132/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 498 ms. Remains : 95/173 places, 132/230 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s12 1) (LT s54 1)) (LT s52 1)), p1:(LT s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 393 ms.
Stack based approach found an accepted trace after 5130 steps with 0 reset with depth 5131 and stack size 5128 in 24 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-11 finished in 1070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 178 place count 94 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 93 transition count 130
Applied a total of 180 rules in 27 ms. Remains 93 /173 variables (removed 80) and now considering 130/230 (removed 100) transitions.
// Phase 1: matrix 130 rows 93 cols
[2024-05-31 17:18:14] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 17:18:14] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-31 17:18:14] [INFO ] Invariant cache hit.
[2024-05-31 17:18:14] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-05-31 17:18:14] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 17:18:14] [INFO ] Invariant cache hit.
[2024-05-31 17:18:14] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/173 places, 130/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 524 ms. Remains : 93/173 places, 130/230 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s12 1) (GEQ s52 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]]
Product exploration explored 100000 steps with 1275 reset in 378 ms.
Stack based approach found an accepted trace after 8082 steps with 92 reset with depth 143 and stack size 143 in 33 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-12 finished in 1002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 178 place count 94 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 93 transition count 130
Applied a total of 180 rules in 28 ms. Remains 93 /173 variables (removed 80) and now considering 130/230 (removed 100) transitions.
// Phase 1: matrix 130 rows 93 cols
[2024-05-31 17:18:15] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 17:18:15] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-31 17:18:15] [INFO ] Invariant cache hit.
[2024-05-31 17:18:15] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-31 17:18:15] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 17:18:15] [INFO ] Invariant cache hit.
[2024-05-31 17:18:15] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/173 places, 130/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 538 ms. Remains : 93/173 places, 130/230 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-14 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 s1 1) (GEQ s19 1) (GEQ s52 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]]
Product exploration explored 100000 steps with 1265 reset in 215 ms.
Stack based approach found an accepted trace after 4744 steps with 57 reset with depth 100 and stack size 100 in 11 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-14 finished in 879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((p0&&F(p1)))))))'
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 6 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-05-31 17:18:16] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 17:18:16] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 17:18:16] [INFO ] Invariant cache hit.
[2024-05-31 17:18:16] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-05-31 17:18:16] [INFO ] Invariant cache hit.
[2024-05-31 17:18:16] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 443 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s100 1), p1:(GEQ s101 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]]
Product exploration explored 100000 steps with 2403 reset in 204 ms.
Stack based approach found an accepted trace after 43210 steps with 1091 reset with depth 82 and stack size 82 in 94 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-15 finished in 907 ms.
All properties solved by simple procedures.
Total runtime 96069 ms.

BK_STOP 1717175898305

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-PT-Z2T3N10"
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 UtilityControlRoom-PT-Z2T3N10, 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 r461-smll-171701122900108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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