Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446600219.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446600219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 862K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717251980589

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:26:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:26:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:26:22] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2024-06-01 14:26:22] [INFO ] Transformed 476 places.
[2024-06-01 14:26:22] [INFO ] Transformed 920 transitions.
[2024-06-01 14:26:22] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 382 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 144 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 475 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 469 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 469 transition count 818
Applied a total of 13 rules in 69 ms. Remains 469 /476 variables (removed 7) and now considering 818/824 (removed 6) transitions.
Running 816 sub problems to find dead transitions.
[2024-06-01 14:26:23] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 469 cols
[2024-06-01 14:26:23] [INFO ] Computed 45 invariants in 51 ms
[2024-06-01 14:26:23] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:26:30] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 37 ms to minimize.
[2024-06-01 14:26:31] [INFO ] Deduced a trap composed of 127 places in 303 ms of which 2 ms to minimize.
[2024-06-01 14:26:35] [INFO ] Deduced a trap composed of 229 places in 4659 ms of which 5 ms to minimize.
[2024-06-01 14:26:36] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 12 ms to minimize.
[2024-06-01 14:26:36] [INFO ] Deduced a trap composed of 223 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:26:36] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-06-01 14:26:37] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-06-01 14:26:37] [INFO ] Deduced a trap composed of 108 places in 103 ms of which 2 ms to minimize.
[2024-06-01 14:26:37] [INFO ] Deduced a trap composed of 111 places in 104 ms of which 3 ms to minimize.
[2024-06-01 14:26:37] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-06-01 14:26:37] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-06-01 14:26:37] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-06-01 14:26:37] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:26:40] [INFO ] Deduced a trap composed of 236 places in 325 ms of which 5 ms to minimize.
[2024-06-01 14:26:40] [INFO ] Deduced a trap composed of 241 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:26:41] [INFO ] Deduced a trap composed of 235 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:26:42] [INFO ] Deduced a trap composed of 228 places in 370 ms of which 4 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 466/1275 variables, and 58 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20106 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/469 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:26:50] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 3 ms to minimize.
[2024-06-01 14:26:50] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
[2024-06-01 14:26:50] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:27:03] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:27:03] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1275 variables, and 63 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/469 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 22/22 constraints]
After SMT, in 41079ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 41132ms
[2024-06-01 14:27:04] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 14:27:04] [INFO ] Invariant cache hit.
[2024-06-01 14:27:04] [INFO ] Implicit Places using invariants in 378 ms returned [113, 239, 276, 279, 418, 430]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 400 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 463/476 places, 818/824 transitions.
Applied a total of 0 rules in 22 ms. Remains 463 /463 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41675 ms. Remains : 463/476 places, 818/824 transitions.
Support contains 144 out of 463 places after structural reductions.
[2024-06-01 14:27:04] [INFO ] Flatten gal took : 143 ms
[2024-06-01 14:27:05] [INFO ] Flatten gal took : 76 ms
[2024-06-01 14:27:05] [INFO ] Input system was already deterministic with 818 transitions.
Support contains 143 out of 463 places (down from 144) after GAL structural reductions.
RANDOM walk for 40000 steps (15 resets) in 2228 ms. (17 steps per ms) remains 13/29 properties
BEST_FIRST walk for 40001 steps (8 resets) in 471 ms. (84 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (10 resets) in 271 ms. (147 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 251 ms. (158 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (10 resets) in 336 ms. (118 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (10 resets) in 372 ms. (107 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (11 resets) in 231 ms. (172 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (11 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (11 resets) in 310 ms. (128 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (10 resets) in 300 ms. (132 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (9 resets) in 301 ms. (132 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (12 resets) in 317 ms. (125 steps per ms) remains 13/13 properties
[2024-06-01 14:27:07] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 463 cols
[2024-06-01 14:27:07] [INFO ] Computed 39 invariants in 28 ms
[2024-06-01 14:27:07] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 161/215 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 1/216 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 6 (OVERLAPS) 226/442 variables, 14/27 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/27 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 3/445 variables, 3/30 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 0/30 constraints. Problems are: Problem set: 8 solved, 5 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 10 (OVERLAPS) 16/461 variables, 8/38 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/38 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 806/1267 variables, 461/499 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1267 variables, 72/571 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1267 variables, 0/571 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/1269 variables, 2/573 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1269 variables, 1/574 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1269 variables, 0/574 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1269 variables, 0/574 constraints. Problems are: Problem set: 10 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1269/1269 variables, and 574 constraints, problems are : Problem set: 10 solved, 3 unsolved in 1088 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 463/463 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 351/403 variables, 6/8 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/8 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 23/426 variables, 12/20 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/20 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 34/460 variables, 17/37 constraints. Problems are: Problem set: 10 solved, 3 unsolved
[2024-06-01 14:27:09] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 3 ms to minimize.
[2024-06-01 14:27:09] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:27:09] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:27:09] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 4/41 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 0/41 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/461 variables, 1/42 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/42 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 806/1267 variables, 461/503 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1267 variables, 72/575 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1267 variables, 3/578 constraints. Problems are: Problem set: 10 solved, 3 unsolved
[2024-06-01 14:27:12] [INFO ] Deduced a trap composed of 224 places in 279 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Int declared 1267/1269 variables, and 579 constraints, problems are : Problem set: 10 solved, 3 unsolved in 4782 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 461/463 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/13 constraints, Known Traps: 5/5 constraints]
After SMT, in 5931ms problems are : Problem set: 10 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 628 ms.
Support contains 3 out of 463 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 463/463 places, 818/818 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 777
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 421 transition count 777
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 83 place count 421 transition count 729
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 179 place count 373 transition count 729
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 285 place count 320 transition count 676
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 289 place count 316 transition count 672
Iterating global reduction 2 with 4 rules applied. Total rules applied 293 place count 316 transition count 672
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 304 place count 316 transition count 661
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 315 place count 305 transition count 661
Applied a total of 315 rules in 308 ms. Remains 305 /463 variables (removed 158) and now considering 661/818 (removed 157) transitions.
Running 659 sub problems to find dead transitions.
[2024-06-01 14:27:14] [INFO ] Flow matrix only has 649 transitions (discarded 12 similar events)
// Phase 1: matrix 649 rows 305 cols
[2024-06-01 14:27:14] [INFO ] Computed 38 invariants in 19 ms
[2024-06-01 14:27:14] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 14:27:18] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-06-01 14:27:18] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-06-01 14:27:19] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-06-01 14:27:19] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:27:19] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:27:19] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:27:19] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 2 ms to minimize.
[2024-06-01 14:27:20] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 5 ms to minimize.
[2024-06-01 14:27:20] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:27:22] [INFO ] Deduced a trap composed of 117 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:27:23] [INFO ] Deduced a trap composed of 123 places in 188 ms of which 3 ms to minimize.
[2024-06-01 14:27:23] [INFO ] Deduced a trap composed of 126 places in 141 ms of which 3 ms to minimize.
[2024-06-01 14:27:23] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-06-01 14:27:23] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 1 ms to minimize.
[2024-06-01 14:27:24] [INFO ] Deduced a trap composed of 126 places in 202 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 14:27:26] [INFO ] Deduced a trap composed of 109 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:27:27] [INFO ] Deduced a trap composed of 169 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/305 variables, 2/55 constraints. Problems are: Problem set: 66 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/954 variables, and 55 constraints, problems are : Problem set: 66 solved, 593 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/305 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 66 solved, 593 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 13/13 constraints. Problems are: Problem set: 66 solved, 593 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 23/36 constraints. Problems are: Problem set: 66 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 17/53 constraints. Problems are: Problem set: 66 solved, 593 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 0/53 constraints. Problems are: Problem set: 66 solved, 593 unsolved
At refinement iteration 4 (OVERLAPS) 2/305 variables, 2/55 constraints. Problems are: Problem set: 66 solved, 593 unsolved
[2024-06-01 14:27:46] [INFO ] Deduced a trap composed of 105 places in 146 ms of which 3 ms to minimize.
[2024-06-01 14:27:47] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2024-06-01 14:27:49] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:27:50] [INFO ] Deduced a trap composed of 121 places in 125 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 4/59 constraints. Problems are: Problem set: 66 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/954 variables, and 59 constraints, problems are : Problem set: 66 solved, 593 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/305 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/659 constraints, Known Traps: 21/21 constraints]
After SMT, in 41254ms problems are : Problem set: 66 solved, 593 unsolved
Search for dead transitions found 66 dead transitions in 41264ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 305/463 places, 595/818 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 303 transition count 583
Reduce places removed 11 places and 12 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 13 place count 292 transition count 571
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 13 rules in 21 ms. Remains 292 /305 variables (removed 13) and now considering 571/595 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41597 ms. Remains : 292/463 places, 571/818 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40000 steps (23 resets) in 409 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (10 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 351336 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 1
Probabilistic random walk after 351336 steps, saw 183116 distinct states, run finished after 3004 ms. (steps per millisecond=116 ) properties seen :0
[2024-06-01 14:27:58] [INFO ] Flow matrix only has 559 transitions (discarded 12 similar events)
// Phase 1: matrix 559 rows 291 cols
[2024-06-01 14:27:58] [INFO ] Computed 38 invariants in 13 ms
[2024-06-01 14:27:58] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 142/850 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 6/15 constraints, Generalized P Invariants (flows): 2/23 constraints, State Equation: 0/291 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 301ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 13 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G(p1) U (p0&&G(p1)))))))'
Support contains 18 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 818/818 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 456 transition count 812
Applied a total of 13 rules in 31 ms. Remains 456 /463 variables (removed 7) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 14:27:59] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-06-01 14:27:59] [INFO ] Computed 38 invariants in 9 ms
[2024-06-01 14:27:59] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:28:04] [INFO ] Deduced a trap composed of 121 places in 109 ms of which 2 ms to minimize.
[2024-06-01 14:28:04] [INFO ] Deduced a trap composed of 217 places in 146 ms of which 3 ms to minimize.
[2024-06-01 14:28:05] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:28:05] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:28:05] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:28:05] [INFO ] Deduced a trap composed of 222 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:28:06] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 3 ms to minimize.
[2024-06-01 14:28:07] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 810 unsolved
SMT process timed out in 20717ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 20726ms
[2024-06-01 14:28:20] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 14:28:20] [INFO ] Invariant cache hit.
[2024-06-01 14:28:20] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-06-01 14:28:20] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 14:28:20] [INFO ] Invariant cache hit.
[2024-06-01 14:28:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:28:25] [INFO ] Implicit Places using invariants and state equation in 5326 ms returned []
Implicit Place search using SMT with State Equation took 5643 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-06-01 14:28:25] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 14:28:25] [INFO ] Invariant cache hit.
[2024-06-01 14:28:25] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:28:31] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 8 ms to minimize.
[2024-06-01 14:28:31] [INFO ] Deduced a trap composed of 121 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:28:31] [INFO ] Deduced a trap composed of 227 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:28:31] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:28:32] [INFO ] Deduced a trap composed of 222 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:28:32] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 1 ms to minimize.
[2024-06-01 14:28:33] [INFO ] Deduced a trap composed of 217 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD23 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/456 variables, 3/45 constraints. Problems are: Problem set: 66 solved, 744 unsolved
[2024-06-01 14:28:48] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 2 ms to minimize.
[2024-06-01 14:28:48] [INFO ] Deduced a trap composed of 64 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:28:49] [INFO ] Deduced a trap composed of 249 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:28:49] [INFO ] Deduced a trap composed of 222 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:28:49] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:28:49] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:28:49] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:28:50] [INFO ] Deduced a trap composed of 64 places in 173 ms of which 3 ms to minimize.
[2024-06-01 14:28:50] [INFO ] Deduced a trap composed of 273 places in 180 ms of which 3 ms to minimize.
[2024-06-01 14:28:50] [INFO ] Deduced a trap composed of 184 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:28:50] [INFO ] Deduced a trap composed of 240 places in 195 ms of which 2 ms to minimize.
[2024-06-01 14:28:51] [INFO ] Deduced a trap composed of 197 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:28:51] [INFO ] Deduced a trap composed of 275 places in 171 ms of which 3 ms to minimize.
[2024-06-01 14:28:51] [INFO ] Deduced a trap composed of 275 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:28:52] [INFO ] Deduced a trap composed of 203 places in 173 ms of which 3 ms to minimize.
[2024-06-01 14:28:52] [INFO ] Deduced a trap composed of 212 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:28:52] [INFO ] Deduced a trap composed of 196 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:28:53] [INFO ] Deduced a trap composed of 113 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:28:55] [INFO ] Deduced a trap composed of 253 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:28:55] [INFO ] Deduced a trap composed of 176 places in 167 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 20/65 constraints. Problems are: Problem set: 66 solved, 744 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/1256 variables, and 65 constraints, problems are : Problem set: 66 solved, 744 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 66 solved, 744 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 66 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 66 solved, 744 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 66 solved, 744 unsolved
[2024-06-01 14:29:02] [INFO ] Deduced a trap composed of 83 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:29:02] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/54 constraints. Problems are: Problem set: 66 solved, 744 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/54 constraints. Problems are: Problem set: 66 solved, 744 unsolved
At refinement iteration 5 (OVERLAPS) 2/456 variables, 3/57 constraints. Problems are: Problem set: 66 solved, 744 unsolved
SMT process timed out in 60819ms, After SMT, problems are : Problem set: 66 solved, 744 unsolved
Search for dead transitions found 66 dead transitions in 60835ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/463 places, 746/818 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 454 transition count 734
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 442 transition count 722
Applied a total of 14 rules in 9 ms. Remains 442 /456 variables (removed 14) and now considering 722/746 (removed 24) transitions.
[2024-06-01 14:29:26] [INFO ] Flow matrix only has 710 transitions (discarded 12 similar events)
// Phase 1: matrix 710 rows 442 cols
[2024-06-01 14:29:26] [INFO ] Computed 38 invariants in 8 ms
[2024-06-01 14:29:27] [INFO ] Implicit Places using invariants in 591 ms returned []
[2024-06-01 14:29:27] [INFO ] Flow matrix only has 710 transitions (discarded 12 similar events)
[2024-06-01 14:29:27] [INFO ] Invariant cache hit.
[2024-06-01 14:29:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:29:30] [INFO ] Implicit Places using invariants and state equation in 3331 ms returned []
Implicit Place search using SMT with State Equation took 3923 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 442/463 places, 722/818 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91192 ms. Remains : 442/463 places, 722/818 transitions.
Stuttering acceptance computed with spot in 394 ms :[(NOT p1), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 362 ms.
Product exploration explored 100000 steps with 50000 reset in 314 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 31 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J04T06-LTLCardinality-04 finished in 92422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 36 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 818/818 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 276 place count 324 transition count 680
Applied a total of 276 rules in 75 ms. Remains 324 /463 variables (removed 139) and now considering 680/818 (removed 138) transitions.
Running 678 sub problems to find dead transitions.
[2024-06-01 14:29:31] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 324 cols
[2024-06-01 14:29:31] [INFO ] Computed 38 invariants in 7 ms
[2024-06-01 14:29:31] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-06-01 14:29:35] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:29:35] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:29:38] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-06-01 14:29:40] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/324 variables, 5/42 constraints. Problems are: Problem set: 66 solved, 612 unsolved
[2024-06-01 14:29:48] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 3 ms to minimize.
[2024-06-01 14:29:48] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:29:48] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:29:48] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:29:48] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:29:48] [INFO ] Deduced a trap composed of 42 places in 26 ms of which 0 ms to minimize.
[2024-06-01 14:29:49] [INFO ] Deduced a trap composed of 127 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:29:49] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:29:49] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:29:49] [INFO ] Deduced a trap composed of 61 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:29:50] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:29:50] [INFO ] Deduced a trap composed of 180 places in 115 ms of which 1 ms to minimize.
[2024-06-01 14:29:51] [INFO ] Deduced a trap composed of 117 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:29:51] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:29:51] [INFO ] Deduced a trap composed of 120 places in 199 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 324/992 variables, and 57 constraints, problems are : Problem set: 66 solved, 612 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 66 solved, 612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 19/33 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 15/48 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/48 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 4 (OVERLAPS) 2/324 variables, 5/53 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 4/57 constraints. Problems are: Problem set: 66 solved, 612 unsolved
[2024-06-01 14:30:01] [INFO ] Deduced a trap composed of 129 places in 186 ms of which 2 ms to minimize.
[2024-06-01 14:30:02] [INFO ] Deduced a trap composed of 120 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:30:08] [INFO ] Deduced a trap composed of 109 places in 147 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 3/60 constraints. Problems are: Problem set: 66 solved, 612 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 9)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/992 variables, and 60 constraints, problems are : Problem set: 66 solved, 612 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/678 constraints, Known Traps: 22/22 constraints]
After SMT, in 40646ms problems are : Problem set: 66 solved, 612 unsolved
Search for dead transitions found 66 dead transitions in 40656ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-06-01 14:30:12] [INFO ] Flow matrix only has 602 transitions (discarded 12 similar events)
// Phase 1: matrix 602 rows 324 cols
[2024-06-01 14:30:12] [INFO ] Computed 38 invariants in 7 ms
[2024-06-01 14:30:12] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-06-01 14:30:12] [INFO ] Flow matrix only has 602 transitions (discarded 12 similar events)
[2024-06-01 14:30:12] [INFO ] Invariant cache hit.
[2024-06-01 14:30:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:30:15] [INFO ] Implicit Places using invariants and state equation in 2903 ms returned []
Implicit Place search using SMT with State Equation took 3330 ms to find 0 implicit places.
[2024-06-01 14:30:15] [INFO ] Redundant transitions in 47 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 324/463 places, 614/818 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 310 transition count 590
Applied a total of 12 rules in 17 ms. Remains 310 /324 variables (removed 14) and now considering 590/614 (removed 24) transitions.
[2024-06-01 14:30:15] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
// Phase 1: matrix 578 rows 310 cols
[2024-06-01 14:30:15] [INFO ] Computed 38 invariants in 15 ms
[2024-06-01 14:30:16] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-06-01 14:30:16] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 14:30:16] [INFO ] Invariant cache hit.
[2024-06-01 14:30:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:30:19] [INFO ] Implicit Places using invariants and state equation in 2765 ms returned []
Implicit Place search using SMT with State Equation took 3227 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 310/463 places, 590/818 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47385 ms. Remains : 310/463 places, 590/818 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLCardinality-06
Product exploration explored 100000 steps with 50 reset in 431 ms.
Product exploration explored 100000 steps with 51 reset in 407 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 247 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40002 steps (22 resets) in 366 ms. (108 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (26 resets) in 301 ms. (132 steps per ms) remains 1/1 properties
[2024-06-01 14:30:20] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 14:30:20] [INFO ] Invariant cache hit.
[2024-06-01 14:30:20] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 171/207 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/221 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 306/888 variables, and 35 constraints, problems are : Problem set: 1 solved, 0 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 308ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 30 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J04T06-LTLCardinality-06 finished in 49338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((G(p1)||F(p2)))))'
Support contains 36 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 818/818 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 462 transition count 818
Applied a total of 1 rules in 6 ms. Remains 462 /463 variables (removed 1) and now considering 818/818 (removed 0) transitions.
Running 816 sub problems to find dead transitions.
[2024-06-01 14:30:21] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 462 cols
[2024-06-01 14:30:21] [INFO ] Computed 38 invariants in 7 ms
[2024-06-01 14:30:21] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:30:26] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:30:27] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:30:27] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:30:27] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:30:27] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:30:27] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:30:27] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 0 ms to minimize.
[2024-06-01 14:30:27] [INFO ] Deduced a trap composed of 130 places in 162 ms of which 3 ms to minimize.
[2024-06-01 14:30:28] [INFO ] Deduced a trap composed of 223 places in 196 ms of which 3 ms to minimize.
[2024-06-01 14:30:28] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:30:28] [INFO ] Deduced a trap composed of 228 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:30:29] [INFO ] Deduced a trap composed of 205 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:30:31] [INFO ] Deduced a trap composed of 232 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:30:31] [INFO ] Deduced a trap composed of 232 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:30:31] [INFO ] Deduced a trap composed of 92 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:30:32] [INFO ] Deduced a trap composed of 249 places in 183 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:30:40] [INFO ] Deduced a trap composed of 294 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:30:40] [INFO ] Deduced a trap composed of 259 places in 173 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1268 variables, and 54 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:30:51] [INFO ] Deduced a trap composed of 312 places in 238 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1268 variables, and 55 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 19/19 constraints]
After SMT, in 40704ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 40714ms
[2024-06-01 14:31:01] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 14:31:01] [INFO ] Invariant cache hit.
[2024-06-01 14:31:02] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-06-01 14:31:02] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 14:31:02] [INFO ] Invariant cache hit.
[2024-06-01 14:31:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:31:05] [INFO ] Implicit Places using invariants and state equation in 3682 ms returned []
Implicit Place search using SMT with State Equation took 4050 ms to find 0 implicit places.
Running 816 sub problems to find dead transitions.
[2024-06-01 14:31:05] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 14:31:05] [INFO ] Invariant cache hit.
[2024-06-01 14:31:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:31:10] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 0 ms to minimize.
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 133 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:31:12] [INFO ] Deduced a trap composed of 251 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:31:12] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2024-06-01 14:31:12] [INFO ] Deduced a trap composed of 223 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:31:13] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-06-01 14:31:13] [INFO ] Deduced a trap composed of 312 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:31:13] [INFO ] Deduced a trap composed of 223 places in 165 ms of which 3 ms to minimize.
[2024-06-01 14:31:15] [INFO ] Deduced a trap composed of 211 places in 181 ms of which 3 ms to minimize.
[2024-06-01 14:31:15] [INFO ] Deduced a trap composed of 252 places in 172 ms of which 3 ms to minimize.
[2024-06-01 14:31:15] [INFO ] Deduced a trap composed of 239 places in 188 ms of which 3 ms to minimize.
[2024-06-01 14:31:15] [INFO ] Deduced a trap composed of 228 places in 180 ms of which 4 ms to minimize.
[2024-06-01 14:31:18] [INFO ] Deduced a trap composed of 236 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:31:18] [INFO ] Deduced a trap composed of 275 places in 149 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:31:21] [INFO ] Deduced a trap composed of 234 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:31:22] [INFO ] Deduced a trap composed of 323 places in 186 ms of which 3 ms to minimize.
[2024-06-01 14:31:23] [INFO ] Deduced a trap composed of 239 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:31:24] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:31:25] [INFO ] Deduced a trap composed of 293 places in 171 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:31:35] [INFO ] Deduced a trap composed of 312 places in 160 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 (/ 1.0 3.0))
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 10.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 (/ 1.0 3.0))
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 4.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 4.0)
(s343 0.0)
(s344 6.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 1.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 (/ 1.0 3.0))
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(timeout
s451 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1268 variables, and 61 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:31:46] [INFO ] Deduced a trap composed of 231 places in 151 ms of which 3 ms to minimize.
[2024-06-01 14:31:46] [INFO ] Deduced a trap composed of 253 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:31:46] [INFO ] Deduced a trap composed of 258 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:31:47] [INFO ] Deduced a trap composed of 237 places in 172 ms of which 3 ms to minimize.
[2024-06-01 14:31:51] [INFO ] Deduced a trap composed of 259 places in 180 ms of which 3 ms to minimize.
[2024-06-01 14:31:53] [INFO ] Deduced a trap composed of 267 places in 168 ms of which 3 ms to minimize.
[2024-06-01 14:31:54] [INFO ] Deduced a trap composed of 101 places in 228 ms of which 4 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 460/1268 variables, and 68 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 32/32 constraints]
After SMT, in 60680ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 60699ms
Starting structural reductions in LTL mode, iteration 1 : 462/463 places, 818/818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105476 ms. Remains : 462/463 places, 818/818 transitions.
Stuttering acceptance computed with spot in 501 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLCardinality-07
Product exploration explored 100000 steps with 25016 reset in 400 ms.
Product exploration explored 100000 steps with 25021 reset in 380 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 226 ms. Reduced automaton from 9 states, 24 edges and 3 AP (stutter sensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 40000 steps (12 resets) in 562 ms. (71 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 529 ms. (75 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 539 ms. (74 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 584 ms. (68 steps per ms) remains 3/3 properties
[2024-06-01 14:32:09] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 14:32:09] [INFO ] Invariant cache hit.
[2024-06-01 14:32:09] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 213/249 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 67/316 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/320 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 7 (OVERLAPS) 138/458 variables, 24/35 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/460 variables, 2/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 806/1266 variables, 460/497 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1266 variables, 72/569 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1266 variables, 0/569 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1268 variables, 2/571 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1268 variables, 1/572 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1268 variables, 0/572 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1268 variables, 0/572 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1268/1268 variables, and 572 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1225 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 462/462 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 213/249 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/316 variables, 7/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/320 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Int declared 458/1268 variables, and 35 constraints, problems are : Problem set: 3 solved, 0 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1447ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (G (OR p2 (NOT p0) p1)), (G (OR p2 p0 p1)), (G (OR p2 (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p1)))), (F p0), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 14 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J04T06-LTLCardinality-07 finished in 109660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (p1||G(p0)))))'
Support contains 3 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 818/818 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 462 transition count 777
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 421 transition count 777
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 82 place count 421 transition count 730
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 176 place count 374 transition count 730
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 284 place count 320 transition count 676
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 288 place count 316 transition count 672
Iterating global reduction 2 with 4 rules applied. Total rules applied 292 place count 316 transition count 672
Applied a total of 292 rules in 33 ms. Remains 316 /463 variables (removed 147) and now considering 672/818 (removed 146) transitions.
Running 670 sub problems to find dead transitions.
[2024-06-01 14:32:10] [INFO ] Flow matrix only has 660 transitions (discarded 12 similar events)
// Phase 1: matrix 660 rows 316 cols
[2024-06-01 14:32:10] [INFO ] Computed 38 invariants in 7 ms
[2024-06-01 14:32:10] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 109 places in 100 ms of which 1 ms to minimize.
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-06-01 14:32:15] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 4 ms to minimize.
[2024-06-01 14:32:15] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:32:16] [INFO ] Deduced a trap composed of 121 places in 106 ms of which 1 ms to minimize.
[2024-06-01 14:32:18] [INFO ] Deduced a trap composed of 130 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:32:18] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:32:18] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-01 14:32:23] [INFO ] Deduced a trap composed of 179 places in 144 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-01 14:32:28] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:32:28] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:32:29] [INFO ] Deduced a trap composed of 193 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/976 variables, and 56 constraints, problems are : Problem set: 0 solved, 670 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/316 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/316 variables, 2/58 constraints. Problems are: Problem set: 66 solved, 604 unsolved
[2024-06-01 14:32:49] [INFO ] Deduced a trap composed of 108 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:32:51] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/976 variables, and 60 constraints, problems are : Problem set: 66 solved, 604 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/316 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/670 constraints, Known Traps: 22/22 constraints]
After SMT, in 40584ms problems are : Problem set: 66 solved, 604 unsolved
Search for dead transitions found 66 dead transitions in 40590ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-06-01 14:32:51] [INFO ] Flow matrix only has 594 transitions (discarded 12 similar events)
// Phase 1: matrix 594 rows 316 cols
[2024-06-01 14:32:51] [INFO ] Computed 38 invariants in 11 ms
[2024-06-01 14:32:51] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-06-01 14:32:51] [INFO ] Flow matrix only has 594 transitions (discarded 12 similar events)
[2024-06-01 14:32:51] [INFO ] Invariant cache hit.
[2024-06-01 14:32:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:32:53] [INFO ] Implicit Places using invariants and state equation in 1999 ms returned []
Implicit Place search using SMT with State Equation took 2297 ms to find 0 implicit places.
[2024-06-01 14:32:53] [INFO ] Redundant transitions in 7 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 316/463 places, 606/818 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 302 transition count 582
Applied a total of 12 rules in 24 ms. Remains 302 /316 variables (removed 14) and now considering 582/606 (removed 24) transitions.
[2024-06-01 14:32:53] [INFO ] Flow matrix only has 570 transitions (discarded 12 similar events)
// Phase 1: matrix 570 rows 302 cols
[2024-06-01 14:32:53] [INFO ] Computed 38 invariants in 6 ms
[2024-06-01 14:32:54] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-01 14:32:54] [INFO ] Flow matrix only has 570 transitions (discarded 12 similar events)
[2024-06-01 14:32:54] [INFO ] Invariant cache hit.
[2024-06-01 14:32:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:32:56] [INFO ] Implicit Places using invariants and state equation in 2127 ms returned []
Implicit Place search using SMT with State Equation took 2521 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 302/463 places, 582/818 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45501 ms. Remains : 302/463 places, 582/818 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLCardinality-08
Stuttering criterion allowed to conclude after 3196 steps with 4 reset in 13 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLCardinality-08 finished in 45580 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 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 818/818 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 288 place count 318 transition count 674
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 292 place count 314 transition count 670
Iterating global reduction 2 with 4 rules applied. Total rules applied 296 place count 314 transition count 670
Applied a total of 296 rules in 38 ms. Remains 314 /463 variables (removed 149) and now considering 670/818 (removed 148) transitions.
Running 668 sub problems to find dead transitions.
[2024-06-01 14:32:56] [INFO ] Flow matrix only has 658 transitions (discarded 12 similar events)
// Phase 1: matrix 658 rows 314 cols
[2024-06-01 14:32:56] [INFO ] Computed 38 invariants in 10 ms
[2024-06-01 14:32:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 14:32:59] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:33:00] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:33:00] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:33:00] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 0 ms to minimize.
[2024-06-01 14:33:00] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-06-01 14:33:00] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 0 ms to minimize.
[2024-06-01 14:33:00] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:33:00] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:33:00] [INFO ] Deduced a trap composed of 108 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:33:01] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:33:02] [INFO ] Deduced a trap composed of 135 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:33:02] [INFO ] Deduced a trap composed of 114 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:33:03] [INFO ] Deduced a trap composed of 122 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:33:03] [INFO ] Deduced a trap composed of 124 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:33:05] [INFO ] Deduced a trap composed of 108 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:33:05] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:33:05] [INFO ] Deduced a trap composed of 122 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:33:05] [INFO ] Deduced a trap composed of 125 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 14:33:08] [INFO ] Deduced a trap composed of 186 places in 166 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/314 variables, 2/57 constraints. Problems are: Problem set: 7 solved, 661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/972 variables, and 57 constraints, problems are : Problem set: 7 solved, 661 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/314 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 668/668 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 7 solved, 661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 16/16 constraints. Problems are: Problem set: 7 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 20/36 constraints. Problems are: Problem set: 7 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 19/55 constraints. Problems are: Problem set: 7 solved, 661 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 0/55 constraints. Problems are: Problem set: 7 solved, 661 unsolved
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/314 variables, 2/57 constraints. Problems are: Problem set: 66 solved, 602 unsolved
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 120 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 107 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:33:35] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/972 variables, and 60 constraints, problems are : Problem set: 66 solved, 602 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/314 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/668 constraints, Known Traps: 22/22 constraints]
After SMT, in 40572ms problems are : Problem set: 66 solved, 602 unsolved
Search for dead transitions found 66 dead transitions in 40578ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-06-01 14:33:36] [INFO ] Flow matrix only has 592 transitions (discarded 12 similar events)
// Phase 1: matrix 592 rows 314 cols
[2024-06-01 14:33:36] [INFO ] Computed 38 invariants in 6 ms
[2024-06-01 14:33:37] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-06-01 14:33:37] [INFO ] Flow matrix only has 592 transitions (discarded 12 similar events)
[2024-06-01 14:33:37] [INFO ] Invariant cache hit.
[2024-06-01 14:33:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:33:39] [INFO ] Implicit Places using invariants and state equation in 2136 ms returned []
Implicit Place search using SMT with State Equation took 2441 ms to find 0 implicit places.
[2024-06-01 14:33:39] [INFO ] Redundant transitions in 5 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 314/463 places, 604/818 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 300 transition count 580
Applied a total of 12 rules in 14 ms. Remains 300 /314 variables (removed 14) and now considering 580/604 (removed 24) transitions.
[2024-06-01 14:33:39] [INFO ] Flow matrix only has 568 transitions (discarded 12 similar events)
// Phase 1: matrix 568 rows 300 cols
[2024-06-01 14:33:39] [INFO ] Computed 38 invariants in 7 ms
[2024-06-01 14:33:39] [INFO ] Implicit Places using invariants in 513 ms returned []
[2024-06-01 14:33:39] [INFO ] Flow matrix only has 568 transitions (discarded 12 similar events)
[2024-06-01 14:33:39] [INFO ] Invariant cache hit.
[2024-06-01 14:33:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:33:41] [INFO ] Implicit Places using invariants and state equation in 1907 ms returned []
Implicit Place search using SMT with State Equation took 2444 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 300/463 places, 580/818 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45529 ms. Remains : 300/463 places, 580/818 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLCardinality-11
Product exploration explored 100000 steps with 54 reset in 303 ms.
Stack based approach found an accepted trace after 341 steps with 0 reset with depth 342 and stack size 342 in 1 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLCardinality-11 finished in 45896 ms.
All properties solved by simple procedures.
Total runtime 439908 ms.
ITS solved all properties within timeout

BK_STOP 1717252422206

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S02J04T06, 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 r516-tajo-171654446600219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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