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.r311-tall-171662337500828.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 greatspnxred
Input is ResAllocation-PT-R003C050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662337500828
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K 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 42K 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.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 23:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 23:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 23:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 23:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 360K 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 ResAllocation-PT-R003C050-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716775212198

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 02:00:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 02:00:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 02:00:13] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-27 02:00:13] [INFO ] Transformed 300 places.
[2024-05-27 02:00:13] [INFO ] Transformed 200 transitions.
[2024-05-27 02:00:13] [INFO ] Found NUPN structural information;
[2024-05-27 02:00:13] [INFO ] Parsed PT model containing 300 places and 200 transitions and 894 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ResAllocation-PT-R003C050-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 32 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 300 cols
[2024-05-27 02:00:13] [INFO ] Computed 150 invariants in 22 ms
[2024-05-27 02:00:14] [INFO ] Implicit Places using invariants in 394 ms returned [295, 297]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 431 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 298/300 places, 200/200 transitions.
Applied a total of 0 rules in 14 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 502 ms. Remains : 298/300 places, 200/200 transitions.
Support contains 54 out of 298 places after structural reductions.
[2024-05-27 02:00:14] [INFO ] Flatten gal took : 52 ms
[2024-05-27 02:00:14] [INFO ] Flatten gal took : 23 ms
[2024-05-27 02:00:14] [INFO ] Input system was already deterministic with 200 transitions.
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 40000 steps (375 resets) in 1786 ms. (22 steps per ms) remains 1/23 properties
BEST_FIRST walk for 40004 steps (10 resets) in 295 ms. (135 steps per ms) remains 1/1 properties
// Phase 1: matrix 200 rows 298 cols
[2024-05-27 02:00:15] [INFO ] Computed 148 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 12/498 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 59 ms.
Refiners :[Domain max(s): 4/298 constraints, Positive P Invariants (semi-flows): 5/148 constraints, State Equation: 0/298 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA ResAllocation-PT-R003C050-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(p1)&&F(p2))))'
Support contains 5 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 6 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-27 02:00:15] [INFO ] Invariant cache hit.
[2024-05-27 02:00:16] [INFO ] Implicit Places using invariants in 285 ms returned [297]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 286 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/298 places, 200/200 transitions.
Applied a total of 0 rules in 6 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 299 ms. Remains : 297/298 places, 200/200 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-01 finished in 707 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 3 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 249 transition count 151
Applied a total of 98 rules in 50 ms. Remains 249 /298 variables (removed 49) and now considering 151/200 (removed 49) transitions.
// Phase 1: matrix 151 rows 249 cols
[2024-05-27 02:00:16] [INFO ] Computed 148 invariants in 2 ms
[2024-05-27 02:00:16] [INFO ] Implicit Places using invariants in 196 ms returned [248]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 197 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 248/298 places, 151/200 transitions.
Applied a total of 0 rules in 17 ms. Remains 248 /248 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 264 ms. Remains : 248/298 places, 151/200 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-02
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 5 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-02 finished in 337 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)))'
Support contains 4 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 0 with 92 rules applied. Total rules applied 92 place count 252 transition count 154
Applied a total of 92 rules in 48 ms. Remains 252 /298 variables (removed 46) and now considering 154/200 (removed 46) transitions.
// Phase 1: matrix 154 rows 252 cols
[2024-05-27 02:00:16] [INFO ] Computed 148 invariants in 1 ms
[2024-05-27 02:00:17] [INFO ] Implicit Places using invariants in 178 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/298 places, 154/200 transitions.
Applied a total of 0 rules in 10 ms. Remains 251 /251 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 239 ms. Remains : 251/298 places, 154/200 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-03
Product exploration explored 100000 steps with 1441 reset in 691 ms.
Stack based approach found an accepted trace after 2240 steps with 31 reset with depth 82 and stack size 82 in 16 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-03 finished in 1073 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((p0&&(F(p1) U G(p2))))))'
Support contains 8 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 298 cols
[2024-05-27 02:00:17] [INFO ] Computed 148 invariants in 3 ms
[2024-05-27 02:00:18] [INFO ] Implicit Places using invariants in 314 ms returned [297]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 317 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/298 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 322 ms. Remains : 297/298 places, 200/200 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-05 finished in 583 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(p1)&&X(p2))))'
Support contains 5 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-27 02:00:18] [INFO ] Invariant cache hit.
[2024-05-27 02:00:18] [INFO ] Implicit Places using invariants in 212 ms returned [297]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 226 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/298 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 232 ms. Remains : 297/298 places, 200/200 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-07
Product exploration explored 100000 steps with 1040 reset in 542 ms.
Product exploration explored 100000 steps with 1016 reset in 685 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 353 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 2478 steps (22 resets) in 33 ms. (72 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 5 factoid took 413 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 5 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 7 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2024-05-27 02:00:21] [INFO ] Computed 147 invariants in 2 ms
[2024-05-27 02:00:21] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-27 02:00:21] [INFO ] Invariant cache hit.
[2024-05-27 02:00:22] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 02:00:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 6 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-27 02:00:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 4 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 5 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:00:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:00:25] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 8 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:00:26] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:00:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:00:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-27 02:00:27] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:00:27] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-27 02:00:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
[2024-05-27 02:00:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:00:27] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 9 ms to minimize.
[2024-05-27 02:00:27] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:00:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:00:28] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-27 02:00:28] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:00:28] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-27 02:00:28] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:00:28] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 11019 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:00:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:00:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 17671 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 28733ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 28737ms
Finished structural reductions in LTL mode , in 1 iterations and 29222 ms. Remains : 297/297 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 180 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 2385 steps (21 resets) in 25 ms. (91 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F p2)]
Knowledge based reduction with 1 factoid took 258 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1028 reset in 514 ms.
Product exploration explored 100000 steps with 1029 reset in 571 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 5 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 0 with 47 rules applied. Total rules applied 47 place count 297 transition count 200
Deduced a syphon composed of 47 places in 0 ms
Applied a total of 47 rules in 25 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-27 02:00:53] [INFO ] Redundant transitions in 6 ms returned []
Running 150 sub problems to find dead transitions.
// Phase 1: matrix 200 rows 297 cols
[2024-05-27 02:00:53] [INFO ] Computed 147 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:00:54] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:00:54] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-27 02:00:54] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-27 02:00:54] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-27 02:00:54] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-27 02:00:54] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-27 02:00:54] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-27 02:00:54] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-27 02:00:54] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-27 02:00:54] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-27 02:00:54] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-27 02:00:54] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-27 02:00:54] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD75 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 19 solved, 131 unsolved
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD100 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD118 is UNSAT
[2024-05-27 02:00:55] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-05-27 02:00:56] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
[2024-05-27 02:00:56] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-05-27 02:00:56] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD130 is UNSAT
[2024-05-27 02:00:56] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 39 solved, 111 unsolved
[2024-05-27 02:00:56] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-27 02:00:56] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-05-27 02:00:56] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 3/487 constraints. Problems are: Problem set: 41 solved, 109 unsolved
[2024-05-27 02:00:57] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD150 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 1/488 constraints. Problems are: Problem set: 42 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/488 constraints. Problems are: Problem set: 42 solved, 108 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/785 constraints. Problems are: Problem set: 47 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/785 constraints. Problems are: Problem set: 47 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/785 constraints. Problems are: Problem set: 47 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 785 constraints, problems are : Problem set: 47 solved, 103 unsolved in 7469 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 47 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 250/250 constraints. Problems are: Problem set: 47 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 55/305 constraints. Problems are: Problem set: 47 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 44/349 constraints. Problems are: Problem set: 47 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/349 constraints. Problems are: Problem set: 47 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 47/297 variables, 92/441 constraints. Problems are: Problem set: 47 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 47/488 constraints. Problems are: Problem set: 47 solved, 103 unsolved
[2024-05-27 02:01:01] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/489 constraints. Problems are: Problem set: 47 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/489 constraints. Problems are: Problem set: 47 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 200/497 variables, 297/786 constraints. Problems are: Problem set: 47 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 103/889 constraints. Problems are: Problem set: 47 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 0/889 constraints. Problems are: Problem set: 47 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/497 variables, 0/889 constraints. Problems are: Problem set: 47 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 889 constraints, problems are : Problem set: 47 solved, 103 unsolved in 6954 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 103/150 constraints, Known Traps: 45/45 constraints]
After SMT, in 14454ms problems are : Problem set: 47 solved, 103 unsolved
Search for dead transitions found 47 dead transitions in 14458ms
Found 47 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 47 transitions
Dead transitions reduction (with SMT) removed 47 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 297/297 places, 153/200 transitions.
Graph (complete) has 1119 edges and 297 vertex of which 250 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.6 ms
Discarding 47 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 250 /297 variables (removed 47) and now considering 153/153 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 250/297 places, 153/200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14518 ms. Remains : 250/297 places, 153/200 transitions.
Support contains 5 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2024-05-27 02:01:08] [INFO ] Computed 147 invariants in 1 ms
[2024-05-27 02:01:08] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-27 02:01:08] [INFO ] Invariant cache hit.
[2024-05-27 02:01:08] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 02:01:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:01:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:01:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:01:11] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-27 02:01:11] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:01:11] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:01:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:01:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10552 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:21] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:25] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 17508 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 28083ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 28086ms
Finished structural reductions in LTL mode , in 1 iterations and 28530 ms. Remains : 297/297 places, 200/200 transitions.
Treatment of property ResAllocation-PT-R003C050-LTLFireability-07 finished in 78141 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(p1))||G(p2)))'
Support contains 8 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 298 cols
[2024-05-27 02:01:36] [INFO ] Computed 148 invariants in 3 ms
[2024-05-27 02:01:36] [INFO ] Implicit Places using invariants in 178 ms returned [297]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/298 places, 200/200 transitions.
Applied a total of 0 rules in 1 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 185 ms. Remains : 297/298 places, 200/200 transitions.
Stuttering acceptance computed with spot in 306 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-08
Stuttering criterion allowed to conclude after 259 steps with 3 reset in 5 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-08 finished in 542 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 6 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-27 02:01:37] [INFO ] Invariant cache hit.
[2024-05-27 02:01:37] [INFO ] Implicit Places using invariants in 175 ms returned [297]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 176 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/298 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 182 ms. Remains : 297/298 places, 200/200 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-10
Entered a terminal (fully accepting) state of product in 316 steps with 3 reset in 6 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-10 finished in 353 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 4 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 0 with 92 rules applied. Total rules applied 92 place count 252 transition count 154
Applied a total of 92 rules in 13 ms. Remains 252 /298 variables (removed 46) and now considering 154/200 (removed 46) transitions.
// Phase 1: matrix 154 rows 252 cols
[2024-05-27 02:01:37] [INFO ] Computed 148 invariants in 2 ms
[2024-05-27 02:01:37] [INFO ] Implicit Places using invariants in 156 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 157 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/298 places, 154/200 transitions.
Applied a total of 0 rules in 5 ms. Remains 251 /251 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 251/298 places, 154/200 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-11
Stuttering criterion allowed to conclude after 149 steps with 1 reset in 2 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-11 finished in 306 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(F(p0))||(F(G(p1))&&F(p2)))))'
Support contains 7 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 5 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 298 cols
[2024-05-27 02:01:37] [INFO ] Computed 148 invariants in 3 ms
[2024-05-27 02:01:37] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-27 02:01:37] [INFO ] Invariant cache hit.
[2024-05-27 02:01:38] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 02:01:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-27 02:01:39] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:01:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 3 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 200/498 variables, 298/818 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (OVERLAPS) 0/498 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 818 constraints, problems are : Problem set: 0 solved, 150 unsolved in 11722 ms.
Refiners :[Domain max(s): 298/298 constraints, Positive P Invariants (semi-flows): 148/148 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 1/298 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/498 variables, 298/818 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 150/968 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/498 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 968 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10724 ms.
Refiners :[Domain max(s): 298/298 constraints, Positive P Invariants (semi-flows): 148/148 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
After SMT, in 22468ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 22471ms
Finished structural reductions in LTL mode , in 1 iterations and 22913 ms. Remains : 298/298 places, 200/200 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-13
Stuttering criterion allowed to conclude after 731 steps with 9 reset in 7 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-13 finished in 23195 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((X(G(p1)) U G(p1)))&&p0)))'
Support contains 3 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 6 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-27 02:02:01] [INFO ] Invariant cache hit.
[2024-05-27 02:02:01] [INFO ] Implicit Places using invariants in 168 ms returned [297]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 169 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/298 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 178 ms. Remains : 297/298 places, 200/200 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-14 finished in 373 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(p1)&&X(p2))))'
[2024-05-27 02:02:01] [INFO ] Flatten gal took : 21 ms
[2024-05-27 02:02:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-27 02:02:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 298 places, 200 transitions and 890 arcs took 6 ms.
Total runtime 108144 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ResAllocation-PT-R003C050

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 298
TRANSITIONS: 200
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.002s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1876
MODEL NAME: /home/mcc/execution/413/model
298 places, 200 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ResAllocation-PT-R003C050-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716775327059

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="ResAllocation-PT-R003C050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ResAllocation-PT-R003C050, 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 r311-tall-171662337500828"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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