About the Execution of ITS-Tools for Dekker-PT-020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1406.812 | 41346.00 | 63633.00 | 367.10 | FFFTFTFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r136-tall-171631131900099.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Dekker-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631131900099
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 20:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Apr 11 20:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 20:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 20:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 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 247K 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 Dekker-PT-020-LTLCardinality-00
FORMULA_NAME Dekker-PT-020-LTLCardinality-01
FORMULA_NAME Dekker-PT-020-LTLCardinality-02
FORMULA_NAME Dekker-PT-020-LTLCardinality-03
FORMULA_NAME Dekker-PT-020-LTLCardinality-04
FORMULA_NAME Dekker-PT-020-LTLCardinality-05
FORMULA_NAME Dekker-PT-020-LTLCardinality-06
FORMULA_NAME Dekker-PT-020-LTLCardinality-07
FORMULA_NAME Dekker-PT-020-LTLCardinality-08
FORMULA_NAME Dekker-PT-020-LTLCardinality-09
FORMULA_NAME Dekker-PT-020-LTLCardinality-10
FORMULA_NAME Dekker-PT-020-LTLCardinality-11
FORMULA_NAME Dekker-PT-020-LTLCardinality-12
FORMULA_NAME Dekker-PT-020-LTLCardinality-13
FORMULA_NAME Dekker-PT-020-LTLCardinality-14
FORMULA_NAME Dekker-PT-020-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716336053212
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 00:00:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:00:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:00:54] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-05-22 00:00:54] [INFO ] Transformed 100 places.
[2024-05-22 00:00:54] [INFO ] Transformed 440 transitions.
[2024-05-22 00:00:54] [INFO ] Found NUPN structural information;
[2024-05-22 00:00:54] [INFO ] Parsed PT model containing 100 places and 440 transitions and 3240 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 18 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:00:54] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2024-05-22 00:00:54] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 00:00:55] [INFO ] Implicit Places using invariants in 296 ms returned [40, 46, 52, 55, 58, 61, 64, 70, 76, 79, 85, 94]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 334 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/100 places, 440/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 374 ms. Remains : 88/100 places, 440/440 transitions.
Support contains 36 out of 88 places after structural reductions.
[2024-05-22 00:00:55] [INFO ] Flatten gal took : 60 ms
[2024-05-22 00:00:55] [INFO ] Flatten gal took : 34 ms
[2024-05-22 00:00:55] [INFO ] Input system was already deterministic with 440 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (8 resets) in 2119 ms. (18 steps per ms) remains 6/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/4 properties
[2024-05-22 00:00:56] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 88 cols
[2024-05-22 00:00:56] [INFO ] Computed 48 invariants in 10 ms
[2024-05-22 00:00:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:00:56] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/13 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/17 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/17 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/17 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/19 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/19 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/19 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 16/35 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/35 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 32/67 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 85/152 variables, 53/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/152 variables, 53/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/152 variables, 11/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/152 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 16/168 variables, 21/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/168 variables, 16/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/168 variables, 5/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/168 variables, 16/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/168 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/168 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 245 constraints, problems are : Problem set: 0 solved, 2 unsolved in 372 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 88/88 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/13 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:00:56] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:00:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/13 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/17 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/17 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/17 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/19 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/19 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/19 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/35 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/35 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 32/67 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/67 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 85/152 variables, 53/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/152 variables, 53/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/152 variables, 11/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/152 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:00:57] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/152 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:00:57] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/152 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:00:57] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:00:57] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/152 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/152 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 16/168 variables, 21/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/168 variables, 16/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/168 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/168 variables, 16/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/168 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/168 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 369 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 88/88 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 783ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 4768 steps, including 180 resets, run visited all 1 properties in 32 ms. (steps per millisecond=149 )
Parikh walk visited 2 properties in 145 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 35 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:00:57] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:00:57] [INFO ] Invariant cache hit.
[2024-05-22 00:00:58] [INFO ] Implicit Places using invariants in 146 ms returned [42, 47, 60, 65, 72, 77, 80, 85]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 148 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/88 places, 440/440 transitions.
Applied a total of 0 rules in 21 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 80/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 532 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA Dekker-PT-020-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-020-LTLCardinality-01 finished in 925 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 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 6 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:00:58] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:00:58] [INFO ] Invariant cache hit.
[2024-05-22 00:00:58] [INFO ] Implicit Places using invariants in 135 ms returned [42, 60, 65, 72, 77, 85]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 136 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/88 places, 440/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 82/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-020-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-LTLCardinality-02 finished in 238 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&&(G(p1) U p2))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:00:58] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:00:58] [INFO ] Invariant cache hit.
[2024-05-22 00:00:59] [INFO ] Implicit Places using invariants in 120 ms returned [42, 47, 60, 72, 77, 80, 85]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 121 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/88 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 130 ms. Remains : 81/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p2))]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 1 ms.
FORMULA Dekker-PT-020-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-LTLCardinality-04 finished in 334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X(X(F(p1)))||(!p2 U (p3||G(!p2))))))'
Support contains 8 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:00:59] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:00:59] [INFO ] Invariant cache hit.
[2024-05-22 00:00:59] [INFO ] Implicit Places using invariants in 110 ms returned [42, 47, 65, 72, 77, 80, 85]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 114 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/88 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 81/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-06
Product exploration explored 100000 steps with 39377 reset in 350 ms.
Product exploration explored 100000 steps with 39416 reset in 377 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) p2 p0 p1), (X (NOT p3)), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X p0), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR p3 (NOT p2))), (X (NOT (OR p3 (NOT p2)))), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) p2))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) p2 (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 555 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2 (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 581 ms. (68 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 3/6 properties
[2024-05-22 00:01:01] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2024-05-22 00:01:01] [INFO ] Computed 41 invariants in 1 ms
[2024-05-22 00:01:01] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 14/22 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/28 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/29 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/29 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 28/57 variables, 29/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/57 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 26/83 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/83 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 65/148 variables, 39/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/148 variables, 39/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/148 variables, 13/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/148 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 13/161 variables, 13/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/161 variables, 13/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/161 variables, 13/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/161 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/161 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 223 constraints, problems are : Problem set: 0 solved, 3 unsolved in 127 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 14/22 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem apf3 is UNSAT
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem apf5 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 3/34 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/28 variables, 5/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 6/45 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 1/46 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/28 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/29 variables, 1/47 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/29 variables, 1/48 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/29 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 28/57 variables, 29/77 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/57 variables, 0/77 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 26/83 variables, 20/97 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/83 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 65/148 variables, 39/136 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/148 variables, 39/175 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/148 variables, 13/188 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/148 variables, 1/189 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/148 variables, 3/192 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/148 variables, 0/192 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 13/161 variables, 13/205 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/161 variables, 13/218 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/161 variables, 13/231 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/161 variables, 0/231 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/161 variables, 0/231 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 231 constraints, problems are : Problem set: 2 solved, 1 unsolved in 322 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 464ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 1785 steps, including 70 resets, run visited all 1 properties in 14 ms. (steps per millisecond=127 )
Parikh walk visited 1 properties in 14 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p2 p0 p1), (X (NOT p3)), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X p0), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1))))), (G (OR p0 p1)), (G (OR p0 (NOT p2) p3 p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR p3 (NOT p2))), (X (NOT (OR p3 (NOT p2)))), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) p2))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) p2 (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p3 p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p2) p3 p1))), (F p3), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 616 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Support contains 6 out of 81 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 440/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:03] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:03] [INFO ] Invariant cache hit.
[2024-05-22 00:01:03] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-22 00:01:03] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:03] [INFO ] Invariant cache hit.
[2024-05-22 00:01:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-22 00:01:03] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-05-22 00:01:03] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:03] [INFO ] Invariant cache hit.
[2024-05-22 00:01:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 39/119 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 14/174 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 1/81 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 10 (OVERLAPS) 80/161 variables, 81/257 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 13 (OVERLAPS) 0/161 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 277 constraints, problems are : Problem set: 0 solved, 420 unsolved in 11748 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 39/119 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 54/174 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (OVERLAPS) 1/81 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 80/161 variables, 81/257 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 420/697 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 12 (OVERLAPS) 0/161 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 697 constraints, problems are : Problem set: 0 solved, 420 unsolved in 9572 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 54/54 constraints]
After SMT, in 21591ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 21600ms
Finished structural reductions in LTL mode , in 1 iterations and 21826 ms. Remains : 81/81 places, 440/440 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 229 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 406 ms. (98 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
[2024-05-22 00:01:25] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:25] [INFO ] Invariant cache hit.
[2024-05-22 00:01:25] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 11/17 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/20 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/21 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 20/41 variables, 21/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/41 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/71 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 75/146 variables, 45/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/146 variables, 45/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/146 variables, 15/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/146 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 15/161 variables, 15/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/161 variables, 15/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/161 variables, 15/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/161 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/161 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 11/17 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:01:25] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/20 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:01:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/20 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/21 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/21 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/21 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/41 variables, 21/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/41 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/71 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/71 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 75/146 variables, 45/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/146 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/146 variables, 15/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/146 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:01:25] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:01:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:01:25] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:01:25] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:01:25] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:01:25] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:01:25] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:01:25] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/146 variables, 8/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/146 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 15/161 variables, 15/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/161 variables, 15/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/161 variables, 15/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/161 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/161 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 234 constraints, problems are : Problem set: 0 solved, 1 unsolved in 416 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 495ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 440/440 transitions.
Applied a total of 0 rules in 15 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 81/81 places, 440/440 transitions.
RANDOM walk for 40000 steps (8 resets) in 228 ms. (174 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1535058 steps, run timeout after 3001 ms. (steps per millisecond=511 ) properties seen :0 out of 1
Probabilistic random walk after 1535058 steps, saw 736264 distinct states, run finished after 3006 ms. (steps per millisecond=510 ) properties seen :0
[2024-05-22 00:01:29] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:29] [INFO ] Invariant cache hit.
[2024-05-22 00:01:29] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 11/17 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/20 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/21 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 20/41 variables, 21/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/41 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/71 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 75/146 variables, 45/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/146 variables, 45/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/146 variables, 15/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/146 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 15/161 variables, 15/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/161 variables, 15/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/161 variables, 15/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/161 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/161 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 11/17 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:01:29] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/20 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:01:29] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/20 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/21 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/21 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/21 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/41 variables, 21/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/41 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/71 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/71 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 75/146 variables, 45/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/146 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/146 variables, 15/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/146 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:01:29] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:01:29] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:01:29] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:01:29] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:01:29] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:01:29] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:01:29] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:01:29] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/146 variables, 8/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/146 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 15/161 variables, 15/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/161 variables, 15/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/161 variables, 15/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/161 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/161 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 234 constraints, problems are : Problem set: 0 solved, 1 unsolved in 418 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 523ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 491 steps, including 19 resets, run visited all 1 properties in 4 ms. (steps per millisecond=122 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 p2 (NOT p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p1 p2 p3))), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) p3))), (F p3)]
Knowledge based reduction with 2 factoid took 333 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Product exploration explored 100000 steps with 33077 reset in 305 ms.
Stack based approach found an accepted trace after 8326 steps with 2762 reset with depth 6 and stack size 6 in 26 ms.
FORMULA Dekker-PT-020-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-020-LTLCardinality-06 finished in 31477 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 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:30] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 88 cols
[2024-05-22 00:01:30] [INFO ] Computed 48 invariants in 2 ms
[2024-05-22 00:01:30] [INFO ] Implicit Places using invariants in 123 ms returned [42, 47, 60, 65, 72, 77, 80, 85]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 127 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/88 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 80/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 90 steps with 0 reset in 2 ms.
FORMULA Dekker-PT-020-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-LTLCardinality-07 finished in 226 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) U p1)))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:31] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:31] [INFO ] Invariant cache hit.
[2024-05-22 00:01:31] [INFO ] Implicit Places using invariants in 145 ms returned [42, 47, 60, 65, 72, 77, 80, 85]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 146 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/88 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 80/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-08
Product exploration explored 100000 steps with 4802 reset in 381 ms.
Stack based approach found an accepted trace after 57 steps with 3 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Dekker-PT-020-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-020-LTLCardinality-08 finished in 666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((((p0 U !p1) U X(p2))&&X(X(p3)))))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:31] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:31] [INFO ] Invariant cache hit.
[2024-05-22 00:01:31] [INFO ] Implicit Places using invariants in 126 ms returned [42, 47, 60, 65, 72, 80, 85]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 127 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/88 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 81/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p3) (NOT p2)), (NOT p2), (NOT p3), (NOT p2), (AND p1 (NOT p2)), true, (NOT p3), p1]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 79 steps with 24 reset in 1 ms.
FORMULA Dekker-PT-020-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-LTLCardinality-09 finished in 473 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(G(!p0)) U p1)))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:32] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:32] [INFO ] Invariant cache hit.
[2024-05-22 00:01:32] [INFO ] Implicit Places using invariants in 125 ms returned [42, 47, 60, 65, 77, 80]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 126 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/88 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 82/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 238 ms :[p0, (NOT p1), true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 18 steps with 8 reset in 0 ms.
FORMULA Dekker-PT-020-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-LTLCardinality-10 finished in 389 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))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:32] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:32] [INFO ] Invariant cache hit.
[2024-05-22 00:01:32] [INFO ] Implicit Places using invariants in 125 ms returned [42, 47, 60, 65, 72, 77, 80, 85]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 126 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/88 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 80/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-020-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-LTLCardinality-11 finished in 251 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)))))'
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:32] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:32] [INFO ] Invariant cache hit.
[2024-05-22 00:01:32] [INFO ] Implicit Places using invariants in 122 ms returned [42, 47, 60, 65, 72, 77, 80, 85]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 125 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/88 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 80/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-12
Product exploration explored 100000 steps with 24809 reset in 302 ms.
Stack based approach found an accepted trace after 3019 steps with 743 reset with depth 6 and stack size 6 in 10 ms.
FORMULA Dekker-PT-020-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-020-LTLCardinality-12 finished in 616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0))||(F(p0)&&F(!p1))) U (p2 U p3)))'
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 21 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:33] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:33] [INFO ] Invariant cache hit.
[2024-05-22 00:01:33] [INFO ] Implicit Places using invariants in 158 ms returned [47, 60, 72, 77, 80, 85]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 158 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/88 places, 440/440 transitions.
Applied a total of 0 rules in 11 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 190 ms. Remains : 82/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p3), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-14
Product exploration explored 100000 steps with 5944 reset in 404 ms.
Stack based approach found an accepted trace after 45 steps with 4 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Dekker-PT-020-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-020-LTLCardinality-14 finished in 781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:34] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:34] [INFO ] Invariant cache hit.
[2024-05-22 00:01:34] [INFO ] Implicit Places using invariants in 130 ms returned [42, 47, 60, 65, 72, 77, 80, 85]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 131 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/88 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 80/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 53 steps with 26 reset in 0 ms.
FORMULA Dekker-PT-020-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-LTLCardinality-15 finished in 315 ms.
All properties solved by simple procedures.
Total runtime 40086 ms.
BK_STOP 1716336094558
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Dekker-PT-020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631131900099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-020.tgz
mv Dekker-PT-020 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;