fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683761600666
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldPPPt-PT-040B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1658.619 181502.00 252237.00 559.00 [undef] Cannot compute

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683761600666.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldPPPt-PT-040B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761600666
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 762K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717258887116

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:21:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:21:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:21:28] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2024-06-01 16:21:28] [INFO ] Transformed 3123 places.
[2024-06-01 16:21:28] [INFO ] Transformed 2843 transitions.
[2024-06-01 16:21:28] [INFO ] Found NUPN structural information;
[2024-06-01 16:21:28] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 166 out of 3123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Discarding 398 places :
Symmetric choice reduction at 0 with 398 rule applications. Total rules 398 place count 2725 transition count 2445
Iterating global reduction 0 with 398 rules applied. Total rules applied 796 place count 2725 transition count 2445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 797 place count 2724 transition count 2444
Iterating global reduction 0 with 1 rules applied. Total rules applied 798 place count 2724 transition count 2444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 799 place count 2723 transition count 2443
Iterating global reduction 0 with 1 rules applied. Total rules applied 800 place count 2723 transition count 2443
Applied a total of 800 rules in 1333 ms. Remains 2723 /3123 variables (removed 400) and now considering 2443/2843 (removed 400) transitions.
// Phase 1: matrix 2443 rows 2723 cols
[2024-06-01 16:21:30] [INFO ] Computed 441 invariants in 28 ms
[2024-06-01 16:21:31] [INFO ] Implicit Places using invariants in 1115 ms returned []
[2024-06-01 16:21:31] [INFO ] Invariant cache hit.
[2024-06-01 16:21:33] [INFO ] Implicit Places using invariants and state equation in 2209 ms returned []
Implicit Place search using SMT with State Equation took 3439 ms to find 0 implicit places.
Running 2442 sub problems to find dead transitions.
[2024-06-01 16:21:33] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2722/5166 variables, and 0 constraints, problems are : Problem set: 0 solved, 2442 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2723 constraints, PredecessorRefiner: 2442/2442 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2442 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2722/5166 variables, and 0 constraints, problems are : Problem set: 0 solved, 2442 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2723 constraints, PredecessorRefiner: 0/2442 constraints, Known Traps: 0/0 constraints]
After SMT, in 60936ms problems are : Problem set: 0 solved, 2442 unsolved
Search for dead transitions found 0 dead transitions in 60975ms
Starting structural reductions in LTL mode, iteration 1 : 2723/3123 places, 2443/2843 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65789 ms. Remains : 2723/3123 places, 2443/2843 transitions.
Support contains 166 out of 2723 places after structural reductions.
[2024-06-01 16:22:35] [INFO ] Flatten gal took : 158 ms
[2024-06-01 16:22:35] [INFO ] Flatten gal took : 96 ms
[2024-06-01 16:22:35] [INFO ] Input system was already deterministic with 2443 transitions.
RANDOM walk for 40000 steps (8 resets) in 2550 ms. (15 steps per ms) remains 57/108 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
[2024-06-01 16:22:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 723/814 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/814 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 1909/2723 variables, 348/441 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2723 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 2443/5166 variables, 2723/3164 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5166/5166 variables, and 3164 constraints, problems are : Problem set: 0 solved, 57 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 2723/2723 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 723/814 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 16:22:42] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/814 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/814 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 1909/2723 variables, 348/442 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 16:22:45] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 3 ms to minimize.
[2024-06-01 16:22:45] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-06-01 16:22:45] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 3 ms to minimize.
[2024-06-01 16:22:45] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:22:45] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 5 ms to minimize.
[2024-06-01 16:22:45] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 3 ms to minimize.
[2024-06-01 16:22:45] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:22:45] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:22:46] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-01 16:22:46] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:22:46] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:22:46] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:22:46] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:22:46] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:22:46] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
SMT process timed out in 10091ms, After SMT, problems are : Problem set: 0 solved, 57 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 91 out of 2723 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 503 transitions
Trivial Post-agglo rules discarded 503 transitions
Performed 503 trivial Post agglomeration. Transition count delta: 503
Iterating post reduction 0 with 503 rules applied. Total rules applied 503 place count 2723 transition count 1940
Reduce places removed 503 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 518 rules applied. Total rules applied 1021 place count 2220 transition count 1925
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1036 place count 2205 transition count 1925
Performed 290 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 290 Pre rules applied. Total rules applied 1036 place count 2205 transition count 1635
Deduced a syphon composed of 290 places in 2 ms
Reduce places removed 290 places and 0 transitions.
Iterating global reduction 3 with 580 rules applied. Total rules applied 1616 place count 1915 transition count 1635
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1635 place count 1896 transition count 1616
Iterating global reduction 3 with 19 rules applied. Total rules applied 1654 place count 1896 transition count 1616
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 1654 place count 1896 transition count 1600
Deduced a syphon composed of 16 places in 6 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1686 place count 1880 transition count 1600
Performed 664 Post agglomeration using F-continuation condition.Transition count delta: 664
Deduced a syphon composed of 664 places in 3 ms
Reduce places removed 664 places and 0 transitions.
Iterating global reduction 3 with 1328 rules applied. Total rules applied 3014 place count 1216 transition count 936
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3015 place count 1216 transition count 935
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3017 place count 1215 transition count 934
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 99 places in 2 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 3215 place count 1116 transition count 934
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3219 place count 1116 transition count 930
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 3223 place count 1112 transition count 930
Partial Free-agglomeration rule applied 109 times.
Drop transitions (Partial Free agglomeration) removed 109 transitions
Iterating global reduction 5 with 109 rules applied. Total rules applied 3332 place count 1112 transition count 930
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3333 place count 1111 transition count 929
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3334 place count 1110 transition count 929
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 3334 place count 1110 transition count 927
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 3338 place count 1108 transition count 927
Applied a total of 3338 rules in 843 ms. Remains 1108 /2723 variables (removed 1615) and now considering 927/2443 (removed 1516) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 844 ms. Remains : 1108/2723 places, 927/2443 transitions.
RANDOM walk for 40000 steps (8 resets) in 844 ms. (47 steps per ms) remains 40/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
// Phase 1: matrix 927 rows 1108 cols
[2024-06-01 16:22:48] [INFO ] Computed 440 invariants in 3 ms
[2024-06-01 16:22:48] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 172/238 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 16/254 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 314/568 variables, 254/331 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 407/975 variables, 232/563 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/975 variables, 76/639 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/975 variables, 5/644 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/975 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 29/1004 variables, 29/673 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1004 variables, 20/693 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1004 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 14 (OVERLAPS) 49/1053 variables, 23/716 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1053 variables, 1/717 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1053 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 17 (OVERLAPS) 355/1408 variables, 223/940 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1408 variables, 63/1003 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1408 variables, 2/1005 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1408 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 21 (OVERLAPS) 16/1424 variables, 16/1021 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1424 variables, 14/1035 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1424 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 24 (OVERLAPS) 24/1448 variables, 12/1047 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1448 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 26 (OVERLAPS) 244/1692 variables, 161/1208 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1692 variables, 41/1249 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1692 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 29 (OVERLAPS) 21/1713 variables, 21/1270 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1713 variables, 12/1282 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1713 variables, 0/1282 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 32 (OVERLAPS) 14/1727 variables, 7/1289 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1727 variables, 0/1289 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 34 (OVERLAPS) 63/1790 variables, 53/1342 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1790 variables, 13/1355 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1790 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 37 (OVERLAPS) 2/1792 variables, 2/1357 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1792 variables, 2/1359 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1792 variables, 0/1359 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 40 (OVERLAPS) 4/1796 variables, 2/1361 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1796 variables, 0/1361 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 42 (OVERLAPS) 27/1823 variables, 19/1380 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1823 variables, 7/1387 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1823 variables, 0/1387 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 45 (OVERLAPS) 19/1842 variables, 8/1395 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1842 variables, 2/1397 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1842 variables, 0/1397 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 48 (OVERLAPS) 2/1844 variables, 2/1399 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1844 variables, 2/1401 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1844 variables, 0/1401 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 51 (OVERLAPS) 4/1848 variables, 2/1403 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1848 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 53 (OVERLAPS) 22/1870 variables, 15/1418 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1870 variables, 4/1422 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1870 variables, 1/1423 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1870 variables, 0/1423 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 57 (OVERLAPS) 2/1872 variables, 1/1424 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1872 variables, 0/1424 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 59 (OVERLAPS) 20/1892 variables, 10/1434 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1892 variables, 2/1436 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1892 variables, 0/1436 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 62 (OVERLAPS) 2/1894 variables, 2/1438 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1894 variables, 2/1440 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1894 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 65 (OVERLAPS) 4/1898 variables, 2/1442 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1898 variables, 0/1442 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 67 (OVERLAPS) 21/1919 variables, 15/1457 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1919 variables, 5/1462 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1919 variables, 0/1462 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 70 (OVERLAPS) 19/1938 variables, 8/1470 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1938 variables, 2/1472 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1938 variables, 0/1472 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 73 (OVERLAPS) 2/1940 variables, 2/1474 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1940 variables, 2/1476 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1940 variables, 0/1476 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 76 (OVERLAPS) 4/1944 variables, 2/1478 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1944 variables, 0/1478 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 78 (OVERLAPS) 21/1965 variables, 15/1493 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1965 variables, 5/1498 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1965 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 81 (OVERLAPS) 19/1984 variables, 8/1506 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1984 variables, 2/1508 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1984 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1984 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 85 (OVERLAPS) 2/1986 variables, 2/1511 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1986 variables, 2/1513 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1986 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 88 (OVERLAPS) 4/1990 variables, 2/1515 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1990 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 90 (OVERLAPS) 20/2010 variables, 14/1529 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/2010 variables, 4/1533 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2010 variables, 0/1533 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 93 (OVERLAPS) 2/2012 variables, 1/1534 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2012 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 95 (OVERLAPS) 12/2024 variables, 8/1542 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2024 variables, 2/1544 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2024 variables, 1/1545 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2024 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 99 (OVERLAPS) 1/2025 variables, 1/1546 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/2025 variables, 1/1547 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2025 variables, 0/1547 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 102 (OVERLAPS) 1/2026 variables, 1/1548 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/2026 variables, 1/1549 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2026 variables, 0/1549 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 105 (OVERLAPS) 9/2035 variables, 6/1555 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/2035 variables, 3/1558 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/2035 variables, 0/1558 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 (/ 1.0 2.0))
(s35 0.0)
(s36 (/ 1.0 2.0))
(s37 0.0)
(s38 (/ 1.0 2.0))
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 1.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 (/ 1.0 8.0))
(s401 0.0)
(s402 (/ 7.0 8.0))
(s403 0.0)
(s404 (/ 5.0 8.0))
(s405 (/ 1.0 4.0))
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 1.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 1.0)
(s476 1.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 1.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 1.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 1.0)
(s509 1.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 1.0)
(s538 0.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 1.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 1.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 1.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 1.0)
(s569 0.0)
(s570 0.0)
(s571 1.0)
(s572 0.0)
(s573 1.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 1.0)
(s597 0.0)
(s598 1.0)
(s599 0.0)
(s600 1.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 1.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 1.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 1.0)
(s624 1.0)
(s625 0.0)
(s626 1.0)
(s627 0.0)
(s628 0.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 1.0)
(s633 1.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 1.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 1.0)
(s644 0.0)
(s645 1.0)
(s646 0.0)
(s647 1.0)
(s648 0.0)
(s649 0.0)
(s650 1.0)
(s651 0.0)
(s652 0.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 1.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 1.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 1.0)
(s674 1.0)
(s675 0.0)
(s676 1.0)
(s677 0.0)
(s678 1.0)
(s679 0.0)
(s680 1.0)
(s681 0.0)
(s682 1.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 1.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 1.0)
(s705 1.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 1.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 (/ 1.0 2.0))
(s724 0.0)
(s725 (/ 1.0 2.0))
(s726 0.0)
(s727 (/ 1.0 2.0))
(s728 1.0)
(s729 0.0)
(s730 1.0)
(s731 0.0)
(s732 0.0)
(s733 1.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 1.0)
(s741 1.0)
(s742 0.0)
(s743 (/ 1.0 2.0))
(s744 0.0)
(s745 (/ 1.0 2.0))
(s746 0.0)
(s747 (/ 1.0 2.0))
(s748 (/ 1.0 2.0))
(s749 0.0)
(s750 (/ 1.0 2.0))
(s751 0.0)
(s752 (/ 1.0 2.0))
(s753 1.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 1.0)
(s759 0.0)
(s760 1.0)
(s761 0.0)
(s762 1.0)
(s763 0.0)
(s764 1.0)
(s765 0.0)
(s766 0.0)
(s767 1.0)
(s768 0.0)
(s769 1.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 1.0)
(s777 1.0)
(s778 0.0)
(s779 (/ 7.0 8.0))
(s780 0.0)
(s781 (/ 1.0 8.0))
(s782 (/ 1.0 8.0))
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 1.0)
(s788 1.0)
(s789 0.0)
(s790 1.0)
(s791 0.0)
(s792 1.0)
(s793 0.0)
(s794 1.0)
(s795 0.0)
(s796 1.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 1.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 (/ 7.0 8.0))
(s807 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2035/2035 variables, and 1558 constraints, problems are : Problem set: 0 solved, 40 unsolved in 45010 ms.
Refiners :[Positive P Invariants (semi-flows): 440/440 constraints, State Equation: 1108/1108 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 172/238 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 16:23:33] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 16/254 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 314/568 variables, 254/332 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 21/353 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 16:23:34] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 16:23:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 16:23:34] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 407/975 variables, 232/588 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/975 variables, 76/664 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/975 variables, 5/669 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/975 variables, 19/688 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 16:23:35] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:23:35] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:23:35] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 16:23:35] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:23:35] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 16:23:35] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:23:35] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-06-01 16:23:36] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:23:36] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/975 variables, 9/697 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/975 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 16 (OVERLAPS) 29/1004 variables, 29/726 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1004 variables, 20/746 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1004 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 19 (OVERLAPS) 49/1053 variables, 23/769 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1053 variables, 1/770 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1053 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 22 (OVERLAPS) 355/1408 variables, 223/993 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1408 variables, 63/1056 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1408 variables, 2/1058 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1408 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 26 (OVERLAPS) 16/1424 variables, 16/1074 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1424 variables, 14/1088 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1424 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 29 (OVERLAPS) 24/1448 variables, 12/1100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1448 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 31 (OVERLAPS) 244/1692 variables, 161/1261 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1692 variables, 41/1302 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 16:23:44] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 2 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/1692 variables, 1/1303 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1692 variables, 0/1303 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 35 (OVERLAPS) 21/1713 variables, 21/1324 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1713 variables, 12/1336 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1713 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 38 (OVERLAPS) 14/1727 variables, 7/1343 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1727 variables, 0/1343 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 40 (OVERLAPS) 63/1790 variables, 53/1396 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1790 variables, 13/1409 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1790 variables, 0/1409 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 43 (OVERLAPS) 2/1792 variables, 2/1411 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1792 variables, 2/1413 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 16:23:52] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/1792 variables, 1/1414 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 16:23:54] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 2 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/1792 variables, 1/1415 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1792 variables, 0/1415 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 48 (OVERLAPS) 4/1796 variables, 2/1417 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 16:23:57] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/1796 variables, 1/1418 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1796 variables, 0/1418 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 51 (OVERLAPS) 27/1823 variables, 19/1437 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1823 variables, 7/1444 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1823 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 54 (OVERLAPS) 19/1842 variables, 8/1452 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1842 variables, 2/1454 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1842 variables, 0/1454 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 57 (OVERLAPS) 2/1844 variables, 2/1456 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1844 variables, 2/1458 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1844 variables, 0/1458 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 60 (OVERLAPS) 4/1848 variables, 2/1460 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1848 variables, 0/1460 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 62 (OVERLAPS) 22/1870 variables, 15/1475 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1870 variables, 4/1479 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1870 variables, 1/1480 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 16:24:07] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 3 ms to minimize.
At refinement iteration 65 (INCLUDED_ONLY) 0/1870 variables, 1/1481 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1870 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 67 (OVERLAPS) 2/1872 variables, 1/1482 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1872 variables, 0/1482 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 69 (OVERLAPS) 20/1892 variables, 10/1492 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1892 variables, 2/1494 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1892 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 72 (OVERLAPS) 2/1894 variables, 2/1496 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1894 variables, 2/1498 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1894 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 75 (OVERLAPS) 4/1898 variables, 2/1500 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1898 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 40 unsolved
SMT process timed out in 90049ms, After SMT, problems are : Problem set: 0 solved, 40 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 1108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1108/1108 places, 927/927 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1108 transition count 922
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1103 transition count 922
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 10 place count 1103 transition count 915
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 24 place count 1096 transition count 915
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 1093 transition count 911
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 1093 transition count 911
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 30 place count 1093 transition count 909
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 1091 transition count 909
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 46 place count 1085 transition count 903
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 66 place count 1075 transition count 903
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 1075 transition count 903
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 1071 transition count 899
Applied a total of 71 rules in 459 ms. Remains 1071 /1108 variables (removed 37) and now considering 899/927 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 459 ms. Remains : 1071/1108 places, 899/927 transitions.
[2024-06-01 16:24:18] [INFO ] Flatten gal took : 68 ms
[2024-06-01 16:24:18] [INFO ] Flatten gal took : 68 ms
[2024-06-01 16:24:18] [INFO ] Input system was already deterministic with 2443 transitions.
Computed a total of 648 stabilizing places and 648 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 2687 transition count 2407
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 2687 transition count 2407
Applied a total of 72 rules in 294 ms. Remains 2687 /2723 variables (removed 36) and now considering 2407/2443 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 2687/2723 places, 2407/2443 transitions.
[2024-06-01 16:24:19] [INFO ] Flatten gal took : 63 ms
[2024-06-01 16:24:19] [INFO ] Flatten gal took : 61 ms
[2024-06-01 16:24:19] [INFO ] Input system was already deterministic with 2407 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 2686 transition count 2406
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 2686 transition count 2406
Applied a total of 74 rules in 364 ms. Remains 2686 /2723 variables (removed 37) and now considering 2406/2443 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 2686/2723 places, 2406/2443 transitions.
[2024-06-01 16:24:20] [INFO ] Flatten gal took : 52 ms
[2024-06-01 16:24:20] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:24:20] [INFO ] Input system was already deterministic with 2406 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 2722 transition count 1885
Reduce places removed 557 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 558 rules applied. Total rules applied 1115 place count 2165 transition count 1884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1116 place count 2164 transition count 1884
Performed 299 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 299 Pre rules applied. Total rules applied 1116 place count 2164 transition count 1585
Deduced a syphon composed of 299 places in 3 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 3 with 598 rules applied. Total rules applied 1714 place count 1865 transition count 1585
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1750 place count 1829 transition count 1549
Iterating global reduction 3 with 36 rules applied. Total rules applied 1786 place count 1829 transition count 1549
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 1786 place count 1829 transition count 1519
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1846 place count 1799 transition count 1519
Performed 631 Post agglomeration using F-continuation condition.Transition count delta: 631
Deduced a syphon composed of 631 places in 1 ms
Reduce places removed 631 places and 0 transitions.
Iterating global reduction 3 with 1262 rules applied. Total rules applied 3108 place count 1168 transition count 888
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3109 place count 1168 transition count 887
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3111 place count 1167 transition count 886
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3113 place count 1165 transition count 884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3114 place count 1164 transition count 884
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3114 place count 1164 transition count 882
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3118 place count 1162 transition count 882
Applied a total of 3118 rules in 460 ms. Remains 1162 /2723 variables (removed 1561) and now considering 882/2443 (removed 1561) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 461 ms. Remains : 1162/2723 places, 882/2443 transitions.
[2024-06-01 16:24:20] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:24:20] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:24:20] [INFO ] Input system was already deterministic with 882 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2722 transition count 1884
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 2164 transition count 1884
Performed 299 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 299 Pre rules applied. Total rules applied 1116 place count 2164 transition count 1585
Deduced a syphon composed of 299 places in 2 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 2 with 598 rules applied. Total rules applied 1714 place count 1865 transition count 1585
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 1750 place count 1829 transition count 1549
Iterating global reduction 2 with 36 rules applied. Total rules applied 1786 place count 1829 transition count 1549
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 1786 place count 1829 transition count 1520
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 1844 place count 1800 transition count 1520
Performed 631 Post agglomeration using F-continuation condition.Transition count delta: 631
Deduced a syphon composed of 631 places in 3 ms
Reduce places removed 631 places and 0 transitions.
Iterating global reduction 2 with 1262 rules applied. Total rules applied 3106 place count 1169 transition count 889
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3107 place count 1169 transition count 888
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3109 place count 1168 transition count 887
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3111 place count 1166 transition count 885
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3112 place count 1165 transition count 885
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3112 place count 1165 transition count 883
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3116 place count 1163 transition count 883
Applied a total of 3116 rules in 429 ms. Remains 1163 /2723 variables (removed 1560) and now considering 883/2443 (removed 1560) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 429 ms. Remains : 1163/2723 places, 883/2443 transitions.
[2024-06-01 16:24:21] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:24:21] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:24:21] [INFO ] Input system was already deterministic with 883 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 2684 transition count 2404
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 2684 transition count 2404
Applied a total of 78 rules in 347 ms. Remains 2684 /2723 variables (removed 39) and now considering 2404/2443 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 2684/2723 places, 2404/2443 transitions.
[2024-06-01 16:24:21] [INFO ] Flatten gal took : 48 ms
[2024-06-01 16:24:21] [INFO ] Flatten gal took : 50 ms
[2024-06-01 16:24:21] [INFO ] Input system was already deterministic with 2404 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 2683 transition count 2403
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 2683 transition count 2403
Applied a total of 80 rules in 353 ms. Remains 2683 /2723 variables (removed 40) and now considering 2403/2443 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 2683/2723 places, 2403/2443 transitions.
[2024-06-01 16:24:22] [INFO ] Flatten gal took : 47 ms
[2024-06-01 16:24:22] [INFO ] Flatten gal took : 50 ms
[2024-06-01 16:24:22] [INFO ] Input system was already deterministic with 2403 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 2722 transition count 1886
Reduce places removed 556 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 558 rules applied. Total rules applied 1114 place count 2166 transition count 1884
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1116 place count 2164 transition count 1884
Performed 299 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 299 Pre rules applied. Total rules applied 1116 place count 2164 transition count 1585
Deduced a syphon composed of 299 places in 3 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 3 with 598 rules applied. Total rules applied 1714 place count 1865 transition count 1585
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1751 place count 1828 transition count 1548
Iterating global reduction 3 with 37 rules applied. Total rules applied 1788 place count 1828 transition count 1548
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 1788 place count 1828 transition count 1517
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 1850 place count 1797 transition count 1517
Performed 633 Post agglomeration using F-continuation condition.Transition count delta: 633
Deduced a syphon composed of 633 places in 1 ms
Reduce places removed 633 places and 0 transitions.
Iterating global reduction 3 with 1266 rules applied. Total rules applied 3116 place count 1164 transition count 884
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3117 place count 1164 transition count 883
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3119 place count 1163 transition count 882
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3121 place count 1161 transition count 880
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3122 place count 1160 transition count 880
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3122 place count 1160 transition count 878
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3126 place count 1158 transition count 878
Applied a total of 3126 rules in 434 ms. Remains 1158 /2723 variables (removed 1565) and now considering 878/2443 (removed 1565) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 434 ms. Remains : 1158/2723 places, 878/2443 transitions.
[2024-06-01 16:24:22] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:24:22] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:24:22] [INFO ] Input system was already deterministic with 878 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 2683 transition count 2403
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 2683 transition count 2403
Applied a total of 80 rules in 327 ms. Remains 2683 /2723 variables (removed 40) and now considering 2403/2443 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 328 ms. Remains : 2683/2723 places, 2403/2443 transitions.
[2024-06-01 16:24:23] [INFO ] Flatten gal took : 44 ms
[2024-06-01 16:24:23] [INFO ] Flatten gal took : 46 ms
[2024-06-01 16:24:23] [INFO ] Input system was already deterministic with 2403 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 2683 transition count 2403
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 2683 transition count 2403
Applied a total of 80 rules in 362 ms. Remains 2683 /2723 variables (removed 40) and now considering 2403/2443 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 2683/2723 places, 2403/2443 transitions.
[2024-06-01 16:24:23] [INFO ] Flatten gal took : 43 ms
[2024-06-01 16:24:23] [INFO ] Flatten gal took : 46 ms
[2024-06-01 16:24:24] [INFO ] Input system was already deterministic with 2403 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 2690 transition count 2410
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 2690 transition count 2410
Applied a total of 66 rules in 406 ms. Remains 2690 /2723 variables (removed 33) and now considering 2410/2443 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 406 ms. Remains : 2690/2723 places, 2410/2443 transitions.
[2024-06-01 16:24:24] [INFO ] Flatten gal took : 43 ms
[2024-06-01 16:24:24] [INFO ] Flatten gal took : 46 ms
[2024-06-01 16:24:24] [INFO ] Input system was already deterministic with 2410 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 2722 transition count 1885
Reduce places removed 557 places and 0 transitions.
Iterating post reduction 1 with 557 rules applied. Total rules applied 1114 place count 2165 transition count 1885
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 300 Pre rules applied. Total rules applied 1114 place count 2165 transition count 1585
Deduced a syphon composed of 300 places in 2 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 2 with 600 rules applied. Total rules applied 1714 place count 1865 transition count 1585
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 1751 place count 1828 transition count 1548
Iterating global reduction 2 with 37 rules applied. Total rules applied 1788 place count 1828 transition count 1548
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 1788 place count 1828 transition count 1517
Deduced a syphon composed of 31 places in 4 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 1850 place count 1797 transition count 1517
Performed 632 Post agglomeration using F-continuation condition.Transition count delta: 632
Deduced a syphon composed of 632 places in 1 ms
Reduce places removed 632 places and 0 transitions.
Iterating global reduction 2 with 1264 rules applied. Total rules applied 3114 place count 1165 transition count 885
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3115 place count 1165 transition count 884
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3117 place count 1164 transition count 883
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3119 place count 1162 transition count 881
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3120 place count 1161 transition count 881
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3120 place count 1161 transition count 879
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3124 place count 1159 transition count 879
Applied a total of 3124 rules in 434 ms. Remains 1159 /2723 variables (removed 1564) and now considering 879/2443 (removed 1564) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 434 ms. Remains : 1159/2723 places, 879/2443 transitions.
[2024-06-01 16:24:25] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:24:25] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:24:25] [INFO ] Input system was already deterministic with 879 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 552 transitions
Trivial Post-agglo rules discarded 552 transitions
Performed 552 trivial Post agglomeration. Transition count delta: 552
Iterating post reduction 0 with 552 rules applied. Total rules applied 552 place count 2722 transition count 1890
Reduce places removed 552 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 553 rules applied. Total rules applied 1105 place count 2170 transition count 1889
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1106 place count 2169 transition count 1889
Performed 298 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 298 Pre rules applied. Total rules applied 1106 place count 2169 transition count 1591
Deduced a syphon composed of 298 places in 3 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 3 with 596 rules applied. Total rules applied 1702 place count 1871 transition count 1591
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1738 place count 1835 transition count 1555
Iterating global reduction 3 with 36 rules applied. Total rules applied 1774 place count 1835 transition count 1555
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 1774 place count 1835 transition count 1526
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1832 place count 1806 transition count 1526
Performed 629 Post agglomeration using F-continuation condition.Transition count delta: 629
Deduced a syphon composed of 629 places in 1 ms
Reduce places removed 629 places and 0 transitions.
Iterating global reduction 3 with 1258 rules applied. Total rules applied 3090 place count 1177 transition count 897
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3091 place count 1177 transition count 896
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3093 place count 1176 transition count 895
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 3094 place count 1176 transition count 895
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3096 place count 1174 transition count 893
Applied a total of 3096 rules in 430 ms. Remains 1174 /2723 variables (removed 1549) and now considering 893/2443 (removed 1550) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 430 ms. Remains : 1174/2723 places, 893/2443 transitions.
[2024-06-01 16:24:25] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:24:25] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:24:25] [INFO ] Input system was already deterministic with 893 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 2686 transition count 2406
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 2686 transition count 2406
Applied a total of 74 rules in 361 ms. Remains 2686 /2723 variables (removed 37) and now considering 2406/2443 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 361 ms. Remains : 2686/2723 places, 2406/2443 transitions.
[2024-06-01 16:24:26] [INFO ] Flatten gal took : 45 ms
[2024-06-01 16:24:26] [INFO ] Flatten gal took : 47 ms
[2024-06-01 16:24:26] [INFO ] Input system was already deterministic with 2406 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 2681 transition count 2401
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 2681 transition count 2401
Applied a total of 84 rules in 378 ms. Remains 2681 /2723 variables (removed 42) and now considering 2401/2443 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 378 ms. Remains : 2681/2723 places, 2401/2443 transitions.
[2024-06-01 16:24:26] [INFO ] Flatten gal took : 45 ms
[2024-06-01 16:24:26] [INFO ] Flatten gal took : 47 ms
[2024-06-01 16:24:26] [INFO ] Input system was already deterministic with 2401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 2686 transition count 2406
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 2686 transition count 2406
Applied a total of 74 rules in 361 ms. Remains 2686 /2723 variables (removed 37) and now considering 2406/2443 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 361 ms. Remains : 2686/2723 places, 2406/2443 transitions.
[2024-06-01 16:24:27] [INFO ] Flatten gal took : 62 ms
[2024-06-01 16:24:27] [INFO ] Flatten gal took : 43 ms
[2024-06-01 16:24:27] [INFO ] Input system was already deterministic with 2406 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2443/2443 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2682 transition count 2402
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2682 transition count 2402
Applied a total of 82 rules in 340 ms. Remains 2682 /2723 variables (removed 41) and now considering 2402/2443 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 2682/2723 places, 2402/2443 transitions.
[2024-06-01 16:24:27] [INFO ] Flatten gal took : 42 ms
[2024-06-01 16:24:27] [INFO ] Flatten gal took : 46 ms
[2024-06-01 16:24:28] [INFO ] Input system was already deterministic with 2402 transitions.
[2024-06-01 16:24:28] [INFO ] Flatten gal took : 44 ms
[2024-06-01 16:24:28] [INFO ] Flatten gal took : 45 ms
[2024-06-01 16:24:28] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 16:24:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2723 places, 2443 transitions and 6326 arcs took 12 ms.
Total runtime 179924 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldPPPt-PT-040B-CTLFireability-2024-00
Could not compute solution for formula : ShieldPPPt-PT-040B-CTLFireability-2024-01
Could not compute solution for formula : ShieldPPPt-PT-040B-CTLFireability-2024-02
Could not compute solution for formula : ShieldPPPt-PT-040B-CTLFireability-2024-03
Could not compute solution for formula : ShieldPPPt-PT-040B-CTLFireability-2024-04
Could not compute solution for formula : ShieldPPPt-PT-040B-CTLFireability-2024-05
Could not compute solution for formula : ShieldPPPt-PT-040B-CTLFireability-2024-06
Could not compute solution for formula : ShieldPPPt-PT-040B-CTLFireability-2024-07
Could not compute solution for formula : ShieldPPPt-PT-040B-CTLFireability-2024-08
Could not compute solution for formula : ShieldPPPt-PT-040B-CTLFireability-2024-09
Could not compute solution for formula : ShieldPPPt-PT-040B-CTLFireability-2024-10
Could not compute solution for formula : ShieldPPPt-PT-040B-CTLFireability-2024-11
Could not compute solution for formula : ShieldPPPt-PT-040B-CTLFireability-2023-12
Could not compute solution for formula : ShieldPPPt-PT-040B-CTLFireability-2023-13
Could not compute solution for formula : ShieldPPPt-PT-040B-CTLFireability-2023-14
Could not compute solution for formula : ShieldPPPt-PT-040B-CTLFireability-2023-15

BK_STOP 1717259068618

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldPPPt-PT-040B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/646/ctl_0_
ctl formula name ShieldPPPt-PT-040B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/646/ctl_1_
ctl formula name ShieldPPPt-PT-040B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/646/ctl_2_
ctl formula name ShieldPPPt-PT-040B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/646/ctl_3_
ctl formula name ShieldPPPt-PT-040B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/646/ctl_4_
ctl formula name ShieldPPPt-PT-040B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/646/ctl_5_
ctl formula name ShieldPPPt-PT-040B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/646/ctl_6_
ctl formula name ShieldPPPt-PT-040B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/646/ctl_7_
ctl formula name ShieldPPPt-PT-040B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/646/ctl_8_
ctl formula name ShieldPPPt-PT-040B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/646/ctl_9_
ctl formula name ShieldPPPt-PT-040B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/646/ctl_10_
ctl formula name ShieldPPPt-PT-040B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/646/ctl_11_
ctl formula name ShieldPPPt-PT-040B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/646/ctl_12_
ctl formula name ShieldPPPt-PT-040B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/646/ctl_13_
ctl formula name ShieldPPPt-PT-040B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/646/ctl_14_
ctl formula name ShieldPPPt-PT-040B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/646/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ShieldPPPt-PT-040B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-040B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683761600666"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-PT-040B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;