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.r484-smll-171624275700300.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 DLCshifumi-PT-2b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624275700300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 06:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 13 06:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 05:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 05:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 729K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717239870329

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCshifumi-PT-2b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:04:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:04:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:04:33] [INFO ] Load time of PNML (sax parser for PT used): 503 ms
[2024-06-01 11:04:33] [INFO ] Transformed 2483 places.
[2024-06-01 11:04:33] [INFO ] Transformed 3183 transitions.
[2024-06-01 11:04:33] [INFO ] Found NUPN structural information;
[2024-06-01 11:04:33] [INFO ] Parsed PT model containing 2483 places and 3183 transitions and 7756 arcs in 803 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DLCshifumi-PT-2b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 2483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2483/2483 places, 3183/3183 transitions.
Discarding 388 places :
Symmetric choice reduction at 0 with 388 rule applications. Total rules 388 place count 2095 transition count 2795
Iterating global reduction 0 with 388 rules applied. Total rules applied 776 place count 2095 transition count 2795
Discarding 303 places :
Symmetric choice reduction at 0 with 303 rule applications. Total rules 1079 place count 1792 transition count 2492
Iterating global reduction 0 with 303 rules applied. Total rules applied 1382 place count 1792 transition count 2492
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 1384 place count 1792 transition count 2490
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 1490 place count 1686 transition count 2354
Iterating global reduction 1 with 106 rules applied. Total rules applied 1596 place count 1686 transition count 2354
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 1695 place count 1587 transition count 2255
Iterating global reduction 1 with 99 rules applied. Total rules applied 1794 place count 1587 transition count 2255
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 1808 place count 1587 transition count 2241
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1850 place count 1545 transition count 2199
Iterating global reduction 2 with 42 rules applied. Total rules applied 1892 place count 1545 transition count 2199
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1934 place count 1503 transition count 2157
Iterating global reduction 2 with 42 rules applied. Total rules applied 1976 place count 1503 transition count 2157
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 2015 place count 1464 transition count 2118
Iterating global reduction 2 with 39 rules applied. Total rules applied 2054 place count 1464 transition count 2118
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 2091 place count 1427 transition count 2081
Iterating global reduction 2 with 37 rules applied. Total rules applied 2128 place count 1427 transition count 2081
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 2151 place count 1404 transition count 2058
Iterating global reduction 2 with 23 rules applied. Total rules applied 2174 place count 1404 transition count 2058
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 2197 place count 1381 transition count 2035
Iterating global reduction 2 with 23 rules applied. Total rules applied 2220 place count 1381 transition count 2035
Applied a total of 2220 rules in 2060 ms. Remains 1381 /2483 variables (removed 1102) and now considering 2035/3183 (removed 1148) transitions.
// Phase 1: matrix 2035 rows 1381 cols
[2024-06-01 11:04:37] [INFO ] Computed 79 invariants in 48 ms
[2024-06-01 11:04:38] [INFO ] Implicit Places using invariants in 1551 ms returned []
[2024-06-01 11:04:38] [INFO ] Invariant cache hit.
[2024-06-01 11:04:41] [INFO ] Implicit Places using invariants and state equation in 2349 ms returned []
Implicit Place search using SMT with State Equation took 4797 ms to find 0 implicit places.
Running 2034 sub problems to find dead transitions.
[2024-06-01 11:04:41] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1380/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 2034 unsolved in 30147 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1381 constraints, PredecessorRefiner: 2034/2034 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2034 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1380/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 2034 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1381 constraints, PredecessorRefiner: 0/2034 constraints, Known Traps: 0/0 constraints]
After SMT, in 61563ms problems are : Problem set: 0 solved, 2034 unsolved
Search for dead transitions found 0 dead transitions in 61650ms
Starting structural reductions in LTL mode, iteration 1 : 1381/2483 places, 2035/3183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68578 ms. Remains : 1381/2483 places, 2035/3183 transitions.
Support contains 43 out of 1381 places after structural reductions.
[2024-06-01 11:05:43] [INFO ] Flatten gal took : 323 ms
[2024-06-01 11:05:43] [INFO ] Flatten gal took : 157 ms
[2024-06-01 11:05:44] [INFO ] Input system was already deterministic with 2035 transitions.
Support contains 42 out of 1381 places (down from 43) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 40000 steps (9 resets) in 3046 ms. (13 steps per ms) remains 3/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
[2024-06-01 11:05:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 324/332 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1049/1381 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1381 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2035/3416 variables, 1381/1460 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 0/1460 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/3416 variables, 0/1460 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3416/3416 variables, and 1460 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1753 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1381/1381 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 324/332 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1049/1381 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 11:05:47] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1381 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1381 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2035/3416 variables, 1381/1461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3416 variables, 3/1464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3416 variables, 0/1464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/3416 variables, 0/1464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3416/3416 variables, and 1464 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2637 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1381/1381 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 4420ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 36156 steps, including 79 resets, run visited all 3 properties in 337 ms. (steps per millisecond=107 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 363 ms.
Computed a total of 157 stabilizing places and 157 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((G(p0)&&X(X(F(p1)))))||G(p2))))'
Support contains 5 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1363 transition count 2002
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1363 transition count 2002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1363 transition count 2001
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 1352 transition count 1990
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 1352 transition count 1990
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 68 place count 1343 transition count 1981
Iterating global reduction 1 with 9 rules applied. Total rules applied 77 place count 1343 transition count 1981
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 85 place count 1335 transition count 1973
Iterating global reduction 1 with 8 rules applied. Total rules applied 93 place count 1335 transition count 1973
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 98 place count 1330 transition count 1968
Iterating global reduction 1 with 5 rules applied. Total rules applied 103 place count 1330 transition count 1968
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 108 place count 1325 transition count 1963
Iterating global reduction 1 with 5 rules applied. Total rules applied 113 place count 1325 transition count 1963
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 117 place count 1321 transition count 1959
Iterating global reduction 1 with 4 rules applied. Total rules applied 121 place count 1321 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 124 place count 1318 transition count 1956
Iterating global reduction 1 with 3 rules applied. Total rules applied 127 place count 1318 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 129 place count 1316 transition count 1954
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 1316 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 1314 transition count 1952
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 1314 transition count 1952
Applied a total of 135 rules in 673 ms. Remains 1314 /1381 variables (removed 67) and now considering 1952/2035 (removed 83) transitions.
// Phase 1: matrix 1952 rows 1314 cols
[2024-06-01 11:05:51] [INFO ] Computed 79 invariants in 11 ms
[2024-06-01 11:05:52] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-06-01 11:05:52] [INFO ] Invariant cache hit.
[2024-06-01 11:05:54] [INFO ] Implicit Places using invariants and state equation in 1961 ms returned []
Implicit Place search using SMT with State Equation took 2720 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2024-06-01 11:05:54] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1313/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1314 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1313/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1314 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints]
After SMT, in 61171ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 61205ms
Starting structural reductions in LTL mode, iteration 1 : 1314/1381 places, 1952/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64611 ms. Remains : 1314/1381 places, 1952/2035 transitions.
Stuttering acceptance computed with spot in 593 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-00
Product exploration explored 100000 steps with 30 reset in 947 ms.
Product exploration explored 100000 steps with 57 reset in 667 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 236 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1446 ms. (27 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
[2024-06-01 11:06:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 232/237 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1077/1314 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1314 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1952/3266 variables, 1314/1393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3266 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/3266 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3266/3266 variables, and 1393 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1742 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1314/1314 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 232/237 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1077/1314 variables, 75/79 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1314 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1952/3266 variables, 1314/1393 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3266 variables, 3/1396 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 11:07:03] [INFO ] Deduced a trap composed of 55 places in 881 ms of which 17 ms to minimize.
[2024-06-01 11:07:03] [INFO ] Deduced a trap composed of 48 places in 524 ms of which 8 ms to minimize.
[2024-06-01 11:07:04] [INFO ] Deduced a trap composed of 43 places in 443 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3266 variables, 3/1399 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3266 variables, 0/1399 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/3266 variables, 0/1399 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3266/3266 variables, and 1399 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4471 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1314/1314 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 6246ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 370 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=52 )
Parikh walk visited 3 properties in 1257 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT (AND p0 p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 1168 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p2))]
Support contains 2 out of 1314 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1314/1314 places, 1952/1952 transitions.
Graph (trivial) has 1241 edges and 1314 vertex of which 304 / 1314 are part of one of the 22 SCC in 10 ms
Free SCC test removed 282 places
Ensure Unique test removed 315 transitions
Reduce isomorphic transitions removed 315 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 284 transitions
Trivial Post-agglo rules discarded 284 transitions
Performed 284 trivial Post agglomeration. Transition count delta: 284
Iterating post reduction 0 with 284 rules applied. Total rules applied 285 place count 1031 transition count 1352
Reduce places removed 284 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 335 rules applied. Total rules applied 620 place count 747 transition count 1301
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 654 place count 713 transition count 1301
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 654 place count 713 transition count 1191
Deduced a syphon composed of 110 places in 4 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 874 place count 603 transition count 1191
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 914 place count 563 transition count 1017
Iterating global reduction 3 with 40 rules applied. Total rules applied 954 place count 563 transition count 1017
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 968 place count 563 transition count 1003
Performed 194 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 194 places in 1 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 4 with 388 rules applied. Total rules applied 1356 place count 369 transition count 807
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1359 place count 369 transition count 804
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1376 place count 352 transition count 728
Iterating global reduction 5 with 17 rules applied. Total rules applied 1393 place count 352 transition count 728
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1410 place count 352 transition count 711
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 6 with 2 rules applied. Total rules applied 1412 place count 351 transition count 710
Performed 50 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 1512 place count 301 transition count 781
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1513 place count 301 transition count 780
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1529 place count 285 transition count 708
Iterating global reduction 7 with 16 rules applied. Total rules applied 1545 place count 285 transition count 708
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 1576 place count 285 transition count 677
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 1590 place count 285 transition count 663
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1594 place count 281 transition count 655
Iterating global reduction 8 with 4 rules applied. Total rules applied 1598 place count 281 transition count 655
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1602 place count 277 transition count 589
Iterating global reduction 8 with 4 rules applied. Total rules applied 1606 place count 277 transition count 589
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1610 place count 277 transition count 585
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1611 place count 277 transition count 585
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1612 place count 276 transition count 584
Applied a total of 1612 rules in 601 ms. Remains 276 /1314 variables (removed 1038) and now considering 584/1952 (removed 1368) transitions.
[2024-06-01 11:07:08] [INFO ] Flow matrix only has 561 transitions (discarded 23 similar events)
// Phase 1: matrix 561 rows 276 cols
[2024-06-01 11:07:08] [INFO ] Computed 79 invariants in 3 ms
[2024-06-01 11:07:08] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-06-01 11:07:08] [INFO ] Flow matrix only has 561 transitions (discarded 23 similar events)
[2024-06-01 11:07:08] [INFO ] Invariant cache hit.
[2024-06-01 11:07:09] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 11:07:09] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
[2024-06-01 11:07:09] [INFO ] Redundant transitions in 53 ms returned []
Running 497 sub problems to find dead transitions.
[2024-06-01 11:07:09] [INFO ] Flow matrix only has 561 transitions (discarded 23 similar events)
[2024-06-01 11:07:09] [INFO ] Invariant cache hit.
[2024-06-01 11:07:09] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 4 (OVERLAPS) 560/836 variables, 276/355 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/836 variables, 43/398 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 497 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 836/837 variables, and 398 constraints, problems are : Problem set: 0 solved, 497 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 276/276 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 497/497 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 497 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 4 (OVERLAPS) 560/836 variables, 276/355 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/836 variables, 43/398 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 497/895 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/836 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 497 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/837 variables, and 895 constraints, problems are : Problem set: 0 solved, 497 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 276/276 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 497/497 constraints, Known Traps: 0/0 constraints]
After SMT, in 60670ms problems are : Problem set: 0 solved, 497 unsolved
Search for dead transitions found 0 dead transitions in 60680ms
Starting structural reductions in SI_LTL mode, iteration 1 : 276/1314 places, 584/1952 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62381 ms. Remains : 276/1314 places, 584/1952 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 7 factoid took 598 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p2) (NOT p0))]
RANDOM walk for 19340 steps (7 resets) in 507 ms. (38 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (F (NOT (OR p2 p0))), (F (NOT (AND p2 p0))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 7 factoid took 851 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p2) (NOT p0))]
Stuttering criterion allowed to conclude after 1193 steps with 0 reset in 20 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-00 finished in 141491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&(X(p2)||F(p3))))))'
Support contains 5 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1363 transition count 2002
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1363 transition count 2002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1363 transition count 2001
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 1352 transition count 1990
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 1352 transition count 1990
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 67 place count 1344 transition count 1982
Iterating global reduction 1 with 8 rules applied. Total rules applied 75 place count 1344 transition count 1982
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 1337 transition count 1975
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 1337 transition count 1975
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 1334 transition count 1972
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 1334 transition count 1972
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 1331 transition count 1969
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 1331 transition count 1969
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 1328 transition count 1966
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 1328 transition count 1966
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 1326 transition count 1964
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 1326 transition count 1964
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 1325 transition count 1963
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 1325 transition count 1963
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 1324 transition count 1962
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 1324 transition count 1962
Applied a total of 115 rules in 711 ms. Remains 1324 /1381 variables (removed 57) and now considering 1962/2035 (removed 73) transitions.
// Phase 1: matrix 1962 rows 1324 cols
[2024-06-01 11:08:12] [INFO ] Computed 79 invariants in 9 ms
[2024-06-01 11:08:13] [INFO ] Implicit Places using invariants in 695 ms returned []
[2024-06-01 11:08:13] [INFO ] Invariant cache hit.
[2024-06-01 11:08:15] [INFO ] Implicit Places using invariants and state equation in 1597 ms returned []
Implicit Place search using SMT with State Equation took 2297 ms to find 0 implicit places.
Running 1961 sub problems to find dead transitions.
[2024-06-01 11:08:15] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/3286 variables, and 0 constraints, problems are : Problem set: 0 solved, 1961 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1324 constraints, PredecessorRefiner: 1961/1961 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1961 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1323/3286 variables, and 0 constraints, problems are : Problem set: 0 solved, 1961 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1324 constraints, PredecessorRefiner: 0/1961 constraints, Known Traps: 0/0 constraints]
After SMT, in 61019ms problems are : Problem set: 0 solved, 1961 unsolved
Search for dead transitions found 0 dead transitions in 61047ms
Starting structural reductions in LTL mode, iteration 1 : 1324/1381 places, 1962/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64061 ms. Remains : 1324/1381 places, 1962/2035 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-01
Stuttering criterion allowed to conclude after 12446 steps with 3 reset in 98 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-01 finished in 64418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1 U p2)))))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Graph (trivial) has 1312 edges and 1381 vertex of which 330 / 1381 are part of one of the 23 SCC in 4 ms
Free SCC test removed 307 places
Ensure Unique test removed 342 transitions
Reduce isomorphic transitions removed 342 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 315 place count 1073 transition count 1378
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 365 rules applied. Total rules applied 680 place count 759 transition count 1327
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 35 rules applied. Total rules applied 715 place count 725 transition count 1326
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 718 place count 724 transition count 1324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 719 place count 723 transition count 1324
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 111 Pre rules applied. Total rules applied 719 place count 723 transition count 1213
Deduced a syphon composed of 111 places in 4 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 5 with 222 rules applied. Total rules applied 941 place count 612 transition count 1213
Discarding 52 places :
Symmetric choice reduction at 5 with 52 rule applications. Total rules 993 place count 560 transition count 1013
Iterating global reduction 5 with 52 rules applied. Total rules applied 1045 place count 560 transition count 1013
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1058 place count 560 transition count 1000
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 1058 place count 560 transition count 996
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1066 place count 556 transition count 996
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1068 place count 554 transition count 992
Iterating global reduction 6 with 2 rules applied. Total rules applied 1070 place count 554 transition count 992
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1072 place count 554 transition count 990
Performed 190 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 190 places in 0 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 7 with 380 rules applied. Total rules applied 1452 place count 364 transition count 797
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1454 place count 364 transition count 795
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 1473 place count 345 transition count 701
Iterating global reduction 8 with 19 rules applied. Total rules applied 1492 place count 345 transition count 701
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 1511 place count 345 transition count 682
Performed 49 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 9 with 98 rules applied. Total rules applied 1609 place count 296 transition count 749
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 1624 place count 281 transition count 683
Iterating global reduction 9 with 15 rules applied. Total rules applied 1639 place count 281 transition count 683
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 9 with 31 rules applied. Total rules applied 1670 place count 281 transition count 652
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 10 with 15 rules applied. Total rules applied 1685 place count 281 transition count 637
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1689 place count 277 transition count 629
Iterating global reduction 10 with 4 rules applied. Total rules applied 1693 place count 277 transition count 629
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1697 place count 273 transition count 563
Iterating global reduction 10 with 4 rules applied. Total rules applied 1701 place count 273 transition count 563
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1705 place count 273 transition count 559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1706 place count 272 transition count 558
Applied a total of 1706 rules in 320 ms. Remains 272 /1381 variables (removed 1109) and now considering 558/2035 (removed 1477) transitions.
[2024-06-01 11:09:16] [INFO ] Flow matrix only has 535 transitions (discarded 23 similar events)
// Phase 1: matrix 535 rows 272 cols
[2024-06-01 11:09:16] [INFO ] Computed 79 invariants in 4 ms
[2024-06-01 11:09:17] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-06-01 11:09:17] [INFO ] Flow matrix only has 535 transitions (discarded 23 similar events)
[2024-06-01 11:09:17] [INFO ] Invariant cache hit.
[2024-06-01 11:09:17] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 11:09:17] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
[2024-06-01 11:09:17] [INFO ] Redundant transitions in 10 ms returned []
Running 477 sub problems to find dead transitions.
[2024-06-01 11:09:17] [INFO ] Flow matrix only has 535 transitions (discarded 23 similar events)
[2024-06-01 11:09:17] [INFO ] Invariant cache hit.
[2024-06-01 11:09:17] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 2/272 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 534/806 variables, 272/351 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 44/395 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/807 variables, and 395 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 272/272 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 2/272 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 534/806 variables, 272/351 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 44/395 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 477/872 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/807 variables, and 872 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 272/272 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
After SMT, in 60392ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 60401ms
Starting structural reductions in SI_LTL mode, iteration 1 : 272/1381 places, 558/2035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61790 ms. Remains : 272/1381 places, 558/2035 transitions.
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-03
Stuttering criterion allowed to conclude after 266 steps with 0 reset in 4 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-03 finished in 62173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1363 transition count 2002
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1363 transition count 2002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1363 transition count 2001
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 1352 transition count 1990
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 1352 transition count 1990
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 67 place count 1344 transition count 1982
Iterating global reduction 1 with 8 rules applied. Total rules applied 75 place count 1344 transition count 1982
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 83 place count 1336 transition count 1974
Iterating global reduction 1 with 8 rules applied. Total rules applied 91 place count 1336 transition count 1974
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 96 place count 1331 transition count 1969
Iterating global reduction 1 with 5 rules applied. Total rules applied 101 place count 1331 transition count 1969
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 106 place count 1326 transition count 1964
Iterating global reduction 1 with 5 rules applied. Total rules applied 111 place count 1326 transition count 1964
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 115 place count 1322 transition count 1960
Iterating global reduction 1 with 4 rules applied. Total rules applied 119 place count 1322 transition count 1960
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 1319 transition count 1957
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 1319 transition count 1957
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 1317 transition count 1955
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 1317 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 1315 transition count 1953
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 1315 transition count 1953
Applied a total of 133 rules in 670 ms. Remains 1315 /1381 variables (removed 66) and now considering 1953/2035 (removed 82) transitions.
// Phase 1: matrix 1953 rows 1315 cols
[2024-06-01 11:10:19] [INFO ] Computed 79 invariants in 13 ms
[2024-06-01 11:10:20] [INFO ] Implicit Places using invariants in 835 ms returned []
[2024-06-01 11:10:20] [INFO ] Invariant cache hit.
[2024-06-01 11:10:21] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 2514 ms to find 0 implicit places.
Running 1952 sub problems to find dead transitions.
[2024-06-01 11:10:21] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1314/3268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1952 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1315 constraints, PredecessorRefiner: 1952/1952 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1314/3268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1952 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1315 constraints, PredecessorRefiner: 0/1952 constraints, Known Traps: 0/0 constraints]
After SMT, in 61058ms problems are : Problem set: 0 solved, 1952 unsolved
Search for dead transitions found 0 dead transitions in 61077ms
Starting structural reductions in LTL mode, iteration 1 : 1315/1381 places, 1953/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64266 ms. Remains : 1315/1381 places, 1953/2035 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-04 finished in 64512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1363 transition count 2002
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1363 transition count 2002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1363 transition count 2001
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 1352 transition count 1990
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 1352 transition count 1990
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 67 place count 1344 transition count 1982
Iterating global reduction 1 with 8 rules applied. Total rules applied 75 place count 1344 transition count 1982
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 83 place count 1336 transition count 1974
Iterating global reduction 1 with 8 rules applied. Total rules applied 91 place count 1336 transition count 1974
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 96 place count 1331 transition count 1969
Iterating global reduction 1 with 5 rules applied. Total rules applied 101 place count 1331 transition count 1969
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 106 place count 1326 transition count 1964
Iterating global reduction 1 with 5 rules applied. Total rules applied 111 place count 1326 transition count 1964
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 115 place count 1322 transition count 1960
Iterating global reduction 1 with 4 rules applied. Total rules applied 119 place count 1322 transition count 1960
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 1319 transition count 1957
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 1319 transition count 1957
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 1317 transition count 1955
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 1317 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 1315 transition count 1953
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 1315 transition count 1953
Applied a total of 133 rules in 692 ms. Remains 1315 /1381 variables (removed 66) and now considering 1953/2035 (removed 82) transitions.
// Phase 1: matrix 1953 rows 1315 cols
[2024-06-01 11:11:23] [INFO ] Computed 79 invariants in 11 ms
[2024-06-01 11:11:24] [INFO ] Implicit Places using invariants in 903 ms returned []
[2024-06-01 11:11:24] [INFO ] Invariant cache hit.
[2024-06-01 11:11:26] [INFO ] Implicit Places using invariants and state equation in 2121 ms returned []
Implicit Place search using SMT with State Equation took 3034 ms to find 0 implicit places.
Running 1952 sub problems to find dead transitions.
[2024-06-01 11:11:27] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1314/3268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1952 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1315 constraints, PredecessorRefiner: 1952/1952 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1952 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 1314/3268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1952 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1315 constraints, PredecessorRefiner: 0/1952 constraints, Known Traps: 0/0 constraints]
After SMT, in 61168ms problems are : Problem set: 0 solved, 1952 unsolved
Search for dead transitions found 0 dead transitions in 61197ms
Starting structural reductions in LTL mode, iteration 1 : 1315/1381 places, 1953/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64931 ms. Remains : 1315/1381 places, 1953/2035 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-05
Product exploration explored 100000 steps with 12 reset in 683 ms.
Product exploration explored 100000 steps with 8 reset in 796 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 135 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 6585 steps (0 resets) in 72 ms. (90 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 312 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1315/1315 places, 1953/1953 transitions.
Applied a total of 0 rules in 61 ms. Remains 1315 /1315 variables (removed 0) and now considering 1953/1953 (removed 0) transitions.
[2024-06-01 11:12:31] [INFO ] Invariant cache hit.
[2024-06-01 11:12:31] [INFO ] Implicit Places using invariants in 872 ms returned []
[2024-06-01 11:12:32] [INFO ] Invariant cache hit.
[2024-06-01 11:12:33] [INFO ] Implicit Places using invariants and state equation in 1789 ms returned []
Implicit Place search using SMT with State Equation took 2676 ms to find 0 implicit places.
Running 1952 sub problems to find dead transitions.
[2024-06-01 11:12:33] [INFO ] Invariant cache hit.
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 Real declared 1314/3268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1952 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1315 constraints, PredecessorRefiner: 1952/1952 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1952 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1314/3268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1952 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1315 constraints, PredecessorRefiner: 0/1952 constraints, Known Traps: 0/0 constraints]
After SMT, in 60990ms problems are : Problem set: 0 solved, 1952 unsolved
Search for dead transitions found 0 dead transitions in 61014ms
Finished structural reductions in LTL mode , in 1 iterations and 63756 ms. Remains : 1315/1315 places, 1953/1953 transitions.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 144 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 6920 steps (0 resets) in 68 ms. (100 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 312 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10 reset in 586 ms.
Product exploration explored 100000 steps with 9 reset in 601 ms.
Support contains 2 out of 1315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1315/1315 places, 1953/1953 transitions.
Applied a total of 0 rules in 58 ms. Remains 1315 /1315 variables (removed 0) and now considering 1953/1953 (removed 0) transitions.
[2024-06-01 11:13:37] [INFO ] Invariant cache hit.
[2024-06-01 11:13:38] [INFO ] Implicit Places using invariants in 843 ms returned []
[2024-06-01 11:13:38] [INFO ] Invariant cache hit.
[2024-06-01 11:13:40] [INFO ] Implicit Places using invariants and state equation in 1989 ms returned []
Implicit Place search using SMT with State Equation took 2837 ms to find 0 implicit places.
Running 1952 sub problems to find dead transitions.
[2024-06-01 11:13:40] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1314/3268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1952 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1315 constraints, PredecessorRefiner: 1952/1952 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1314/3268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1952 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1315 constraints, PredecessorRefiner: 0/1952 constraints, Known Traps: 0/0 constraints]
After SMT, in 61122ms problems are : Problem set: 0 solved, 1952 unsolved
Search for dead transitions found 0 dead transitions in 61141ms
Finished structural reductions in LTL mode , in 1 iterations and 64042 ms. Remains : 1315/1315 places, 1953/1953 transitions.
Treatment of property DLCshifumi-PT-2b-LTLFireability-05 finished in 198942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1363 transition count 2002
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1363 transition count 2002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1363 transition count 2001
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 1351 transition count 1989
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 1351 transition count 1989
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 1342 transition count 1980
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 1342 transition count 1980
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 1333 transition count 1971
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 1333 transition count 1971
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 102 place count 1328 transition count 1966
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 1328 transition count 1966
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 112 place count 1323 transition count 1961
Iterating global reduction 1 with 5 rules applied. Total rules applied 117 place count 1323 transition count 1961
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 1319 transition count 1957
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 1319 transition count 1957
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 128 place count 1316 transition count 1954
Iterating global reduction 1 with 3 rules applied. Total rules applied 131 place count 1316 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 1314 transition count 1952
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 1314 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 1312 transition count 1950
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 1312 transition count 1950
Applied a total of 139 rules in 676 ms. Remains 1312 /1381 variables (removed 69) and now considering 1950/2035 (removed 85) transitions.
// Phase 1: matrix 1950 rows 1312 cols
[2024-06-01 11:14:42] [INFO ] Computed 79 invariants in 6 ms
[2024-06-01 11:14:43] [INFO ] Implicit Places using invariants in 731 ms returned []
[2024-06-01 11:14:43] [INFO ] Invariant cache hit.
[2024-06-01 11:14:45] [INFO ] Implicit Places using invariants and state equation in 2118 ms returned []
Implicit Place search using SMT with State Equation took 2851 ms to find 0 implicit places.
Running 1949 sub problems to find dead transitions.
[2024-06-01 11:14:45] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1311/3262 variables, and 0 constraints, problems are : Problem set: 0 solved, 1949 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1312 constraints, PredecessorRefiner: 1949/1949 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1949 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 1311/3262 variables, and 0 constraints, problems are : Problem set: 0 solved, 1949 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1312 constraints, PredecessorRefiner: 0/1949 constraints, Known Traps: 0/0 constraints]
After SMT, in 61058ms problems are : Problem set: 0 solved, 1949 unsolved
Search for dead transitions found 0 dead transitions in 61091ms
Starting structural reductions in LTL mode, iteration 1 : 1312/1381 places, 1950/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64625 ms. Remains : 1312/1381 places, 1950/2035 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-06 finished in 64856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(!p0) U p1))))'
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Graph (trivial) has 1311 edges and 1381 vertex of which 330 / 1381 are part of one of the 23 SCC in 2 ms
Free SCC test removed 307 places
Ensure Unique test removed 342 transitions
Reduce isomorphic transitions removed 342 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 315 place count 1073 transition count 1378
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 365 rules applied. Total rules applied 680 place count 759 transition count 1327
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 714 place count 725 transition count 1327
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 714 place count 725 transition count 1214
Deduced a syphon composed of 113 places in 4 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 940 place count 612 transition count 1214
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 992 place count 560 transition count 1014
Iterating global reduction 3 with 52 rules applied. Total rules applied 1044 place count 560 transition count 1014
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1057 place count 560 transition count 1001
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1057 place count 560 transition count 997
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1065 place count 556 transition count 997
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1067 place count 554 transition count 993
Iterating global reduction 4 with 2 rules applied. Total rules applied 1069 place count 554 transition count 993
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1071 place count 554 transition count 991
Performed 189 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 189 places in 0 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 5 with 378 rules applied. Total rules applied 1449 place count 365 transition count 800
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1452 place count 365 transition count 797
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1471 place count 346 transition count 703
Iterating global reduction 6 with 19 rules applied. Total rules applied 1490 place count 346 transition count 703
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 1509 place count 346 transition count 684
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1511 place count 345 transition count 683
Performed 48 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 1607 place count 297 transition count 750
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1621 place count 283 transition count 688
Iterating global reduction 7 with 14 rules applied. Total rules applied 1635 place count 283 transition count 688
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1664 place count 283 transition count 659
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 1681 place count 283 transition count 642
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1685 place count 279 transition count 634
Iterating global reduction 8 with 4 rules applied. Total rules applied 1689 place count 279 transition count 634
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1693 place count 275 transition count 568
Iterating global reduction 8 with 4 rules applied. Total rules applied 1697 place count 275 transition count 568
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1701 place count 275 transition count 564
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1702 place count 274 transition count 563
Applied a total of 1702 rules in 264 ms. Remains 274 /1381 variables (removed 1107) and now considering 563/2035 (removed 1472) transitions.
[2024-06-01 11:15:47] [INFO ] Flow matrix only has 540 transitions (discarded 23 similar events)
// Phase 1: matrix 540 rows 274 cols
[2024-06-01 11:15:47] [INFO ] Computed 79 invariants in 8 ms
[2024-06-01 11:15:47] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-06-01 11:15:47] [INFO ] Flow matrix only has 540 transitions (discarded 23 similar events)
[2024-06-01 11:15:47] [INFO ] Invariant cache hit.
[2024-06-01 11:15:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 11:15:48] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
[2024-06-01 11:15:48] [INFO ] Redundant transitions in 9 ms returned []
Running 479 sub problems to find dead transitions.
[2024-06-01 11:15:48] [INFO ] Flow matrix only has 540 transitions (discarded 23 similar events)
[2024-06-01 11:15:48] [INFO ] Invariant cache hit.
[2024-06-01 11:15:48] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (OVERLAPS) 539/813 variables, 274/353 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 42/395 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.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 0.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.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 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 813/814 variables, and 395 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 274/274 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (OVERLAPS) 539/813 variables, 274/353 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 42/395 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 479/874 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/813 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 813/814 variables, and 874 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 274/274 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 0/0 constraints]
After SMT, in 60325ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/1381 places, 563/2035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61804 ms. Remains : 274/1381 places, 563/2035 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-07 finished in 61996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(G((p0||G(p1))))))&&F(p1)))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1364 transition count 2003
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1364 transition count 2003
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1364 transition count 2002
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 1354 transition count 1992
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 1354 transition count 1992
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 1346 transition count 1984
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 1346 transition count 1984
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 79 place count 1338 transition count 1976
Iterating global reduction 1 with 8 rules applied. Total rules applied 87 place count 1338 transition count 1976
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 92 place count 1333 transition count 1971
Iterating global reduction 1 with 5 rules applied. Total rules applied 97 place count 1333 transition count 1971
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 102 place count 1328 transition count 1966
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 1328 transition count 1966
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 111 place count 1324 transition count 1962
Iterating global reduction 1 with 4 rules applied. Total rules applied 115 place count 1324 transition count 1962
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 118 place count 1321 transition count 1959
Iterating global reduction 1 with 3 rules applied. Total rules applied 121 place count 1321 transition count 1959
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 1319 transition count 1957
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 1319 transition count 1957
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 1317 transition count 1955
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 1317 transition count 1955
Applied a total of 129 rules in 601 ms. Remains 1317 /1381 variables (removed 64) and now considering 1955/2035 (removed 80) transitions.
// Phase 1: matrix 1955 rows 1317 cols
[2024-06-01 11:16:49] [INFO ] Computed 79 invariants in 10 ms
[2024-06-01 11:16:50] [INFO ] Implicit Places using invariants in 810 ms returned []
[2024-06-01 11:16:50] [INFO ] Invariant cache hit.
[2024-06-01 11:16:52] [INFO ] Implicit Places using invariants and state equation in 1794 ms returned []
Implicit Place search using SMT with State Equation took 2610 ms to find 0 implicit places.
Running 1954 sub problems to find dead transitions.
[2024-06-01 11:16:52] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1316/3272 variables, and 0 constraints, problems are : Problem set: 0 solved, 1954 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1317 constraints, PredecessorRefiner: 1954/1954 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1954 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1316/3272 variables, and 0 constraints, problems are : Problem set: 0 solved, 1954 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1317 constraints, PredecessorRefiner: 0/1954 constraints, Known Traps: 0/0 constraints]
After SMT, in 61080ms problems are : Problem set: 0 solved, 1954 unsolved
Search for dead transitions found 0 dead transitions in 61113ms
Starting structural reductions in LTL mode, iteration 1 : 1317/1381 places, 1955/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64333 ms. Remains : 1317/1381 places, 1955/2035 transitions.
Stuttering acceptance computed with spot in 341 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-08
Stuttering criterion allowed to conclude after 9773 steps with 0 reset in 53 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-08 finished in 64761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1364 transition count 2003
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1364 transition count 2003
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1364 transition count 2002
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 46 place count 1353 transition count 1991
Iterating global reduction 1 with 11 rules applied. Total rules applied 57 place count 1353 transition count 1991
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 65 place count 1345 transition count 1983
Iterating global reduction 1 with 8 rules applied. Total rules applied 73 place count 1345 transition count 1983
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 81 place count 1337 transition count 1975
Iterating global reduction 1 with 8 rules applied. Total rules applied 89 place count 1337 transition count 1975
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 93 place count 1333 transition count 1971
Iterating global reduction 1 with 4 rules applied. Total rules applied 97 place count 1333 transition count 1971
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 101 place count 1329 transition count 1967
Iterating global reduction 1 with 4 rules applied. Total rules applied 105 place count 1329 transition count 1967
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 108 place count 1326 transition count 1964
Iterating global reduction 1 with 3 rules applied. Total rules applied 111 place count 1326 transition count 1964
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 1323 transition count 1961
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 1323 transition count 1961
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 1321 transition count 1959
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 1321 transition count 1959
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 1319 transition count 1957
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 1319 transition count 1957
Applied a total of 125 rules in 695 ms. Remains 1319 /1381 variables (removed 62) and now considering 1957/2035 (removed 78) transitions.
// Phase 1: matrix 1957 rows 1319 cols
[2024-06-01 11:17:54] [INFO ] Computed 79 invariants in 8 ms
[2024-06-01 11:17:55] [INFO ] Implicit Places using invariants in 933 ms returned []
[2024-06-01 11:17:55] [INFO ] Invariant cache hit.
[2024-06-01 11:17:57] [INFO ] Implicit Places using invariants and state equation in 2128 ms returned []
Implicit Place search using SMT with State Equation took 3070 ms to find 0 implicit places.
Running 1956 sub problems to find dead transitions.
[2024-06-01 11:17:57] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1318/3276 variables, and 0 constraints, problems are : Problem set: 0 solved, 1956 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1319 constraints, PredecessorRefiner: 1956/1956 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1956 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1318/3276 variables, and 0 constraints, problems are : Problem set: 0 solved, 1956 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1319 constraints, PredecessorRefiner: 0/1956 constraints, Known Traps: 0/0 constraints]
After SMT, in 60953ms problems are : Problem set: 0 solved, 1956 unsolved
Search for dead transitions found 0 dead transitions in 60986ms
Starting structural reductions in LTL mode, iteration 1 : 1319/1381 places, 1957/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64759 ms. Remains : 1319/1381 places, 1957/2035 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 1144 ms.
Product exploration explored 100000 steps with 50000 reset in 568 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCshifumi-PT-2b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCshifumi-PT-2b-LTLFireability-09 finished in 66768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Graph (trivial) has 1315 edges and 1381 vertex of which 330 / 1381 are part of one of the 23 SCC in 2 ms
Free SCC test removed 307 places
Ensure Unique test removed 342 transitions
Reduce isomorphic transitions removed 342 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 317 transitions
Trivial Post-agglo rules discarded 317 transitions
Performed 317 trivial Post agglomeration. Transition count delta: 317
Iterating post reduction 0 with 317 rules applied. Total rules applied 318 place count 1073 transition count 1375
Reduce places removed 317 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 371 rules applied. Total rules applied 689 place count 756 transition count 1321
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 725 place count 720 transition count 1321
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 725 place count 720 transition count 1210
Deduced a syphon composed of 111 places in 2 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 947 place count 609 transition count 1210
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 999 place count 557 transition count 1025
Iterating global reduction 3 with 52 rules applied. Total rules applied 1051 place count 557 transition count 1025
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1064 place count 557 transition count 1012
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1064 place count 557 transition count 1008
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1072 place count 553 transition count 1008
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1074 place count 551 transition count 1004
Iterating global reduction 4 with 2 rules applied. Total rules applied 1076 place count 551 transition count 1004
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1078 place count 551 transition count 1002
Performed 189 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 189 places in 1 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 5 with 378 rules applied. Total rules applied 1456 place count 362 transition count 811
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1459 place count 362 transition count 808
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1478 place count 343 transition count 714
Iterating global reduction 6 with 19 rules applied. Total rules applied 1497 place count 343 transition count 714
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 1516 place count 343 transition count 695
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1518 place count 342 transition count 694
Performed 49 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 1616 place count 293 transition count 762
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1631 place count 278 transition count 696
Iterating global reduction 7 with 15 rules applied. Total rules applied 1646 place count 278 transition count 696
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 1677 place count 278 transition count 665
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 1691 place count 278 transition count 651
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1694 place count 275 transition count 645
Iterating global reduction 8 with 3 rules applied. Total rules applied 1697 place count 275 transition count 645
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1700 place count 272 transition count 596
Iterating global reduction 8 with 3 rules applied. Total rules applied 1703 place count 272 transition count 596
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1706 place count 272 transition count 593
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1707 place count 271 transition count 592
Applied a total of 1707 rules in 147 ms. Remains 271 /1381 variables (removed 1110) and now considering 592/2035 (removed 1443) transitions.
[2024-06-01 11:19:00] [INFO ] Flow matrix only has 568 transitions (discarded 24 similar events)
// Phase 1: matrix 568 rows 271 cols
[2024-06-01 11:19:00] [INFO ] Computed 79 invariants in 3 ms
[2024-06-01 11:19:00] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-06-01 11:19:00] [INFO ] Flow matrix only has 568 transitions (discarded 24 similar events)
[2024-06-01 11:19:00] [INFO ] Invariant cache hit.
[2024-06-01 11:19:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 11:19:01] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 929 ms to find 0 implicit places.
[2024-06-01 11:19:01] [INFO ] Redundant transitions in 7 ms returned []
Running 507 sub problems to find dead transitions.
[2024-06-01 11:19:01] [INFO ] Flow matrix only has 568 transitions (discarded 24 similar events)
[2024-06-01 11:19:01] [INFO ] Invariant cache hit.
[2024-06-01 11:19:01] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 4 (OVERLAPS) 567/838 variables, 271/350 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/838 variables, 44/394 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 838/839 variables, and 394 constraints, problems are : Problem set: 0 solved, 507 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 271/271 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 507/507 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 507 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 4 (OVERLAPS) 567/838 variables, 271/350 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/838 variables, 44/394 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 507/901 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/838 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 838/839 variables, and 901 constraints, problems are : Problem set: 0 solved, 507 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 271/271 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 507/507 constraints, Known Traps: 0/0 constraints]
After SMT, in 60401ms problems are : Problem set: 0 solved, 507 unsolved
Search for dead transitions found 0 dead transitions in 60407ms
Starting structural reductions in SI_LTL mode, iteration 1 : 271/1381 places, 592/2035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61498 ms. Remains : 271/1381 places, 592/2035 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-10 finished in 61621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1362 transition count 2001
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1362 transition count 2001
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 1362 transition count 2000
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 1350 transition count 1988
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 1350 transition count 1988
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 72 place count 1341 transition count 1979
Iterating global reduction 1 with 9 rules applied. Total rules applied 81 place count 1341 transition count 1979
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 90 place count 1332 transition count 1970
Iterating global reduction 1 with 9 rules applied. Total rules applied 99 place count 1332 transition count 1970
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 104 place count 1327 transition count 1965
Iterating global reduction 1 with 5 rules applied. Total rules applied 109 place count 1327 transition count 1965
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 114 place count 1322 transition count 1960
Iterating global reduction 1 with 5 rules applied. Total rules applied 119 place count 1322 transition count 1960
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 123 place count 1318 transition count 1956
Iterating global reduction 1 with 4 rules applied. Total rules applied 127 place count 1318 transition count 1956
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 130 place count 1315 transition count 1953
Iterating global reduction 1 with 3 rules applied. Total rules applied 133 place count 1315 transition count 1953
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 1313 transition count 1951
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 1313 transition count 1951
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 139 place count 1311 transition count 1949
Iterating global reduction 1 with 2 rules applied. Total rules applied 141 place count 1311 transition count 1949
Applied a total of 141 rules in 659 ms. Remains 1311 /1381 variables (removed 70) and now considering 1949/2035 (removed 86) transitions.
// Phase 1: matrix 1949 rows 1311 cols
[2024-06-01 11:20:02] [INFO ] Computed 79 invariants in 7 ms
[2024-06-01 11:20:03] [INFO ] Implicit Places using invariants in 887 ms returned []
[2024-06-01 11:20:03] [INFO ] Invariant cache hit.
[2024-06-01 11:20:05] [INFO ] Implicit Places using invariants and state equation in 1938 ms returned []
Implicit Place search using SMT with State Equation took 2832 ms to find 0 implicit places.
Running 1948 sub problems to find dead transitions.
[2024-06-01 11:20:05] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1310/3260 variables, and 0 constraints, problems are : Problem set: 0 solved, 1948 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1311 constraints, PredecessorRefiner: 1948/1948 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1948 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1310/3260 variables, and 0 constraints, problems are : Problem set: 0 solved, 1948 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1311 constraints, PredecessorRefiner: 0/1948 constraints, Known Traps: 0/0 constraints]
After SMT, in 60987ms problems are : Problem set: 0 solved, 1948 unsolved
Search for dead transitions found 0 dead transitions in 61006ms
Starting structural reductions in LTL mode, iteration 1 : 1311/1381 places, 1949/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64503 ms. Remains : 1311/1381 places, 1949/2035 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 719 steps with 0 reset in 4 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-11 finished in 64666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&X((G(p2) U !p1)))))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1363 transition count 2002
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1363 transition count 2002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1363 transition count 2001
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 1352 transition count 1990
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 1352 transition count 1990
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 68 place count 1343 transition count 1981
Iterating global reduction 1 with 9 rules applied. Total rules applied 77 place count 1343 transition count 1981
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 86 place count 1334 transition count 1972
Iterating global reduction 1 with 9 rules applied. Total rules applied 95 place count 1334 transition count 1972
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 100 place count 1329 transition count 1967
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 1329 transition count 1967
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 110 place count 1324 transition count 1962
Iterating global reduction 1 with 5 rules applied. Total rules applied 115 place count 1324 transition count 1962
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 119 place count 1320 transition count 1958
Iterating global reduction 1 with 4 rules applied. Total rules applied 123 place count 1320 transition count 1958
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 1317 transition count 1955
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 1317 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 1315 transition count 1953
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 1315 transition count 1953
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 1313 transition count 1951
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 1313 transition count 1951
Applied a total of 137 rules in 688 ms. Remains 1313 /1381 variables (removed 68) and now considering 1951/2035 (removed 84) transitions.
// Phase 1: matrix 1951 rows 1313 cols
[2024-06-01 11:21:07] [INFO ] Computed 79 invariants in 9 ms
[2024-06-01 11:21:08] [INFO ] Implicit Places using invariants in 843 ms returned []
[2024-06-01 11:21:08] [INFO ] Invariant cache hit.
[2024-06-01 11:21:10] [INFO ] Implicit Places using invariants and state equation in 1860 ms returned []
Implicit Place search using SMT with State Equation took 2707 ms to find 0 implicit places.
Running 1950 sub problems to find dead transitions.
[2024-06-01 11:21:10] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1312/3264 variables, and 0 constraints, problems are : Problem set: 0 solved, 1950 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1313 constraints, PredecessorRefiner: 1950/1950 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1950 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1312/3264 variables, and 0 constraints, problems are : Problem set: 0 solved, 1950 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1313 constraints, PredecessorRefiner: 0/1950 constraints, Known Traps: 0/0 constraints]
After SMT, in 60838ms problems are : Problem set: 0 solved, 1950 unsolved
Search for dead transitions found 0 dead transitions in 60857ms
Starting structural reductions in LTL mode, iteration 1 : 1313/1381 places, 1951/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64257 ms. Remains : 1313/1381 places, 1951/2035 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), p1]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-12
Product exploration explored 100000 steps with 99 reset in 560 ms.
Product exploration explored 100000 steps with 98 reset in 495 ms.
Computed a total of 144 stabilizing places and 144 stable transitions
Computed a total of 144 stabilizing places and 144 stable transitions
Detected a total of 144/1313 stabilizing places and 144/1951 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 196 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[p1, p1]
RANDOM walk for 3887 steps (0 resets) in 27 ms. (138 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 12 factoid took 284 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[p1, p1]
Stuttering acceptance computed with spot in 99 ms :[p1, p1]
[2024-06-01 11:22:13] [INFO ] Invariant cache hit.
[2024-06-01 11:22:14] [INFO ] [Real]Absence check using 79 positive place invariants in 84 ms returned sat
[2024-06-01 11:22:18] [INFO ] [Real]Absence check using state equation in 3437 ms returned sat
[2024-06-01 11:22:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:22:20] [INFO ] [Nat]Absence check using 79 positive place invariants in 98 ms returned sat
[2024-06-01 11:22:23] [INFO ] [Nat]Absence check using state equation in 3037 ms returned sat
[2024-06-01 11:22:23] [INFO ] Computed and/alt/rep : 1892/3089/1892 causal constraints (skipped 58 transitions) in 152 ms.
Could not prove EG p1
Support contains 1 out of 1313 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1313/1313 places, 1951/1951 transitions.
Graph (trivial) has 1238 edges and 1313 vertex of which 305 / 1313 are part of one of the 24 SCC in 2 ms
Free SCC test removed 281 places
Ensure Unique test removed 314 transitions
Reduce isomorphic transitions removed 314 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 282 place count 1031 transition count 1355
Reduce places removed 281 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 332 rules applied. Total rules applied 614 place count 750 transition count 1304
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 36 rules applied. Total rules applied 650 place count 716 transition count 1302
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 652 place count 714 transition count 1302
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 108 Pre rules applied. Total rules applied 652 place count 714 transition count 1194
Deduced a syphon composed of 108 places in 4 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 4 with 216 rules applied. Total rules applied 868 place count 606 transition count 1194
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 907 place count 567 transition count 1035
Iterating global reduction 4 with 39 rules applied. Total rules applied 946 place count 567 transition count 1035
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 961 place count 567 transition count 1020
Performed 198 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 198 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 5 with 396 rules applied. Total rules applied 1357 place count 369 transition count 820
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1359 place count 369 transition count 818
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1377 place count 351 transition count 740
Iterating global reduction 6 with 18 rules applied. Total rules applied 1395 place count 351 transition count 740
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1412 place count 351 transition count 723
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1414 place count 350 transition count 722
Performed 49 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 1512 place count 301 transition count 794
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1527 place count 286 transition count 730
Iterating global reduction 7 with 15 rules applied. Total rules applied 1542 place count 286 transition count 730
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 7 with 32 rules applied. Total rules applied 1574 place count 286 transition count 698
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 1586 place count 286 transition count 686
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1588 place count 284 transition count 682
Iterating global reduction 8 with 2 rules applied. Total rules applied 1590 place count 284 transition count 682
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1592 place count 282 transition count 650
Iterating global reduction 8 with 2 rules applied. Total rules applied 1594 place count 282 transition count 650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1596 place count 282 transition count 648
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1597 place count 281 transition count 647
Applied a total of 1597 rules in 229 ms. Remains 281 /1313 variables (removed 1032) and now considering 647/1951 (removed 1304) transitions.
[2024-06-01 11:22:33] [INFO ] Flow matrix only has 617 transitions (discarded 30 similar events)
// Phase 1: matrix 617 rows 281 cols
[2024-06-01 11:22:33] [INFO ] Computed 79 invariants in 3 ms
[2024-06-01 11:22:34] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-06-01 11:22:34] [INFO ] Flow matrix only has 617 transitions (discarded 30 similar events)
[2024-06-01 11:22:34] [INFO ] Invariant cache hit.
[2024-06-01 11:22:34] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 11:22:34] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
[2024-06-01 11:22:34] [INFO ] Redundant transitions in 12 ms returned []
Running 567 sub problems to find dead transitions.
[2024-06-01 11:22:34] [INFO ] Flow matrix only has 617 transitions (discarded 30 similar events)
[2024-06-01 11:22:34] [INFO ] Invariant cache hit.
[2024-06-01 11:22:34] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 2 (OVERLAPS) 3/281 variables, 64/79 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 4 (OVERLAPS) 616/897 variables, 281/360 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 49/409 constraints. Problems are: Problem set: 0 solved, 567 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 Real declared 897/898 variables, and 409 constraints, problems are : Problem set: 0 solved, 567 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 281/281 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 567/567 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 567 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 2 (OVERLAPS) 3/281 variables, 64/79 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 4 (OVERLAPS) 616/897 variables, 281/360 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 49/409 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/897 variables, 567/976 constraints. Problems are: Problem set: 0 solved, 567 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/898 variables, and 976 constraints, problems are : Problem set: 0 solved, 567 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 281/281 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 567/567 constraints, Known Traps: 0/0 constraints]
After SMT, in 60449ms problems are : Problem set: 0 solved, 567 unsolved
Search for dead transitions found 0 dead transitions in 60459ms
Starting structural reductions in SI_LTL mode, iteration 1 : 281/1313 places, 647/1951 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61832 ms. Remains : 281/1313 places, 647/1951 transitions.
Computed a total of 3 stabilizing places and 18 stable transitions
Computed a total of 3 stabilizing places and 18 stable transitions
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[p1, p1]
RANDOM walk for 540 steps (0 resets) in 13 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[p1, p1]
Stuttering acceptance computed with spot in 96 ms :[p1, p1]
[2024-06-01 11:23:36] [INFO ] Flow matrix only has 617 transitions (discarded 30 similar events)
[2024-06-01 11:23:36] [INFO ] Invariant cache hit.
[2024-06-01 11:23:36] [INFO ] [Real]Absence check using 79 positive place invariants in 29 ms returned sat
[2024-06-01 11:23:36] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2024-06-01 11:23:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:23:37] [INFO ] [Nat]Absence check using 79 positive place invariants in 39 ms returned sat
[2024-06-01 11:23:38] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2024-06-01 11:23:38] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 11:23:38] [INFO ] [Nat]Added 49 Read/Feed constraints in 13 ms returned sat
[2024-06-01 11:23:38] [INFO ] Computed and/alt/rep : 383/839/383 causal constraints (skipped 169 transitions) in 87 ms.
[2024-06-01 11:23:38] [INFO ] Added : 12 causal constraints over 3 iterations in 318 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 97 ms :[p1, p1]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-12 finished in 151659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Graph (trivial) has 1314 edges and 1381 vertex of which 330 / 1381 are part of one of the 23 SCC in 1 ms
Free SCC test removed 307 places
Ensure Unique test removed 342 transitions
Reduce isomorphic transitions removed 342 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 316 transitions
Trivial Post-agglo rules discarded 316 transitions
Performed 316 trivial Post agglomeration. Transition count delta: 316
Iterating post reduction 0 with 316 rules applied. Total rules applied 317 place count 1073 transition count 1376
Reduce places removed 316 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 370 rules applied. Total rules applied 687 place count 757 transition count 1322
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 723 place count 721 transition count 1322
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 723 place count 721 transition count 1211
Deduced a syphon composed of 111 places in 4 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 945 place count 610 transition count 1211
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 996 place count 559 transition count 1012
Iterating global reduction 3 with 51 rules applied. Total rules applied 1047 place count 559 transition count 1012
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1060 place count 559 transition count 999
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1060 place count 559 transition count 996
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1066 place count 556 transition count 996
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1067 place count 555 transition count 994
Iterating global reduction 4 with 1 rules applied. Total rules applied 1068 place count 555 transition count 994
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1069 place count 555 transition count 993
Performed 190 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 190 places in 0 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 5 with 380 rules applied. Total rules applied 1449 place count 365 transition count 801
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1452 place count 365 transition count 798
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1471 place count 346 transition count 704
Iterating global reduction 6 with 19 rules applied. Total rules applied 1490 place count 346 transition count 704
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 1509 place count 346 transition count 685
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1511 place count 345 transition count 684
Performed 50 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 1611 place count 295 transition count 759
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1626 place count 280 transition count 693
Iterating global reduction 7 with 15 rules applied. Total rules applied 1641 place count 280 transition count 693
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 7 with 32 rules applied. Total rules applied 1673 place count 280 transition count 661
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 1691 place count 280 transition count 643
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1695 place count 276 transition count 635
Iterating global reduction 8 with 4 rules applied. Total rules applied 1699 place count 276 transition count 635
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1703 place count 272 transition count 567
Iterating global reduction 8 with 4 rules applied. Total rules applied 1707 place count 272 transition count 567
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1711 place count 272 transition count 563
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1712 place count 271 transition count 562
Applied a total of 1712 rules in 219 ms. Remains 271 /1381 variables (removed 1110) and now considering 562/2035 (removed 1473) transitions.
[2024-06-01 11:23:38] [INFO ] Flow matrix only has 537 transitions (discarded 25 similar events)
// Phase 1: matrix 537 rows 271 cols
[2024-06-01 11:23:38] [INFO ] Computed 79 invariants in 3 ms
[2024-06-01 11:23:39] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-06-01 11:23:39] [INFO ] Flow matrix only has 537 transitions (discarded 25 similar events)
[2024-06-01 11:23:39] [INFO ] Invariant cache hit.
[2024-06-01 11:23:39] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 11:23:39] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
[2024-06-01 11:23:39] [INFO ] Redundant transitions in 9 ms returned []
Running 477 sub problems to find dead transitions.
[2024-06-01 11:23:39] [INFO ] Flow matrix only has 537 transitions (discarded 25 similar events)
[2024-06-01 11:23:39] [INFO ] Invariant cache hit.
[2024-06-01 11:23:39] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 536/807 variables, 271/350 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 45/395 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/807 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 807/808 variables, and 395 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 271/271 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 536/807 variables, 271/350 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 45/395 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/807 variables, 477/872 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/807 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 807/808 variables, and 872 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 271/271 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
After SMT, in 60345ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 60353ms
Starting structural reductions in SI_LTL mode, iteration 1 : 271/1381 places, 562/2035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61676 ms. Remains : 271/1381 places, 562/2035 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-13 finished in 61825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1363 transition count 2002
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1363 transition count 2002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1363 transition count 2001
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 1351 transition count 1989
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 1351 transition count 1989
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 1342 transition count 1980
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 1342 transition count 1980
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 1333 transition count 1971
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 1333 transition count 1971
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 102 place count 1328 transition count 1966
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 1328 transition count 1966
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 112 place count 1323 transition count 1961
Iterating global reduction 1 with 5 rules applied. Total rules applied 117 place count 1323 transition count 1961
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 1319 transition count 1957
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 1319 transition count 1957
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 128 place count 1316 transition count 1954
Iterating global reduction 1 with 3 rules applied. Total rules applied 131 place count 1316 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 1314 transition count 1952
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 1314 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 1312 transition count 1950
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 1312 transition count 1950
Applied a total of 139 rules in 679 ms. Remains 1312 /1381 variables (removed 69) and now considering 1950/2035 (removed 85) transitions.
// Phase 1: matrix 1950 rows 1312 cols
[2024-06-01 11:24:41] [INFO ] Computed 79 invariants in 12 ms
[2024-06-01 11:24:41] [INFO ] Implicit Places using invariants in 860 ms returned []
[2024-06-01 11:24:41] [INFO ] Invariant cache hit.
[2024-06-01 11:24:43] [INFO ] Implicit Places using invariants and state equation in 1938 ms returned []
Implicit Place search using SMT with State Equation took 2813 ms to find 0 implicit places.
Running 1949 sub problems to find dead transitions.
[2024-06-01 11:24:43] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1311/3262 variables, and 0 constraints, problems are : Problem set: 0 solved, 1949 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1312 constraints, PredecessorRefiner: 1949/1949 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1949 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1311/3262 variables, and 0 constraints, problems are : Problem set: 0 solved, 1949 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1312 constraints, PredecessorRefiner: 0/1949 constraints, Known Traps: 0/0 constraints]
After SMT, in 60902ms problems are : Problem set: 0 solved, 1949 unsolved
Search for dead transitions found 0 dead transitions in 60922ms
Starting structural reductions in LTL mode, iteration 1 : 1312/1381 places, 1950/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64419 ms. Remains : 1312/1381 places, 1950/2035 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-14
Stuttering criterion allowed to conclude after 5449 steps with 1 reset in 30 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-14 finished in 64586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((G(p1)&&X(F((p2||G(p3))))))))'
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1365 transition count 2019
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1365 transition count 2019
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1365 transition count 2018
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 43 place count 1355 transition count 2008
Iterating global reduction 1 with 10 rules applied. Total rules applied 53 place count 1355 transition count 2008
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 1348 transition count 2001
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 1348 transition count 2001
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 74 place count 1341 transition count 1994
Iterating global reduction 1 with 7 rules applied. Total rules applied 81 place count 1341 transition count 1994
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 85 place count 1337 transition count 1990
Iterating global reduction 1 with 4 rules applied. Total rules applied 89 place count 1337 transition count 1990
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 93 place count 1333 transition count 1986
Iterating global reduction 1 with 4 rules applied. Total rules applied 97 place count 1333 transition count 1986
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 101 place count 1329 transition count 1982
Iterating global reduction 1 with 4 rules applied. Total rules applied 105 place count 1329 transition count 1982
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 108 place count 1326 transition count 1979
Iterating global reduction 1 with 3 rules applied. Total rules applied 111 place count 1326 transition count 1979
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 113 place count 1324 transition count 1977
Iterating global reduction 1 with 2 rules applied. Total rules applied 115 place count 1324 transition count 1977
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 1322 transition count 1975
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 1322 transition count 1975
Applied a total of 119 rules in 688 ms. Remains 1322 /1381 variables (removed 59) and now considering 1975/2035 (removed 60) transitions.
// Phase 1: matrix 1975 rows 1322 cols
[2024-06-01 11:25:45] [INFO ] Computed 79 invariants in 13 ms
[2024-06-01 11:25:46] [INFO ] Implicit Places using invariants in 777 ms returned []
[2024-06-01 11:25:46] [INFO ] Invariant cache hit.
[2024-06-01 11:25:48] [INFO ] Implicit Places using invariants and state equation in 1938 ms returned []
Implicit Place search using SMT with State Equation took 2730 ms to find 0 implicit places.
Running 1974 sub problems to find dead transitions.
[2024-06-01 11:25:48] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1321/3297 variables, and 0 constraints, problems are : Problem set: 0 solved, 1974 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1322 constraints, PredecessorRefiner: 1974/1974 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1974 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1321/3297 variables, and 0 constraints, problems are : Problem set: 0 solved, 1974 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1322 constraints, PredecessorRefiner: 0/1974 constraints, Known Traps: 0/0 constraints]
After SMT, in 60948ms problems are : Problem set: 0 solved, 1974 unsolved
Search for dead transitions found 0 dead transitions in 60968ms
Starting structural reductions in LTL mode, iteration 1 : 1322/1381 places, 1975/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64391 ms. Remains : 1322/1381 places, 1975/2035 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-15 finished in 64677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Found a Lengthening insensitive property : DLCshifumi-PT-2b-LTLFireability-05
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Graph (trivial) has 1313 edges and 1381 vertex of which 326 / 1381 are part of one of the 23 SCC in 3 ms
Free SCC test removed 303 places
Ensure Unique test removed 337 transitions
Reduce isomorphic transitions removed 337 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 319 transitions
Trivial Post-agglo rules discarded 319 transitions
Performed 319 trivial Post agglomeration. Transition count delta: 319
Iterating post reduction 0 with 319 rules applied. Total rules applied 320 place count 1077 transition count 1378
Reduce places removed 319 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 373 rules applied. Total rules applied 693 place count 758 transition count 1324
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 729 place count 722 transition count 1324
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 729 place count 722 transition count 1213
Deduced a syphon composed of 111 places in 3 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 951 place count 611 transition count 1213
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1003 place count 559 transition count 1013
Iterating global reduction 3 with 52 rules applied. Total rules applied 1055 place count 559 transition count 1013
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1068 place count 559 transition count 1000
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1068 place count 559 transition count 996
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1076 place count 555 transition count 996
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1078 place count 553 transition count 992
Iterating global reduction 4 with 2 rules applied. Total rules applied 1080 place count 553 transition count 992
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1082 place count 553 transition count 990
Performed 189 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 189 places in 0 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 5 with 378 rules applied. Total rules applied 1460 place count 364 transition count 799
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1463 place count 364 transition count 796
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1481 place count 346 transition count 718
Iterating global reduction 6 with 18 rules applied. Total rules applied 1499 place count 346 transition count 718
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 1517 place count 346 transition count 700
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 7 with 2 rules applied. Total rules applied 1519 place count 345 transition count 699
Performed 49 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 1617 place count 296 transition count 768
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1632 place count 281 transition count 702
Iterating global reduction 7 with 15 rules applied. Total rules applied 1647 place count 281 transition count 702
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 1678 place count 281 transition count 671
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1682 place count 281 transition count 667
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1683 place count 280 transition count 666
Applied a total of 1683 rules in 135 ms. Remains 280 /1381 variables (removed 1101) and now considering 666/2035 (removed 1369) transitions.
[2024-06-01 11:26:49] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
// Phase 1: matrix 637 rows 280 cols
[2024-06-01 11:26:50] [INFO ] Computed 79 invariants in 2 ms
[2024-06-01 11:26:50] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-06-01 11:26:50] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
[2024-06-01 11:26:50] [INFO ] Invariant cache hit.
[2024-06-01 11:26:50] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 11:26:51] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
Running 576 sub problems to find dead transitions.
[2024-06-01 11:26:51] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
[2024-06-01 11:26:51] [INFO ] Invariant cache hit.
[2024-06-01 11:26:51] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (OVERLAPS) 636/916 variables, 280/359 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/916 variables, 44/403 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/916 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 916/917 variables, and 403 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 280/280 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (OVERLAPS) 636/916 variables, 280/359 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/916 variables, 44/403 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/916 variables, 576/979 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 916/917 variables, and 979 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 280/280 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 0/0 constraints]
After SMT, in 60306ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 60314ms
Starting structural reductions in LI_LTL mode, iteration 1 : 280/1381 places, 666/2035 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61612 ms. Remains : 280/1381 places, 666/2035 transitions.
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 804 ms.
Product exploration explored 100000 steps with 2 reset in 662 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1505 steps (0 resets) in 18 ms. (79 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 3 factoid took 439 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 666/666 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 666/666 (removed 0) transitions.
[2024-06-01 11:27:54] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
[2024-06-01 11:27:54] [INFO ] Invariant cache hit.
[2024-06-01 11:27:54] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-06-01 11:27:54] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
[2024-06-01 11:27:54] [INFO ] Invariant cache hit.
[2024-06-01 11:27:54] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 11:27:55] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
Running 576 sub problems to find dead transitions.
[2024-06-01 11:27:55] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
[2024-06-01 11:27:55] [INFO ] Invariant cache hit.
[2024-06-01 11:27:55] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (OVERLAPS) 636/916 variables, 280/359 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/916 variables, 44/403 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 916/917 variables, and 403 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 280/280 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (OVERLAPS) 636/916 variables, 280/359 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/916 variables, 44/403 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/916 variables, 576/979 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 916/917 variables, and 979 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 280/280 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 0/0 constraints]
After SMT, in 60520ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 60531ms
Finished structural reductions in LTL mode , in 1 iterations and 61777 ms. Remains : 280/280 places, 666/666 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 293 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1293 steps (0 resets) in 17 ms. (71 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 3 factoid took 370 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 930 ms.
Product exploration explored 100000 steps with 0 reset in 651 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 666/666 transitions.
Applied a total of 0 rules in 2 ms. Remains 280 /280 variables (removed 0) and now considering 666/666 (removed 0) transitions.
[2024-06-01 11:28:58] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
[2024-06-01 11:28:58] [INFO ] Invariant cache hit.
[2024-06-01 11:28:59] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-06-01 11:28:59] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
[2024-06-01 11:28:59] [INFO ] Invariant cache hit.
[2024-06-01 11:28:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 11:29:00] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
Running 576 sub problems to find dead transitions.
[2024-06-01 11:29:00] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
[2024-06-01 11:29:00] [INFO ] Invariant cache hit.
[2024-06-01 11:29:00] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (OVERLAPS) 636/916 variables, 280/359 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/916 variables, 44/403 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 916/917 variables, and 403 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 280/280 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (OVERLAPS) 636/916 variables, 280/359 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/916 variables, 44/403 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/916 variables, 576/979 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 1)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 0)timeout

(s108 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 916/917 variables, and 979 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 280/280 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 0/0 constraints]
After SMT, in 60467ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 60478ms
Finished structural reductions in LTL mode , in 1 iterations and 61632 ms. Remains : 280/280 places, 666/666 transitions.
Treatment of property DLCshifumi-PT-2b-LTLFireability-05 finished in 191126 ms.
[2024-06-01 11:30:00] [INFO ] Flatten gal took : 128 ms
[2024-06-01 11:30:00] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 20 ms.
[2024-06-01 11:30:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1381 places, 2035 transitions and 5428 arcs took 29 ms.
Total runtime 1527998 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DLCshifumi-PT-2b-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717241799467

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name DLCshifumi-PT-2b-LTLFireability-05
ltl formula formula --ltl=/tmp/1840/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1381 places, 2035 transitions and 5428 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1840/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1840/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.090 user 0.120 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1840/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1840/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1383 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1382, there are 2045 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~101840 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~266636 transitions
pnml2lts-mc( 0/ 4): ~10000 levels ~40000 states ~476296 transitions
pnml2lts-mc( 0/ 4): ~19941 levels ~80000 states ~755272 transitions
pnml2lts-mc( 0/ 4): ~39816 levels ~160000 states ~1254144 transitions
pnml2lts-mc( 0/ 4): ~79349 levels ~320000 states ~2015376 transitions
pnml2lts-mc( 0/ 4): ~158183 levels ~640000 states ~3590556 transitions
pnml2lts-mc( 0/ 4): ~316860 levels ~1280000 states ~7510376 transitions
pnml2lts-mc( 0/ 4): ~634334 levels ~2560000 states ~15418076 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 3143426
pnml2lts-mc( 0/ 4): unique transitions count: 38758869
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 3992162
pnml2lts-mc( 0/ 4): - claim success count: 3143436
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3136250
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3143436 states 38758895 transitions, fanout: 12.330
pnml2lts-mc( 0/ 4): Total exploration time 397.010 sec (396.960 sec minimum, 396.985 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7918, Transitions per second: 97627
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 307.8MB, 9.6 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/80.0%
pnml2lts-mc( 0/ 4): Stored 2092 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 307.8MB (~256.0MB paged-in)

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="DLCshifumi-PT-2b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is DLCshifumi-PT-2b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r484-smll-171624275700300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-2b.tgz
mv DLCshifumi-PT-2b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;