Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r136-tall-171631131900115.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-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631131900115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 20:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 20:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 20:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 20:07 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 5.9M 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-100-LTLCardinality-00
FORMULA_NAME Dekker-PT-100-LTLCardinality-01
FORMULA_NAME Dekker-PT-100-LTLCardinality-02
FORMULA_NAME Dekker-PT-100-LTLCardinality-03
FORMULA_NAME Dekker-PT-100-LTLCardinality-04
FORMULA_NAME Dekker-PT-100-LTLCardinality-05
FORMULA_NAME Dekker-PT-100-LTLCardinality-06
FORMULA_NAME Dekker-PT-100-LTLCardinality-07
FORMULA_NAME Dekker-PT-100-LTLCardinality-08
FORMULA_NAME Dekker-PT-100-LTLCardinality-09
FORMULA_NAME Dekker-PT-100-LTLCardinality-10
FORMULA_NAME Dekker-PT-100-LTLCardinality-11
FORMULA_NAME Dekker-PT-100-LTLCardinality-12
FORMULA_NAME Dekker-PT-100-LTLCardinality-13
FORMULA_NAME Dekker-PT-100-LTLCardinality-14
FORMULA_NAME Dekker-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716336531228

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-100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 00:08:52] [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:08:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:08:52] [INFO ] Load time of PNML (sax parser for PT used): 442 ms
[2024-05-22 00:08:52] [INFO ] Transformed 500 places.
[2024-05-22 00:08:52] [INFO ] Transformed 10200 transitions.
[2024-05-22 00:08:52] [INFO ] Found NUPN structural information;
[2024-05-22 00:08:52] [INFO ] Parsed PT model containing 500 places and 10200 transitions and 80200 arcs in 600 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 339 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 00:08:53] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2024-05-22 00:08:53] [INFO ] Computed 300 invariants in 30 ms
[2024-05-22 00:09:01] [INFO ] Implicit Places using invariants in 7622 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 269, 272, 275, 278, 281, 284, 290, 293, 296, 299, 302, 305, 311, 314, 317, 320, 323, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 365, 368, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 440, 443, 446, 449, 455, 458, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491]
Discarding 91 places :
Implicit Place search using SMT only with invariants took 7679 ms to find 91 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 409/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 101 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8141 ms. Remains : 409/500 places, 10200/10200 transitions.
Support contains 45 out of 409 places after structural reductions.
[2024-05-22 00:09:02] [INFO ] Flatten gal took : 624 ms
[2024-05-22 00:09:02] [INFO ] Flatten gal took : 407 ms
[2024-05-22 00:09:03] [INFO ] Input system was already deterministic with 10200 transitions.
Support contains 43 out of 409 places (down from 45) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (8 resets) in 3063 ms. (13 steps per ms) remains 3/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
[2024-05-22 00:09:04] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 409 cols
[2024-05-22 00:09:04] [INFO ] Computed 209 invariants in 5 ms
[2024-05-22 00:09:04] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/17 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/17 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 196/213 variables, 100/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 498/711 variables, 302/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/711 variables, 302/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/711 variables, 90/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/711 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 98/809 variables, 106/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/809 variables, 98/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/809 variables, 8/1029 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/809 variables, 98/1127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/809 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/809 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 809/809 variables, and 1127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 626 ms.
Refiners :[Domain max(s): 409/409 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 409/409 constraints, ReadFeed: 100/100 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/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/17 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/17 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 196/213 variables, 100/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 498/711 variables, 302/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/711 variables, 302/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/711 variables, 90/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/711 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/711 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 98/809 variables, 106/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/809 variables, 98/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/809 variables, 8/1030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/809 variables, 98/1128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/809 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/809 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 809/809 variables, and 1128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 495 ms.
Refiners :[Domain max(s): 409/409 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 409/409 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1253ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 15 ms.
FORMULA Dekker-PT-100-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!X(p0)||!p1) U !(F(!G(p0))||F(p1))))'
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 108 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 00:09:06] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:09:06] [INFO ] Invariant cache hit.
[2024-05-22 00:09:08] [INFO ] Implicit Places using invariants in 2028 ms returned [218, 245, 260, 275, 373, 380, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2040 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 109 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2259 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) p1), p0, true]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Dekker-PT-100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-00 finished in 2581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 409 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 706 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 00:09:09] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:09:09] [INFO ] Invariant cache hit.
[2024-05-22 00:09:11] [INFO ] Implicit Places using invariants in 2008 ms returned [218, 245, 260, 275, 288, 373, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2019 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 589 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3315 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-01
Product exploration explored 100000 steps with 930 reset in 2228 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 3 ms.
FORMULA Dekker-PT-100-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-01 finished in 5676 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((X(p1)&&p0)))'
Support contains 2 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 92 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 00:09:14] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:09:14] [INFO ] Invariant cache hit.
[2024-05-22 00:09:16] [INFO ] Implicit Places using invariants in 2086 ms returned [218, 245, 260, 288, 373, 380, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2100 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 96 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2289 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-02
Product exploration explored 100000 steps with 33590 reset in 1869 ms.
Stack based approach found an accepted trace after 1592 steps with 749 reset with depth 27 and stack size 27 in 28 ms.
FORMULA Dekker-PT-100-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-02 finished in 4318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 409 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 450 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 00:09:19] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:09:19] [INFO ] Invariant cache hit.
[2024-05-22 00:09:21] [INFO ] Implicit Places using invariants in 1997 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2007 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 442 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2901 ms. Remains : 400/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 2090 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-03 finished in 5073 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 p1)&&X(p2)))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 88 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 00:09:24] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:09:24] [INFO ] Invariant cache hit.
[2024-05-22 00:09:26] [INFO ] Implicit Places using invariants in 2036 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2049 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 88 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2225 ms. Remains : 400/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-04 finished in 2367 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 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 104 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 00:09:26] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:09:26] [INFO ] Invariant cache hit.
[2024-05-22 00:09:28] [INFO ] Implicit Places using invariants in 2004 ms returned [218, 245, 260, 275, 288, 380, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2039 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 95 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2238 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 214 steps with 0 reset in 6 ms.
FORMULA Dekker-PT-100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-05 finished in 2355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1))))'
Support contains 3 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 98 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 00:09:28] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:09:28] [INFO ] Invariant cache hit.
[2024-05-22 00:09:30] [INFO ] Implicit Places using invariants in 1974 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1986 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 92 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2176 ms. Remains : 400/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 2105 ms.
Stack based approach found an accepted trace after 70 steps with 0 reset with depth 71 and stack size 71 in 2 ms.
FORMULA Dekker-PT-100-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-09 finished in 4566 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((F(p0)&&X(p1))))'
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 93 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 00:09:33] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:09:33] [INFO ] Invariant cache hit.
[2024-05-22 00:09:35] [INFO ] Implicit Places using invariants in 2113 ms returned [218, 245, 260, 275, 288, 373, 380, 403]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2127 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 91 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2312 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-11
Product exploration explored 100000 steps with 3842 reset in 1990 ms.
Stack based approach found an accepted trace after 232 steps with 10 reset with depth 13 and stack size 13 in 6 ms.
FORMULA Dekker-PT-100-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-11 finished in 4475 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&&F((p1||X(((p1 U !p2) U (p1&&(p1 U !p2)))))))))'
Support contains 3 out of 409 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 453 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 00:09:38] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:09:38] [INFO ] Invariant cache hit.
[2024-05-22 00:09:40] [INFO ] Implicit Places using invariants in 1988 ms returned [218, 245, 275, 288, 373, 380, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1996 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 460 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2909 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-12
Product exploration explored 100000 steps with 1033 reset in 2040 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-12 finished in 5064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p1&&F(p2))))))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 91 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 00:09:43] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:09:43] [INFO ] Invariant cache hit.
[2024-05-22 00:09:45] [INFO ] Implicit Places using invariants in 2040 ms returned [260, 275, 288, 373, 380, 403, 406]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 2051 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 402/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 96 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2240 ms. Remains : 402/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-13 finished in 2461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((F(p1)&&p0))||X(X(F(p2)))))))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 88 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 00:09:45] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:09:45] [INFO ] Invariant cache hit.
[2024-05-22 00:09:47] [INFO ] Implicit Places using invariants in 2026 ms returned [218, 245, 260, 275, 288, 373, 380, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2036 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 91 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2216 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-14
Product exploration explored 100000 steps with 18382 reset in 1982 ms.
Stack based approach found an accepted trace after 188 steps with 45 reset with depth 7 and stack size 7 in 4 ms.
FORMULA Dekker-PT-100-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-14 finished in 4464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1 U (G(p2)||F(G(p1)))))))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 92 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 00:09:49] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:09:49] [INFO ] Invariant cache hit.
[2024-05-22 00:09:52] [INFO ] Implicit Places using invariants in 2035 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2043 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 93 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2229 ms. Remains : 400/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 2106 ms.
Product exploration explored 100000 steps with 0 reset in 2341 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 p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 747 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1477 ms. (27 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
[2024-05-22 00:09:58] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-22 00:09:58] [INFO ] Computed 200 invariants in 8 ms
[2024-05-22 00:09:58] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 4 unsolved in 436 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 4/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 12 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 1 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 20/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:10:03] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2024-05-22 00:10:03] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:10:03] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:10:03] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-22 00:10:03] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:10:03] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-22 00:10:03] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-22 00:10:03] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2024-05-22 00:10:04] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:10:04] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
SMT process timed out in 5552ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 628 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 628 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1117 ms. (35 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
[2024-05-22 00:10:05] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:10:05] [INFO ] Invariant cache hit.
[2024-05-22 00:10:05] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 334 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:10:05] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:10:06] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2024-05-22 00:10:06] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-05-22 00:10:06] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/704 variables, 20/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/704 variables, 20/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 20/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/704 variables, 7/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/704 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 96/800 variables, 96/998 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/800 variables, 96/1094 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 96/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1190 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11418 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 88/88 constraints]
After SMT, in 11819ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 350 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 351 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 351 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1013 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 266236 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 2
Probabilistic random walk after 266236 steps, saw 244412 distinct states, run finished after 3005 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-22 00:10:21] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:10:21] [INFO ] Invariant cache hit.
[2024-05-22 00:10:21] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 381 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:10:21] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:10:22] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-22 00:10:22] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2024-05-22 00:10:22] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-22 00:10:22] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/704 variables, 20/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/704 variables, 20/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 20/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/704 variables, 7/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/704 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 96/800 variables, 96/998 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/800 variables, 96/1094 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 96/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1190 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11211 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 88/88 constraints]
After SMT, in 11688ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 367 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 354 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 359 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 00:10:33] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:10:33] [INFO ] Invariant cache hit.
[2024-05-22 00:10:35] [INFO ] Implicit Places using invariants in 1454 ms returned []
Implicit Place search using SMT only with invariants took 1458 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-22 00:10:35] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:10:35] [INFO ] Invariant cache hit.
[2024-05-22 00:10:35] [INFO ] State equation strengthened by 100 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/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 49024ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 49138ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51018 ms. Remains : 400/400 places, 10200/10200 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.2 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions (Output transitions of discarded places.) removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 396 place count 14 transition count 15
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 29 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 10 rows 10 cols
[2024-05-22 00:11:24] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 00:11:24] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 00:11:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-22 00:11:24] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 00:11:24] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 00:11:24] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 130 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p2 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 892 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 93 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 00:11:26] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-22 00:11:26] [INFO ] Computed 200 invariants in 4 ms
[2024-05-22 00:11:27] [INFO ] Implicit Places using invariants in 1485 ms returned []
Implicit Place search using SMT only with invariants took 1490 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-22 00:11:27] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:11:27] [INFO ] Invariant cache hit.
[2024-05-22 00:11:27] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 49887ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 49997ms
Finished structural reductions in LTL mode , in 1 iterations and 51608 ms. Remains : 400/400 places, 10200/10200 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 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 722 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1130 ms. (35 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
[2024-05-22 00:12:19] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:12:19] [INFO ] Invariant cache hit.
[2024-05-22 00:12:19] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 351 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:12:19] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 1 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2024-05-22 00:12:23] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2024-05-22 00:12:23] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-22 00:12:23] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-05-22 00:12:23] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:12:23] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-22 00:12:23] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-22 00:12:23] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:12:24] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 4 ms to minimize.
[2024-05-22 00:12:24] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-22 00:12:24] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-22 00:12:24] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2024-05-22 00:12:24] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-22 00:12:24] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
SMT process timed out in 5504ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 381 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 381 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1202 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 229674 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 2
Probabilistic random walk after 229674 steps, saw 211235 distinct states, run finished after 3002 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-22 00:12:28] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:12:28] [INFO ] Invariant cache hit.
[2024-05-22 00:12:28] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 348 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:12:28] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-22 00:12:30] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-22 00:12:30] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-22 00:12:30] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2024-05-22 00:12:30] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2024-05-22 00:12:30] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2024-05-22 00:12:31] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-22 00:12:31] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-22 00:12:31] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2024-05-22 00:12:31] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:12:31] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:12:33] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-22 00:12:33] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-22 00:12:33] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-22 00:12:33] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-22 00:12:33] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:12:33] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-22 00:12:33] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:12:33] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:12:33] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/704 variables, 20/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:12:35] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-22 00:12:35] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:12:35] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-22 00:12:35] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-22 00:12:35] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-22 00:12:35] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-05-22 00:12:35] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2024-05-22 00:12:35] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/704 variables, 20/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 20/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/704 variables, 7/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/704 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 96/800 variables, 96/998 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/800 variables, 96/1094 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 96/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1190 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11230 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 88/88 constraints]
After SMT, in 11646ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 364 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 344 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 344 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 343 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 00:12:41] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:12:41] [INFO ] Invariant cache hit.
[2024-05-22 00:12:42] [INFO ] Implicit Places using invariants in 1449 ms returned []
Implicit Place search using SMT only with invariants took 1450 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-22 00:12:42] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 00:12:42] [INFO ] Invariant cache hit.
[2024-05-22 00:12:42] [INFO ] State equation strengthened by 100 read => feed constraints.

BK_STOP 1716336774938

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-100"
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-100, 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-171631131900115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-100.tgz
mv Dekker-PT-100 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;