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.r476-tall-171620505200116.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 ltsminxred
Input is CANInsertWithFailure-PT-030, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505200116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 5.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717187560146

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-030
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:32:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:32:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:32:41] [INFO ] Load time of PNML (sax parser for PT used): 265 ms
[2024-05-31 20:32:41] [INFO ] Transformed 2164 places.
[2024-05-31 20:32:41] [INFO ] Transformed 5580 transitions.
[2024-05-31 20:32:41] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 388 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-030-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-030-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 2164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2163 transition count 5580
Applied a total of 1 rules in 299 ms. Remains 2163 /2164 variables (removed 1) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-31 20:32:42] [INFO ] Computed 32 invariants in 305 ms
[2024-05-31 20:32:43] [INFO ] Implicit Places using invariants in 1242 ms returned []
[2024-05-31 20:32:43] [INFO ] Invariant cache hit.
[2024-05-31 20:32:44] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:32:57] [INFO ] Implicit Places using invariants and state equation in 14077 ms returned []
Implicit Place search using SMT with State Equation took 15352 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:32:57] [INFO ] Invariant cache hit.
[2024-05-31 20:32:57] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 34002ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 34075ms
Starting structural reductions in LTL mode, iteration 1 : 2163/2164 places, 5580/5580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49786 ms. Remains : 2163/2164 places, 5580/5580 transitions.
Support contains 42 out of 2163 places after structural reductions.
[2024-05-31 20:33:32] [INFO ] Flatten gal took : 264 ms
[2024-05-31 20:33:32] [INFO ] Flatten gal took : 170 ms
[2024-05-31 20:33:32] [INFO ] Input system was already deterministic with 5580 transitions.
Support contains 37 out of 2163 places (down from 42) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (55 resets) in 2028 ms. (19 steps per ms) remains 1/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
[2024-05-31 20:33:33] [INFO ] Invariant cache hit.
[2024-05-31 20:33:33] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2100/2103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:33:33] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 13 ms to minimize.
[2024-05-31 20:33:33] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 6 ms to minimize.
[2024-05-31 20:33:34] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:33:34] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:33:34] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:33:34] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:33:34] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2024-05-31 20:33:34] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
[2024-05-31 20:33:34] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:33:34] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:33:34] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:33:34] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:33:35] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:33:35] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:33:35] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2103 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2103 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/2159 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2159 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2161 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:33:36] [INFO ] Deduced a trap composed of 59 places in 1427 ms of which 14 ms to minimize.
[2024-05-31 20:33:38] [INFO ] Deduced a trap composed of 53 places in 1271 ms of which 12 ms to minimize.
[2024-05-31 20:33:39] [INFO ] Deduced a trap composed of 65 places in 1203 ms of which 11 ms to minimize.
SMT process timed out in 6137ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 2163 transition count 5371
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 3 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2156 place count 1085 transition count 4502
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2969 place count 1085 transition count 3689
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2971 place count 1083 transition count 3689
Partial Free-agglomeration rule applied 930 times.
Drop transitions (Partial Free agglomeration) removed 930 transitions
Iterating global reduction 3 with 930 rules applied. Total rules applied 3901 place count 1083 transition count 3689
Applied a total of 3901 rules in 987 ms. Remains 1083 /2163 variables (removed 1080) and now considering 3689/5580 (removed 1891) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 988 ms. Remains : 1083/2163 places, 3689/5580 transitions.
RANDOM walk for 37760 steps (269 resets) in 1420 ms. (26 steps per ms) remains 0/1 properties
FORMULA CANInsertWithFailure-PT-030-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 122 stabilizing places and 210 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((G(p0) U !p1)))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 64 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-31 20:33:41] [INFO ] Invariant cache hit.
[2024-05-31 20:33:42] [INFO ] Implicit Places using invariants in 894 ms returned []
[2024-05-31 20:33:42] [INFO ] Invariant cache hit.
[2024-05-31 20:33:43] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:33:57] [INFO ] Implicit Places using invariants and state equation in 15604 ms returned []
Implicit Place search using SMT with State Equation took 16506 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:33:57] [INFO ] Invariant cache hit.
[2024-05-31 20:33:57] [INFO ] State equation strengthened by 1770 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33682ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33736ms
Finished structural reductions in LTL mode , in 1 iterations and 50323 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 242 ms :[p1, p1, true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 975 ms.
Product exploration explored 100000 steps with 50000 reset in 871 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-030-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-01 finished in 52554 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((X(p2)||p1))||G(p3)))||p0)))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 66 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-31 20:34:33] [INFO ] Invariant cache hit.
[2024-05-31 20:34:34] [INFO ] Implicit Places using invariants in 905 ms returned []
[2024-05-31 20:34:34] [INFO ] Invariant cache hit.
[2024-05-31 20:34:36] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:34:51] [INFO ] Implicit Places using invariants and state equation in 16927 ms returned []
Implicit Place search using SMT with State Equation took 17834 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:34:51] [INFO ] Invariant cache hit.
[2024-05-31 20:34:51] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33412ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33481ms
Finished structural reductions in LTL mode , in 1 iterations and 51392 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 321 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 804 ms.
Product exploration explored 100000 steps with 50000 reset in 803 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0 p3), (X p0), (X (X p3))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 9 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-030-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-02 finished in 53452 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((X(p0) U (G(p1)&&(!p1||F(!p0))))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 79 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-31 20:35:27] [INFO ] Invariant cache hit.
[2024-05-31 20:35:28] [INFO ] Implicit Places using invariants in 866 ms returned []
[2024-05-31 20:35:28] [INFO ] Invariant cache hit.
[2024-05-31 20:35:29] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:35:42] [INFO ] Implicit Places using invariants and state equation in 14626 ms returned []
Implicit Place search using SMT with State Equation took 15495 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:35:42] [INFO ] Invariant cache hit.
[2024-05-31 20:35:42] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33346ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33393ms
Finished structural reductions in LTL mode , in 1 iterations and 48983 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p1) p0), true, (AND (NOT p1) (NOT p0)), (NOT p1), p0, true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-04 finished in 49276 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((G(p1)||p0))))'
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 56 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-31 20:36:16] [INFO ] Invariant cache hit.
[2024-05-31 20:36:17] [INFO ] Implicit Places using invariants in 830 ms returned []
[2024-05-31 20:36:17] [INFO ] Invariant cache hit.
[2024-05-31 20:36:18] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:36:32] [INFO ] Implicit Places using invariants and state equation in 15210 ms returned []
Implicit Place search using SMT with State Equation took 16042 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:36:32] [INFO ] Invariant cache hit.
[2024-05-31 20:36:32] [INFO ] State equation strengthened by 1770 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 1.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 1.0)
(s590 1.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 0.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 0.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 1.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 1.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(timeout
s1327 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33173ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33220ms
Finished structural reductions in LTL mode , in 1 iterations and 49329 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-05
Product exploration explored 100000 steps with 141 reset in 533 ms.
Product exploration explored 100000 steps with 141 reset in 629 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 159 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (55 resets) in 449 ms. (88 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 251 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
[2024-05-31 20:37:07] [INFO ] Invariant cache hit.
[2024-05-31 20:37:07] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2099/2105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:37:08] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-31 20:37:08] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-31 20:37:08] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-05-31 20:37:08] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:37:08] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 2 ms to minimize.
[2024-05-31 20:37:08] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-31 20:37:08] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-05-31 20:37:09] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-31 20:37:09] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:37:09] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
[2024-05-31 20:37:09] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:37:09] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:37:09] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:37:09] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2105 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/2159 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2159 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/2161 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2161 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5580/7741 variables, 2161/2207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/7741 variables, 1770/3977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7741 variables, 0/3977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/7743 variables, 2/3979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/7743 variables, 0/3979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/7743 variables, 0/3979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7743/7743 variables, and 3979 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4488 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2163/2163 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2099/2105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2105 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/2159 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2159 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/2161 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2161 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5580/7741 variables, 2161/2207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7741/7743 variables, and 3977 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4404 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2161/2163 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 14/14 constraints]
After SMT, in 8944ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 171 ms.
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 2163 transition count 5374
Reduce places removed 206 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 207 rules applied. Total rules applied 413 place count 1957 transition count 5373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 414 place count 1956 transition count 5373
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 1 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 3 with 1736 rules applied. Total rules applied 2150 place count 1088 transition count 4505
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 3 with 811 rules applied. Total rules applied 2961 place count 1088 transition count 3694
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 2964 place count 1088 transition count 3691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions (Partial Free agglomeration) removed 930 transitions
Iterating global reduction 4 with 930 rules applied. Total rules applied 3897 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 3927 place count 1085 transition count 3691
Applied a total of 3927 rules in 532 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3691/5580 (removed 1889) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 532 ms. Remains : 1085/2163 places, 3691/5580 transitions.
RANDOM walk for 40000 steps (282 resets) in 627 ms. (63 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 141589 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 3
Probabilistic random walk after 141589 steps, saw 27520 distinct states, run finished after 3004 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-31 20:37:20] [INFO ] Computed 32 invariants in 50 ms
[2024-05-31 20:37:20] [INFO ] State equation strengthened by 3564 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:37:21] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/1081 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1083 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1083 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3691/4774 variables, 1083/1116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/4774 variables, 3564/4680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 0/4680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/4776 variables, 2/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/4776 variables, 0/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4682 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2152 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:37:23] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:37:23] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 5 ms to minimize.
[2024-05-31 20:37:23] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-31 20:37:23] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:37:23] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:37:23] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:37:23] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:37:23] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:37:23] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:37:23] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:37:23] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:37:23] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:37:23] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:37:23] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:37:23] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:37:24] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:37:24] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:37:24] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:37:24] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 54/1081 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/1083 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1083 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3691/4774 variables, 1083/1135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3564/4699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 3/4702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4774 variables, 0/4702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/4776 variables, 2/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/4776 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4704 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4561 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 constraints]
After SMT, in 6820ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 97 ms.
Support contains 6 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 61 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 60 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2024-05-31 20:37:27] [INFO ] Invariant cache hit.
[2024-05-31 20:37:28] [INFO ] Implicit Places using invariants in 892 ms returned []
[2024-05-31 20:37:28] [INFO ] Invariant cache hit.
[2024-05-31 20:37:29] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2024-05-31 20:37:46] [INFO ] Implicit Places using invariants and state equation in 17861 ms returned []
Implicit Place search using SMT with State Equation took 18756 ms to find 0 implicit places.
[2024-05-31 20:37:46] [INFO ] Redundant transitions in 235 ms returned []
Running 3661 sub problems to find dead transitions.
[2024-05-31 20:37:46] [INFO ] Invariant cache hit.
[2024-05-31 20:37:46] [INFO ] State equation strengthened by 3564 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 32628ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 32667ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51740 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3470 edges and 1085 vertex of which 926 / 1085 are part of one of the 2 SCC in 4 ms
Free SCC test removed 924 places
Drop transitions (Empty/Sink Transition effects.) removed 2519 transitions
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 3435 transitions.
Graph (complete) has 440 edges and 161 vertex of which 77 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.1 ms
Discarding 84 places :
Also discarding 27 output transitions
Drop transitions (Output transitions of discarded places.) removed 27 transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 77 transition count 172
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 112 place count 24 transition count 67
Iterating global reduction 1 with 53 rules applied. Total rules applied 165 place count 24 transition count 67
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 191 place count 24 transition count 41
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 193 place count 23 transition count 40
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 195 place count 22 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 22 transition count 35
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 22 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 20 transition count 33
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 19 transition count 32
Applied a total of 207 rules in 140 ms. Remains 19 /1085 variables (removed 1066) and now considering 32/3691 (removed 3659) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 19 cols
[2024-05-31 20:38:19] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 20:38:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 20:38:19] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 20:38:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-31 20:38:19] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-31 20:38:19] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-31 20:38:20] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 640 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 136 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 2163 transition count 5374
Reduce places removed 206 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 207 rules applied. Total rules applied 413 place count 1957 transition count 5373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 414 place count 1956 transition count 5373
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 2 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 3 with 1736 rules applied. Total rules applied 2150 place count 1088 transition count 4505
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 3 with 811 rules applied. Total rules applied 2961 place count 1088 transition count 3694
Applied a total of 2961 rules in 473 ms. Remains 1088 /2163 variables (removed 1075) and now considering 3694/5580 (removed 1886) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2024-05-31 20:38:20] [INFO ] Computed 32 invariants in 53 ms
[2024-05-31 20:38:21] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-31 20:38:21] [INFO ] Invariant cache hit.
[2024-05-31 20:38:22] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-31 20:38:27] [INFO ] Implicit Places using invariants and state equation in 6401 ms returned []
Implicit Place search using SMT with State Equation took 6980 ms to find 0 implicit places.
[2024-05-31 20:38:28] [INFO ] Redundant transitions in 197 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 20:38:28] [INFO ] Invariant cache hit.
[2024-05-31 20:38:28] [INFO ] State equation strengthened by 2666 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1087 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32028ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32062ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1088/2163 places, 3694/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39731 ms. Remains : 1088/2163 places, 3694/5580 transitions.
Computed a total of 92 stabilizing places and 151 stable transitions
Computed a total of 92 stabilizing places and 151 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (256 resets) in 479 ms. (83 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
[2024-05-31 20:39:00] [INFO ] Invariant cache hit.
[2024-05-31 20:39:00] [INFO ] State equation strengthened by 2666 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1024/1030 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:39:00] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:39:00] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:39:00] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 3 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1030 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:39:01] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:39:02] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-31 20:39:02] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1030 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1030 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 54/1084 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1084 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/1086 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1086 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3694/4780 variables, 1086/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4780 variables, 2666/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4780 variables, 0/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4782 variables, 2/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4782 variables, 0/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4782 variables, 0/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4782/4782 variables, and 3809 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3205 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1088/1088 constraints, ReadFeed: 2666/2666 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1024/1030 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1030 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1030 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/1084 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1084 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1086 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1086 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3694/4780 variables, 1086/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4780 variables, 2666/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4780 variables, 3/3810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4780 variables, 0/3810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/4782 variables, 2/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4782 variables, 0/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4782 variables, 0/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4782/4782 variables, and 3812 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2673 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1088/1088 constraints, ReadFeed: 2666/2666 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 23/23 constraints]
After SMT, in 5921ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 184 ms.
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1088 transition count 3691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions (Partial Free agglomeration) removed 930 transitions
Iterating global reduction 1 with 930 rules applied. Total rules applied 936 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 966 place count 1085 transition count 3691
Applied a total of 966 rules in 294 ms. Remains 1085 /1088 variables (removed 3) and now considering 3691/3694 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 1085/1088 places, 3691/3694 transitions.
RANDOM walk for 40000 steps (280 resets) in 681 ms. (58 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 137045 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 3
Probabilistic random walk after 137045 steps, saw 26904 distinct states, run finished after 3003 ms. (steps per millisecond=45 ) properties seen :0
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-31 20:39:10] [INFO ] Computed 32 invariants in 46 ms
[2024-05-31 20:39:10] [INFO ] State equation strengthened by 3564 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:39:10] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/1081 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1083 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1083 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3691/4774 variables, 1083/1116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/4774 variables, 3564/4680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 0/4680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/4776 variables, 2/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/4776 variables, 0/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4682 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2199 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:39:12] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:39:12] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:39:12] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:39:12] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:39:13] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:39:13] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:39:13] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:39:13] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:39:13] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:39:13] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:39:13] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:39:13] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:39:13] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:39:13] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:39:13] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:39:13] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
[2024-05-31 20:39:13] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:39:13] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:39:13] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 54/1081 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/1083 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1083 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3691/4774 variables, 1083/1135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3564/4699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 3/4702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4774 variables, 0/4702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/4776 variables, 2/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/4776 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4704 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4194 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 constraints]
After SMT, in 6506ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 144 ms.
Support contains 6 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 92 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 66 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2024-05-31 20:39:17] [INFO ] Invariant cache hit.
[2024-05-31 20:39:18] [INFO ] Implicit Places using invariants in 898 ms returned []
[2024-05-31 20:39:18] [INFO ] Invariant cache hit.
[2024-05-31 20:39:18] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2024-05-31 20:39:37] [INFO ] Implicit Places using invariants and state equation in 19868 ms returned []
Implicit Place search using SMT with State Equation took 20768 ms to find 0 implicit places.
[2024-05-31 20:39:38] [INFO ] Redundant transitions in 115 ms returned []
Running 3661 sub problems to find dead transitions.
[2024-05-31 20:39:38] [INFO ] Invariant cache hit.
[2024-05-31 20:39:38] [INFO ] State equation strengthened by 3564 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 32507ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 32540ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53505 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3470 edges and 1085 vertex of which 926 / 1085 are part of one of the 2 SCC in 1 ms
Free SCC test removed 924 places
Drop transitions (Empty/Sink Transition effects.) removed 2519 transitions
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 3435 transitions.
Graph (complete) has 440 edges and 161 vertex of which 77 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.1 ms
Discarding 84 places :
Also discarding 27 output transitions
Drop transitions (Output transitions of discarded places.) removed 27 transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 77 transition count 172
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 112 place count 24 transition count 67
Iterating global reduction 1 with 53 rules applied. Total rules applied 165 place count 24 transition count 67
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 191 place count 24 transition count 41
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 193 place count 23 transition count 40
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 195 place count 22 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 22 transition count 35
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 22 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 20 transition count 33
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 19 transition count 32
Applied a total of 207 rules in 15 ms. Remains 19 /1085 variables (removed 1066) and now considering 32/3691 (removed 3659) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 19 cols
[2024-05-31 20:40:10] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 20:40:10] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-31 20:40:10] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 20:40:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 20:40:10] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-31 20:40:10] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-31 20:40:10] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 119 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 125 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 633 reset in 812 ms.
Product exploration explored 100000 steps with 640 reset in 837 ms.
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Applied a total of 0 rules in 62 ms. Remains 1088 /1088 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2024-05-31 20:40:12] [INFO ] Computed 32 invariants in 50 ms
[2024-05-31 20:40:13] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-05-31 20:40:13] [INFO ] Invariant cache hit.
[2024-05-31 20:40:14] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-31 20:40:19] [INFO ] Implicit Places using invariants and state equation in 6499 ms returned []
Implicit Place search using SMT with State Equation took 7091 ms to find 0 implicit places.
[2024-05-31 20:40:20] [INFO ] Redundant transitions in 109 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 20:40:20] [INFO ] Invariant cache hit.
[2024-05-31 20:40:20] [INFO ] State equation strengthened by 2666 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1087 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 31912ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 31945ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39224 ms. Remains : 1088/1088 places, 3694/3694 transitions.
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-05 finished in 275745 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)))'
Support contains 1 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 69 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-31 20:40:52] [INFO ] Computed 32 invariants in 126 ms
[2024-05-31 20:40:53] [INFO ] Implicit Places using invariants in 1038 ms returned []
[2024-05-31 20:40:53] [INFO ] Invariant cache hit.
[2024-05-31 20:40:54] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:41:09] [INFO ] Implicit Places using invariants and state equation in 15851 ms returned []
Implicit Place search using SMT with State Equation took 16891 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:41:09] [INFO ] Invariant cache hit.
[2024-05-31 20:41:09] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33532ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33597ms
Finished structural reductions in LTL mode , in 1 iterations and 50568 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-06 finished in 50676 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(p0)))'
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 72 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-31 20:41:43] [INFO ] Invariant cache hit.
[2024-05-31 20:41:43] [INFO ] Implicit Places using invariants in 895 ms returned []
[2024-05-31 20:41:43] [INFO ] Invariant cache hit.
[2024-05-31 20:41:45] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:42:00] [INFO ] Implicit Places using invariants and state equation in 16969 ms returned []
Implicit Place search using SMT with State Equation took 17871 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:42:00] [INFO ] Invariant cache hit.
[2024-05-31 20:42:00] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33531ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33588ms
Finished structural reductions in LTL mode , in 1 iterations and 51543 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-09
Stuttering criterion allowed to conclude after 725 steps with 0 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-09 finished in 51677 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(F(p0))||(p1&&F(p2))))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 68 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-31 20:42:34] [INFO ] Invariant cache hit.
[2024-05-31 20:42:35] [INFO ] Implicit Places using invariants in 879 ms returned []
[2024-05-31 20:42:35] [INFO ] Invariant cache hit.
[2024-05-31 20:42:37] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:42:50] [INFO ] Implicit Places using invariants and state equation in 15408 ms returned []
Implicit Place search using SMT with State Equation took 16288 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:42:51] [INFO ] Invariant cache hit.
[2024-05-31 20:42:51] [INFO ] State equation strengthened by 1770 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33334ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33384ms
Finished structural reductions in LTL mode , in 1 iterations and 49753 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-10
Stuttering criterion allowed to conclude after 537 steps with 0 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-10 finished in 49997 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(F((p1 U (G(p1)||(p1&&(X(!p2) U ((!p2&&X(!p2))||X(G(!p2))))))))))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 67 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-31 20:43:24] [INFO ] Invariant cache hit.
[2024-05-31 20:43:25] [INFO ] Implicit Places using invariants in 844 ms returned []
[2024-05-31 20:43:25] [INFO ] Invariant cache hit.
[2024-05-31 20:43:26] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:43:41] [INFO ] Implicit Places using invariants and state equation in 16433 ms returned []
Implicit Place search using SMT with State Equation took 17280 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:43:42] [INFO ] Invariant cache hit.
[2024-05-31 20:43:42] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33187ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33231ms
Finished structural reductions in LTL mode , in 1 iterations and 50585 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-11
Stuttering criterion allowed to conclude after 650 steps with 0 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-11 finished in 50903 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(p1))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 66 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-31 20:44:15] [INFO ] Invariant cache hit.
[2024-05-31 20:44:16] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-05-31 20:44:16] [INFO ] Invariant cache hit.
[2024-05-31 20:44:17] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:44:32] [INFO ] Implicit Places using invariants and state equation in 15693 ms returned []
Implicit Place search using SMT with State Equation took 16542 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:44:32] [INFO ] Invariant cache hit.
[2024-05-31 20:44:32] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33530ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33575ms
Finished structural reductions in LTL mode , in 1 iterations and 50190 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-12 finished in 50327 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)&&X(G(p1))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 66 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-31 20:45:05] [INFO ] Invariant cache hit.
[2024-05-31 20:45:06] [INFO ] Implicit Places using invariants in 888 ms returned []
[2024-05-31 20:45:06] [INFO ] Invariant cache hit.
[2024-05-31 20:45:08] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:45:22] [INFO ] Implicit Places using invariants and state equation in 15545 ms returned []
Implicit Place search using SMT with State Equation took 16439 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:45:22] [INFO ] Invariant cache hit.
[2024-05-31 20:45:22] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33260ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33311ms
Finished structural reductions in LTL mode , in 1 iterations and 49823 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-13
Stuttering criterion allowed to conclude after 882 steps with 0 reset in 10 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-13 finished in 50018 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(X(!(F(p0) U !p1)))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 2163 transition count 5371
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 1 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2156 place count 1085 transition count 4502
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Applied a total of 2967 rules in 338 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3691/5580 (removed 1889) transitions.
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-31 20:45:56] [INFO ] Computed 32 invariants in 59 ms
[2024-05-31 20:45:56] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-05-31 20:45:56] [INFO ] Invariant cache hit.
[2024-05-31 20:45:57] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2024-05-31 20:46:03] [INFO ] Implicit Places using invariants and state equation in 6477 ms returned []
Implicit Place search using SMT with State Equation took 7098 ms to find 0 implicit places.
[2024-05-31 20:46:03] [INFO ] Redundant transitions in 118 ms returned []
Running 3661 sub problems to find dead transitions.
[2024-05-31 20:46:03] [INFO ] Invariant cache hit.
[2024-05-31 20:46:03] [INFO ] State equation strengthened by 2667 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 32030ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 32068ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1085/2163 places, 3691/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39639 ms. Remains : 1085/2163 places, 3691/5580 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-14
Stuttering criterion allowed to conclude after 203 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-14 finished in 39775 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(!p0)))||G(p1)))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 68 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-31 20:46:35] [INFO ] Computed 32 invariants in 126 ms
[2024-05-31 20:46:36] [INFO ] Implicit Places using invariants in 1008 ms returned []
[2024-05-31 20:46:36] [INFO ] Invariant cache hit.
[2024-05-31 20:46:38] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:46:52] [INFO ] Implicit Places using invariants and state equation in 15688 ms returned []
Implicit Place search using SMT with State Equation took 16697 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:46:52] [INFO ] Invariant cache hit.
[2024-05-31 20:46:52] [INFO ] State equation strengthened by 1770 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33297ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33342ms
Finished structural reductions in LTL mode , in 1 iterations and 50115 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 228 ms :[p0, (NOT p1), (AND p0 (NOT p1)), true, true, (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-15
Stuttering criterion allowed to conclude after 709 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-15 finished in 50378 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((G(p1)||p0))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-030-LTLFireability-05
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 2163 transition count 5374
Reduce places removed 206 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 207 rules applied. Total rules applied 413 place count 1957 transition count 5373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 414 place count 1956 transition count 5373
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 1 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 3 with 1736 rules applied. Total rules applied 2150 place count 1088 transition count 4505
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 3 with 811 rules applied. Total rules applied 2961 place count 1088 transition count 3694
Applied a total of 2961 rules in 314 ms. Remains 1088 /2163 variables (removed 1075) and now considering 3694/5580 (removed 1886) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2024-05-31 20:47:26] [INFO ] Computed 32 invariants in 49 ms
[2024-05-31 20:47:27] [INFO ] Implicit Places using invariants in 586 ms returned []
[2024-05-31 20:47:27] [INFO ] Invariant cache hit.
[2024-05-31 20:47:27] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-31 20:47:33] [INFO ] Implicit Places using invariants and state equation in 6477 ms returned []
Implicit Place search using SMT with State Equation took 7085 ms to find 0 implicit places.
Running 3664 sub problems to find dead transitions.
[2024-05-31 20:47:33] [INFO ] Invariant cache hit.
[2024-05-31 20:47:33] [INFO ] State equation strengthened by 2666 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1087 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 31896ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 31928ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1088/2163 places, 3694/5580 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 39332 ms. Remains : 1088/2163 places, 3694/5580 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-05
Product exploration explored 100000 steps with 644 reset in 739 ms.
Product exploration explored 100000 steps with 644 reset in 743 ms.
Computed a total of 92 stabilizing places and 151 stable transitions
Computed a total of 92 stabilizing places and 151 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (251 resets) in 339 ms. (117 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
[2024-05-31 20:48:07] [INFO ] Invariant cache hit.
[2024-05-31 20:48:07] [INFO ] State equation strengthened by 2666 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1024/1030 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1030 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:48:09] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-31 20:48:09] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:48:09] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1030 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1030 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 54/1084 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1084 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/1086 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1086 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3694/4780 variables, 1086/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4780 variables, 2666/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4780 variables, 0/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4782 variables, 2/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4782 variables, 0/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4782 variables, 0/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4782/4782 variables, and 3809 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3512 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1088/1088 constraints, ReadFeed: 2666/2666 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1024/1030 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1030 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1030 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/1084 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1084 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1086 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1086 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3694/4780 variables, 1086/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4780 variables, 2666/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4780 variables, 3/3810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4780 variables, 0/3810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/4782 variables, 2/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4782 variables, 0/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4782 variables, 0/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4782/4782 variables, and 3812 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2589 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1088/1088 constraints, ReadFeed: 2666/2666 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 23/23 constraints]
After SMT, in 6140ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 154 ms.
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1088 transition count 3691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions (Partial Free agglomeration) removed 930 transitions
Iterating global reduction 1 with 930 rules applied. Total rules applied 936 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 966 place count 1085 transition count 3691
Applied a total of 966 rules in 231 ms. Remains 1085 /1088 variables (removed 3) and now considering 3691/3694 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 1085/1088 places, 3691/3694 transitions.
RANDOM walk for 40000 steps (280 resets) in 938 ms. (42 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 131822 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 3
Probabilistic random walk after 131822 steps, saw 26157 distinct states, run finished after 3003 ms. (steps per millisecond=43 ) properties seen :0
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-31 20:48:17] [INFO ] Computed 32 invariants in 39 ms
[2024-05-31 20:48:17] [INFO ] State equation strengthened by 3564 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:48:17] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/1081 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1083 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1083 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3691/4774 variables, 1083/1116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/4774 variables, 3564/4680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 0/4680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/4776 variables, 2/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/4776 variables, 0/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4682 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2182 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:48:19] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:48:19] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 54/1081 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/1083 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1083 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3691/4774 variables, 1083/1135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3564/4699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 3/4702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4774 variables, 0/4702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/4776 variables, 2/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/4776 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4704 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4489 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 constraints]
After SMT, in 6754ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 146 ms.
Support contains 6 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 72 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 78 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2024-05-31 20:48:24] [INFO ] Invariant cache hit.
[2024-05-31 20:48:25] [INFO ] Implicit Places using invariants in 903 ms returned []
[2024-05-31 20:48:25] [INFO ] Invariant cache hit.
[2024-05-31 20:48:26] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2024-05-31 20:48:46] [INFO ] Implicit Places using invariants and state equation in 20888 ms returned []
Implicit Place search using SMT with State Equation took 21793 ms to find 0 implicit places.
[2024-05-31 20:48:46] [INFO ] Redundant transitions in 110 ms returned []
Running 3661 sub problems to find dead transitions.
[2024-05-31 20:48:46] [INFO ] Invariant cache hit.
[2024-05-31 20:48:46] [INFO ] State equation strengthened by 3564 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 32595ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 32633ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54631 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3470 edges and 1085 vertex of which 926 / 1085 are part of one of the 2 SCC in 1 ms
Free SCC test removed 924 places
Drop transitions (Empty/Sink Transition effects.) removed 2519 transitions
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 3435 transitions.
Graph (complete) has 440 edges and 161 vertex of which 77 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.0 ms
Discarding 84 places :
Also discarding 27 output transitions
Drop transitions (Output transitions of discarded places.) removed 27 transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 77 transition count 172
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 112 place count 24 transition count 67
Iterating global reduction 1 with 53 rules applied. Total rules applied 165 place count 24 transition count 67
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 191 place count 24 transition count 41
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 193 place count 23 transition count 40
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 195 place count 22 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 22 transition count 35
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 22 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 20 transition count 33
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 19 transition count 32
Applied a total of 207 rules in 12 ms. Remains 19 /1085 variables (removed 1066) and now considering 32/3691 (removed 3659) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 19 cols
[2024-05-31 20:49:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:49:19] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-31 20:49:19] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 20:49:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-31 20:49:19] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-31 20:49:19] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-31 20:49:19] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 111 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 153 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Applied a total of 0 rules in 60 ms. Remains 1088 /1088 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2024-05-31 20:49:19] [INFO ] Computed 32 invariants in 54 ms
[2024-05-31 20:49:20] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-31 20:49:20] [INFO ] Invariant cache hit.
[2024-05-31 20:49:20] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-31 20:49:26] [INFO ] Implicit Places using invariants and state equation in 6754 ms returned []
Implicit Place search using SMT with State Equation took 7349 ms to find 0 implicit places.
[2024-05-31 20:49:27] [INFO ] Redundant transitions in 110 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 20:49:27] [INFO ] Invariant cache hit.
[2024-05-31 20:49:27] [INFO ] State equation strengthened by 2666 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1087 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 31911ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 31943ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39476 ms. Remains : 1088/1088 places, 3694/3694 transitions.
Computed a total of 92 stabilizing places and 151 stable transitions
Computed a total of 92 stabilizing places and 151 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 121 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (254 resets) in 824 ms. (48 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
[2024-05-31 20:49:59] [INFO ] Invariant cache hit.
[2024-05-31 20:49:59] [INFO ] State equation strengthened by 2666 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1024/1030 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:49:59] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:49:59] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:49:59] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1030 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:50:00] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-31 20:50:01] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:50:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1030 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1030 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 54/1084 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1084 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/1086 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1086 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3694/4780 variables, 1086/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4780 variables, 2666/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4780 variables, 0/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4782 variables, 2/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4782 variables, 0/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4782 variables, 0/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4782/4782 variables, and 3809 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3373 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1088/1088 constraints, ReadFeed: 2666/2666 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1024/1030 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1030 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1030 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/1084 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1084 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1086 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1086 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3694/4780 variables, 1086/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4780 variables, 2666/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4780 variables, 3/3810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4780 variables, 0/3810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/4782 variables, 2/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4782 variables, 0/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4782 variables, 0/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4782/4782 variables, and 3812 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2731 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1088/1088 constraints, ReadFeed: 2666/2666 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 23/23 constraints]
After SMT, in 6141ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 184 ms.
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1088 transition count 3691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions (Partial Free agglomeration) removed 930 transitions
Iterating global reduction 1 with 930 rules applied. Total rules applied 936 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 966 place count 1085 transition count 3691
Applied a total of 966 rules in 240 ms. Remains 1085 /1088 variables (removed 3) and now considering 3691/3694 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 1085/1088 places, 3691/3694 transitions.
RANDOM walk for 40000 steps (280 resets) in 1215 ms. (32 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/3 properties
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-31 20:50:06] [INFO ] Computed 32 invariants in 35 ms
[2024-05-31 20:50:06] [INFO ] State equation strengthened by 3564 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:50:06] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:50:06] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 54/1081 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1083 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1083 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3691/4774 variables, 1083/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/4774 variables, 3564/4681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 0/4681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/4776 variables, 2/4683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/4776 variables, 0/4683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4683 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1589 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:50:08] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:50:08] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:50:08] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:50:08] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:50:08] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:50:08] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:50:08] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:50:08] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:50:08] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:50:08] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-31 20:50:09] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:50:09] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
[2024-05-31 20:50:09] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:50:09] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:50:09] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:50:09] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:50:09] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:50:09] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/1081 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1083 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1083 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3691/4774 variables, 1083/1135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3564/4699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 1/4700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4774 variables, 0/4700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4776 variables, 2/4702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4776 variables, 0/4702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4702 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3264 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 20/20 constraints]
After SMT, in 4935ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 6 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 65 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1085/1085 places, 3691/3691 transitions.
RANDOM walk for 40000 steps (279 resets) in 390 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 152512 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 1
Probabilistic random walk after 152512 steps, saw 28870 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-31 20:50:14] [INFO ] Invariant cache hit.
[2024-05-31 20:50:14] [INFO ] State equation strengthened by 3564 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:50:14] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 54/1081 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1083 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1083 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3691/4774 variables, 1083/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/4774 variables, 3564/4680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 0/4680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/4776 variables, 2/4682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/4776 variables, 0/4682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4682 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1464 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 54/1081 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1083 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1083 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3691/4774 variables, 1083/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4774 variables, 3564/4680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 1/4681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 0/4681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4776 variables, 2/4683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 0/4683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4776 variables, 0/4683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4683 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2093 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3611ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 6 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 67 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 66 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2024-05-31 20:50:18] [INFO ] Invariant cache hit.
[2024-05-31 20:50:19] [INFO ] Implicit Places using invariants in 907 ms returned []
[2024-05-31 20:50:19] [INFO ] Invariant cache hit.
[2024-05-31 20:50:20] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2024-05-31 20:50:39] [INFO ] Implicit Places using invariants and state equation in 20011 ms returned []
Implicit Place search using SMT with State Equation took 20924 ms to find 0 implicit places.
[2024-05-31 20:50:39] [INFO ] Redundant transitions in 109 ms returned []
Running 3661 sub problems to find dead transitions.
[2024-05-31 20:50:39] [INFO ] Invariant cache hit.
[2024-05-31 20:50:39] [INFO ] State equation strengthened by 3564 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 32585ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 32622ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53737 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3470 edges and 1085 vertex of which 926 / 1085 are part of one of the 2 SCC in 1 ms
Free SCC test removed 924 places
Drop transitions (Empty/Sink Transition effects.) removed 2519 transitions
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 3435 transitions.
Graph (complete) has 440 edges and 161 vertex of which 77 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.0 ms
Discarding 84 places :
Also discarding 27 output transitions
Drop transitions (Output transitions of discarded places.) removed 27 transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 77 transition count 172
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 112 place count 24 transition count 67
Iterating global reduction 1 with 53 rules applied. Total rules applied 165 place count 24 transition count 67
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 191 place count 24 transition count 41
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 193 place count 23 transition count 40
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 195 place count 22 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 22 transition count 35
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 22 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 20 transition count 33
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 19 transition count 32
Applied a total of 207 rules in 8 ms. Remains 19 /1085 variables (removed 1066) and now considering 32/3691 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 19 cols
[2024-05-31 20:51:12] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:51:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 20:51:12] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:51:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 20:51:12] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:51:12] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:51:12] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 78 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 179 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 639 reset in 758 ms.
Product exploration explored 100000 steps with 641 reset in 759 ms.
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Applied a total of 0 rules in 57 ms. Remains 1088 /1088 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2024-05-31 20:51:14] [INFO ] Computed 32 invariants in 48 ms
[2024-05-31 20:51:14] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-05-31 20:51:14] [INFO ] Invariant cache hit.
[2024-05-31 20:51:15] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-31 20:51:21] [INFO ] Implicit Places using invariants and state equation in 6826 ms returned []
Implicit Place search using SMT with State Equation took 7417 ms to find 0 implicit places.
[2024-05-31 20:51:21] [INFO ] Redundant transitions in 102 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 20:51:21] [INFO ] Invariant cache hit.
[2024-05-31 20:51:21] [INFO ] State equation strengthened by 2666 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1087 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 31983ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32016ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39606 ms. Remains : 1088/1088 places, 3694/3694 transitions.
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-05 finished in 267987 ms.
[2024-05-31 20:51:54] [INFO ] Flatten gal took : 150 ms
[2024-05-31 20:51:54] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 20:51:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2163 places, 5580 transitions and 14940 arcs took 27 ms.
Total runtime 1152965 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2024

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="CANInsertWithFailure-PT-030"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CANInsertWithFailure-PT-030, 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 r476-tall-171620505200116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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