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.r549-tall-171734897900148.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 greatspnxred
Input is CO4-PT-19, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734897900148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 332K Jun 2 16:33 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 CO4-PT-19-LTLFireability-00
FORMULA_NAME CO4-PT-19-LTLFireability-01
FORMULA_NAME CO4-PT-19-LTLFireability-02
FORMULA_NAME CO4-PT-19-LTLFireability-03
FORMULA_NAME CO4-PT-19-LTLFireability-04
FORMULA_NAME CO4-PT-19-LTLFireability-05
FORMULA_NAME CO4-PT-19-LTLFireability-06
FORMULA_NAME CO4-PT-19-LTLFireability-07
FORMULA_NAME CO4-PT-19-LTLFireability-08
FORMULA_NAME CO4-PT-19-LTLFireability-09
FORMULA_NAME CO4-PT-19-LTLFireability-10
FORMULA_NAME CO4-PT-19-LTLFireability-11
FORMULA_NAME CO4-PT-19-LTLFireability-12
FORMULA_NAME CO4-PT-19-LTLFireability-13
FORMULA_NAME CO4-PT-19-LTLFireability-14
FORMULA_NAME CO4-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717361479053

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 20:51:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 20:51:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:51:20] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2024-06-02 20:51:20] [INFO ] Transformed 1174 places.
[2024-06-02 20:51:20] [INFO ] Transformed 1447 transitions.
[2024-06-02 20:51:20] [INFO ] Found NUPN structural information;
[2024-06-02 20:51:20] [INFO ] Parsed PT model containing 1174 places and 1447 transitions and 3662 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 201 places in 15 ms
Reduce places removed 201 places and 274 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-19-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 973 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 973/973 places, 1173/1173 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 948 transition count 1165
Discarding 161 places :
Symmetric choice reduction at 1 with 161 rule applications. Total rules 194 place count 787 transition count 1002
Iterating global reduction 1 with 161 rules applied. Total rules applied 355 place count 787 transition count 1002
Discarding 132 places :
Symmetric choice reduction at 1 with 132 rule applications. Total rules 487 place count 655 transition count 866
Iterating global reduction 1 with 132 rules applied. Total rules applied 619 place count 655 transition count 866
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 626 place count 655 transition count 859
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 690 place count 591 transition count 791
Iterating global reduction 2 with 64 rules applied. Total rules applied 754 place count 591 transition count 791
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 756 place count 591 transition count 789
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 797 place count 550 transition count 748
Iterating global reduction 3 with 41 rules applied. Total rules applied 838 place count 550 transition count 748
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 844 place count 550 transition count 742
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 863 place count 531 transition count 723
Iterating global reduction 4 with 19 rules applied. Total rules applied 882 place count 531 transition count 723
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 884 place count 531 transition count 721
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 890 place count 525 transition count 715
Iterating global reduction 5 with 6 rules applied. Total rules applied 896 place count 525 transition count 715
Applied a total of 896 rules in 477 ms. Remains 525 /973 variables (removed 448) and now considering 715/1173 (removed 458) transitions.
// Phase 1: matrix 715 rows 525 cols
[2024-06-02 20:51:21] [INFO ] Computed 7 invariants in 22 ms
[2024-06-02 20:51:21] [INFO ] Implicit Places using invariants in 300 ms returned [6, 456]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 328 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 523/973 places, 715/1173 transitions.
Applied a total of 0 rules in 56 ms. Remains 523 /523 variables (removed 0) and now considering 715/715 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 876 ms. Remains : 523/973 places, 715/1173 transitions.
Support contains 32 out of 523 places after structural reductions.
[2024-06-02 20:51:21] [INFO ] Flatten gal took : 81 ms
[2024-06-02 20:51:21] [INFO ] Flatten gal took : 58 ms
[2024-06-02 20:51:21] [INFO ] Input system was already deterministic with 715 transitions.
Support contains 31 out of 523 places (down from 32) after GAL structural reductions.
RANDOM walk for 40000 steps (777 resets) in 1850 ms. (21 steps per ms) remains 17/26 properties
BEST_FIRST walk for 4002 steps (14 resets) in 51 ms. (76 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 51 ms. (76 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (11 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (13 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (14 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (13 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (13 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (13 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
// Phase 1: matrix 715 rows 523 cols
[2024-06-02 20:51:22] [INFO ] Computed 5 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 43/61 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 294/355 variables, 49/67 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/373 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 17/390 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 432/822 variables, 210/290 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/822 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 297/1119 variables, 164/454 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1119 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 91/1210 variables, 55/509 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1210 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 22/1232 variables, 14/523 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1232 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 6/1238 variables, 5/528 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1238 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (OVERLAPS) 0/1238 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1238/1238 variables, and 528 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2347 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 523/523 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 43/61 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 294/355 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 16/84 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 18/373 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 7/93 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 17/390 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 432/822 variables, 210/307 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/822 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 297/1119 variables, 164/471 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1119 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 91/1210 variables, 55/526 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1210 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 22/1232 variables, 14/540 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1232 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (OVERLAPS) 6/1238 variables, 5/545 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1238 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (OVERLAPS) 0/1238 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1238/1238 variables, and 545 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3086 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 523/523 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 5482ms problems are : Problem set: 0 solved, 17 unsolved
Finished Parikh walk after 21407 steps, including 324 resets, run visited all 1 properties in 29 ms. (steps per millisecond=738 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 17 properties in 980 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 1017 edges and 523 vertex of which 518 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.20 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p1||X(p2)))&&p0)))'
Support contains 3 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 508 transition count 700
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 508 transition count 700
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 500 transition count 691
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 500 transition count 691
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 500 transition count 688
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 495 transition count 682
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 495 transition count 682
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 491 transition count 678
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 491 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 491 transition count 676
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 490 transition count 675
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 490 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 489 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 489 transition count 674
Applied a total of 73 rules in 62 ms. Remains 489 /523 variables (removed 34) and now considering 674/715 (removed 41) transitions.
// Phase 1: matrix 674 rows 489 cols
[2024-06-02 20:51:29] [INFO ] Computed 5 invariants in 8 ms
[2024-06-02 20:51:29] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-06-02 20:51:29] [INFO ] Invariant cache hit.
[2024-06-02 20:51:30] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 673 sub problems to find dead transitions.
[2024-06-02 20:51:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 3 (OVERLAPS) 674/1163 variables, 489/494 constraints. Problems are: Problem set: 0 solved, 673 unsolved
[2024-06-02 20:51:53] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 26 ms to minimize.
[2024-06-02 20:51:53] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 4 ms to minimize.
[2024-06-02 20:51:55] [INFO ] Deduced a trap composed of 188 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 497 constraints, problems are : Problem set: 0 solved, 673 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 673/673 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 673 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 673 unsolved
[2024-06-02 20:52:09] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:52:09] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 5 (OVERLAPS) 674/1163 variables, 489/499 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 673/1172 constraints. Problems are: Problem set: 0 solved, 673 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 1172 constraints, problems are : Problem set: 0 solved, 673 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 673/673 constraints, Known Traps: 5/5 constraints]
After SMT, in 60312ms problems are : Problem set: 0 solved, 673 unsolved
Search for dead transitions found 0 dead transitions in 60321ms
Starting structural reductions in LTL mode, iteration 1 : 489/523 places, 674/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60895 ms. Remains : 489/523 places, 674/715 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-19-LTLFireability-00
Product exploration explored 100000 steps with 12537 reset in 257 ms.
Product exploration explored 100000 steps with 12411 reset in 195 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 968 edges and 489 vertex of which 484 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Detected a total of 17/489 stabilizing places and 20/674 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 162 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (679 resets) in 310 ms. (128 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (141 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (161 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (123 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (142 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (144 resets) in 165 ms. (240 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (166 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
[2024-06-02 20:52:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 25/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 117/157 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 290/447 variables, 97/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 413/860 variables, 177/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/860 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 225/1085 variables, 127/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1085 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 56/1141 variables, 35/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 20:52:32] [INFO ] Deduced a trap composed of 188 places in 109 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1141 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1141 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 17/1158 variables, 9/491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1158 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 5/1163 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1163 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/1163 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 495 constraints, problems are : Problem set: 0 solved, 6 unsolved in 943 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 25/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 117/157 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 290/447 variables, 97/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 413/860 variables, 177/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/860 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 225/1085 variables, 127/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1085 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 56/1141 variables, 35/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1141 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1141 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 17/1158 variables, 9/497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1158 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 5/1163 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1163 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/1163 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 501 constraints, problems are : Problem set: 0 solved, 6 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1901ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 80 steps, including 1 resets, run visited all 6 properties in 3 ms. (steps per millisecond=26 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 4 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p1 p2))), (F (NOT p0)), (F p2), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge based reduction with 15 factoid took 420 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
[2024-06-02 20:52:34] [INFO ] Invariant cache hit.
[2024-06-02 20:52:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 20:52:35] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-06-02 20:52:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 20:52:35] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-06-02 20:52:35] [INFO ] Computed and/alt/rep : 655/1178/655 causal constraints (skipped 18 transitions) in 37 ms.
[2024-06-02 20:52:40] [INFO ] Added : 594 causal constraints over 119 iterations in 5257 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 674/674 transitions.
Applied a total of 0 rules in 8 ms. Remains 489 /489 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2024-06-02 20:52:40] [INFO ] Invariant cache hit.
[2024-06-02 20:52:40] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 20:52:40] [INFO ] Invariant cache hit.
[2024-06-02 20:52:41] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 673 sub problems to find dead transitions.
[2024-06-02 20:52:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 3 (OVERLAPS) 674/1163 variables, 489/494 constraints. Problems are: Problem set: 0 solved, 673 unsolved
[2024-06-02 20:53:04] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 3 ms to minimize.
[2024-06-02 20:53:04] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 3 ms to minimize.
[2024-06-02 20:53:05] [INFO ] Deduced a trap composed of 188 places in 85 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 497 constraints, problems are : Problem set: 0 solved, 673 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 673/673 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 673 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 673 unsolved
[2024-06-02 20:53:20] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:53:20] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 5 (OVERLAPS) 674/1163 variables, 489/499 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 673/1172 constraints. Problems are: Problem set: 0 solved, 673 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 1163/1163 variables, and 1172 constraints, problems are : Problem set: 0 solved, 673 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 673/673 constraints, Known Traps: 5/5 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 673 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Finished structural reductions in LTL mode , in 1 iterations and 60622 ms. Remains : 489/489 places, 674/674 transitions.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 968 edges and 489 vertex of which 484 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Detected a total of 17/489 stabilizing places and 20/674 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 151 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (535 resets) in 188 ms. (211 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (140 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (166 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (124 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (137 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (142 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (156 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
[2024-06-02 20:53:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 25/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 117/157 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 290/447 variables, 97/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 413/860 variables, 177/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/860 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 225/1085 variables, 127/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1085 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 56/1141 variables, 35/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 20:53:42] [INFO ] Deduced a trap composed of 188 places in 125 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1141 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1141 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 17/1158 variables, 9/491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1158 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 5/1163 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1163 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/1163 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 495 constraints, problems are : Problem set: 0 solved, 6 unsolved in 986 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 25/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 117/157 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 290/447 variables, 97/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 413/860 variables, 177/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/860 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 225/1085 variables, 127/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1085 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 56/1141 variables, 35/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1141 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1141 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 17/1158 variables, 9/497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1158 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 5/1163 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1163 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/1163 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 501 constraints, problems are : Problem set: 0 solved, 6 unsolved in 875 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1868ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 80 steps, including 1 resets, run visited all 6 properties in 5 ms. (steps per millisecond=16 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 5 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p1 p2))), (F (NOT p0)), (F p2), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge based reduction with 15 factoid took 521 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
[2024-06-02 20:53:44] [INFO ] Invariant cache hit.
[2024-06-02 20:53:44] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 20:53:45] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-06-02 20:53:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 20:53:45] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-06-02 20:53:45] [INFO ] Computed and/alt/rep : 655/1178/655 causal constraints (skipped 18 transitions) in 37 ms.
[2024-06-02 20:53:50] [INFO ] Added : 594 causal constraints over 119 iterations in 5228 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 12570 reset in 148 ms.
Product exploration explored 100000 steps with 12485 reset in 250 ms.
Support contains 3 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 674/674 transitions.
Applied a total of 0 rules in 14 ms. Remains 489 /489 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2024-06-02 20:53:51] [INFO ] Invariant cache hit.
[2024-06-02 20:53:51] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 20:53:51] [INFO ] Invariant cache hit.
[2024-06-02 20:53:51] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 673 sub problems to find dead transitions.
[2024-06-02 20:53:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 3 (OVERLAPS) 674/1163 variables, 489/494 constraints. Problems are: Problem set: 0 solved, 673 unsolved
[2024-06-02 20:54:15] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 3 ms to minimize.
[2024-06-02 20:54:15] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-06-02 20:54:16] [INFO ] Deduced a trap composed of 188 places in 80 ms of which 2 ms to minimize.
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 1163/1163 variables, and 497 constraints, problems are : Problem set: 0 solved, 673 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 673/673 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 673 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 673 unsolved
[2024-06-02 20:54:31] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:54:31] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 5 (OVERLAPS) 674/1163 variables, 489/499 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 673/1172 constraints. Problems are: Problem set: 0 solved, 673 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 1172 constraints, problems are : Problem set: 0 solved, 673 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 673/673 constraints, Known Traps: 5/5 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 673 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Finished structural reductions in LTL mode , in 1 iterations and 60591 ms. Remains : 489/489 places, 674/674 transitions.
Treatment of property CO4-PT-19-LTLFireability-00 finished in 202606 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&&((p2&&F(p3))||p1)))))'
Support contains 6 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 508 transition count 700
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 508 transition count 700
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 499 transition count 690
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 499 transition count 690
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 499 transition count 687
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 493 transition count 680
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 493 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 493 transition count 679
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 489 transition count 675
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 489 transition count 675
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 489 transition count 673
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 488 transition count 672
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 488 transition count 672
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 487 transition count 671
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 487 transition count 671
Applied a total of 78 rules in 43 ms. Remains 487 /523 variables (removed 36) and now considering 671/715 (removed 44) transitions.
// Phase 1: matrix 671 rows 487 cols
[2024-06-02 20:54:52] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 20:54:52] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-02 20:54:52] [INFO ] Invariant cache hit.
[2024-06-02 20:54:52] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2024-06-02 20:54:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-02 20:55:06] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:55:06] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (OVERLAPS) 671/1158 variables, 487/494 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-02 20:55:17] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 2 ms to minimize.
[2024-06-02 20:55:17] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 3 ms to minimize.
[2024-06-02 20:55:18] [INFO ] Deduced a trap composed of 188 places in 79 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1158/1158 variables, and 497 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (OVERLAPS) 671/1158 variables, 487/497 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1158 variables, 670/1167 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1158/1158 variables, and 1167 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 5/5 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Starting structural reductions in LTL mode, iteration 1 : 487/523 places, 671/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60691 ms. Remains : 487/523 places, 671/715 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3)]
Running random walk in product with property : CO4-PT-19-LTLFireability-01
Product exploration explored 100000 steps with 1133 reset in 166 ms.
Product exploration explored 100000 steps with 79 reset in 141 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 960 edges and 487 vertex of which 482 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (OR (AND p0 p1) (AND p0 p2))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 100 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3)]
RANDOM walk for 40000 steps (825 resets) in 282 ms. (141 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (138 resets) in 57 ms. (689 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (142 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (131 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
[2024-06-02 20:55:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/41 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 120/161 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 299/460 variables, 101/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 411/871 variables, 180/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/871 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 209/1080 variables, 117/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 56/1136 variables, 35/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1136 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 17/1153 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1153 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 5/1158 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1158 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1158 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1158/1158 variables, and 492 constraints, problems are : Problem set: 0 solved, 3 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 487/487 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/41 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 120/161 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 299/460 variables, 101/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 411/871 variables, 180/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/871 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 209/1080 variables, 117/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 56/1136 variables, 35/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1136 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 17/1153 variables, 9/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1153 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 5/1158 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1158 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1158 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1158/1158 variables, and 495 constraints, problems are : Problem set: 0 solved, 3 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1189ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 153 ms.
Support contains 6 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 671/671 transitions.
Graph (trivial) has 516 edges and 487 vertex of which 3 / 487 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 957 edges and 485 vertex of which 479 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 216 rules applied. Total rules applied 218 place count 479 transition count 441
Reduce places removed 206 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 208 rules applied. Total rules applied 426 place count 273 transition count 439
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 429 place count 272 transition count 437
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 431 place count 270 transition count 437
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 431 place count 270 transition count 387
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 531 place count 220 transition count 387
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 533 place count 218 transition count 385
Iterating global reduction 4 with 2 rules applied. Total rules applied 535 place count 218 transition count 385
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 537 place count 218 transition count 383
Performed 76 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 689 place count 142 transition count 284
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 700 place count 142 transition count 273
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 708 place count 134 transition count 260
Iterating global reduction 6 with 8 rules applied. Total rules applied 716 place count 134 transition count 260
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 722 place count 131 transition count 257
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 723 place count 131 transition count 256
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 724 place count 130 transition count 254
Iterating global reduction 7 with 1 rules applied. Total rules applied 725 place count 130 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 726 place count 130 transition count 253
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 76 rules applied. Total rules applied 802 place count 92 transition count 291
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 8 with 36 rules applied. Total rules applied 838 place count 92 transition count 255
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 865 place count 65 transition count 158
Iterating global reduction 9 with 27 rules applied. Total rules applied 892 place count 65 transition count 158
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 911 place count 65 transition count 139
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 916 place count 60 transition count 116
Iterating global reduction 10 with 5 rules applied. Total rules applied 921 place count 60 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 924 place count 60 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 926 place count 59 transition count 128
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 929 place count 59 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 12 with 9 rules applied. Total rules applied 938 place count 59 transition count 116
Free-agglomeration rule applied 16 times.
Iterating global reduction 12 with 16 rules applied. Total rules applied 954 place count 59 transition count 100
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 18 rules applied. Total rules applied 972 place count 43 transition count 98
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 973 place count 43 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 974 place count 42 transition count 97
Applied a total of 974 rules in 127 ms. Remains 42 /487 variables (removed 445) and now considering 97/671 (removed 574) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 42/487 places, 97/671 transitions.
RANDOM walk for 40000 steps (8 resets) in 284 ms. (140 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6194 steps, run visited all 1 properties in 17 ms. (steps per millisecond=364 )
Probabilistic random walk after 6194 steps, saw 1541 distinct states, run finished after 20 ms. (steps per millisecond=309 ) properties seen :1
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (OR (AND p0 p1) (AND p0 p2))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 (OR p1 p2)))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (NOT p3))]
Property proved to be false thanks to negative knowledge :(F (NOT (AND p0 (OR p1 p2))))
Knowledge based reduction with 15 factoid took 130 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-19-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-19-LTLFireability-01 finished in 63483 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) U G(p1)) U X((!p1||X(X(p2))))))'
Support contains 3 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 510 transition count 702
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 510 transition count 702
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 503 transition count 694
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 503 transition count 694
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 503 transition count 691
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 498 transition count 686
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 498 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 498 transition count 685
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 494 transition count 681
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 494 transition count 681
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 494 transition count 679
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 493 transition count 678
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 493 transition count 678
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 492 transition count 677
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 492 transition count 677
Applied a total of 68 rules in 97 ms. Remains 492 /523 variables (removed 31) and now considering 677/715 (removed 38) transitions.
// Phase 1: matrix 677 rows 492 cols
[2024-06-02 20:55:55] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 20:55:56] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-02 20:55:56] [INFO ] Invariant cache hit.
[2024-06-02 20:55:56] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 676 sub problems to find dead transitions.
[2024-06-02 20:55:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/492 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (OVERLAPS) 677/1169 variables, 492/497 constraints. Problems are: Problem set: 0 solved, 676 unsolved
[2024-06-02 20:56:20] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 3 ms to minimize.
[2024-06-02 20:56:21] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 3 ms to minimize.
[2024-06-02 20:56:22] [INFO ] Deduced a trap composed of 190 places in 82 ms of which 1 ms to minimize.
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 1169/1169 variables, and 500 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 492/492 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 676 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/492 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 677/1169 variables, 492/500 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1169 variables, 676/1176 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1169/1169 variables, and 1176 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 492/492 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 3/3 constraints]
After SMT, in 60217ms problems are : Problem set: 0 solved, 676 unsolved
Search for dead transitions found 0 dead transitions in 60227ms
Starting structural reductions in LTL mode, iteration 1 : 492/523 places, 677/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60920 ms. Remains : 492/523 places, 677/715 transitions.
Stuttering acceptance computed with spot in 882 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p2)), false, (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (NOT p2), true, (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-19-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 971 edges and 492 vertex of which 487 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 17 ms. Reduced automaton from 20 states, 45 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-19-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-19-LTLFireability-02 finished in 62182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||G(p1)))'
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 508 transition count 700
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 508 transition count 700
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 500 transition count 691
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 500 transition count 691
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 500 transition count 689
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 494 transition count 682
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 494 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 494 transition count 681
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 490 transition count 677
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 490 transition count 677
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 490 transition count 675
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 489 transition count 674
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 489 transition count 674
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 488 transition count 673
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 488 transition count 673
Applied a total of 75 rules in 97 ms. Remains 488 /523 variables (removed 35) and now considering 673/715 (removed 42) transitions.
// Phase 1: matrix 673 rows 488 cols
[2024-06-02 20:56:57] [INFO ] Computed 5 invariants in 8 ms
[2024-06-02 20:56:58] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 20:56:58] [INFO ] Invariant cache hit.
[2024-06-02 20:56:58] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 672 sub problems to find dead transitions.
[2024-06-02 20:56:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 20:57:12] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:57:12] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1161 variables, 488/495 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 20:57:23] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 2 ms to minimize.
[2024-06-02 20:57:23] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-06-02 20:57:24] [INFO ] Deduced a trap composed of 187 places in 78 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1161/1161 variables, and 498 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1161 variables, 488/498 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 672/1170 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 20:57:44] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1161/1161 variables, and 1171 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 6/6 constraints]
After SMT, in 60214ms problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Starting structural reductions in LTL mode, iteration 1 : 488/523 places, 673/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60714 ms. Remains : 488/523 places, 673/715 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-19-LTLFireability-03
Product exploration explored 100000 steps with 604 reset in 109 ms.
Product exploration explored 100000 steps with 188 reset in 92 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 962 edges and 488 vertex of which 483 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 93 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (464 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (136 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (144 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (142 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (141 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 414202 steps, run visited all 4 properties in 1736 ms. (steps per millisecond=238 )
Probabilistic random walk after 414202 steps, saw 86235 distinct states, run finished after 1736 ms. (steps per millisecond=238 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 6 factoid took 165 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 673/673 transitions.
Applied a total of 0 rules in 10 ms. Remains 488 /488 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2024-06-02 20:58:01] [INFO ] Invariant cache hit.
[2024-06-02 20:58:01] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 20:58:01] [INFO ] Invariant cache hit.
[2024-06-02 20:58:01] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 672 sub problems to find dead transitions.
[2024-06-02 20:58:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 20:58:16] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-02 20:58:16] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1161 variables, 488/495 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 20:58:27] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 3 ms to minimize.
[2024-06-02 20:58:27] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 6 ms to minimize.
[2024-06-02 20:58:28] [INFO ] Deduced a trap composed of 187 places in 79 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1161/1161 variables, and 498 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1161 variables, 488/498 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 672/1170 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 20:58:47] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
(s236 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(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 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0timeout
)
(s237 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1161/1161 variables, and 1171 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 6/6 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 60248ms
Finished structural reductions in LTL mode , in 1 iterations and 60613 ms. Remains : 488/488 places, 673/673 transitions.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 962 edges and 488 vertex of which 483 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (468 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (140 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (140 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (125 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (147 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 414202 steps, run visited all 4 properties in 1681 ms. (steps per millisecond=246 )
Probabilistic random walk after 414202 steps, saw 86235 distinct states, run finished after 1681 ms. (steps per millisecond=246 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 160 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 113 reset in 98 ms.
Product exploration explored 100000 steps with 193 reset in 141 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 673/673 transitions.
Graph (trivial) has 526 edges and 488 vertex of which 3 / 488 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 960 edges and 486 vertex of which 481 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 201 rules applied. Total rules applied 203 place count 481 transition count 665
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 204 place count 481 transition count 664
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 204 place count 481 transition count 667
Deduced a syphon composed of 206 places in 1 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 209 place count 481 transition count 667
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 268 place count 422 transition count 608
Deduced a syphon composed of 147 places in 1 ms
Iterating global reduction 2 with 59 rules applied. Total rules applied 327 place count 422 transition count 608
Performed 107 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 254 places in 1 ms
Iterating global reduction 2 with 107 rules applied. Total rules applied 434 place count 422 transition count 664
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 451 place count 422 transition count 647
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 547 place count 326 transition count 546
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 96 rules applied. Total rules applied 643 place count 326 transition count 546
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 644 place count 325 transition count 545
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 645 place count 325 transition count 545
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 646 place count 325 transition count 545
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 647 place count 325 transition count 544
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 649 place count 323 transition count 542
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 651 place count 323 transition count 542
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 652 place count 323 transition count 542
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 654 place count 321 transition count 539
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 656 place count 321 transition count 539
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 658 place count 319 transition count 536
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 660 place count 319 transition count 536
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 661 place count 319 transition count 535
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 662 place count 318 transition count 534
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 663 place count 318 transition count 534
Performed 62 Post agglomeration using F-continuation condition with reduction of 29 identical transitions.
Deduced a syphon composed of 224 places in 1 ms
Iterating global reduction 5 with 62 rules applied. Total rules applied 725 place count 318 transition count 839
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 5 with 60 rules applied. Total rules applied 785 place count 318 transition count 779
Discarding 105 places :
Symmetric choice reduction at 6 with 105 rule applications. Total rules 890 place count 213 transition count 492
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 6 with 105 rules applied. Total rules applied 995 place count 213 transition count 492
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 1030 place count 213 transition count 457
Discarding 66 places :
Symmetric choice reduction at 7 with 66 rule applications. Total rules 1096 place count 147 transition count 329
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 7 with 66 rules applied. Total rules applied 1162 place count 147 transition count 329
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1170 place count 147 transition count 321
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1181 place count 136 transition count 300
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 8 with 11 rules applied. Total rules applied 1192 place count 136 transition count 300
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1195 place count 136 transition count 353
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1205 place count 136 transition count 343
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1210 place count 131 transition count 321
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 5 rules applied. Total rules applied 1215 place count 131 transition count 321
Deduced a syphon composed of 74 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 9 with 49 rules applied. Total rules applied 1264 place count 131 transition count 272
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1265 place count 130 transition count 271
Deduced a syphon composed of 73 places in 1 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1266 place count 130 transition count 271
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1267 place count 130 transition count 292
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1269 place count 128 transition count 276
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1271 place count 128 transition count 276
Deduced a syphon composed of 72 places in 0 ms
Applied a total of 1271 rules in 166 ms. Remains 128 /488 variables (removed 360) and now considering 276/673 (removed 397) transitions.
[2024-06-02 20:59:05] [INFO ] Redundant transitions in 12 ms returned []
Running 275 sub problems to find dead transitions.
[2024-06-02 20:59:05] [INFO ] Flow matrix only has 264 transitions (discarded 12 similar events)
// Phase 1: matrix 264 rows 128 cols
[2024-06-02 20:59:05] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:59:05] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 20:59:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-02 20:59:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 20:59:07] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-02 20:59:07] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-06-02 20:59:07] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 5/10 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 260 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
At refinement iteration 4 (OVERLAPS) 263/391 variables, 128/138 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 44/182 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/182 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/183 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/183 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/183 constraints. Problems are: Problem set: 162 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 183 constraints, problems are : Problem set: 162 solved, 113 unsolved in 6384 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 128/128 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 162 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 16/71 variables, 5/5 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 5/10 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 247/318 variables, 71/81 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 44/125 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 113/238 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/238 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 73/391 variables, 57/295 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/295 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/296 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/296 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 12 (OVERLAPS) 0/392 variables, 0/296 constraints. Problems are: Problem set: 162 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 296 constraints, problems are : Problem set: 162 solved, 113 unsolved in 5407 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 128/128 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 113/275 constraints, Known Traps: 5/5 constraints]
After SMT, in 11880ms problems are : Problem set: 162 solved, 113 unsolved
Search for dead transitions found 162 dead transitions in 11885ms
Found 162 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 162 transitions
Dead transitions reduction (with SMT) removed 162 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 128/488 places, 114/673 transitions.
Graph (complete) has 234 edges and 128 vertex of which 56 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.1 ms
Discarding 72 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 134
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 56 transition count 127
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 9 rules in 12 ms. Remains 56 /128 variables (removed 72) and now considering 127/114 (removed -13) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/488 places, 127/673 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12090 ms. Remains : 56/488 places, 127/673 transitions.
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 673/673 transitions.
Applied a total of 0 rules in 14 ms. Remains 488 /488 variables (removed 0) and now considering 673/673 (removed 0) transitions.
// Phase 1: matrix 673 rows 488 cols
[2024-06-02 20:59:17] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 20:59:17] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 20:59:17] [INFO ] Invariant cache hit.
[2024-06-02 20:59:17] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 672 sub problems to find dead transitions.
[2024-06-02 20:59:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 20:59:31] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:59:31] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1161 variables, 488/495 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 20:59:42] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 3 ms to minimize.
[2024-06-02 20:59:42] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-06-02 20:59:43] [INFO ] Deduced a trap composed of 187 places in 80 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)timeout

(s364 0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1161/1161 variables, and 498 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1161 variables, 488/498 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 672/1170 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 21:00:03] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1161/1161 variables, and 1171 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 6/6 constraints]
After SMT, in 60246ms problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Finished structural reductions in LTL mode , in 1 iterations and 60656 ms. Remains : 488/488 places, 673/673 transitions.
Treatment of property CO4-PT-19-LTLFireability-03 finished in 200427 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 U p1))))'
Support contains 6 out of 523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Graph (trivial) has 554 edges and 523 vertex of which 3 / 523 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1015 edges and 521 vertex of which 516 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 218 place count 515 transition count 490
Reduce places removed 216 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 217 rules applied. Total rules applied 435 place count 299 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 436 place count 298 transition count 489
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 436 place count 298 transition count 445
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 524 place count 254 transition count 445
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 529 place count 249 transition count 440
Iterating global reduction 3 with 5 rules applied. Total rules applied 534 place count 249 transition count 440
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 534 place count 249 transition count 436
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 542 place count 245 transition count 436
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 545 place count 242 transition count 431
Iterating global reduction 3 with 3 rules applied. Total rules applied 548 place count 242 transition count 431
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 550 place count 242 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 551 place count 241 transition count 429
Performed 91 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 5 with 182 rules applied. Total rules applied 733 place count 150 transition count 310
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 747 place count 150 transition count 296
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 756 place count 141 transition count 282
Iterating global reduction 6 with 9 rules applied. Total rules applied 765 place count 141 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 766 place count 141 transition count 281
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 768 place count 140 transition count 280
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 769 place count 139 transition count 278
Iterating global reduction 7 with 1 rules applied. Total rules applied 770 place count 139 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 771 place count 139 transition count 277
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 80 rules applied. Total rules applied 851 place count 99 transition count 318
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 871 place count 99 transition count 298
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 899 place count 71 transition count 186
Iterating global reduction 9 with 28 rules applied. Total rules applied 927 place count 71 transition count 186
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 944 place count 71 transition count 169
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 950 place count 65 transition count 137
Iterating global reduction 10 with 6 rules applied. Total rules applied 956 place count 65 transition count 137
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 961 place count 65 transition count 132
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 969 place count 61 transition count 177
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 11 with 44 rules applied. Total rules applied 1013 place count 61 transition count 133
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1014 place count 61 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1015 place count 60 transition count 132
Applied a total of 1015 rules in 66 ms. Remains 60 /523 variables (removed 463) and now considering 132/715 (removed 583) transitions.
[2024-06-02 21:00:18] [INFO ] Flow matrix only has 101 transitions (discarded 31 similar events)
// Phase 1: matrix 101 rows 60 cols
[2024-06-02 21:00:18] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:00:18] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 21:00:18] [INFO ] Flow matrix only has 101 transitions (discarded 31 similar events)
[2024-06-02 21:00:18] [INFO ] Invariant cache hit.
[2024-06-02 21:00:18] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 21:00:18] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-06-02 21:00:18] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-02 21:00:18] [INFO ] Flow matrix only has 101 transitions (discarded 31 similar events)
[2024-06-02 21:00:18] [INFO ] Invariant cache hit.
[2024-06-02 21:00:18] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 2/60 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 100/160 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 11/76 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 1/161 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/161 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 77 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2242 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 2/60 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 100/160 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 11/76 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 120/196 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/161 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 197 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2627 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 4915ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 4917ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/523 places, 132/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5097 ms. Remains : 60/523 places, 132/715 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-19-LTLFireability-04
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA CO4-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-04 finished in 5215 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)&&(p1||F(p2)||X(F(p3))))))'
Support contains 4 out of 523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Graph (trivial) has 559 edges and 523 vertex of which 3 / 523 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1015 edges and 521 vertex of which 516 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 220 place count 515 transition count 488
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 438 place count 297 transition count 488
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 438 place count 297 transition count 444
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 526 place count 253 transition count 444
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 531 place count 248 transition count 439
Iterating global reduction 2 with 5 rules applied. Total rules applied 536 place count 248 transition count 439
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 536 place count 248 transition count 435
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 544 place count 244 transition count 435
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 547 place count 241 transition count 430
Iterating global reduction 2 with 3 rules applied. Total rules applied 550 place count 241 transition count 430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 552 place count 241 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 553 place count 240 transition count 428
Performed 93 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 4 with 186 rules applied. Total rules applied 739 place count 147 transition count 307
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 752 place count 147 transition count 294
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 760 place count 139 transition count 282
Iterating global reduction 5 with 8 rules applied. Total rules applied 768 place count 139 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 769 place count 139 transition count 281
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 6 with 2 rules applied. Total rules applied 771 place count 138 transition count 280
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 772 place count 137 transition count 278
Iterating global reduction 6 with 1 rules applied. Total rules applied 773 place count 137 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 774 place count 137 transition count 277
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 856 place count 96 transition count 325
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 876 place count 96 transition count 305
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 904 place count 68 transition count 193
Iterating global reduction 8 with 28 rules applied. Total rules applied 932 place count 68 transition count 193
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 950 place count 68 transition count 175
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 957 place count 61 transition count 137
Iterating global reduction 9 with 7 rules applied. Total rules applied 964 place count 61 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 968 place count 61 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 972 place count 59 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 10 with 31 rules applied. Total rules applied 1003 place count 59 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1005 place count 58 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1007 place count 56 transition count 125
Applied a total of 1007 rules in 54 ms. Remains 56 /523 variables (removed 467) and now considering 125/715 (removed 590) transitions.
[2024-06-02 21:00:23] [INFO ] Flow matrix only has 113 transitions (discarded 12 similar events)
// Phase 1: matrix 113 rows 56 cols
[2024-06-02 21:00:23] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:00:23] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 21:00:23] [INFO ] Flow matrix only has 113 transitions (discarded 12 similar events)
[2024-06-02 21:00:23] [INFO ] Invariant cache hit.
[2024-06-02 21:00:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 21:00:23] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-06-02 21:00:23] [INFO ] Redundant transitions in 0 ms returned []
Running 104 sub problems to find dead transitions.
[2024-06-02 21:00:23] [INFO ] Flow matrix only has 113 transitions (discarded 12 similar events)
[2024-06-02 21:00:23] [INFO ] Invariant cache hit.
[2024-06-02 21:00:23] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 112/168 variables, 56/61 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 1/169 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 65 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1525 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 56/56 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 112/168 variables, 56/61 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 104/168 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 1/169 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 169 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 56/56 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 3582ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 3583ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/523 places, 125/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3748 ms. Remains : 56/523 places, 125/715 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : CO4-PT-19-LTLFireability-05
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-19-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-05 finished in 3908 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 (G(p0)||(p0&&G(p1)))))'
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Graph (trivial) has 559 edges and 523 vertex of which 3 / 523 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1015 edges and 521 vertex of which 516 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 223 place count 515 transition count 485
Reduce places removed 221 places and 0 transitions.
Iterating post reduction 1 with 221 rules applied. Total rules applied 444 place count 294 transition count 485
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 444 place count 294 transition count 441
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 532 place count 250 transition count 441
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 537 place count 245 transition count 436
Iterating global reduction 2 with 5 rules applied. Total rules applied 542 place count 245 transition count 436
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 542 place count 245 transition count 432
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 550 place count 241 transition count 432
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 553 place count 238 transition count 427
Iterating global reduction 2 with 3 rules applied. Total rules applied 556 place count 238 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 558 place count 238 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 559 place count 237 transition count 425
Performed 92 Post agglomeration using F-continuation condition with reduction of 25 identical transitions.
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 743 place count 145 transition count 308
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 758 place count 145 transition count 293
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 767 place count 136 transition count 279
Iterating global reduction 5 with 9 rules applied. Total rules applied 776 place count 136 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 777 place count 136 transition count 278
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 6 with 2 rules applied. Total rules applied 779 place count 135 transition count 277
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 780 place count 134 transition count 275
Iterating global reduction 6 with 1 rules applied. Total rules applied 781 place count 134 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 782 place count 134 transition count 274
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 864 place count 93 transition count 320
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 885 place count 93 transition count 299
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 913 place count 65 transition count 187
Iterating global reduction 8 with 28 rules applied. Total rules applied 941 place count 65 transition count 187
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 960 place count 65 transition count 168
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 967 place count 58 transition count 130
Iterating global reduction 9 with 7 rules applied. Total rules applied 974 place count 58 transition count 130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 979 place count 58 transition count 125
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 987 place count 54 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 10 with 40 rules applied. Total rules applied 1027 place count 54 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1029 place count 52 transition count 124
Applied a total of 1029 rules in 50 ms. Remains 52 /523 variables (removed 471) and now considering 124/715 (removed 591) transitions.
[2024-06-02 21:00:27] [INFO ] Flow matrix only has 101 transitions (discarded 23 similar events)
// Phase 1: matrix 101 rows 52 cols
[2024-06-02 21:00:27] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:00:27] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-02 21:00:27] [INFO ] Flow matrix only has 101 transitions (discarded 23 similar events)
[2024-06-02 21:00:27] [INFO ] Invariant cache hit.
[2024-06-02 21:00:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:00:27] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-06-02 21:00:27] [INFO ] Redundant transitions in 1 ms returned []
Running 104 sub problems to find dead transitions.
[2024-06-02 21:00:27] [INFO ] Flow matrix only has 101 transitions (discarded 23 similar events)
[2024-06-02 21:00:27] [INFO ] Invariant cache hit.
[2024-06-02 21:00:27] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 100/152 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 1/153 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/153 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 62 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1460 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 52/52 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 100/152 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 104/165 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 1/153 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 166 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1859 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 52/52 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 3357ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 3358ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/523 places, 124/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3506 ms. Remains : 52/523 places, 124/715 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-19-LTLFireability-07
Product exploration explored 100000 steps with 393 reset in 178 ms.
Product exploration explored 100000 steps with 137 reset in 182 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 111 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3269 resets) in 404 ms. (98 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (280 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2024-06-02 21:00:31] [INFO ] Flow matrix only has 101 transitions (discarded 23 similar events)
[2024-06-02 21:00:31] [INFO ] Invariant cache hit.
[2024-06-02 21:00:31] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/36 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/116 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/118 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/128 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/152 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/153 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/153 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/153 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 62 constraints, problems are : Problem set: 0 solved, 1 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 52/52 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/36 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 80/116 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/118 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/128 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 24/152 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/153 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/153 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/153 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 52/52 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p0)))
Knowledge based reduction with 13 factoid took 133 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-19-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-19-LTLFireability-07 finished in 4649 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 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 508 transition count 700
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 508 transition count 700
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 500 transition count 692
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 500 transition count 692
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 500 transition count 689
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 494 transition count 682
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 494 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 494 transition count 681
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 490 transition count 677
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 490 transition count 677
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 490 transition count 675
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 489 transition count 674
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 489 transition count 674
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 488 transition count 673
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 488 transition count 673
Applied a total of 76 rules in 47 ms. Remains 488 /523 variables (removed 35) and now considering 673/715 (removed 42) transitions.
// Phase 1: matrix 673 rows 488 cols
[2024-06-02 21:00:32] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 21:00:32] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 21:00:32] [INFO ] Invariant cache hit.
[2024-06-02 21:00:32] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 672 sub problems to find dead transitions.
[2024-06-02 21:00:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 21:00:46] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:00:46] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1161 variables, 488/495 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 21:00:56] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 3 ms to minimize.
[2024-06-02 21:00:57] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:00:57] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:00:58] [INFO ] Deduced a trap composed of 187 places in 81 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1161/1161 variables, and 499 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1161 variables, 488/499 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 672/1171 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 21:01:17] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1161/1161 variables, and 1172 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 7/7 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Starting structural reductions in LTL mode, iteration 1 : 488/523 places, 673/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60705 ms. Remains : 488/523 places, 673/715 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-19-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-10 finished in 60792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p0)))))'
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 508 transition count 700
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 508 transition count 700
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 499 transition count 690
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 499 transition count 690
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 499 transition count 687
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 493 transition count 680
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 493 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 493 transition count 679
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 489 transition count 675
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 489 transition count 675
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 489 transition count 673
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 488 transition count 672
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 488 transition count 672
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 487 transition count 671
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 487 transition count 671
Applied a total of 78 rules in 49 ms. Remains 487 /523 variables (removed 36) and now considering 671/715 (removed 44) transitions.
// Phase 1: matrix 671 rows 487 cols
[2024-06-02 21:01:32] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 21:01:33] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-02 21:01:33] [INFO ] Invariant cache hit.
[2024-06-02 21:01:33] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2024-06-02 21:01:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-02 21:01:47] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:01:47] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (OVERLAPS) 671/1158 variables, 487/494 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-02 21:01:58] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-06-02 21:01:58] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-06-02 21:01:59] [INFO ] Deduced a trap composed of 188 places in 79 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1158/1158 variables, and 497 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (OVERLAPS) 671/1158 variables, 487/497 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1158 variables, 670/1167 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1158/1158 variables, and 1167 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 5/5 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Starting structural reductions in LTL mode, iteration 1 : 487/523 places, 671/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60721 ms. Remains : 487/523 places, 671/715 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CO4-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-11 finished in 60860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U G(p1)))))'
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 509 transition count 701
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 509 transition count 701
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 502 transition count 693
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 502 transition count 693
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 502 transition count 690
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 498 transition count 685
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 498 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 498 transition count 684
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 496 transition count 682
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 496 transition count 682
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 496 transition count 680
Applied a total of 60 rules in 39 ms. Remains 496 /523 variables (removed 27) and now considering 680/715 (removed 35) transitions.
// Phase 1: matrix 680 rows 496 cols
[2024-06-02 21:02:33] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 21:02:33] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 21:02:33] [INFO ] Invariant cache hit.
[2024-06-02 21:02:34] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 679 sub problems to find dead transitions.
[2024-06-02 21:02:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (OVERLAPS) 680/1176 variables, 496/501 constraints. Problems are: Problem set: 0 solved, 679 unsolved
[2024-06-02 21:02:58] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2024-06-02 21:02:58] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-06-02 21:02:59] [INFO ] Deduced a trap composed of 193 places in 75 ms of which 2 ms to minimize.
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 1176/1176 variables, and 504 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 679 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 680/1176 variables, 496/504 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1176 variables, 679/1183 constraints. Problems are: Problem set: 0 solved, 679 unsolved
[2024-06-02 21:03:19] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1176/1176 variables, and 1184 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 4/4 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 679 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Starting structural reductions in LTL mode, iteration 1 : 496/523 places, 680/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60661 ms. Remains : 496/523 places, 680/715 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CO4-PT-19-LTLFireability-14
Stuttering criterion allowed to conclude after 63 steps with 1 reset in 0 ms.
FORMULA CO4-PT-19-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-14 finished in 60875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
Support contains 4 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 509 transition count 701
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 509 transition count 701
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 501 transition count 692
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 501 transition count 692
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 501 transition count 690
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 496 transition count 684
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 496 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 496 transition count 683
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 493 transition count 680
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 493 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 493 transition count 679
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 492 transition count 678
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 492 transition count 678
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 491 transition count 677
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 491 transition count 677
Applied a total of 68 rules in 53 ms. Remains 491 /523 variables (removed 32) and now considering 677/715 (removed 38) transitions.
// Phase 1: matrix 677 rows 491 cols
[2024-06-02 21:03:34] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 21:03:34] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 21:03:34] [INFO ] Invariant cache hit.
[2024-06-02 21:03:35] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 676 sub problems to find dead transitions.
[2024-06-02 21:03:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
[2024-06-02 21:03:49] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-02 21:03:49] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 677/1168 variables, 491/498 constraints. Problems are: Problem set: 0 solved, 676 unsolved
[2024-06-02 21:04:00] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-06-02 21:04:00] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-06-02 21:04:01] [INFO ] Deduced a trap composed of 187 places in 82 ms of which 2 ms to minimize.
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 1168/1168 variables, and 501 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 676 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 677/1168 variables, 491/501 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 676/1177 constraints. Problems are: Problem set: 0 solved, 676 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 1168/1168 variables, and 1177 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 5/5 constraints]
After SMT, in 60216ms problems are : Problem set: 0 solved, 676 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Starting structural reductions in LTL mode, iteration 1 : 491/523 places, 677/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60658 ms. Remains : 491/523 places, 677/715 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-19-LTLFireability-15
Product exploration explored 100000 steps with 3013 reset in 190 ms.
Product exploration explored 100000 steps with 3010 reset in 190 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 966 edges and 491 vertex of which 486 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 125 steps (0 resets) in 4 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2024-06-02 21:04:36] [INFO ] Invariant cache hit.
[2024-06-02 21:04:36] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 21:04:36] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2024-06-02 21:04:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:04:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 21:04:37] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2024-06-02 21:04:37] [INFO ] Computed and/alt/rep : 657/1165/657 causal constraints (skipped 19 transitions) in 33 ms.
[2024-06-02 21:04:42] [INFO ] Added : 592 causal constraints over 119 iterations in 5100 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 491 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 677/677 transitions.
Applied a total of 0 rules in 9 ms. Remains 491 /491 variables (removed 0) and now considering 677/677 (removed 0) transitions.
[2024-06-02 21:04:42] [INFO ] Invariant cache hit.
[2024-06-02 21:04:42] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 21:04:42] [INFO ] Invariant cache hit.
[2024-06-02 21:04:42] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 676 sub problems to find dead transitions.
[2024-06-02 21:04:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
[2024-06-02 21:04:56] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-02 21:04:56] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 677/1168 variables, 491/498 constraints. Problems are: Problem set: 0 solved, 676 unsolved
[2024-06-02 21:05:07] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-06-02 21:05:07] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-06-02 21:05:08] [INFO ] Deduced a trap composed of 187 places in 83 ms of which 1 ms to minimize.
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 1168/1168 variables, and 501 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 676 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 677/1168 variables, 491/501 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 676/1177 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1168/1168 variables, and 1177 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 5/5 constraints]
After SMT, in 60204ms problems are : Problem set: 0 solved, 676 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Finished structural reductions in LTL mode , in 1 iterations and 60581 ms. Remains : 491/491 places, 677/677 transitions.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 966 edges and 491 vertex of which 486 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 119 steps (0 resets) in 5 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 179 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2024-06-02 21:05:43] [INFO ] Invariant cache hit.
[2024-06-02 21:05:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 21:05:43] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2024-06-02 21:05:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:05:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:05:44] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2024-06-02 21:05:44] [INFO ] Computed and/alt/rep : 657/1165/657 causal constraints (skipped 19 transitions) in 33 ms.
[2024-06-02 21:05:49] [INFO ] Added : 592 causal constraints over 119 iterations in 4983 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3019 reset in 220 ms.
Product exploration explored 100000 steps with 3017 reset in 191 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 491 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 491/491 places, 677/677 transitions.
Graph (trivial) has 526 edges and 491 vertex of which 3 / 491 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 964 edges and 489 vertex of which 484 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 204 rules applied. Total rules applied 206 place count 484 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 207 place count 484 transition count 668
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 207 place count 484 transition count 672
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 213 place count 484 transition count 672
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 274 place count 423 transition count 611
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 335 place count 423 transition count 611
Performed 105 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 2 with 105 rules applied. Total rules applied 440 place count 423 transition count 667
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 457 place count 423 transition count 650
Discarding 94 places :
Symmetric choice reduction at 3 with 94 rule applications. Total rules 551 place count 329 transition count 551
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 3 with 94 rules applied. Total rules applied 645 place count 329 transition count 551
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 646 place count 328 transition count 550
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 647 place count 328 transition count 550
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 648 place count 328 transition count 550
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 649 place count 328 transition count 549
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 651 place count 326 transition count 547
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 653 place count 326 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 654 place count 326 transition count 547
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 656 place count 324 transition count 544
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 658 place count 324 transition count 544
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 660 place count 322 transition count 541
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 662 place count 322 transition count 541
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 663 place count 322 transition count 540
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 664 place count 321 transition count 539
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 665 place count 321 transition count 539
Performed 63 Post agglomeration using F-continuation condition with reduction of 29 identical transitions.
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 63 rules applied. Total rules applied 728 place count 321 transition count 848
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 5 with 61 rules applied. Total rules applied 789 place count 321 transition count 787
Discarding 107 places :
Symmetric choice reduction at 6 with 107 rule applications. Total rules 896 place count 214 transition count 494
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 6 with 107 rules applied. Total rules applied 1003 place count 214 transition count 494
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 1038 place count 214 transition count 459
Discarding 66 places :
Symmetric choice reduction at 7 with 66 rule applications. Total rules 1104 place count 148 transition count 331
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 7 with 66 rules applied. Total rules applied 1170 place count 148 transition count 331
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1175 place count 148 transition count 326
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1186 place count 137 transition count 305
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 8 with 11 rules applied. Total rules applied 1197 place count 137 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1200 place count 137 transition count 358
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1210 place count 137 transition count 348
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1215 place count 132 transition count 326
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 9 with 5 rules applied. Total rules applied 1220 place count 132 transition count 326
Deduced a syphon composed of 75 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 9 with 36 rules applied. Total rules applied 1256 place count 132 transition count 290
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1257 place count 131 transition count 289
Deduced a syphon composed of 74 places in 1 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1258 place count 131 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1259 place count 131 transition count 313
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1261 place count 129 transition count 295
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1263 place count 129 transition count 295
Deduced a syphon composed of 73 places in 0 ms
Applied a total of 1263 rules in 82 ms. Remains 129 /491 variables (removed 362) and now considering 295/677 (removed 382) transitions.
[2024-06-02 21:05:50] [INFO ] Redundant transitions in 2 ms returned []
Running 294 sub problems to find dead transitions.
[2024-06-02 21:05:50] [INFO ] Flow matrix only has 286 transitions (discarded 9 similar events)
// Phase 1: matrix 286 rows 129 cols
[2024-06-02 21:05:50] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:05:50] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 21:05:51] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-02 21:05:51] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 21:05:51] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-02 21:05:51] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-02 21:05:51] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 5/10 constraints. Problems are: Problem set: 15 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 279 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
At refinement iteration 4 (OVERLAPS) 285/414 variables, 129/139 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 49/188 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/188 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 1/415 variables, 1/189 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/189 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/415 variables, 0/189 constraints. Problems are: Problem set: 173 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 189 constraints, problems are : Problem set: 173 solved, 121 unsolved in 6740 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 129/129 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 173 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 16/71 variables, 5/5 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 5/10 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 269/340 variables, 71/81 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 49/130 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 121/251 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/251 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 74/414 variables, 58/309 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/309 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 1/415 variables, 1/310 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 0/310 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/415 variables, 0/310 constraints. Problems are: Problem set: 173 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 310 constraints, problems are : Problem set: 173 solved, 121 unsolved in 5996 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 129/129 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 121/294 constraints, Known Traps: 5/5 constraints]
After SMT, in 12834ms problems are : Problem set: 173 solved, 121 unsolved
Search for dead transitions found 173 dead transitions in 12836ms
Found 173 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 173 transitions
Dead transitions reduction (with SMT) removed 173 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 129/491 places, 122/677 transitions.
Graph (complete) has 233 edges and 129 vertex of which 56 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.1 ms
Discarding 73 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 56 transition count 162
Deduced a syphon composed of 2 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 20 place count 56 transition count 145
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 20 rules in 17 ms. Remains 56 /129 variables (removed 73) and now considering 145/122 (removed -23) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/491 places, 145/677 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12941 ms. Remains : 56/491 places, 145/677 transitions.
Support contains 3 out of 491 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 677/677 transitions.
Applied a total of 0 rules in 7 ms. Remains 491 /491 variables (removed 0) and now considering 677/677 (removed 0) transitions.
// Phase 1: matrix 677 rows 491 cols
[2024-06-02 21:06:03] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 21:06:03] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-02 21:06:03] [INFO ] Invariant cache hit.
[2024-06-02 21:06:03] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 676 sub problems to find dead transitions.
[2024-06-02 21:06:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
[2024-06-02 21:06:17] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-06-02 21:06:17] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 677/1168 variables, 491/498 constraints. Problems are: Problem set: 0 solved, 676 unsolved
[2024-06-02 21:06:28] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-06-02 21:06:28] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-06-02 21:06:29] [INFO ] Deduced a trap composed of 187 places in 84 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1168/1168 variables, and 501 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 676 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 677/1168 variables, 491/501 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 676/1177 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1168/1168 variables, and 1177 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 5/5 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 676 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Finished structural reductions in LTL mode , in 1 iterations and 60620 ms. Remains : 491/491 places, 677/677 transitions.
Treatment of property CO4-PT-19-LTLFireability-15 finished in 209145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p1||X(p2)))&&p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||G(p1)))'
Found a Shortening insensitive property : CO4-PT-19-LTLFireability-03
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Graph (trivial) has 561 edges and 523 vertex of which 3 / 523 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1015 edges and 521 vertex of which 516 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 219 place count 515 transition count 489
Reduce places removed 217 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 218 rules applied. Total rules applied 437 place count 298 transition count 488
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 438 place count 297 transition count 488
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 438 place count 297 transition count 444
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 526 place count 253 transition count 444
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 531 place count 248 transition count 439
Iterating global reduction 3 with 5 rules applied. Total rules applied 536 place count 248 transition count 439
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 536 place count 248 transition count 435
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 544 place count 244 transition count 435
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 547 place count 241 transition count 430
Iterating global reduction 3 with 3 rules applied. Total rules applied 550 place count 241 transition count 430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 552 place count 241 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 553 place count 240 transition count 428
Performed 95 Post agglomeration using F-continuation condition with reduction of 29 identical transitions.
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 5 with 190 rules applied. Total rules applied 743 place count 145 transition count 304
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 756 place count 145 transition count 291
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 765 place count 136 transition count 277
Iterating global reduction 6 with 9 rules applied. Total rules applied 774 place count 136 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 775 place count 136 transition count 276
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 777 place count 135 transition count 275
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 778 place count 134 transition count 273
Iterating global reduction 7 with 1 rules applied. Total rules applied 779 place count 134 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 780 place count 134 transition count 272
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 8 with 82 rules applied. Total rules applied 862 place count 93 transition count 317
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 883 place count 93 transition count 296
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 911 place count 65 transition count 184
Iterating global reduction 9 with 28 rules applied. Total rules applied 939 place count 65 transition count 184
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 958 place count 65 transition count 165
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 964 place count 59 transition count 133
Iterating global reduction 10 with 6 rules applied. Total rules applied 970 place count 59 transition count 133
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 975 place count 59 transition count 128
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 981 place count 56 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 988 place count 56 transition count 156
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 990 place count 54 transition count 154
Applied a total of 990 rules in 42 ms. Remains 54 /523 variables (removed 469) and now considering 154/715 (removed 561) transitions.
[2024-06-02 21:07:04] [INFO ] Flow matrix only has 130 transitions (discarded 24 similar events)
// Phase 1: matrix 130 rows 54 cols
[2024-06-02 21:07:04] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 21:07:04] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-02 21:07:04] [INFO ] Flow matrix only has 130 transitions (discarded 24 similar events)
[2024-06-02 21:07:04] [INFO ] Invariant cache hit.
[2024-06-02 21:07:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 21:07:04] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-06-02 21:07:04] [INFO ] Flow matrix only has 130 transitions (discarded 24 similar events)
[2024-06-02 21:07:04] [INFO ] Invariant cache hit.
[2024-06-02 21:07:04] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 129/183 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 1/184 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 63 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2233 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 129/183 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 131/193 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 1/184 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 194 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2832 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 5121ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 5123ms
Starting structural reductions in LI_LTL mode, iteration 1 : 54/523 places, 154/715 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5293 ms. Remains : 54/523 places, 154/715 transitions.
Running random walk in product with property : CO4-PT-19-LTLFireability-03
Product exploration explored 100000 steps with 1423 reset in 71 ms.
Product exploration explored 100000 steps with 471 reset in 56 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 98 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 26527 steps (2231 resets) in 126 ms. (208 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 6 factoid took 188 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 154/154 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2024-06-02 21:07:10] [INFO ] Flow matrix only has 130 transitions (discarded 24 similar events)
[2024-06-02 21:07:10] [INFO ] Invariant cache hit.
[2024-06-02 21:07:10] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-02 21:07:10] [INFO ] Flow matrix only has 130 transitions (discarded 24 similar events)
[2024-06-02 21:07:10] [INFO ] Invariant cache hit.
[2024-06-02 21:07:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 21:07:10] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-06-02 21:07:10] [INFO ] Flow matrix only has 130 transitions (discarded 24 similar events)
[2024-06-02 21:07:10] [INFO ] Invariant cache hit.
[2024-06-02 21:07:10] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 129/183 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 1/184 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 63 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2119 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 129/183 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 131/193 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 1/184 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 194 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2855 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 5045ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 5047ms
Finished structural reductions in LTL mode , in 1 iterations and 5141 ms. Remains : 54/54 places, 154/154 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 27263 steps (2301 resets) in 275 ms. (98 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 55 reset in 62 ms.
Product exploration explored 100000 steps with 399 reset in 62 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 154/154 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 0 with 31 rules applied. Total rules applied 31 place count 54 transition count 123
Applied a total of 31 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 123/154 (removed 31) transitions.
[2024-06-02 21:07:16] [INFO ] Redundant transitions in 1 ms returned []
Running 103 sub problems to find dead transitions.
[2024-06-02 21:07:16] [INFO ] Flow matrix only has 100 transitions (discarded 23 similar events)
// Phase 1: matrix 100 rows 54 cols
[2024-06-02 21:07:16] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:07:16] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 99/153 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 1/154 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 63 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1590 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 99/153 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 103/165 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 1/154 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/154 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 166 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1891 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 3516ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 3519ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/54 places, 123/154 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3529 ms. Remains : 54/54 places, 123/154 transitions.
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 154/154 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2024-06-02 21:07:20] [INFO ] Flow matrix only has 130 transitions (discarded 24 similar events)
// Phase 1: matrix 130 rows 54 cols
[2024-06-02 21:07:20] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:07:20] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-02 21:07:20] [INFO ] Flow matrix only has 130 transitions (discarded 24 similar events)
[2024-06-02 21:07:20] [INFO ] Invariant cache hit.
[2024-06-02 21:07:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 21:07:20] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-06-02 21:07:20] [INFO ] Flow matrix only has 130 transitions (discarded 24 similar events)
[2024-06-02 21:07:20] [INFO ] Invariant cache hit.
[2024-06-02 21:07:20] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 129/183 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 1/184 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 63 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2211 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 129/183 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 131/193 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 1/184 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 194 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2878 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 5162ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 5164ms
Finished structural reductions in LTL mode , in 1 iterations and 5276 ms. Remains : 54/54 places, 154/154 transitions.
Treatment of property CO4-PT-19-LTLFireability-03 finished in 21856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
[2024-06-02 21:07:25] [INFO ] Flatten gal took : 42 ms
[2024-06-02 21:07:25] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-02 21:07:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 523 places, 715 transitions and 1834 arcs took 5 ms.
Total runtime 965666 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CO4-PT-19

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 523
TRANSITIONS: 715
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.011s, Sys 0.002s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2309
MODEL NAME: /home/mcc/execution/411/model
523 places, 715 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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

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="CO4-PT-19"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CO4-PT-19, 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 r549-tall-171734897900148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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