About the Execution of 2023-gold for FunctionPointer-PT-b128
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1826.367 | 36294.00 | 91970.00 | 1843.00 | FFFFFFFFFFFFTFTF | 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.r197-tall-171640625000168.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 FunctionPointer-PT-b128, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625000168
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 11 16:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b128-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716524812191
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=FunctionPointer-PT-b128
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 04:26:53] [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-24 04:26:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 04:26:53] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-24 04:26:53] [INFO ] Transformed 306 places.
[2024-05-24 04:26:53] [INFO ] Transformed 840 transitions.
[2024-05-24 04:26:53] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b128-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 32 place count 190 transition count 582
Iterating global reduction 1 with 22 rules applied. Total rules applied 54 place count 190 transition count 582
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 142 place count 190 transition count 494
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 151 place count 181 transition count 476
Iterating global reduction 2 with 9 rules applied. Total rules applied 160 place count 181 transition count 476
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 188 place count 181 transition count 448
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 194 place count 175 transition count 436
Iterating global reduction 3 with 6 rules applied. Total rules applied 200 place count 175 transition count 436
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 205 place count 170 transition count 416
Iterating global reduction 3 with 5 rules applied. Total rules applied 210 place count 170 transition count 416
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 215 place count 165 transition count 406
Iterating global reduction 3 with 5 rules applied. Total rules applied 220 place count 165 transition count 406
Applied a total of 220 rules in 64 ms. Remains 165 /222 variables (removed 57) and now considering 406/648 (removed 242) transitions.
[2024-05-24 04:26:54] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
// Phase 1: matrix 275 rows 165 cols
[2024-05-24 04:26:54] [INFO ] Computed 2 invariants in 16 ms
[2024-05-24 04:26:54] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-24 04:26:54] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
[2024-05-24 04:26:54] [INFO ] Invariant cache hit.
[2024-05-24 04:26:54] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-24 04:26:54] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2024-05-24 04:26:54] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
[2024-05-24 04:26:54] [INFO ] Invariant cache hit.
[2024-05-24 04:26:54] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 165/222 places, 406/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 886 ms. Remains : 165/222 places, 406/648 transitions.
Support contains 27 out of 165 places after structural reductions.
[2024-05-24 04:26:55] [INFO ] Flatten gal took : 53 ms
[2024-05-24 04:26:55] [INFO ] Flatten gal took : 24 ms
[2024-05-24 04:26:55] [INFO ] Input system was already deterministic with 406 transitions.
Incomplete random walk after 10012 steps, including 6 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 23) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2024-05-24 04:26:55] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
[2024-05-24 04:26:55] [INFO ] Invariant cache hit.
[2024-05-24 04:26:55] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-24 04:26:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:26:56] [INFO ] After 482ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-24 04:26:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2024-05-24 04:26:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:26:56] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-24 04:26:56] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-24 04:26:56] [INFO ] After 16ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-24 04:26:56] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-24 04:26:56] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 406/406 transitions.
Graph (complete) has 651 edges and 165 vertex of which 141 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 141 transition count 358
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 132 transition count 338
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 132 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 132 transition count 336
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 77 place count 124 transition count 320
Iterating global reduction 2 with 8 rules applied. Total rules applied 85 place count 124 transition count 320
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 117 transition count 292
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 117 transition count 292
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 106 place count 110 transition count 266
Iterating global reduction 2 with 7 rules applied. Total rules applied 113 place count 110 transition count 266
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 119 place count 104 transition count 252
Iterating global reduction 2 with 6 rules applied. Total rules applied 125 place count 104 transition count 252
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 131 place count 98 transition count 238
Iterating global reduction 2 with 6 rules applied. Total rules applied 137 place count 98 transition count 238
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 143 place count 92 transition count 226
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 92 transition count 226
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 155 place count 86 transition count 214
Iterating global reduction 2 with 6 rules applied. Total rules applied 161 place count 86 transition count 214
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 167 place count 80 transition count 202
Iterating global reduction 2 with 6 rules applied. Total rules applied 173 place count 80 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 79 transition count 200
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 79 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 176 place count 78 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 78 transition count 198
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 179 place count 78 transition count 196
Applied a total of 179 rules in 75 ms. Remains 78 /165 variables (removed 87) and now considering 196/406 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 78/165 places, 196/406 transitions.
Finished random walk after 4019 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=669 )
Parikh walk visited 0 properties in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-b128-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-b128-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-b128-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 24 stabilizing places and 64 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(p1)&&p0) U G(!p2))||(F(p1)&&F(p2))))'
Support contains 4 out of 165 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 388
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 157 transition count 386
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 150 transition count 372
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 150 transition count 372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 144 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 138 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 138 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 133 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 133 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 128 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 128 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 123 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 123 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 118 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 113 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 113 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 112 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 112 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 111 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 111 transition count 268
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 111 transition count 264
Applied a total of 114 rules in 126 ms. Remains 111 /165 variables (removed 54) and now considering 264/406 (removed 142) transitions.
[2024-05-24 04:26:56] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
// Phase 1: matrix 181 rows 111 cols
[2024-05-24 04:26:56] [INFO ] Computed 2 invariants in 7 ms
[2024-05-24 04:26:56] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-24 04:26:56] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-24 04:26:56] [INFO ] Invariant cache hit.
[2024-05-24 04:26:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 04:26:57] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-24 04:26:57] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-24 04:26:57] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-24 04:26:57] [INFO ] Invariant cache hit.
[2024-05-24 04:26:57] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/165 places, 264/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 443 ms. Remains : 111/165 places, 264/406 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 164 ms :[(NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s68 1)), p2:(AND (GEQ s5 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3013 steps with 32 reset in 52 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-00 finished in 721 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||G(p1)))) U p2))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 388
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 157 transition count 386
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 150 transition count 372
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 150 transition count 372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 144 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 138 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 138 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 133 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 133 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 128 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 128 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 123 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 123 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 118 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 113 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 113 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 112 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 112 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 111 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 111 transition count 268
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 111 transition count 264
Applied a total of 114 rules in 65 ms. Remains 111 /165 variables (removed 54) and now considering 264/406 (removed 142) transitions.
[2024-05-24 04:26:57] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-24 04:26:57] [INFO ] Invariant cache hit.
[2024-05-24 04:26:57] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-24 04:26:57] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-24 04:26:57] [INFO ] Invariant cache hit.
[2024-05-24 04:26:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 04:26:57] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-24 04:26:57] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 04:26:57] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-24 04:26:57] [INFO ] Invariant cache hit.
[2024-05-24 04:26:57] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/165 places, 264/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 391 ms. Remains : 111/165 places, 264/406 transitions.
Stuttering acceptance computed with spot in 905 ms :[(NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s92 1)), p1:(AND (GEQ s5 1) (GEQ s83 1)), p0:(AND (GEQ s1 1) (GEQ s31 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 1318 reset in 335 ms.
Product exploration explored 100000 steps with 1280 reset in 318 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 110 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10016 steps, including 3 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 04:26:59] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-24 04:26:59] [INFO ] Invariant cache hit.
[2024-05-24 04:26:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 04:26:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 04:26:59] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p2), (F (AND p0 (NOT p1))), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 11 factoid took 215 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), p0, p0]
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), p0, p0]
[2024-05-24 04:27:00] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-24 04:27:00] [INFO ] Invariant cache hit.
[2024-05-24 04:27:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 04:27:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:27:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 04:27:00] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-24 04:27:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:27:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 04:27:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:27:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 04:27:00] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-24 04:27:00] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 04:27:00] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2024-05-24 04:27:00] [INFO ] Computed and/alt/rep : 46/89/41 causal constraints (skipped 138 transitions) in 24 ms.
[2024-05-24 04:27:01] [INFO ] Added : 21 causal constraints over 5 iterations in 106 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 111 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 264/264 transitions.
Applied a total of 0 rules in 11 ms. Remains 111 /111 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-24 04:27:01] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-24 04:27:01] [INFO ] Invariant cache hit.
[2024-05-24 04:27:01] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-24 04:27:01] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-24 04:27:01] [INFO ] Invariant cache hit.
[2024-05-24 04:27:01] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 04:27:01] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-24 04:27:01] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 04:27:01] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-24 04:27:01] [INFO ] Invariant cache hit.
[2024-05-24 04:27:01] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 327 ms. Remains : 111/111 places, 264/264 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 101 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), p0, p0]
Incomplete random walk after 10069 steps, including 7 resets, run finished after 60 ms. (steps per millisecond=167 ) properties (out of 3) seen :1
Finished Best-First random walk after 368 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=184 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (AND (NOT p2) p0))]
Knowledge based reduction with 8 factoid took 206 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), p0, p0]
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), p0, p0]
[2024-05-24 04:27:02] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-24 04:27:02] [INFO ] Invariant cache hit.
[2024-05-24 04:27:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 04:27:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:27:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 04:27:02] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-24 04:27:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:27:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 04:27:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 04:27:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 04:27:02] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-24 04:27:02] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 04:27:02] [INFO ] [Nat]Added 43 Read/Feed constraints in 19 ms returned sat
[2024-05-24 04:27:02] [INFO ] Computed and/alt/rep : 46/89/41 causal constraints (skipped 138 transitions) in 27 ms.
[2024-05-24 04:27:02] [INFO ] Added : 21 causal constraints over 5 iterations in 104 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 130 ms :[(NOT p2), p0, p0]
Product exploration explored 100000 steps with 1378 reset in 332 ms.
Product exploration explored 100000 steps with 1285 reset in 270 ms.
Built C files in :
/tmp/ltsmin12173112261469631477
[2024-05-24 04:27:03] [INFO ] Computing symmetric may disable matrix : 264 transitions.
[2024-05-24 04:27:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:27:03] [INFO ] Computing symmetric may enable matrix : 264 transitions.
[2024-05-24 04:27:03] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:27:03] [INFO ] Computing Do-Not-Accords matrix : 264 transitions.
[2024-05-24 04:27:03] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:27:03] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12173112261469631477
Running compilation step : cd /tmp/ltsmin12173112261469631477;'/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 655 ms.
Running link step : cd /tmp/ltsmin12173112261469631477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin12173112261469631477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4843617163756892287.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 264/264 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 109 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 109 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 108 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 108 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 107 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 107 transition count 256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 106 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 106 transition count 254
Applied a total of 10 rules in 21 ms. Remains 106 /111 variables (removed 5) and now considering 254/264 (removed 10) transitions.
[2024-05-24 04:27:18] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2024-05-24 04:27:18] [INFO ] Computed 2 invariants in 3 ms
[2024-05-24 04:27:18] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-24 04:27:18] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-24 04:27:18] [INFO ] Invariant cache hit.
[2024-05-24 04:27:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 04:27:18] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-24 04:27:18] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 04:27:18] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-24 04:27:18] [INFO ] Invariant cache hit.
[2024-05-24 04:27:18] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/111 places, 254/264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 106/111 places, 254/264 transitions.
Built C files in :
/tmp/ltsmin16087960295586527393
[2024-05-24 04:27:18] [INFO ] Computing symmetric may disable matrix : 254 transitions.
[2024-05-24 04:27:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:27:18] [INFO ] Computing symmetric may enable matrix : 254 transitions.
[2024-05-24 04:27:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:27:18] [INFO ] Computing Do-Not-Accords matrix : 254 transitions.
[2024-05-24 04:27:18] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:27:18] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16087960295586527393
Running compilation step : cd /tmp/ltsmin16087960295586527393;'/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 460 ms.
Running link step : cd /tmp/ltsmin16087960295586527393;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16087960295586527393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15662049217897523028.hoa' '--buchi-type=spotba'
LTSmin run took 734 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-b128-LTLFireability-01 finished in 22683 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))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 388
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 157 transition count 386
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 150 transition count 372
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 150 transition count 372
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 143 transition count 344
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 143 transition count 344
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 136 transition count 318
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 136 transition count 318
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 130 transition count 306
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 130 transition count 306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 124 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 118 transition count 282
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 118 transition count 282
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 112 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 112 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 106 transition count 258
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 106 transition count 258
Applied a total of 120 rules in 23 ms. Remains 106 /165 variables (removed 59) and now considering 258/406 (removed 148) transitions.
[2024-05-24 04:27:20] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2024-05-24 04:27:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 04:27:20] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-24 04:27:20] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2024-05-24 04:27:20] [INFO ] Invariant cache hit.
[2024-05-24 04:27:20] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 04:27:20] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-24 04:27:20] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2024-05-24 04:27:20] [INFO ] Invariant cache hit.
[2024-05-24 04:27:20] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/165 places, 258/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 350 ms. Remains : 106/165 places, 258/406 transitions.
Stuttering acceptance computed with spot in 420 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s87 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-02 finished in 789 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 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 158 transition count 390
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 158 transition count 390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 158 transition count 388
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 152 transition count 376
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 152 transition count 376
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 147 transition count 356
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 147 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 142 transition count 338
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 142 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 137 transition count 326
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 137 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 132 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 132 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 127 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 127 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 122 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 122 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 117 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 117 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 116 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 116 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 115 transition count 280
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 115 transition count 280
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 115 transition count 274
Applied a total of 108 rules in 40 ms. Remains 115 /165 variables (removed 50) and now considering 274/406 (removed 132) transitions.
[2024-05-24 04:27:20] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
// Phase 1: matrix 186 rows 115 cols
[2024-05-24 04:27:20] [INFO ] Computed 2 invariants in 2 ms
[2024-05-24 04:27:21] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-24 04:27:21] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
[2024-05-24 04:27:21] [INFO ] Invariant cache hit.
[2024-05-24 04:27:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 04:27:21] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-24 04:27:21] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 04:27:21] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
[2024-05-24 04:27:21] [INFO ] Invariant cache hit.
[2024-05-24 04:27:21] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/165 places, 274/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 349 ms. Remains : 115/165 places, 274/406 transitions.
Stuttering acceptance computed with spot in 447 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-03 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 (GEQ s1 1) (GEQ s96 1)), p1:(OR (AND (GEQ s0 1) (GEQ s52 1)) (AND (GEQ s0 1) (GEQ s95 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-03 finished in 814 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((G(!G(p0)) U !p1))) U (p0 U p2)))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 158 transition count 392
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 158 transition count 392
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 158 transition count 390
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 152 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 152 transition count 378
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 147 transition count 358
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 147 transition count 358
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 142 transition count 340
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 142 transition count 340
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 138 transition count 330
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 138 transition count 330
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 134 transition count 320
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 134 transition count 320
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 130 transition count 312
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 130 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 126 transition count 304
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 126 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 84 place count 122 transition count 296
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 122 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 121 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 121 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 120 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 120 transition count 292
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 120 transition count 286
Applied a total of 98 rules in 40 ms. Remains 120 /165 variables (removed 45) and now considering 286/406 (removed 120) transitions.
[2024-05-24 04:27:21] [INFO ] Flow matrix only has 197 transitions (discarded 89 similar events)
// Phase 1: matrix 197 rows 120 cols
[2024-05-24 04:27:21] [INFO ] Computed 2 invariants in 3 ms
[2024-05-24 04:27:21] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-24 04:27:21] [INFO ] Flow matrix only has 197 transitions (discarded 89 similar events)
[2024-05-24 04:27:21] [INFO ] Invariant cache hit.
[2024-05-24 04:27:21] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-24 04:27:22] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-24 04:27:22] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 04:27:22] [INFO ] Flow matrix only has 197 transitions (discarded 89 similar events)
[2024-05-24 04:27:22] [INFO ] Invariant cache hit.
[2024-05-24 04:27:22] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/165 places, 286/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 364 ms. Remains : 120/165 places, 286/406 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s98 1)), p0:(AND (GEQ s0 1) (GEQ s108 1)), p1:(AND (GEQ s4 1) (GEQ s89 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-05 finished in 523 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 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 388
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 157 transition count 386
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 150 transition count 372
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 150 transition count 372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 144 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 138 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 138 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 132 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 132 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 74 place count 126 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 126 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 120 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 114 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 114 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 108 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 106 transition count 258
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 106 transition count 254
Applied a total of 124 rules in 27 ms. Remains 106 /165 variables (removed 59) and now considering 254/406 (removed 152) transitions.
[2024-05-24 04:27:22] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2024-05-24 04:27:22] [INFO ] Computed 2 invariants in 3 ms
[2024-05-24 04:27:22] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-24 04:27:22] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-24 04:27:22] [INFO ] Invariant cache hit.
[2024-05-24 04:27:22] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 04:27:22] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-24 04:27:22] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 04:27:22] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-24 04:27:22] [INFO ] Invariant cache hit.
[2024-05-24 04:27:22] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/165 places, 254/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 106/165 places, 254/406 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-07 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 s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-07 finished in 424 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)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 386
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 386
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 156 transition count 384
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 148 transition count 368
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 148 transition count 368
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 141 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 141 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 134 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 134 transition count 314
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 127 transition count 298
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 127 transition count 298
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 120 transition count 282
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 120 transition count 282
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 114 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 114 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 108 transition count 258
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 108 transition count 258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 122 place count 102 transition count 246
Iterating global reduction 1 with 6 rules applied. Total rules applied 128 place count 102 transition count 246
Applied a total of 128 rules in 19 ms. Remains 102 /165 variables (removed 63) and now considering 246/406 (removed 160) transitions.
[2024-05-24 04:27:22] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 102 cols
[2024-05-24 04:27:22] [INFO ] Computed 2 invariants in 3 ms
[2024-05-24 04:27:22] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-24 04:27:22] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2024-05-24 04:27:22] [INFO ] Invariant cache hit.
[2024-05-24 04:27:22] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 04:27:22] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-24 04:27:22] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2024-05-24 04:27:22] [INFO ] Invariant cache hit.
[2024-05-24 04:27:23] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/165 places, 246/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 102/165 places, 246/406 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s5 1) (LT s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1569 steps with 18 reset in 5 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-09 finished in 416 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)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 386
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 386
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 156 transition count 384
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 148 transition count 368
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 148 transition count 368
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 141 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 141 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 134 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 134 transition count 314
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 127 transition count 298
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 127 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 121 transition count 284
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 121 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 96 place count 115 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 102 place count 115 transition count 272
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 108 place count 109 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 114 place count 109 transition count 260
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 103 transition count 248
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 103 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 102 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 102 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 101 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 101 transition count 244
Applied a total of 130 rules in 27 ms. Remains 101 /165 variables (removed 64) and now considering 244/406 (removed 162) transitions.
[2024-05-24 04:27:23] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
// Phase 1: matrix 166 rows 101 cols
[2024-05-24 04:27:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 04:27:23] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-24 04:27:23] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
[2024-05-24 04:27:23] [INFO ] Invariant cache hit.
[2024-05-24 04:27:23] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 04:27:23] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-24 04:27:23] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
[2024-05-24 04:27:23] [INFO ] Invariant cache hit.
[2024-05-24 04:27:23] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/165 places, 244/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 330 ms. Remains : 101/165 places, 244/406 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s77 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 89 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-10 finished in 421 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(p1)&&p0)||X((G(!p2)||(!p2&&F(p3)))))))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 388
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 157 transition count 386
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 150 transition count 372
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 150 transition count 372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 144 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 139 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 139 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 134 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 134 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 129 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 129 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 124 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 124 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 119 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 119 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 114 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 114 transition count 276
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 113 transition count 274
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 113 transition count 274
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 112 transition count 272
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 112 transition count 272
Applied a total of 108 rules in 22 ms. Remains 112 /165 variables (removed 53) and now considering 272/406 (removed 134) transitions.
[2024-05-24 04:27:23] [INFO ] Flow matrix only has 185 transitions (discarded 87 similar events)
// Phase 1: matrix 185 rows 112 cols
[2024-05-24 04:27:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 04:27:23] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-24 04:27:23] [INFO ] Flow matrix only has 185 transitions (discarded 87 similar events)
[2024-05-24 04:27:23] [INFO ] Invariant cache hit.
[2024-05-24 04:27:23] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 04:27:23] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-24 04:27:23] [INFO ] Flow matrix only has 185 transitions (discarded 87 similar events)
[2024-05-24 04:27:23] [INFO ] Invariant cache hit.
[2024-05-24 04:27:23] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/165 places, 272/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 341 ms. Remains : 112/165 places, 272/406 transitions.
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p3), p2, (AND (NOT p1) p2), (AND (NOT p3) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 3}]], initial=5, aps=[p3:(AND (GEQ s1 1) (GEQ s92 1)), p2:(AND (GEQ s1 1) (GEQ s33 1)), p1:(AND (GEQ s0 1) (GEQ s86 1)), p0:(AND (GEQ s1 1) (GEQ s92 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, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 156 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-11 finished in 643 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)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 386
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 386
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 156 transition count 384
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 148 transition count 368
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 148 transition count 368
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 141 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 141 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 134 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 134 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 128 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 128 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 122 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 122 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 116 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 116 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 106 place count 110 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 112 place count 110 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 118 place count 104 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 104 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 103 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 103 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 102 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 102 transition count 246
Applied a total of 128 rules in 13 ms. Remains 102 /165 variables (removed 63) and now considering 246/406 (removed 160) transitions.
[2024-05-24 04:27:24] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 102 cols
[2024-05-24 04:27:24] [INFO ] Computed 2 invariants in 2 ms
[2024-05-24 04:27:24] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-24 04:27:24] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2024-05-24 04:27:24] [INFO ] Invariant cache hit.
[2024-05-24 04:27:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 04:27:24] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-05-24 04:27:24] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2024-05-24 04:27:24] [INFO ] Invariant cache hit.
[2024-05-24 04:27:24] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/165 places, 246/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 338 ms. Remains : 102/165 places, 246/406 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s78 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 210 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-13 finished in 444 ms.
All properties solved by simple procedures.
Total runtime 30999 ms.
BK_STOP 1716524848485
--------------------
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="FunctionPointer-PT-b128"
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 FunctionPointer-PT-b128, 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 r197-tall-171640625000168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b128.tgz
mv FunctionPointer-PT-b128 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 ;