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.r550-tall-171734899000299.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is FireWire-PT-17, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000299
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K 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 25K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 153K 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 FireWire-PT-17-LTLCardinality-00
FORMULA_NAME FireWire-PT-17-LTLCardinality-01
FORMULA_NAME FireWire-PT-17-LTLCardinality-02
FORMULA_NAME FireWire-PT-17-LTLCardinality-03
FORMULA_NAME FireWire-PT-17-LTLCardinality-04
FORMULA_NAME FireWire-PT-17-LTLCardinality-05
FORMULA_NAME FireWire-PT-17-LTLCardinality-06
FORMULA_NAME FireWire-PT-17-LTLCardinality-07
FORMULA_NAME FireWire-PT-17-LTLCardinality-08
FORMULA_NAME FireWire-PT-17-LTLCardinality-09
FORMULA_NAME FireWire-PT-17-LTLCardinality-10
FORMULA_NAME FireWire-PT-17-LTLCardinality-11
FORMULA_NAME FireWire-PT-17-LTLCardinality-12
FORMULA_NAME FireWire-PT-17-LTLCardinality-13
FORMULA_NAME FireWire-PT-17-LTLCardinality-14
FORMULA_NAME FireWire-PT-17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717368788194

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 22:53:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:53:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:53:09] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-06-02 22:53:09] [INFO ] Transformed 428 places.
[2024-06-02 22:53:09] [INFO ] Transformed 656 transitions.
[2024-06-02 22:53:09] [INFO ] Found NUPN structural information;
[2024-06-02 22:53:09] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA FireWire-PT-17-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 428 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 656/656 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 423 transition count 656
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 93 place count 335 transition count 568
Iterating global reduction 1 with 88 rules applied. Total rules applied 181 place count 335 transition count 568
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 204 place count 312 transition count 522
Iterating global reduction 1 with 23 rules applied. Total rules applied 227 place count 312 transition count 522
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 230 place count 312 transition count 519
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 231 place count 311 transition count 518
Iterating global reduction 2 with 1 rules applied. Total rules applied 232 place count 311 transition count 518
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 233 place count 310 transition count 517
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 310 transition count 517
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 235 place count 309 transition count 516
Iterating global reduction 2 with 1 rules applied. Total rules applied 236 place count 309 transition count 516
Applied a total of 236 rules in 102 ms. Remains 309 /428 variables (removed 119) and now considering 516/656 (removed 140) transitions.
// Phase 1: matrix 516 rows 309 cols
[2024-06-02 22:53:09] [INFO ] Computed 7 invariants in 30 ms
[2024-06-02 22:53:10] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-06-02 22:53:10] [INFO ] Invariant cache hit.
[2024-06-02 22:53:10] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2024-06-02 22:53:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-06-02 22:53:15] [INFO ] Deduced a trap composed of 146 places in 141 ms of which 26 ms to minimize.
[2024-06-02 22:53:16] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 2 ms to minimize.
[2024-06-02 22:53:16] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:53:16] [INFO ] Deduced a trap composed of 88 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:53:17] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:53:17] [INFO ] Deduced a trap composed of 87 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:53:17] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:53:18] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-06-02 22:53:20] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-06-02 22:53:20] [INFO ] Deduced a trap composed of 151 places in 86 ms of which 2 ms to minimize.
[2024-06-02 22:53:20] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:53:20] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:53:22] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-06-02 22:53:27] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 6 (OVERLAPS) 516/824 variables, 308/329 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 824/825 variables, and 329 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 308/309 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-06-02 22:53:44] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (OVERLAPS) 516/824 variables, 308/330 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 510/840 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-06-02 22:53:54] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-06-02 22:53:54] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-06-02 22:53:55] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-06-02 22:53:55] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 1 ms to minimize.
[2024-06-02 22:53:55] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-06-02 22:53:55] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-06-02 22:53:55] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 1 ms to minimize.
[2024-06-02 22:53:55] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 2 ms to minimize.
[2024-06-02 22:53:56] [INFO ] Deduced a trap composed of 108 places in 108 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 9/849 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 824/825 variables, and 849 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 308/309 constraints, PredecessorRefiner: 510/515 constraints, Known Traps: 24/24 constraints]
After SMT, in 60305ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60325ms
Starting structural reductions in LTL mode, iteration 1 : 309/428 places, 516/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61112 ms. Remains : 309/428 places, 516/656 transitions.
Support contains 19 out of 309 places after structural reductions.
[2024-06-02 22:54:11] [INFO ] Flatten gal took : 60 ms
[2024-06-02 22:54:11] [INFO ] Flatten gal took : 29 ms
[2024-06-02 22:54:11] [INFO ] Input system was already deterministic with 516 transitions.
RANDOM walk for 40000 steps (16 resets) in 1985 ms. (20 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40000 steps (22 resets) in 728 ms. (54 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (10 resets) in 266 ms. (149 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (15 resets) in 168 ms. (236 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (11 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
[2024-06-02 22:54:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 172/182 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 88/270 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 480/750 variables, 270/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 29/779 variables, 14/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/779 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 24/803 variables, 13/304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/803 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 9/812 variables, 5/309 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/812 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 9/821 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/821 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 4/825 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/825 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/825 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 825/825 variables, and 316 constraints, problems are : Problem set: 0 solved, 5 unsolved in 534 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 172/182 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 88/270 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:54:12] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 480/750 variables, 270/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/750 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/750 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 29/779 variables, 14/296 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/779 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:54:13] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/779 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/779 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 24/803 variables, 13/311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:54:13] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 1 ms to minimize.
[2024-06-02 22:54:13] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/803 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/803 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 9/812 variables, 5/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/812 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 9/821 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/821 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 4/825 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/825 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/825 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 825/825 variables, and 325 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1795 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 2337ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 5810 ms.
Support contains 10 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 516/516 transitions.
Graph (trivial) has 227 edges and 309 vertex of which 18 / 309 are part of one of the 3 SCC in 3 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 853 edges and 294 vertex of which 293 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 293 transition count 443
Reduce places removed 52 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 56 rules applied. Total rules applied 110 place count 241 transition count 439
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 116 place count 237 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 236 transition count 437
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 117 place count 236 transition count 408
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 175 place count 207 transition count 408
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 179 place count 203 transition count 385
Iterating global reduction 4 with 4 rules applied. Total rules applied 183 place count 203 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 185 place count 203 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 185 place count 203 transition count 382
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 202 transition count 382
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 201 transition count 379
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 201 transition count 379
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 249 place count 171 transition count 349
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -74
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 297 place count 147 transition count 423
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 302 place count 147 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 6 with 31 rules applied. Total rules applied 333 place count 147 transition count 387
Free-agglomeration rule applied 22 times.
Iterating global reduction 6 with 22 rules applied. Total rules applied 355 place count 147 transition count 365
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 382 place count 125 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 7 with 51 rules applied. Total rules applied 433 place count 125 transition count 309
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 435 place count 125 transition count 309
Applied a total of 435 rules in 113 ms. Remains 125 /309 variables (removed 184) and now considering 309/516 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 125/309 places, 309/516 transitions.
RANDOM walk for 40000 steps (2044 resets) in 432 ms. (92 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (500 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (516 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (507 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
[2024-06-02 22:54:20] [INFO ] Flow matrix only has 275 transitions (discarded 34 similar events)
// Phase 1: matrix 275 rows 125 cols
[2024-06-02 22:54:20] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:54:20] [INFO ] State equation strengthened by 61 read => feed constraints.
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) 91/97 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/120 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 275/395 variables, 120/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 61/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5/400 variables, 5/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 193 constraints, problems are : Problem set: 0 solved, 3 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 61/61 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) 91/97 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/120 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:54:20] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 275/395 variables, 120/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 61/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:54:21] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/400 variables, 5/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/400 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 198 constraints, problems are : Problem set: 0 solved, 3 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 578ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 251 ms.
Support contains 4 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 309/309 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 307
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 123 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 123 transition count 306
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 122 transition count 306
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 122 transition count 304
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 120 transition count 304
Applied a total of 10 rules in 26 ms. Remains 120 /125 variables (removed 5) and now considering 304/309 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 120/125 places, 304/309 transitions.
RANDOM walk for 40000 steps (2033 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (500 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (499 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 929907 steps, run visited all 2 properties in 1864 ms. (steps per millisecond=498 )
Probabilistic random walk after 929907 steps, saw 272555 distinct states, run finished after 1867 ms. (steps per millisecond=498 ) properties seen :2
FORMULA FireWire-PT-17-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 48 stabilizing places and 51 stable transitions
Graph (complete) has 893 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 516/516 transitions.
Graph (trivial) has 239 edges and 309 vertex of which 18 / 309 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 856 edges and 294 vertex of which 293 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 292 transition count 443
Reduce places removed 56 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 58 rules applied. Total rules applied 116 place count 236 transition count 441
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 118 place count 235 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 234 transition count 440
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 119 place count 234 transition count 410
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 179 place count 204 transition count 410
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 184 place count 199 transition count 384
Iterating global reduction 4 with 5 rules applied. Total rules applied 189 place count 199 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 199 transition count 382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 191 place count 199 transition count 381
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 193 place count 198 transition count 381
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 197 transition count 378
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 197 transition count 378
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 253 place count 168 transition count 349
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 315 place count 137 transition count 446
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 351 place count 137 transition count 410
Applied a total of 351 rules in 62 ms. Remains 137 /309 variables (removed 172) and now considering 410/516 (removed 106) transitions.
[2024-06-02 22:54:23] [INFO ] Flow matrix only has 395 transitions (discarded 15 similar events)
// Phase 1: matrix 395 rows 137 cols
[2024-06-02 22:54:23] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:54:23] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 22:54:23] [INFO ] Flow matrix only has 395 transitions (discarded 15 similar events)
[2024-06-02 22:54:23] [INFO ] Invariant cache hit.
[2024-06-02 22:54:24] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:54:24] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-06-02 22:54:24] [INFO ] Redundant transitions in 53 ms returned []
Running 400 sub problems to find dead transitions.
[2024-06-02 22:54:24] [INFO ] Flow matrix only has 395 transitions (discarded 15 similar events)
[2024-06-02 22:54:24] [INFO ] Invariant cache hit.
[2024-06-02 22:54:24] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-02 22:54:26] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-06-02 22:54:27] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:54:27] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-06-02 22:54:27] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:54:27] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:54:27] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:54:27] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:54:27] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:54:27] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-06-02 22:54:28] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 394/531 variables, 137/154 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 60/214 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-02 22:54:35] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/531 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 10 (OVERLAPS) 0/531 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/532 variables, and 215 constraints, problems are : Problem set: 0 solved, 400 unsolved in 19155 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (OVERLAPS) 1/137 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 394/531 variables, 137/155 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 60/215 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 400/615 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 10 (OVERLAPS) 0/531 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/532 variables, and 615 constraints, problems are : Problem set: 0 solved, 400 unsolved in 24408 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 11/11 constraints]
After SMT, in 43869ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 43874ms
Starting structural reductions in SI_LTL mode, iteration 1 : 137/309 places, 410/516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44308 ms. Remains : 137/309 places, 410/516 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 141 ms.
Product exploration explored 100000 steps with 0 reset in 74 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3259 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (688 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1159 steps, run visited all 1 properties in 22 ms. (steps per millisecond=52 )
Probabilistic random walk after 1159 steps, saw 587 distinct states, run finished after 23 ms. (steps per millisecond=50 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 410/410 transitions.
Applied a total of 0 rules in 11 ms. Remains 137 /137 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2024-06-02 22:55:08] [INFO ] Flow matrix only has 395 transitions (discarded 15 similar events)
[2024-06-02 22:55:08] [INFO ] Invariant cache hit.
[2024-06-02 22:55:09] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 22:55:09] [INFO ] Flow matrix only has 395 transitions (discarded 15 similar events)
[2024-06-02 22:55:09] [INFO ] Invariant cache hit.
[2024-06-02 22:55:09] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:55:09] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-06-02 22:55:09] [INFO ] Redundant transitions in 20 ms returned []
Running 400 sub problems to find dead transitions.
[2024-06-02 22:55:09] [INFO ] Flow matrix only has 395 transitions (discarded 15 similar events)
[2024-06-02 22:55:09] [INFO ] Invariant cache hit.
[2024-06-02 22:55:09] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-02 22:55:11] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:55:11] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:55:11] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:55:12] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2024-06-02 22:55:12] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:55:12] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:55:12] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:55:12] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 0 ms to minimize.
[2024-06-02 22:55:12] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:55:12] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 394/531 variables, 137/154 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 60/214 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-02 22:55:20] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/531 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 10 (OVERLAPS) 0/531 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/532 variables, and 215 constraints, problems are : Problem set: 0 solved, 400 unsolved in 19003 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (OVERLAPS) 1/137 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 394/531 variables, 137/155 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 60/215 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 400/615 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 10 (OVERLAPS) 0/531 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/532 variables, and 615 constraints, problems are : Problem set: 0 solved, 400 unsolved in 23910 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 11/11 constraints]
After SMT, in 43172ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 43176ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43523 ms. Remains : 137/137 places, 410/410 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3273 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (692 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1159 steps, run visited all 1 properties in 8 ms. (steps per millisecond=144 )
Probabilistic random walk after 1159 steps, saw 587 distinct states, run finished after 8 ms. (steps per millisecond=144 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 67 ms.
Product exploration explored 100000 steps with 0 reset in 77 ms.
Built C files in :
/tmp/ltsmin2207296124115651115
[2024-06-02 22:55:53] [INFO ] Computing symmetric may disable matrix : 410 transitions.
[2024-06-02 22:55:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:55:53] [INFO ] Computing symmetric may enable matrix : 410 transitions.
[2024-06-02 22:55:53] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:55:53] [INFO ] Computing Do-Not-Accords matrix : 410 transitions.
[2024-06-02 22:55:53] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:55:53] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2207296124115651115
Running compilation step : cd /tmp/ltsmin2207296124115651115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1225 ms.
Running link step : cd /tmp/ltsmin2207296124115651115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin2207296124115651115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13064227812187814557.hoa' '--buchi-type=spotba'
LTSmin run took 968 ms.
FORMULA FireWire-PT-17-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-17-LTLCardinality-01 finished in 91624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(F(p1))))))'
Support contains 3 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 516/516 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 308 transition count 516
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 302 transition count 508
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 302 transition count 508
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 299 transition count 503
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 299 transition count 503
Applied a total of 19 rules in 9 ms. Remains 299 /309 variables (removed 10) and now considering 503/516 (removed 13) transitions.
// Phase 1: matrix 503 rows 299 cols
[2024-06-02 22:55:55] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:55:55] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 22:55:55] [INFO ] Invariant cache hit.
[2024-06-02 22:55:55] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2024-06-02 22:55:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:56:00] [INFO ] Deduced a trap composed of 183 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:56:00] [INFO ] Deduced a trap composed of 152 places in 89 ms of which 2 ms to minimize.
[2024-06-02 22:56:00] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-06-02 22:56:00] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-06-02 22:56:01] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 5 ms to minimize.
[2024-06-02 22:56:02] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:56:03] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:56:04] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 2 ms to minimize.
[2024-06-02 22:56:05] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:56:06] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:56:08] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:56:12] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 2 ms to minimize.
[2024-06-02 22:56:14] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 503/802 variables, 299/319 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:56:25] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 802/802 variables, and 320 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 503/802 variables, 299/320 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 502/822 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:56:36] [INFO ] Deduced a trap composed of 110 places in 117 ms of which 2 ms to minimize.
[2024-06-02 22:56:36] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 2 ms to minimize.
[2024-06-02 22:56:38] [INFO ] Deduced a trap composed of 158 places in 102 ms of which 1 ms to minimize.
[2024-06-02 22:56:39] [INFO ] Deduced a trap composed of 154 places in 109 ms of which 2 ms to minimize.
[2024-06-02 22:56:39] [INFO ] Deduced a trap composed of 160 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 5/827 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:56:52] [INFO ] Deduced a trap composed of 103 places in 113 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 Int declared 802/802 variables, and 828 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 20/20 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in LTL mode, iteration 1 : 299/309 places, 503/516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60544 ms. Remains : 299/309 places, 503/516 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-17-LTLCardinality-05
Product exploration explored 100000 steps with 3 reset in 124 ms.
Product exploration explored 100000 steps with 0 reset in 93 ms.
Computed a total of 45 stabilizing places and 49 stable transitions
Computed a total of 45 stabilizing places and 49 stable transitions
Detected a total of 45/299 stabilizing places and 49/503 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (15 resets) in 371 ms. (107 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (9 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (12 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
[2024-06-02 22:56:56] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 179/263 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 466/729 variables, 263/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/729 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/751 variables, 10/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/751 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 22/773 variables, 11/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/773 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/788 variables, 7/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/788 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/799 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/799 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/802 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/802 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/802 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 179/263 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 466/729 variables, 263/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/729 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/729 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 22/751 variables, 10/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/751 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/751 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 22/773 variables, 11/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/773 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 15/788 variables, 7/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/788 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 11/799 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/799 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/802 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/802 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/802 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 308 constraints, problems are : Problem set: 0 solved, 2 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 730ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 296 ms.
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 503/503 transitions.
Graph (trivial) has 233 edges and 299 vertex of which 18 / 299 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 284 transition count 430
Reduce places removed 52 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 54 rules applied. Total rules applied 107 place count 232 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 231 transition count 428
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 108 place count 231 transition count 395
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 174 place count 198 transition count 395
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 197 transition count 375
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 197 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 177 place count 197 transition count 374
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 233 place count 169 transition count 346
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 293 place count 139 transition count 444
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 299 place count 139 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 335 place count 139 transition count 402
Free-agglomeration rule applied 21 times.
Iterating global reduction 5 with 21 rules applied. Total rules applied 356 place count 139 transition count 381
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 383 place count 118 transition count 375
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 439 place count 118 transition count 319
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 441 place count 118 transition count 319
Applied a total of 441 rules in 54 ms. Remains 118 /299 variables (removed 181) and now considering 319/503 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 118/299 places, 319/503 transitions.
RANDOM walk for 36628 steps (2028 resets) in 155 ms. (234 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 216 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 503/503 transitions.
Applied a total of 0 rules in 6 ms. Remains 299 /299 variables (removed 0) and now considering 503/503 (removed 0) transitions.
[2024-06-02 22:56:58] [INFO ] Invariant cache hit.
[2024-06-02 22:56:58] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 22:56:58] [INFO ] Invariant cache hit.
[2024-06-02 22:56:59] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2024-06-02 22:56:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:57:03] [INFO ] Deduced a trap composed of 183 places in 105 ms of which 2 ms to minimize.
[2024-06-02 22:57:03] [INFO ] Deduced a trap composed of 152 places in 88 ms of which 2 ms to minimize.
[2024-06-02 22:57:04] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-06-02 22:57:04] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-06-02 22:57:04] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:57:05] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 0 ms to minimize.
[2024-06-02 22:57:06] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-06-02 22:57:07] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 2 ms to minimize.
[2024-06-02 22:57:08] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:57:09] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-06-02 22:57:11] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:57:15] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:57:17] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 503/802 variables, 299/319 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:57:28] [INFO ] Deduced a trap composed of 53 places in 86 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 802/802 variables, and 320 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 503/802 variables, 299/320 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 502/822 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:57:39] [INFO ] Deduced a trap composed of 110 places in 110 ms of which 2 ms to minimize.
[2024-06-02 22:57:39] [INFO ] Deduced a trap composed of 107 places in 99 ms of which 2 ms to minimize.
[2024-06-02 22:57:41] [INFO ] Deduced a trap composed of 158 places in 100 ms of which 2 ms to minimize.
[2024-06-02 22:57:42] [INFO ] Deduced a trap composed of 154 places in 96 ms of which 2 ms to minimize.
[2024-06-02 22:57:42] [INFO ] Deduced a trap composed of 160 places in 95 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 5/827 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:57:55] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 802/802 variables, and 828 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 20/20 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Finished structural reductions in LTL mode , in 1 iterations and 60540 ms. Remains : 299/299 places, 503/503 transitions.
Computed a total of 45 stabilizing places and 49 stable transitions
Computed a total of 45 stabilizing places and 49 stable transitions
Detected a total of 45/299 stabilizing places and 49/503 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (12 resets) in 114 ms. (347 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (13 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (10 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
[2024-06-02 22:57:59] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 179/263 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 466/729 variables, 263/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/729 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/751 variables, 10/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/751 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 22/773 variables, 11/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/773 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/788 variables, 7/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/788 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/799 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/799 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/802 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/802 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/802 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 179/263 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 466/729 variables, 263/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/729 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/729 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 22/751 variables, 10/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/751 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/751 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 22/773 variables, 11/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/773 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 15/788 variables, 7/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/788 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 11/799 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/799 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/802 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/802 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/802 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 308 constraints, problems are : Problem set: 0 solved, 2 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 715ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 193 ms.
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 503/503 transitions.
Graph (trivial) has 233 edges and 299 vertex of which 18 / 299 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 284 transition count 430
Reduce places removed 52 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 54 rules applied. Total rules applied 107 place count 232 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 231 transition count 428
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 108 place count 231 transition count 395
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 174 place count 198 transition count 395
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 197 transition count 375
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 197 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 177 place count 197 transition count 374
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 233 place count 169 transition count 346
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 293 place count 139 transition count 444
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 299 place count 139 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 335 place count 139 transition count 402
Free-agglomeration rule applied 21 times.
Iterating global reduction 5 with 21 rules applied. Total rules applied 356 place count 139 transition count 381
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 383 place count 118 transition count 375
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 439 place count 118 transition count 319
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 441 place count 118 transition count 319
Applied a total of 441 rules in 42 ms. Remains 118 /299 variables (removed 181) and now considering 319/503 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 118/299 places, 319/503 transitions.
RANDOM walk for 35073 steps (1958 resets) in 93 ms. (373 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 6 reset in 84 ms.
Product exploration explored 100000 steps with 0 reset in 88 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 503/503 transitions.
Graph (trivial) has 233 edges and 299 vertex of which 18 / 299 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 284 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 284 transition count 486
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 52 place count 284 transition count 507
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 71 place count 284 transition count 507
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 88 place count 267 transition count 471
Deduced a syphon composed of 53 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 105 place count 267 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 267 transition count 470
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 3 with 36 rules applied. Total rules applied 142 place count 267 transition count 472
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 160 place count 249 transition count 454
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 3 with 18 rules applied. Total rules applied 178 place count 249 transition count 454
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -225
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 3 with 38 rules applied. Total rules applied 216 place count 249 transition count 679
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 226 place count 239 transition count 656
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 236 place count 239 transition count 656
Deduced a syphon composed of 99 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 274 place count 239 transition count 618
Deduced a syphon composed of 99 places in 0 ms
Applied a total of 274 rules in 53 ms. Remains 239 /299 variables (removed 60) and now considering 618/503 (removed -115) transitions.
[2024-06-02 22:58:02] [INFO ] Redundant transitions in 64 ms returned []
Running 606 sub problems to find dead transitions.
[2024-06-02 22:58:02] [INFO ] Flow matrix only has 601 transitions (discarded 17 similar events)
// Phase 1: matrix 601 rows 239 cols
[2024-06-02 22:58:02] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:58:02] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-06-02 22:58:07] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-06-02 22:58:07] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:58:07] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-02 22:58:07] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-06-02 22:58:07] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:58:07] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 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 TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-06-02 22:58:07] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 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
[2024-06-02 22:58:07] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 0 ms to minimize.
[2024-06-02 22:58:07] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-06-02 22:58:07] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-06-02 22:58:07] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:58:07] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2024-06-02 22:58:08] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
[2024-06-02 22:58:08] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
[2024-06-02 22:58:08] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
[2024-06-02 22:58:08] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
[2024-06-02 22:58:08] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
[2024-06-02 22:58:09] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
Problem TDEAD235 is UNSAT
[2024-06-02 22:58:09] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 19/26 constraints. Problems are: Problem set: 197 solved, 409 unsolved
[2024-06-02 22:58:11] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 1/27 constraints. Problems are: Problem set: 197 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/27 constraints. Problems are: Problem set: 197 solved, 409 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
At refinement iteration 5 (OVERLAPS) 600/839 variables, 239/266 constraints. Problems are: Problem set: 213 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/839 variables, 51/317 constraints. Problems are: Problem set: 213 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/839 variables, 0/317 constraints. Problems are: Problem set: 213 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 1/840 variables, 1/318 constraints. Problems are: Problem set: 213 solved, 393 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/318 constraints. Problems are: Problem set: 213 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/840 variables, and 318 constraints, problems are : Problem set: 213 solved, 393 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 239/239 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 213 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 213 solved, 393 unsolved
At refinement iteration 1 (OVERLAPS) 92/231 variables, 7/7 constraints. Problems are: Problem set: 213 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 20/27 constraints. Problems are: Problem set: 213 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/27 constraints. Problems are: Problem set: 213 solved, 393 unsolved
At refinement iteration 4 (OVERLAPS) 596/827 variables, 231/258 constraints. Problems are: Problem set: 213 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/827 variables, 51/309 constraints. Problems are: Problem set: 213 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 393/702 constraints. Problems are: Problem set: 213 solved, 393 unsolved
[2024-06-02 22:58:41] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 1/703 constraints. Problems are: Problem set: 213 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 0/703 constraints. Problems are: Problem set: 213 solved, 393 unsolved
SMT process timed out in 60460ms, After SMT, problems are : Problem set: 213 solved, 393 unsolved
Search for dead transitions found 213 dead transitions in 60467ms
Found 213 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 213 transitions
Dead transitions reduction (with SMT) removed 213 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 239/299 places, 405/503 transitions.
Graph (complete) has 720 edges and 239 vertex of which 140 are kept as prefixes of interest. Removing 99 places using SCC suffix rule.2 ms
Discarding 99 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 140 /239 variables (removed 99) and now considering 405/405 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 140/299 places, 405/503 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60603 ms. Remains : 140/299 places, 405/503 transitions.
Built C files in :
/tmp/ltsmin3677045676497703452
[2024-06-02 22:59:02] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3677045676497703452
Running compilation step : cd /tmp/ltsmin3677045676497703452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 809 ms.
Running link step : cd /tmp/ltsmin3677045676497703452;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3677045676497703452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12347799001913624582.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 503/503 transitions.
Applied a total of 0 rules in 6 ms. Remains 299 /299 variables (removed 0) and now considering 503/503 (removed 0) transitions.
// Phase 1: matrix 503 rows 299 cols
[2024-06-02 22:59:17] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 22:59:17] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 22:59:17] [INFO ] Invariant cache hit.
[2024-06-02 22:59:18] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2024-06-02 22:59:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:59:22] [INFO ] Deduced a trap composed of 183 places in 92 ms of which 2 ms to minimize.
[2024-06-02 22:59:23] [INFO ] Deduced a trap composed of 152 places in 87 ms of which 1 ms to minimize.
[2024-06-02 22:59:23] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-06-02 22:59:23] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:59:23] [INFO ] Deduced a trap composed of 86 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:59:24] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:59:25] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:59:26] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 5 ms to minimize.
[2024-06-02 22:59:27] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:59:28] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:59:30] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:59:34] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:59:36] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 503/802 variables, 299/319 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:59:47] [INFO ] Deduced a trap composed of 53 places in 95 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 802/802 variables, and 320 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 503/802 variables, 299/320 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 502/822 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 22:59:58] [INFO ] Deduced a trap composed of 110 places in 104 ms of which 2 ms to minimize.
[2024-06-02 22:59:58] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:00:00] [INFO ] Deduced a trap composed of 158 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:00:01] [INFO ] Deduced a trap composed of 154 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:00:01] [INFO ] Deduced a trap composed of 160 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 5/827 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 23:00:14] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 802/802 variables, and 828 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 20/20 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Finished structural reductions in LTL mode , in 1 iterations and 60544 ms. Remains : 299/299 places, 503/503 transitions.
Built C files in :
/tmp/ltsmin12114543725767303172
[2024-06-02 23:00:18] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12114543725767303172
Running compilation step : cd /tmp/ltsmin12114543725767303172;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 825 ms.
Running link step : cd /tmp/ltsmin12114543725767303172;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12114543725767303172;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11153658495163285768.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 23:00:33] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:00:33] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:00:33] [INFO ] Time to serialize gal into /tmp/LTL15168094495375780135.gal : 6 ms
[2024-06-02 23:00:33] [INFO ] Time to serialize properties into /tmp/LTL11428804100791121641.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15168094495375780135.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2710455474790865658.hoa' '-atoms' '/tmp/LTL11428804100791121641.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11428804100791121641.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2710455474790865658.hoa
Detected timeout of ITS tools.
[2024-06-02 23:00:48] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:00:48] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:00:48] [INFO ] Time to serialize gal into /tmp/LTL2533527499847790058.gal : 4 ms
[2024-06-02 23:00:48] [INFO ] Time to serialize properties into /tmp/LTL6530759106132333661.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2533527499847790058.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6530759106132333661.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("((p344==0)||(p361==1))"))||(X(X(F("(p242==1)")))))))
Formula 0 simplified : X(F!"((p344==0)||(p361==1))" & XXG!"(p242==1)")
Detected timeout of ITS tools.
[2024-06-02 23:01:03] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:01:03] [INFO ] Applying decomposition
[2024-06-02 23:01:03] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16836651783270152961.txt' '-o' '/tmp/graph16836651783270152961.bin' '-w' '/tmp/graph16836651783270152961.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16836651783270152961.bin' '-l' '-1' '-v' '-w' '/tmp/graph16836651783270152961.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:01:03] [INFO ] Decomposing Gal with order
[2024-06-02 23:01:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:01:03] [INFO ] Removed a total of 504 redundant transitions.
[2024-06-02 23:01:03] [INFO ] Flatten gal took : 66 ms
[2024-06-02 23:01:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 21 ms.
[2024-06-02 23:01:03] [INFO ] Time to serialize gal into /tmp/LTL2110201554115699436.gal : 7 ms
[2024-06-02 23:01:03] [INFO ] Time to serialize properties into /tmp/LTL2954857422082071583.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2110201554115699436.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2954857422082071583.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((G("((i11.u91.p344==0)||(i10.u84.p361==1))"))||(X(X(F("(i7.u62.p242==1)")))))))
Formula 0 simplified : X(F!"((i11.u91.p344==0)||(i10.u84.p361==1))" & XXG!"(i7.u62.p242==1)")
Reverse transition relation is NOT exact ! Due to transitions t22, t123, t229, t243, t254, t259, t264, t269, t274, t279, t281, t282, t295, t347, t356, t361...1108
Computing Next relation with stutter on 3.69226e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property FireWire-PT-17-LTLCardinality-05 finished in 323555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 516/516 transitions.
Graph (trivial) has 241 edges and 309 vertex of which 18 / 309 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 856 edges and 294 vertex of which 293 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 292 transition count 443
Reduce places removed 56 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 58 rules applied. Total rules applied 116 place count 236 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 235 transition count 441
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 117 place count 235 transition count 411
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 177 place count 205 transition count 411
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 182 place count 200 transition count 385
Iterating global reduction 3 with 5 rules applied. Total rules applied 187 place count 200 transition count 385
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 189 place count 200 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 189 place count 200 transition count 382
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 191 place count 199 transition count 382
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 192 place count 198 transition count 379
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 198 transition count 379
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 251 place count 169 transition count 350
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -102
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 315 place count 137 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 355 place count 137 transition count 412
Applied a total of 355 rules in 33 ms. Remains 137 /309 variables (removed 172) and now considering 412/516 (removed 104) transitions.
[2024-06-02 23:01:18] [INFO ] Flow matrix only has 394 transitions (discarded 18 similar events)
// Phase 1: matrix 394 rows 137 cols
[2024-06-02 23:01:18] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:01:19] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 23:01:19] [INFO ] Flow matrix only has 394 transitions (discarded 18 similar events)
[2024-06-02 23:01:19] [INFO ] Invariant cache hit.
[2024-06-02 23:01:19] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:01:19] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-06-02 23:01:19] [INFO ] Redundant transitions in 23 ms returned []
Running 402 sub problems to find dead transitions.
[2024-06-02 23:01:19] [INFO ] Flow matrix only has 394 transitions (discarded 18 similar events)
[2024-06-02 23:01:19] [INFO ] Invariant cache hit.
[2024-06-02 23:01:19] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-06-02 23:01:21] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:01:22] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:01:22] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:01:22] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 3 ms to minimize.
[2024-06-02 23:01:22] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:01:22] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:01:22] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:01:22] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:01:22] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:01:23] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 5 (OVERLAPS) 393/530 variables, 137/154 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 61/215 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-06-02 23:01:31] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/530 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 10 (OVERLAPS) 0/530 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 402 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/531 variables, and 216 constraints, problems are : Problem set: 0 solved, 402 unsolved in 20464 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 402/402 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 402 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 3 (OVERLAPS) 1/137 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 6 (OVERLAPS) 393/530 variables, 137/155 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 61/216 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 402/618 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 10 (OVERLAPS) 0/530 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 402 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/531 variables, and 618 constraints, problems are : Problem set: 0 solved, 402 unsolved in 24443 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 402/402 constraints, Known Traps: 11/11 constraints]
After SMT, in 45204ms problems are : Problem set: 0 solved, 402 unsolved
Search for dead transitions found 0 dead transitions in 45208ms
Starting structural reductions in SI_LTL mode, iteration 1 : 137/309 places, 412/516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45596 ms. Remains : 137/309 places, 412/516 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-17-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLCardinality-06 finished in 45686 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(G(p0))&&G(p1))))'
Support contains 4 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 516/516 transitions.
Graph (trivial) has 237 edges and 309 vertex of which 18 / 309 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 856 edges and 294 vertex of which 293 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 292 transition count 444
Reduce places removed 55 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 57 rules applied. Total rules applied 114 place count 237 transition count 442
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 116 place count 236 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 235 transition count 441
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 117 place count 235 transition count 412
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 175 place count 206 transition count 412
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 179 place count 202 transition count 387
Iterating global reduction 4 with 4 rules applied. Total rules applied 183 place count 202 transition count 387
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 185 place count 202 transition count 385
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 245 place count 172 transition count 355
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -89
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 309 place count 140 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 5 with 37 rules applied. Total rules applied 346 place count 140 transition count 407
Applied a total of 346 rules in 33 ms. Remains 140 /309 variables (removed 169) and now considering 407/516 (removed 109) transitions.
[2024-06-02 23:02:04] [INFO ] Flow matrix only has 392 transitions (discarded 15 similar events)
// Phase 1: matrix 392 rows 140 cols
[2024-06-02 23:02:04] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:02:04] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 23:02:04] [INFO ] Flow matrix only has 392 transitions (discarded 15 similar events)
[2024-06-02 23:02:04] [INFO ] Invariant cache hit.
[2024-06-02 23:02:04] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-02 23:02:04] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-02 23:02:05] [INFO ] Redundant transitions in 22 ms returned []
Running 397 sub problems to find dead transitions.
[2024-06-02 23:02:05] [INFO ] Flow matrix only has 392 transitions (discarded 15 similar events)
[2024-06-02 23:02:05] [INFO ] Invariant cache hit.
[2024-06-02 23:02:05] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-02 23:02:07] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:02:07] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:02:07] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:02:07] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:02:08] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:02:08] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:02:08] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:02:08] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (OVERLAPS) 391/531 variables, 140/155 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 47/202 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 397 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/532 variables, and 202 constraints, problems are : Problem set: 0 solved, 397 unsolved in 12739 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 1/140 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (OVERLAPS) 391/531 variables, 140/155 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 47/202 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 397/599 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-02 23:02:24] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:02:24] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 11 (OVERLAPS) 0/531 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 397 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/532 variables, and 601 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 10/10 constraints]
After SMT, in 43052ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 43057ms
Starting structural reductions in SI_LTL mode, iteration 1 : 140/309 places, 407/516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43432 ms. Remains : 140/309 places, 407/516 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-17-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLCardinality-08 finished in 43681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 516/516 transitions.
Graph (trivial) has 238 edges and 309 vertex of which 18 / 309 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 856 edges and 294 vertex of which 293 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 292 transition count 445
Reduce places removed 54 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 56 rules applied. Total rules applied 112 place count 238 transition count 443
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 237 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 236 transition count 442
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 115 place count 236 transition count 413
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 173 place count 207 transition count 413
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 178 place count 202 transition count 387
Iterating global reduction 4 with 5 rules applied. Total rules applied 183 place count 202 transition count 387
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 185 place count 202 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 185 place count 202 transition count 384
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 201 transition count 384
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 200 transition count 381
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 200 transition count 381
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 247 place count 171 transition count 352
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -104
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 313 place count 138 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 353 place count 138 transition count 416
Applied a total of 353 rules in 41 ms. Remains 138 /309 variables (removed 171) and now considering 416/516 (removed 100) transitions.
[2024-06-02 23:02:48] [INFO ] Flow matrix only has 400 transitions (discarded 16 similar events)
// Phase 1: matrix 400 rows 138 cols
[2024-06-02 23:02:48] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:02:48] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 23:02:48] [INFO ] Flow matrix only has 400 transitions (discarded 16 similar events)
[2024-06-02 23:02:48] [INFO ] Invariant cache hit.
[2024-06-02 23:02:48] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 23:02:48] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-06-02 23:02:48] [INFO ] Redundant transitions in 19 ms returned []
Running 406 sub problems to find dead transitions.
[2024-06-02 23:02:48] [INFO ] Flow matrix only has 400 transitions (discarded 16 similar events)
[2024-06-02 23:02:48] [INFO ] Invariant cache hit.
[2024-06-02 23:02:48] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 23:02:51] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:02:51] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:02:51] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:02:51] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:02:51] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:02:51] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:02:51] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:02:52] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:02:52] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:02:52] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (OVERLAPS) 399/537 variables, 138/155 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 62/217 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (OVERLAPS) 0/537 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 217 constraints, problems are : Problem set: 0 solved, 406 unsolved in 14725 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 23:03:05] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (OVERLAPS) 399/537 variables, 138/156 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 62/218 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 406/624 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/537 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 11 (OVERLAPS) 0/537 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/538 variables, and 624 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 11/11 constraints]
After SMT, in 45003ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 45010ms
Starting structural reductions in SI_LTL mode, iteration 1 : 138/309 places, 416/516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45377 ms. Remains : 138/309 places, 416/516 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLCardinality-10 finished in 45437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 516/516 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 308 transition count 516
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 302 transition count 508
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 302 transition count 508
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 300 transition count 504
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 300 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 299 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 299 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 298 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 298 transition count 502
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 297 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 297 transition count 501
Applied a total of 23 rules in 14 ms. Remains 297 /309 variables (removed 12) and now considering 501/516 (removed 15) transitions.
// Phase 1: matrix 501 rows 297 cols
[2024-06-02 23:03:33] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 23:03:33] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 23:03:33] [INFO ] Invariant cache hit.
[2024-06-02 23:03:34] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-06-02 23:03:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-02 23:03:39] [INFO ] Deduced a trap composed of 152 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:03:39] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:03:40] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:03:40] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-02 23:03:40] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:03:40] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 2 ms to minimize.
[2024-06-02 23:03:41] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:03:41] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:03:43] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-02 23:03:43] [INFO ] Deduced a trap composed of 139 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:03:43] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:03:43] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:03:45] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:03:47] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (OVERLAPS) 501/798 variables, 297/318 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-02 23:03:53] [INFO ] Deduced a trap composed of 157 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:03:56] [INFO ] Deduced a trap composed of 111 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:03:56] [INFO ] Deduced a trap composed of 107 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 798/798 variables, and 321 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (OVERLAPS) 501/798 variables, 297/321 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/798 variables, 500/821 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-02 23:04:17] [INFO ] Deduced a trap composed of 130 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:04:18] [INFO ] Deduced a trap composed of 128 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:04:18] [INFO ] Deduced a trap composed of 155 places in 104 ms of which 1 ms to minimize.
[2024-06-02 23:04:19] [INFO ] Deduced a trap composed of 158 places in 98 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 4/825 constraints. Problems are: Problem set: 0 solved, 500 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 798/798 variables, and 825 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 21/21 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Starting structural reductions in LTL mode, iteration 1 : 297/309 places, 501/516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60613 ms. Remains : 297/309 places, 501/516 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLCardinality-12
Product exploration explored 100000 steps with 1 reset in 84 ms.
Entered a terminal (fully accepting) state of product in 93 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLCardinality-12 finished in 60830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(F(p1))))))'
[2024-06-02 23:04:34] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11619796046335520373
[2024-06-02 23:04:34] [INFO ] Computing symmetric may disable matrix : 516 transitions.
[2024-06-02 23:04:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:04:34] [INFO ] Computing symmetric may enable matrix : 516 transitions.
[2024-06-02 23:04:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:04:34] [INFO ] Applying decomposition
[2024-06-02 23:04:34] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16233437200299322677.txt' '-o' '/tmp/graph16233437200299322677.bin' '-w' '/tmp/graph16233437200299322677.weights'
[2024-06-02 23:04:34] [INFO ] Computing Do-Not-Accords matrix : 516 transitions.
[2024-06-02 23:04:34] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:04:34] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11619796046335520373
Running compilation step : cd /tmp/ltsmin11619796046335520373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16233437200299322677.bin' '-l' '-1' '-v' '-w' '/tmp/graph16233437200299322677.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:04:34] [INFO ] Decomposing Gal with order
[2024-06-02 23:04:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:04:34] [INFO ] Removed a total of 519 redundant transitions.
[2024-06-02 23:04:34] [INFO ] Flatten gal took : 52 ms
[2024-06-02 23:04:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 5 ms.
[2024-06-02 23:04:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality11195094084928069027.gal : 4 ms
[2024-06-02 23:04:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality4270709876899437179.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11195094084928069027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4270709876899437179.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G("((i9.u95.p344==0)||(i1.u101.p361==1))"))||(X(X(F("(i8.i1.i1.u67.p242==1)")))))))
Formula 0 simplified : X(F!"((i9.u95.p344==0)||(i1.u101.p361==1))" & XXG!"(i8.i1.i1.u67.p242==1)")
Compilation finished in 1408 ms.
Running link step : cd /tmp/ltsmin11619796046335520373;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin11619796046335520373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t22, t123, t201, t223, t228, t243, t244, t254, t280, t281, t282, t295, t297, t300, t347, t363...1183
Computing Next relation with stutter on 5.84308e+06 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
16469 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,164.755,2589404,1,0,3.38642e+06,4967,2993,1.10115e+07,223,24979,247329
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FireWire-PT-17-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1055232 ms.

BK_STOP 1717369844605

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-17"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-17, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734899000299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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