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.r268-smll-171654406800060.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 itstools
Input is Parking-PT-104, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654406800060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 16:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 11 16:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 16:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 23K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716655032268

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-104
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-25 16:37:14] [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-25 16:37:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:37:15] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-25 16:37:15] [INFO ] Transformed 65 places.
[2024-05-25 16:37:15] [INFO ] Transformed 97 transitions.
[2024-05-25 16:37:15] [INFO ] Found NUPN structural information;
[2024-05-25 16:37:15] [INFO ] Parsed PT model containing 65 places and 97 transitions and 284 arcs in 341 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
FORMULA Parking-PT-104-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Applied a total of 0 rules in 16 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 65 cols
[2024-05-25 16:37:15] [INFO ] Computed 16 invariants in 7 ms
[2024-05-25 16:37:16] [INFO ] Implicit Places using invariants in 447 ms returned [24, 32, 40, 48, 58]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 512 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/65 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 58 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 58 transition count 54
Applied a total of 4 rules in 44 ms. Remains 58 /60 variables (removed 2) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 58 cols
[2024-05-25 16:37:16] [INFO ] Computed 11 invariants in 13 ms
[2024-05-25 16:37:16] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-25 16:37:16] [INFO ] Invariant cache hit.
[2024-05-25 16:37:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 16:37:16] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/65 places, 54/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 995 ms. Remains : 58/65 places, 54/56 transitions.
Support contains 24 out of 58 places after structural reductions.
[2024-05-25 16:37:17] [INFO ] Flatten gal took : 35 ms
[2024-05-25 16:37:17] [INFO ] Flatten gal took : 24 ms
[2024-05-25 16:37:17] [INFO ] Input system was already deterministic with 54 transitions.
RANDOM walk for 40000 steps (2372 resets) in 1977 ms. (20 steps per ms) remains 2/25 properties
BEST_FIRST walk for 40003 steps (389 resets) in 436 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (444 resets) in 312 ms. (127 steps per ms) remains 2/2 properties
[2024-05-25 16:37:18] [INFO ] Invariant cache hit.
[2024-05-25 16:37:18] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/42 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/58 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/112 variables, 58/69 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 12/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 81 constraints, problems are : Problem set: 1 solved, 1 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 58/58 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/58 variables, 9/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/112 variables, 58/69 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 12/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/112 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 82 constraints, problems are : Problem set: 1 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 58/58 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 352ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 54/54 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 56 transition count 50
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 54 transition count 50
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 52 transition count 48
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 52 transition count 48
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 49 transition count 45
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 27 place count 49 transition count 36
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 36 place count 40 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 39 transition count 35
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 25 rules applied. Total rules applied 62 place count 30 transition count 19
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 22 rules applied. Total rules applied 84 place count 14 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 88 place count 10 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 88 place count 10 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 92 place count 8 transition count 11
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 95 place count 5 transition count 8
Iterating global reduction 6 with 3 rules applied. Total rules applied 98 place count 5 transition count 8
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 101 place count 5 transition count 5
Applied a total of 101 rules in 61 ms. Remains 5 /58 variables (removed 53) and now considering 5/54 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 5/58 places, 5/54 transitions.
RANDOM walk for 16 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||F(p1))) U (p2&&X((p0||F(p1)))))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 56 transition count 52
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
Applied a total of 4 rules in 8 ms. Remains 56 /58 variables (removed 2) and now considering 52/54 (removed 2) transitions.
// Phase 1: matrix 52 rows 56 cols
[2024-05-25 16:37:19] [INFO ] Computed 11 invariants in 2 ms
[2024-05-25 16:37:19] [INFO ] Implicit Places using invariants in 122 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/58 places, 52/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 55/58 places, 52/54 transitions.
Stuttering acceptance computed with spot in 470 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Parking-PT-104-LTLFireability-00
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 3 ms.
FORMULA Parking-PT-104-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-00 finished in 702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 52
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 56 transition count 51
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 55 transition count 51
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 52 transition count 48
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 52 transition count 48
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 49 transition count 45
Applied a total of 16 rules in 27 ms. Remains 49 /58 variables (removed 9) and now considering 45/54 (removed 9) transitions.
// Phase 1: matrix 45 rows 49 cols
[2024-05-25 16:37:19] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 16:37:19] [INFO ] Implicit Places using invariants in 96 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/58 places, 45/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 44
Applied a total of 2 rules in 10 ms. Remains 47 /48 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 47 cols
[2024-05-25 16:37:19] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 16:37:19] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-25 16:37:19] [INFO ] Invariant cache hit.
[2024-05-25 16:37:20] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/58 places, 44/54 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 393 ms. Remains : 47/58 places, 44/54 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLFireability-02
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA Parking-PT-104-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-02 finished in 555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(!p0)))&&F(p1)))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 58 transition count 53
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 57 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 56 transition count 52
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 56 transition count 51
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 55 transition count 51
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 9 place count 52 transition count 48
Iterating global reduction 3 with 3 rules applied. Total rules applied 12 place count 52 transition count 48
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 49 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 48 transition count 48
Applied a total of 20 rules in 31 ms. Remains 48 /58 variables (removed 10) and now considering 48/54 (removed 6) transitions.
// Phase 1: matrix 48 rows 48 cols
[2024-05-25 16:37:20] [INFO ] Computed 11 invariants in 3 ms
[2024-05-25 16:37:20] [INFO ] Implicit Places using invariants in 96 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/58 places, 48/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 63
Applied a total of 2 rules in 11 ms. Remains 46 /47 variables (removed 1) and now considering 63/48 (removed -15) transitions.
// Phase 1: matrix 63 rows 46 cols
[2024-05-25 16:37:20] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 16:37:20] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-25 16:37:20] [INFO ] Invariant cache hit.
[2024-05-25 16:37:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-25 16:37:20] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/58 places, 63/54 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 398 ms. Remains : 46/58 places, 63/54 transitions.
Stuttering acceptance computed with spot in 239 ms :[p0, true, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : Parking-PT-104-LTLFireability-03
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA Parking-PT-104-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-03 finished in 664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 56 transition count 50
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 54 transition count 50
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 51 transition count 47
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 51 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 50 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 49 transition count 49
Applied a total of 18 rules in 32 ms. Remains 49 /58 variables (removed 9) and now considering 49/54 (removed 5) transitions.
// Phase 1: matrix 49 rows 49 cols
[2024-05-25 16:37:20] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 16:37:21] [INFO ] Implicit Places using invariants in 90 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/58 places, 49/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 64
Applied a total of 2 rules in 10 ms. Remains 47 /48 variables (removed 1) and now considering 64/49 (removed -15) transitions.
// Phase 1: matrix 64 rows 47 cols
[2024-05-25 16:37:21] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 16:37:21] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-25 16:37:21] [INFO ] Invariant cache hit.
[2024-05-25 16:37:21] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-25 16:37:21] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/58 places, 64/54 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 361 ms. Remains : 47/58 places, 64/54 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-104-LTLFireability-04
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA Parking-PT-104-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-04 finished in 489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 56 transition count 50
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 54 transition count 50
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 51 transition count 47
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 51 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 49 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 48 transition count 48
Applied a total of 20 rules in 23 ms. Remains 48 /58 variables (removed 10) and now considering 48/54 (removed 6) transitions.
// Phase 1: matrix 48 rows 48 cols
[2024-05-25 16:37:21] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 16:37:21] [INFO ] Implicit Places using invariants in 99 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/58 places, 48/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 63
Applied a total of 2 rules in 10 ms. Remains 46 /47 variables (removed 1) and now considering 63/48 (removed -15) transitions.
// Phase 1: matrix 63 rows 46 cols
[2024-05-25 16:37:21] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 16:37:21] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-25 16:37:21] [INFO ] Invariant cache hit.
[2024-05-25 16:37:21] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-25 16:37:21] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/58 places, 63/54 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 357 ms. Remains : 46/58 places, 63/54 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLFireability-05
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA Parking-PT-104-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-05 finished in 427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 5 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 51
Applied a total of 6 rules in 6 ms. Remains 55 /58 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 55 cols
[2024-05-25 16:37:21] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 16:37:21] [INFO ] Implicit Places using invariants in 92 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/58 places, 51/54 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 54/58 places, 51/54 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-104-LTLFireability-06
Entered a terminal (fully accepting) state of product in 710 steps with 43 reset in 13 ms.
FORMULA Parking-PT-104-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-06 finished in 314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&G(p1))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 56 transition count 52
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
Applied a total of 4 rules in 3 ms. Remains 56 /58 variables (removed 2) and now considering 52/54 (removed 2) transitions.
// Phase 1: matrix 52 rows 56 cols
[2024-05-25 16:37:22] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 16:37:22] [INFO ] Implicit Places using invariants in 97 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/58 places, 52/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 55/58 places, 52/54 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Parking-PT-104-LTLFireability-08
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-08 finished in 367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(G(p1)&&F(p2))))))'
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 57 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 53
Applied a total of 2 rules in 3 ms. Remains 57 /58 variables (removed 1) and now considering 53/54 (removed 1) transitions.
// Phase 1: matrix 53 rows 57 cols
[2024-05-25 16:37:22] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 16:37:22] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-25 16:37:22] [INFO ] Invariant cache hit.
[2024-05-25 16:37:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 16:37:22] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:37:22] [INFO ] Invariant cache hit.
[2024-05-25 16:37:22] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-25 16:37:23] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 53/110 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 81 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1868 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 57/57 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 53/110 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 52/133 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 133 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1242 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 57/57 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 1/1 constraints]
After SMT, in 3150ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 3153ms
Starting structural reductions in LTL mode, iteration 1 : 57/58 places, 53/54 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3422 ms. Remains : 57/58 places, 53/54 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Parking-PT-104-LTLFireability-09
Product exploration explored 100000 steps with 7995 reset in 354 ms.
Product exploration explored 100000 steps with 7932 reset in 469 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 542 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 480 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), false, false, false]
RANDOM walk for 40000 steps (2365 resets) in 446 ms. (89 steps per ms) remains 6/14 properties
BEST_FIRST walk for 40004 steps (430 resets) in 230 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (433 resets) in 281 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (445 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (439 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (446 resets) in 223 ms. (178 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (444 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
[2024-05-25 16:37:28] [INFO ] Invariant cache hit.
[2024-05-25 16:37:28] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 36/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 17/57 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 53/110 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 80 constraints, problems are : Problem set: 0 solved, 6 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 57/57 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 36/40 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/57 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 53/110 variables, 57/68 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 12/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 5/85 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/110 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 85 constraints, problems are : Problem set: 1 solved, 5 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 57/57 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 363ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 147 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 53/53 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 55 transition count 51
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 55 transition count 49
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 53 transition count 49
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 50 transition count 46
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 50 transition count 38
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 30 place count 42 transition count 38
Applied a total of 30 rules in 15 ms. Remains 42 /57 variables (removed 15) and now considering 38/53 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 42/57 places, 38/53 transitions.
RANDOM walk for 9940 steps (270 resets) in 90 ms. (109 steps per ms) remains 0/5 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p1 p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (AND p1 p2 p0))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT p1)), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND p1 p0))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 17 factoid took 1177 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter insensitive) to 8 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 412 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 449 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), false, false, false]
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 53/53 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 55 transition count 51
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 55 transition count 49
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 53 transition count 49
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 50 transition count 46
Applied a total of 14 rules in 9 ms. Remains 50 /57 variables (removed 7) and now considering 46/53 (removed 7) transitions.
// Phase 1: matrix 46 rows 50 cols
[2024-05-25 16:37:31] [INFO ] Computed 11 invariants in 0 ms
[2024-05-25 16:37:31] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-25 16:37:31] [INFO ] Invariant cache hit.
[2024-05-25 16:37:31] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-25 16:37:31] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-25 16:37:31] [INFO ] Redundant transitions in 0 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-25 16:37:31] [INFO ] Invariant cache hit.
[2024-05-25 16:37:31] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 46/96 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/96 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 79 constraints, problems are : Problem set: 0 solved, 45 unsolved in 970 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 50/50 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 46/96 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 45/124 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/96 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 124 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1294 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 50/50 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 2287ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 2289ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/57 places, 46/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2510 ms. Remains : 50/57 places, 46/53 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p2) p0)), (X (AND (NOT p2) p0)), (X (NOT (AND p1 p2 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0))))]
Knowledge based reduction with 24 factoid took 698 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter insensitive) to 8 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 439 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), false, false, false]
RANDOM walk for 40000 steps (2439 resets) in 188 ms. (211 steps per ms) remains 6/14 properties
BEST_FIRST walk for 40003 steps (437 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (437 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (444 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (448 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (453 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (449 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
[2024-05-25 16:37:35] [INFO ] Invariant cache hit.
[2024-05-25 16:37:35] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 16/50 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 46/96 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 79 constraints, problems are : Problem set: 0 solved, 6 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 50/50 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/34 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 16/50 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 46/96 variables, 50/61 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 18/79 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 5/84 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 84 constraints, problems are : Problem set: 1 solved, 5 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 50/50 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 329ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 139 ms.
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 46/46 transitions.
Free-agglomeration rule applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 50 transition count 38
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 42 transition count 38
Applied a total of 16 rules in 6 ms. Remains 42 /50 variables (removed 8) and now considering 38/46 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 42/50 places, 38/46 transitions.
RANDOM walk for 4546 steps (113 resets) in 30 ms. (146 steps per ms) remains 0/5 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p2) p0)), (X (AND (NOT p2) p0)), (X (NOT (AND p1 p2 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p1 p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (NOT (AND p1 p2 p0))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT p1)), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND p1 p0))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 25 factoid took 988 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter insensitive) to 8 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 411 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 305 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 13997 reset in 282 ms.
Product exploration explored 100000 steps with 13918 reset in 384 ms.
Built C files in :
/tmp/ltsmin15510578816031001302
[2024-05-25 16:37:38] [INFO ] Computing symmetric may disable matrix : 46 transitions.
[2024-05-25 16:37:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:37:38] [INFO ] Computing symmetric may enable matrix : 46 transitions.
[2024-05-25 16:37:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:37:38] [INFO ] Computing Do-Not-Accords matrix : 46 transitions.
[2024-05-25 16:37:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:37:38] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15510578816031001302
Running compilation step : cd /tmp/ltsmin15510578816031001302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 416 ms.
Running link step : cd /tmp/ltsmin15510578816031001302;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin15510578816031001302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18013159200675718221.hoa' '--buchi-type=spotba'
LTSmin run took 688 ms.
FORMULA Parking-PT-104-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-104-LTLFireability-09 finished in 16998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X((p1||X(p2)))))))'
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 51
Applied a total of 6 rules in 6 ms. Remains 55 /58 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 55 cols
[2024-05-25 16:37:39] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 16:37:39] [INFO ] Implicit Places using invariants in 84 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/58 places, 51/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 54/58 places, 51/54 transitions.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : Parking-PT-104-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1988 steps with 252 reset in 8 ms.
FORMULA Parking-PT-104-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-10 finished in 378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 58 transition count 53
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 53
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 54 transition count 50
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 54 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 52 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 51 transition count 51
Applied a total of 14 rules in 10 ms. Remains 51 /58 variables (removed 7) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 51 cols
[2024-05-25 16:37:39] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 16:37:40] [INFO ] Implicit Places using invariants in 114 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/58 places, 51/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 66
Applied a total of 2 rules in 6 ms. Remains 49 /50 variables (removed 1) and now considering 66/51 (removed -15) transitions.
// Phase 1: matrix 66 rows 49 cols
[2024-05-25 16:37:40] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 16:37:40] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-25 16:37:40] [INFO ] Invariant cache hit.
[2024-05-25 16:37:40] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-25 16:37:40] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/58 places, 66/54 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 298 ms. Remains : 49/58 places, 66/54 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-104-LTLFireability-11
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-11 finished in 436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 51
Applied a total of 6 rules in 2 ms. Remains 55 /58 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 55 cols
[2024-05-25 16:37:40] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 16:37:40] [INFO ] Implicit Places using invariants in 81 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/58 places, 51/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 54/58 places, 51/54 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Parking-PT-104-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-12 finished in 420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 51
Applied a total of 6 rules in 3 ms. Remains 55 /58 variables (removed 3) and now considering 51/54 (removed 3) transitions.
[2024-05-25 16:37:40] [INFO ] Invariant cache hit.
[2024-05-25 16:37:40] [INFO ] Implicit Places using invariants in 67 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/58 places, 51/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 54/58 places, 51/54 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Parking-PT-104-LTLFireability-13
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-13 finished in 268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 56 transition count 50
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 54 transition count 50
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 51 transition count 47
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 51 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 49 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 48 transition count 48
Applied a total of 20 rules in 9 ms. Remains 48 /58 variables (removed 10) and now considering 48/54 (removed 6) transitions.
// Phase 1: matrix 48 rows 48 cols
[2024-05-25 16:37:41] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 16:37:41] [INFO ] Implicit Places using invariants in 85 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/58 places, 48/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 63
Applied a total of 2 rules in 3 ms. Remains 46 /47 variables (removed 1) and now considering 63/48 (removed -15) transitions.
// Phase 1: matrix 63 rows 46 cols
[2024-05-25 16:37:41] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 16:37:41] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-25 16:37:41] [INFO ] Invariant cache hit.
[2024-05-25 16:37:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-25 16:37:41] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/58 places, 63/54 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 300 ms. Remains : 46/58 places, 63/54 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-104-LTLFireability-14
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-14 finished in 419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(X(G(p1)))))))'
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 51
Applied a total of 6 rules in 2 ms. Remains 55 /58 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 55 cols
[2024-05-25 16:37:41] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 16:37:41] [INFO ] Implicit Places using invariants in 76 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/58 places, 51/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 54/58 places, 51/54 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-104-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Parking-PT-104-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-15 finished in 357 ms.
All properties solved by simple procedures.
Total runtime 26819 ms.

BK_STOP 1716655061870

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="Parking-PT-104"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Parking-PT-104, 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 r268-smll-171654406800060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-104.tgz
mv Parking-PT-104 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;