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.r289-tajo-171654445500235.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 greatspnxred
Input is PolyORBLF-PT-S02J04T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445500235
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 25K Apr 11 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 11 16:46 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.5K 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 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 11 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Apr 11 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K 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 906K 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-S02J04T10-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716860032508

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 01:33:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 01:33:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:33:54] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2024-05-28 01:33:54] [INFO ] Transformed 752 places.
[2024-05-28 01:33:54] [INFO ] Transformed 1572 transitions.
[2024-05-28 01:33:54] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 73 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 741 transition count 1403
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 741 transition count 1403
Applied a total of 20 rules in 112 ms. Remains 741 /752 variables (removed 11) and now considering 1403/1412 (removed 9) transitions.
Running 1401 sub problems to find dead transitions.
[2024-05-28 01:33:54] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
// Phase 1: matrix 1383 rows 741 cols
[2024-05-28 01:33:54] [INFO ] Computed 52 invariants in 81 ms
[2024-05-28 01:33:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/739 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/739 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 01:34:10] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 17 ms to minimize.
[2024-05-28 01:34:11] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2024-05-28 01:34:11] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-28 01:34:11] [INFO ] Deduced a trap composed of 66 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:34:11] [INFO ] Deduced a trap composed of 66 places in 46 ms of which 1 ms to minimize.
[2024-05-28 01:34:11] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-05-28 01:34:11] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-05-28 01:34:11] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 2 ms to minimize.
[2024-05-28 01:34:11] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 1 ms to minimize.
[2024-05-28 01:34:11] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:34:12] [INFO ] Deduced a trap composed of 395 places in 292 ms of which 4 ms to minimize.
[2024-05-28 01:34:12] [INFO ] Deduced a trap composed of 387 places in 277 ms of which 4 ms to minimize.
[2024-05-28 01:34:12] [INFO ] Deduced a trap composed of 386 places in 325 ms of which 4 ms to minimize.
[2024-05-28 01:34:13] [INFO ] Deduced a trap composed of 394 places in 287 ms of which 4 ms to minimize.
[2024-05-28 01:34:13] [INFO ] Deduced a trap composed of 170 places in 237 ms of which 3 ms to minimize.
[2024-05-28 01:34:13] [INFO ] Deduced a trap composed of 127 places in 200 ms of which 2 ms to minimize.
[2024-05-28 01:34:14] [INFO ] Deduced a trap composed of 370 places in 428 ms of which 6 ms to minimize.
[2024-05-28 01:34:14] [INFO ] Deduced a trap composed of 378 places in 379 ms of which 4 ms to minimize.
[2024-05-28 01:34:15] [INFO ] Deduced a trap composed of 405 places in 314 ms of which 4 ms to minimize.
[2024-05-28 01:34:15] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/739 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 739/2124 variables, and 70 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20087 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 39/41 constraints, State Equation: 0/741 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/739 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/739 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/739 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 739/2124 variables, and 70 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 39/41 constraints, State Equation: 0/741 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 20/20 constraints]
After SMT, in 42411ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 42464ms
[2024-05-28 01:34:36] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-05-28 01:34:36] [INFO ] Invariant cache hit.
[2024-05-28 01:34:37] [INFO ] Implicit Places using invariants in 771 ms returned [4, 102, 190, 276, 394, 434, 522, 574, 584, 666]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 785 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 731/752 places, 1403/1412 transitions.
Applied a total of 0 rules in 22 ms. Remains 731 /731 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43434 ms. Remains : 731/752 places, 1403/1412 transitions.
Support contains 73 out of 731 places after structural reductions.
[2024-05-28 01:34:38] [INFO ] Flatten gal took : 148 ms
[2024-05-28 01:34:38] [INFO ] Flatten gal took : 101 ms
[2024-05-28 01:34:38] [INFO ] Input system was already deterministic with 1403 transitions.
RANDOM walk for 40000 steps (9 resets) in 1737 ms. (23 steps per ms) remains 10/22 properties
BEST_FIRST walk for 40001 steps (9 resets) in 205 ms. (194 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 327 ms. (121 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 272 ms. (146 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 292 ms. (136 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 323 ms. (123 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 271 ms. (147 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 229 ms. (173 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 217 ms. (183 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 187 ms. (212 steps per ms) remains 9/9 properties
[2024-05-28 01:34:39] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
// Phase 1: matrix 1383 rows 731 cols
[2024-05-28 01:34:39] [INFO ] Computed 42 invariants in 36 ms
[2024-05-28 01:34:39] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 31/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/54 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 6 (OVERLAPS) 637/691 variables, 13/17 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/691 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 9/700 variables, 9/26 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/700 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 10 (OVERLAPS) 29/729 variables, 15/41 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/729 variables, 0/41 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1383/2112 variables, 729/770 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2112 variables, 120/890 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2112 variables, 0/890 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/2114 variables, 2/892 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2114 variables, 1/893 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2114 variables, 0/893 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/2114 variables, 0/893 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2114/2114 variables, and 893 constraints, problems are : Problem set: 5 solved, 4 unsolved in 2159 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 731/731 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 20/36 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 651/687 variables, 12/13 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/687 variables, 0/13 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/698 variables, 11/24 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/24 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 31/729 variables, 17/41 constraints. Problems are: Problem set: 5 solved, 4 unsolved
[2024-05-28 01:34:43] [INFO ] Deduced a trap composed of 65 places in 489 ms of which 20 ms to minimize.
[2024-05-28 01:34:44] [INFO ] Deduced a trap composed of 65 places in 1449 ms of which 3 ms to minimize.
[2024-05-28 01:34:44] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 3 ms to minimize.
[2024-05-28 01:34:45] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 3 ms to minimize.
[2024-05-28 01:34:45] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 2 ms to minimize.
[2024-05-28 01:34:45] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-05-28 01:34:45] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 2 ms to minimize.
[2024-05-28 01:34:45] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-28 01:34:45] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2024-05-28 01:34:46] [INFO ] Deduced a trap composed of 162 places in 717 ms of which 14 ms to minimize.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/729 variables, 10/51 constraints. Problems are: Problem set: 7 solved, 2 unsolved
[2024-05-28 01:34:46] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/729 variables, 1/52 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/729 variables, 0/52 constraints. Problems are: Problem set: 7 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2112/2114 variables, and 781 constraints, problems are : Problem set: 7 solved, 2 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 729/731 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 11/11 constraints]
After SMT, in 7266ms problems are : Problem set: 7 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 731 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 731/731 places, 1403/1403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 731 transition count 1332
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 143 place count 660 transition count 1331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 659 transition count 1331
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 144 place count 659 transition count 1251
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 304 place count 579 transition count 1251
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 305 place count 578 transition count 1250
Iterating global reduction 3 with 1 rules applied. Total rules applied 306 place count 578 transition count 1250
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 444 place count 509 transition count 1181
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 452 place count 501 transition count 1173
Iterating global reduction 3 with 8 rules applied. Total rules applied 460 place count 501 transition count 1173
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 480 place count 501 transition count 1153
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 500 place count 481 transition count 1153
Applied a total of 500 rules in 282 ms. Remains 481 /731 variables (removed 250) and now considering 1153/1403 (removed 250) transitions.
Running 1151 sub problems to find dead transitions.
[2024-05-28 01:34:47] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
// Phase 1: matrix 1133 rows 481 cols
[2024-05-28 01:34:47] [INFO ] Computed 42 invariants in 31 ms
[2024-05-28 01:34:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-05-28 01:34:58] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-28 01:34:58] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:34:58] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
[2024-05-28 01:34:58] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-28 01:34:58] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2024-05-28 01:34:58] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-05-28 01:34:58] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2024-05-28 01:34:58] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-28 01:34:58] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:34:59] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-28 01:34:59] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 2 ms to minimize.
[2024-05-28 01:34:59] [INFO ] Deduced a trap composed of 46 places in 307 ms of which 3 ms to minimize.
[2024-05-28 01:35:00] [INFO ] Deduced a trap composed of 111 places in 303 ms of which 3 ms to minimize.
[2024-05-28 01:35:02] [INFO ] Deduced a trap composed of 247 places in 244 ms of which 3 ms to minimize.
[2024-05-28 01:35:02] [INFO ] Deduced a trap composed of 194 places in 271 ms of which 4 ms to minimize.
[2024-05-28 01:35:03] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 3 ms to minimize.
[2024-05-28 01:35:04] [INFO ] Deduced a trap composed of 277 places in 267 ms of which 3 ms to minimize.
[2024-05-28 01:35:04] [INFO ] Deduced a trap composed of 193 places in 256 ms of which 4 ms to minimize.
[2024-05-28 01:35:05] [INFO ] Deduced a trap composed of 190 places in 251 ms of which 4 ms to minimize.
[2024-05-28 01:35:05] [INFO ] Deduced a trap composed of 198 places in 281 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-05-28 01:35:09] [INFO ] Deduced a trap composed of 282 places in 277 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 479/1614 variables, and 61 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1151/1151 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-05-28 01:35:22] [INFO ] Deduced a trap composed of 218 places in 270 ms of which 4 ms to minimize.
[2024-05-28 01:35:24] [INFO ] Deduced a trap composed of 242 places in 314 ms of which 3 ms to minimize.
[2024-05-28 01:35:24] [INFO ] Deduced a trap composed of 187 places in 280 ms of which 3 ms to minimize.
[2024-05-28 01:35:26] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 2 ms to minimize.
[2024-05-28 01:35:27] [INFO ] Deduced a trap composed of 215 places in 302 ms of which 7 ms to minimize.
[2024-05-28 01:35:28] [INFO ] Deduced a trap composed of 195 places in 232 ms of which 3 ms to minimize.
[2024-05-28 01:35:29] [INFO ] Deduced a trap composed of 193 places in 304 ms of which 4 ms to minimize.
[2024-05-28 01:35:29] [INFO ] Deduced a trap composed of 198 places in 268 ms of which 3 ms to minimize.
[2024-05-28 01:35:29] [INFO ] Deduced a trap composed of 192 places in 261 ms of which 3 ms to minimize.
[2024-05-28 01:35:30] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/1614 variables, and 71 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1151 constraints, Known Traps: 31/31 constraints]
After SMT, in 42846ms problems are : Problem set: 0 solved, 1151 unsolved
Search for dead transitions found 0 dead transitions in 42861ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43146 ms. Remains : 481/731 places, 1153/1403 transitions.
RANDOM walk for 40000 steps (14 resets) in 680 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 332 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 129756 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 2
Probabilistic random walk after 129756 steps, saw 82810 distinct states, run finished after 3004 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-28 01:35:33] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-05-28 01:35:33] [INFO ] Invariant cache hit.
[2024-05-28 01:35:33] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 405/418 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/435 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 43/478 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/479 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1133/1612 variables, 479/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1612 variables, 120/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1612 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/1614 variables, 2/642 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1614 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1614 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1614 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1614/1614 variables, and 643 constraints, problems are : Problem set: 0 solved, 2 unsolved in 825 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 481/481 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 405/418 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/435 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 43/478 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 01:35:34] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 3 ms to minimize.
[2024-05-28 01:35:35] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 3 ms to minimize.
[2024-05-28 01:35:35] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 3 ms to minimize.
[2024-05-28 01:35:35] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 5 ms to minimize.
[2024-05-28 01:35:35] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-28 01:35:35] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-28 01:35:35] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-28 01:35:35] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-05-28 01:35:35] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/479 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1133/1612 variables, 479/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1612 variables, 120/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/1612 variables, 2/651 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 01:35:41] [INFO ] Deduced a trap composed of 200 places in 331 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1612 variables, 1/652 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1612 variables, 0/652 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1614 variables, 2/654 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1614 variables, 1/655 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 01:35:42] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1614 variables, 1/656 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1614 variables, 0/656 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1614 variables, 0/656 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1614/1614 variables, and 656 constraints, problems are : Problem set: 1 solved, 1 unsolved in 7827 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 481/481 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 8667ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 187 ms.
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1153/1153 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 471 transition count 1143
Applied a total of 20 rules in 89 ms. Remains 471 /481 variables (removed 10) and now considering 1143/1153 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 471/481 places, 1143/1153 transitions.
RANDOM walk for 40000 steps (16 resets) in 706 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (9 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 170673 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 1
Probabilistic random walk after 170673 steps, saw 108270 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-28 01:35:46] [INFO ] Flow matrix only has 1123 transitions (discarded 20 similar events)
// Phase 1: matrix 1123 rows 471 cols
[2024-05-28 01:35:46] [INFO ] Computed 42 invariants in 12 ms
[2024-05-28 01:35:46] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 352/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/372 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/376 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/464 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/468 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/469 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/469 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1123/1592 variables, 469/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1592 variables, 120/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1592 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1594 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1594 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1594 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1594 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1594/1594 variables, and 633 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 471/471 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 352/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/372 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/376 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/464 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 01:35:47] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-28 01:35:47] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-05-28 01:35:47] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 1 ms to minimize.
[2024-05-28 01:35:47] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2024-05-28 01:35:47] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-05-28 01:35:47] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:35:47] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/468 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/469 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/469 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1123/1592 variables, 469/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1592 variables, 120/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1592 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1592 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1594 variables, 2/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1594 variables, 1/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 01:35:52] [INFO ] Deduced a trap composed of 23 places in 307 ms of which 3 ms to minimize.
[2024-05-28 01:35:53] [INFO ] Deduced a trap composed of 202 places in 314 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1594 variables, 2/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1594 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1594 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1594/1594 variables, and 643 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6595 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 471/471 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 7656ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 134 ms.
Support contains 2 out of 471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 1143/1143 transitions.
Applied a total of 0 rules in 28 ms. Remains 471 /471 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 471/471 places, 1143/1143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 1143/1143 transitions.
Applied a total of 0 rules in 28 ms. Remains 471 /471 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
[2024-05-28 01:35:53] [INFO ] Flow matrix only has 1123 transitions (discarded 20 similar events)
[2024-05-28 01:35:53] [INFO ] Invariant cache hit.
[2024-05-28 01:35:54] [INFO ] Implicit Places using invariants in 595 ms returned []
[2024-05-28 01:35:54] [INFO ] Flow matrix only has 1123 transitions (discarded 20 similar events)
[2024-05-28 01:35:54] [INFO ] Invariant cache hit.
[2024-05-28 01:35:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 01:36:03] [INFO ] Implicit Places using invariants and state equation in 8930 ms returned []
Implicit Place search using SMT with State Equation took 9527 ms to find 0 implicit places.
[2024-05-28 01:36:03] [INFO ] Redundant transitions in 67 ms returned []
Running 1141 sub problems to find dead transitions.
[2024-05-28 01:36:03] [INFO ] Flow matrix only has 1123 transitions (discarded 20 similar events)
[2024-05-28 01:36:03] [INFO ] Invariant cache hit.
[2024-05-28 01:36:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-05-28 01:36:13] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-05-28 01:36:13] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-05-28 01:36:14] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-28 01:36:14] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:36:14] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-28 01:36:14] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:36:14] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-28 01:36:14] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-28 01:36:14] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:36:14] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-28 01:36:15] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 2 ms to minimize.
[2024-05-28 01:36:15] [INFO ] Deduced a trap composed of 109 places in 296 ms of which 3 ms to minimize.
[2024-05-28 01:36:16] [INFO ] Deduced a trap composed of 100 places in 267 ms of which 3 ms to minimize.
[2024-05-28 01:36:16] [INFO ] Deduced a trap composed of 314 places in 277 ms of which 4 ms to minimize.
[2024-05-28 01:36:17] [INFO ] Deduced a trap composed of 288 places in 258 ms of which 4 ms to minimize.
[2024-05-28 01:36:17] [INFO ] Deduced a trap composed of 300 places in 309 ms of which 3 ms to minimize.
[2024-05-28 01:36:18] [INFO ] Deduced a trap composed of 172 places in 312 ms of which 3 ms to minimize.
[2024-05-28 01:36:19] [INFO ] Deduced a trap composed of 187 places in 274 ms of which 4 ms to minimize.
[2024-05-28 01:36:19] [INFO ] Deduced a trap composed of 281 places in 281 ms of which 3 ms to minimize.
[2024-05-28 01:36:20] [INFO ] Deduced a trap composed of 281 places in 262 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-05-28 01:36:23] [INFO ] Deduced a trap composed of 187 places in 300 ms of which 4 ms to minimize.
[2024-05-28 01:36:23] [INFO ] Deduced a trap composed of 207 places in 276 ms of which 4 ms to minimize.
[2024-05-28 01:36:23] [INFO ] Deduced a trap composed of 178 places in 283 ms of which 3 ms to minimize.
[2024-05-28 01:36:25] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 2 ms to minimize.
[2024-05-28 01:36:26] [INFO ] Deduced a trap composed of 259 places in 274 ms of which 3 ms to minimize.
[2024-05-28 01:36:26] [INFO ] Deduced a trap composed of 245 places in 300 ms of which 4 ms to minimize.
[2024-05-28 01:36:26] [INFO ] Deduced a trap composed of 172 places in 282 ms of which 4 ms to minimize.
[2024-05-28 01:36:28] [INFO ] Deduced a trap composed of 187 places in 281 ms of which 4 ms to minimize.
[2024-05-28 01:36:31] [INFO ] Deduced a trap composed of 77 places in 161 ms of which 2 ms to minimize.
[2024-05-28 01:36:32] [INFO ] Deduced a trap composed of 192 places in 276 ms of which 3 ms to minimize.
[2024-05-28 01:36:34] [INFO ] Deduced a trap composed of 274 places in 215 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/1594 variables, and 71 constraints, problems are : Problem set: 0 solved, 1141 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/471 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1141/1141 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/1594 variables, and 71 constraints, problems are : Problem set: 0 solved, 1141 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/471 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1141 constraints, Known Traps: 31/31 constraints]
After SMT, in 62831ms problems are : Problem set: 0 solved, 1141 unsolved
Search for dead transitions found 0 dead transitions in 62845ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72484 ms. Remains : 471/471 places, 1143/1143 transitions.
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-09 FALSE 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' '!(F(p0))'
Support contains 32 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 1403/1403 transitions.
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 731 transition count 1361
Reduce places removed 42 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 52 rules applied. Total rules applied 94 place count 689 transition count 1351
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 104 place count 679 transition count 1351
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 70 Pre rules applied. Total rules applied 104 place count 679 transition count 1281
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 244 place count 609 transition count 1281
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 245 place count 608 transition count 1280
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 608 transition count 1280
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 404 place count 529 transition count 1201
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 412 place count 521 transition count 1193
Iterating global reduction 3 with 8 rules applied. Total rules applied 420 place count 521 transition count 1193
Applied a total of 420 rules in 105 ms. Remains 521 /731 variables (removed 210) and now considering 1193/1403 (removed 210) transitions.
Running 1191 sub problems to find dead transitions.
[2024-05-28 01:37:06] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
// Phase 1: matrix 1173 rows 521 cols
[2024-05-28 01:37:06] [INFO ] Computed 42 invariants in 15 ms
[2024-05-28 01:37:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:37:17] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-28 01:37:17] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:37:17] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-05-28 01:37:17] [INFO ] Deduced a trap composed of 44 places in 29 ms of which 0 ms to minimize.
[2024-05-28 01:37:17] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:37:17] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-05-28 01:37:17] [INFO ] Deduced a trap composed of 235 places in 203 ms of which 3 ms to minimize.
[2024-05-28 01:37:17] [INFO ] Deduced a trap composed of 234 places in 196 ms of which 3 ms to minimize.
[2024-05-28 01:37:18] [INFO ] Deduced a trap composed of 45 places in 230 ms of which 4 ms to minimize.
[2024-05-28 01:37:18] [INFO ] Deduced a trap composed of 220 places in 204 ms of which 3 ms to minimize.
[2024-05-28 01:37:18] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 3 ms to minimize.
[2024-05-28 01:37:18] [INFO ] Deduced a trap composed of 223 places in 204 ms of which 3 ms to minimize.
[2024-05-28 01:37:18] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 3 ms to minimize.
[2024-05-28 01:37:19] [INFO ] Deduced a trap composed of 239 places in 200 ms of which 2 ms to minimize.
[2024-05-28 01:37:19] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 3 ms to minimize.
[2024-05-28 01:37:19] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 0 ms to minimize.
[2024-05-28 01:37:20] [INFO ] Deduced a trap composed of 68 places in 197 ms of which 3 ms to minimize.
[2024-05-28 01:37:20] [INFO ] Deduced a trap composed of 265 places in 196 ms of which 3 ms to minimize.
[2024-05-28 01:37:21] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-05-28 01:37:24] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:37:27] [INFO ] Deduced a trap composed of 212 places in 270 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/1694 variables, and 56 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1191/1191 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 21/56 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:37:37] [INFO ] Deduced a trap composed of 261 places in 262 ms of which 3 ms to minimize.
[2024-05-28 01:37:39] [INFO ] Deduced a trap composed of 260 places in 253 ms of which 3 ms to minimize.
[2024-05-28 01:37:39] [INFO ] Deduced a trap composed of 277 places in 239 ms of which 3 ms to minimize.
[2024-05-28 01:37:40] [INFO ] Deduced a trap composed of 297 places in 209 ms of which 2 ms to minimize.
[2024-05-28 01:37:40] [INFO ] Deduced a trap composed of 296 places in 261 ms of which 4 ms to minimize.
[2024-05-28 01:37:41] [INFO ] Deduced a trap composed of 288 places in 226 ms of which 3 ms to minimize.
[2024-05-28 01:37:41] [INFO ] Deduced a trap composed of 257 places in 227 ms of which 3 ms to minimize.
[2024-05-28 01:37:43] [INFO ] Deduced a trap composed of 216 places in 228 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/1694 variables, and 64 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1191 constraints, Known Traps: 29/29 constraints]
After SMT, in 42081ms problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 42094ms
[2024-05-28 01:37:48] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-05-28 01:37:48] [INFO ] Invariant cache hit.
[2024-05-28 01:37:49] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-05-28 01:37:49] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-05-28 01:37:49] [INFO ] Invariant cache hit.
[2024-05-28 01:37:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 01:38:00] [INFO ] Implicit Places using invariants and state equation in 10847 ms returned []
Implicit Place search using SMT with State Equation took 11395 ms to find 0 implicit places.
[2024-05-28 01:38:00] [INFO ] Redundant transitions in 23 ms returned []
Running 1191 sub problems to find dead transitions.
[2024-05-28 01:38:00] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-05-28 01:38:00] [INFO ] Invariant cache hit.
[2024-05-28 01:38:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:38:10] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-28 01:38:10] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-05-28 01:38:10] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:38:10] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:38:11] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 0 ms to minimize.
[2024-05-28 01:38:11] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-05-28 01:38:11] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-05-28 01:38:11] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-28 01:38:11] [INFO ] Deduced a trap composed of 229 places in 264 ms of which 4 ms to minimize.
[2024-05-28 01:38:11] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 4 ms to minimize.
[2024-05-28 01:38:12] [INFO ] Deduced a trap composed of 224 places in 261 ms of which 4 ms to minimize.
[2024-05-28 01:38:12] [INFO ] Deduced a trap composed of 219 places in 249 ms of which 4 ms to minimize.
[2024-05-28 01:38:12] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2024-05-28 01:38:12] [INFO ] Deduced a trap composed of 111 places in 194 ms of which 3 ms to minimize.
[2024-05-28 01:38:13] [INFO ] Deduced a trap composed of 235 places in 235 ms of which 3 ms to minimize.
[2024-05-28 01:38:13] [INFO ] Deduced a trap composed of 341 places in 198 ms of which 3 ms to minimize.
[2024-05-28 01:38:13] [INFO ] Deduced a trap composed of 255 places in 192 ms of which 3 ms to minimize.
[2024-05-28 01:38:13] [INFO ] Deduced a trap composed of 230 places in 196 ms of which 3 ms to minimize.
[2024-05-28 01:38:13] [INFO ] Deduced a trap composed of 257 places in 198 ms of which 3 ms to minimize.
[2024-05-28 01:38:14] [INFO ] Deduced a trap composed of 252 places in 322 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:38:16] [INFO ] Deduced a trap composed of 198 places in 293 ms of which 3 ms to minimize.
[2024-05-28 01:38:17] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 3 ms to minimize.
[2024-05-28 01:38:17] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-05-28 01:38:25] [INFO ] Deduced a trap composed of 287 places in 232 ms of which 3 ms to minimize.
[2024-05-28 01:38:25] [INFO ] Deduced a trap composed of 273 places in 231 ms of which 3 ms to minimize.
[2024-05-28 01:38:27] [INFO ] Deduced a trap composed of 275 places in 261 ms of which 4 ms to minimize.
[2024-05-28 01:38:27] [INFO ] Deduced a trap composed of 287 places in 214 ms of which 3 ms to minimize.
[2024-05-28 01:38:27] [INFO ] Deduced a trap composed of 323 places in 201 ms of which 3 ms to minimize.
[2024-05-28 01:38:27] [INFO ] Deduced a trap composed of 273 places in 191 ms of which 3 ms to minimize.
[2024-05-28 01:38:28] [INFO ] Deduced a trap composed of 247 places in 254 ms of which 3 ms to minimize.
[2024-05-28 01:38:28] [INFO ] Deduced a trap composed of 258 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/1694 variables, and 66 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1191/1191 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 31/66 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:38:40] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-28 01:38:40] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-28 01:38:40] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2024-05-28 01:38:40] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-28 01:38:41] [INFO ] Deduced a trap composed of 321 places in 295 ms of which 4 ms to minimize.
[2024-05-28 01:38:41] [INFO ] Deduced a trap composed of 343 places in 233 ms of which 2 ms to minimize.
[2024-05-28 01:38:43] [INFO ] Deduced a trap composed of 270 places in 272 ms of which 3 ms to minimize.
[2024-05-28 01:38:44] [INFO ] Deduced a trap composed of 287 places in 309 ms of which 3 ms to minimize.
[2024-05-28 01:38:45] [INFO ] Deduced a trap composed of 354 places in 254 ms of which 4 ms to minimize.
[2024-05-28 01:38:46] [INFO ] Deduced a trap composed of 359 places in 257 ms of which 3 ms to minimize.
[2024-05-28 01:38:46] [INFO ] Deduced a trap composed of 330 places in 217 ms of which 3 ms to minimize.
[2024-05-28 01:38:46] [INFO ] Deduced a trap composed of 344 places in 214 ms of which 3 ms to minimize.
[2024-05-28 01:38:48] [INFO ] Deduced a trap composed of 332 places in 305 ms of which 4 ms to minimize.
[2024-05-28 01:38:48] [INFO ] Deduced a trap composed of 351 places in 293 ms of which 4 ms to minimize.
[2024-05-28 01:38:49] [INFO ] Deduced a trap composed of 348 places in 242 ms of which 3 ms to minimize.
[2024-05-28 01:38:50] [INFO ] Deduced a trap composed of 258 places in 314 ms of which 3 ms to minimize.
[2024-05-28 01:38:52] [INFO ] Deduced a trap composed of 300 places in 337 ms of which 4 ms to minimize.
[2024-05-28 01:38:52] [INFO ] Deduced a trap composed of 320 places in 298 ms of which 4 ms to minimize.
[2024-05-28 01:38:52] [INFO ] Deduced a trap composed of 322 places in 288 ms of which 3 ms to minimize.
[2024-05-28 01:38:52] [INFO ] Deduced a trap composed of 309 places in 257 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/1694 variables, and 86 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1191 constraints, Known Traps: 51/51 constraints]
After SMT, in 61866ms problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 61877ms
Starting structural reductions in SI_LTL mode, iteration 1 : 521/731 places, 1193/1403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115513 ms. Remains : 521/731 places, 1193/1403 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLCardinality-02
Product exploration explored 100000 steps with 2316 reset in 628 ms.
Product exploration explored 100000 steps with 2316 reset in 537 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 175 steps (0 resets) in 5 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2024-05-28 01:39:03] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-05-28 01:39:03] [INFO ] Invariant cache hit.
[2024-05-28 01:39:04] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 01:39:04] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 64 ms returned sat
[2024-05-28 01:39:05] [INFO ] [Real]Absence check using state equation in 1316 ms returned sat
[2024-05-28 01:39:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:39:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 01:39:06] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 77 ms returned sat
[2024-05-28 01:39:09] [INFO ] [Nat]Absence check using state equation in 2516 ms returned sat
[2024-05-28 01:39:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 01:39:09] [INFO ] [Nat]Added 120 Read/Feed constraints in 861 ms returned sat
[2024-05-28 01:39:10] [INFO ] Deduced a trap composed of 226 places in 309 ms of which 4 ms to minimize.
[2024-05-28 01:39:11] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1856 ms
Could not prove EG (NOT p0)
Support contains 32 out of 521 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 521/521 places, 1193/1193 transitions.
Applied a total of 0 rules in 48 ms. Remains 521 /521 variables (removed 0) and now considering 1193/1193 (removed 0) transitions.
Running 1191 sub problems to find dead transitions.
[2024-05-28 01:39:11] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-05-28 01:39:11] [INFO ] Invariant cache hit.
[2024-05-28 01:39:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:39:22] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 2 ms to minimize.
[2024-05-28 01:39:22] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-28 01:39:22] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2024-05-28 01:39:22] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-05-28 01:39:22] [INFO ] Deduced a trap composed of 44 places in 26 ms of which 1 ms to minimize.
[2024-05-28 01:39:22] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-05-28 01:39:22] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:39:23] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:39:23] [INFO ] Deduced a trap composed of 229 places in 223 ms of which 3 ms to minimize.
[2024-05-28 01:39:23] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 3 ms to minimize.
[2024-05-28 01:39:23] [INFO ] Deduced a trap composed of 224 places in 242 ms of which 4 ms to minimize.
[2024-05-28 01:39:24] [INFO ] Deduced a trap composed of 219 places in 202 ms of which 3 ms to minimize.
[2024-05-28 01:39:24] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-05-28 01:39:24] [INFO ] Deduced a trap composed of 111 places in 237 ms of which 3 ms to minimize.
[2024-05-28 01:39:24] [INFO ] Deduced a trap composed of 235 places in 265 ms of which 3 ms to minimize.
[2024-05-28 01:39:25] [INFO ] Deduced a trap composed of 341 places in 214 ms of which 4 ms to minimize.
[2024-05-28 01:39:25] [INFO ] Deduced a trap composed of 255 places in 213 ms of which 3 ms to minimize.
[2024-05-28 01:39:25] [INFO ] Deduced a trap composed of 230 places in 203 ms of which 3 ms to minimize.
[2024-05-28 01:39:25] [INFO ] Deduced a trap composed of 257 places in 211 ms of which 2 ms to minimize.
[2024-05-28 01:39:25] [INFO ] Deduced a trap composed of 252 places in 198 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:39:28] [INFO ] Deduced a trap composed of 198 places in 289 ms of which 3 ms to minimize.
[2024-05-28 01:39:28] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 2 ms to minimize.
[2024-05-28 01:39:29] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/1694 variables, and 58 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1191/1191 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 23/58 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:39:41] [INFO ] Deduced a trap composed of 285 places in 298 ms of which 4 ms to minimize.
[2024-05-28 01:39:41] [INFO ] Deduced a trap composed of 42 places in 266 ms of which 4 ms to minimize.
[2024-05-28 01:39:41] [INFO ] Deduced a trap composed of 42 places in 259 ms of which 4 ms to minimize.
[2024-05-28 01:39:41] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-28 01:39:41] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:39:41] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-05-28 01:39:42] [INFO ] Deduced a trap composed of 262 places in 320 ms of which 4 ms to minimize.
[2024-05-28 01:39:42] [INFO ] Deduced a trap composed of 275 places in 298 ms of which 3 ms to minimize.
[2024-05-28 01:39:43] [INFO ] Deduced a trap composed of 273 places in 297 ms of which 4 ms to minimize.
[2024-05-28 01:39:43] [INFO ] Deduced a trap composed of 167 places in 275 ms of which 4 ms to minimize.
[2024-05-28 01:39:43] [INFO ] Deduced a trap composed of 293 places in 239 ms of which 3 ms to minimize.
[2024-05-28 01:39:44] [INFO ] Deduced a trap composed of 282 places in 222 ms of which 4 ms to minimize.
[2024-05-28 01:39:44] [INFO ] Deduced a trap composed of 285 places in 271 ms of which 3 ms to minimize.
[2024-05-28 01:39:44] [INFO ] Deduced a trap composed of 337 places in 212 ms of which 3 ms to minimize.
[2024-05-28 01:39:44] [INFO ] Deduced a trap composed of 306 places in 210 ms of which 3 ms to minimize.
[2024-05-28 01:39:44] [INFO ] Deduced a trap composed of 269 places in 211 ms of which 3 ms to minimize.
[2024-05-28 01:39:45] [INFO ] Deduced a trap composed of 42 places in 255 ms of which 3 ms to minimize.
[2024-05-28 01:39:45] [INFO ] Deduced a trap composed of 232 places in 212 ms of which 3 ms to minimize.
[2024-05-28 01:39:46] [INFO ] Deduced a trap composed of 303 places in 289 ms of which 3 ms to minimize.
[2024-05-28 01:39:46] [INFO ] Deduced a trap composed of 305 places in 263 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/1694 variables, and 78 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1191 constraints, Known Traps: 43/43 constraints]
After SMT, in 42072ms problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 42093ms
[2024-05-28 01:39:53] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-05-28 01:39:53] [INFO ] Invariant cache hit.
[2024-05-28 01:39:54] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-05-28 01:39:54] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-05-28 01:39:54] [INFO ] Invariant cache hit.
[2024-05-28 01:39:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 01:40:05] [INFO ] Implicit Places using invariants and state equation in 11186 ms returned []
Implicit Place search using SMT with State Equation took 11740 ms to find 0 implicit places.
[2024-05-28 01:40:05] [INFO ] Redundant transitions in 16 ms returned []
Running 1191 sub problems to find dead transitions.
[2024-05-28 01:40:05] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-05-28 01:40:05] [INFO ] Invariant cache hit.
[2024-05-28 01:40:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:40:17] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-05-28 01:40:17] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
[2024-05-28 01:40:17] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-28 01:40:17] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-28 01:40:18] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-28 01:40:18] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2024-05-28 01:40:18] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-28 01:40:18] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 2 ms to minimize.
[2024-05-28 01:40:18] [INFO ] Deduced a trap composed of 229 places in 264 ms of which 4 ms to minimize.
[2024-05-28 01:40:18] [INFO ] Deduced a trap composed of 45 places in 219 ms of which 3 ms to minimize.
[2024-05-28 01:40:19] [INFO ] Deduced a trap composed of 224 places in 240 ms of which 3 ms to minimize.
[2024-05-28 01:40:19] [INFO ] Deduced a trap composed of 219 places in 194 ms of which 4 ms to minimize.
[2024-05-28 01:40:19] [INFO ] Deduced a trap composed of 44 places in 27 ms of which 0 ms to minimize.
[2024-05-28 01:40:19] [INFO ] Deduced a trap composed of 111 places in 223 ms of which 3 ms to minimize.
[2024-05-28 01:40:20] [INFO ] Deduced a trap composed of 235 places in 233 ms of which 2 ms to minimize.
[2024-05-28 01:40:20] [INFO ] Deduced a trap composed of 341 places in 198 ms of which 2 ms to minimize.
[2024-05-28 01:40:20] [INFO ] Deduced a trap composed of 255 places in 197 ms of which 3 ms to minimize.
[2024-05-28 01:40:20] [INFO ] Deduced a trap composed of 230 places in 203 ms of which 3 ms to minimize.
[2024-05-28 01:40:20] [INFO ] Deduced a trap composed of 257 places in 210 ms of which 5 ms to minimize.
[2024-05-28 01:40:21] [INFO ] Deduced a trap composed of 252 places in 200 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:40:23] [INFO ] Deduced a trap composed of 198 places in 289 ms of which 4 ms to minimize.
[2024-05-28 01:40:23] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 2 ms to minimize.
[2024-05-28 01:40:24] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 2 ms to minimize.
[2024-05-28 01:40:31] [INFO ] Deduced a trap composed of 287 places in 290 ms of which 3 ms to minimize.
[2024-05-28 01:40:31] [INFO ] Deduced a trap composed of 273 places in 247 ms of which 3 ms to minimize.
[2024-05-28 01:40:32] [INFO ] Deduced a trap composed of 275 places in 257 ms of which 4 ms to minimize.
[2024-05-28 01:40:33] [INFO ] Deduced a trap composed of 287 places in 187 ms of which 3 ms to minimize.
[2024-05-28 01:40:33] [INFO ] Deduced a trap composed of 323 places in 214 ms of which 3 ms to minimize.
[2024-05-28 01:40:33] [INFO ] Deduced a trap composed of 273 places in 191 ms of which 3 ms to minimize.
[2024-05-28 01:40:34] [INFO ] Deduced a trap composed of 247 places in 263 ms of which 3 ms to minimize.
[2024-05-28 01:40:34] [INFO ] Deduced a trap composed of 258 places in 229 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/1694 variables, and 66 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1191/1191 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 31/66 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:40:46] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-28 01:40:46] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-28 01:40:46] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-28 01:40:46] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:40:47] [INFO ] Deduced a trap composed of 321 places in 287 ms of which 3 ms to minimize.
[2024-05-28 01:40:47] [INFO ] Deduced a trap composed of 343 places in 240 ms of which 3 ms to minimize.
[2024-05-28 01:40:49] [INFO ] Deduced a trap composed of 270 places in 257 ms of which 2 ms to minimize.
[2024-05-28 01:40:50] [INFO ] Deduced a trap composed of 287 places in 282 ms of which 3 ms to minimize.
[2024-05-28 01:40:51] [INFO ] Deduced a trap composed of 354 places in 310 ms of which 3 ms to minimize.
[2024-05-28 01:40:51] [INFO ] Deduced a trap composed of 359 places in 262 ms of which 4 ms to minimize.
[2024-05-28 01:40:52] [INFO ] Deduced a trap composed of 330 places in 263 ms of which 3 ms to minimize.
[2024-05-28 01:40:52] [INFO ] Deduced a trap composed of 344 places in 211 ms of which 3 ms to minimize.
[2024-05-28 01:40:54] [INFO ] Deduced a trap composed of 332 places in 307 ms of which 4 ms to minimize.
[2024-05-28 01:40:54] [INFO ] Deduced a trap composed of 351 places in 314 ms of which 4 ms to minimize.
[2024-05-28 01:40:54] [INFO ] Deduced a trap composed of 348 places in 256 ms of which 3 ms to minimize.
[2024-05-28 01:40:56] [INFO ] Deduced a trap composed of 258 places in 276 ms of which 4 ms to minimize.
[2024-05-28 01:40:57] [INFO ] Deduced a trap composed of 300 places in 313 ms of which 4 ms to minimize.
[2024-05-28 01:40:57] [INFO ] Deduced a trap composed of 320 places in 304 ms of which 3 ms to minimize.
[2024-05-28 01:40:57] [INFO ] Deduced a trap composed of 322 places in 267 ms of which 3 ms to minimize.
[2024-05-28 01:40:57] [INFO ] Deduced a trap composed of 309 places in 251 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:41:07] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 2 ms to minimize.
[2024-05-28 01:41:07] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/1694 variables, and 88 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1191 constraints, Known Traps: 53/53 constraints]
After SMT, in 62309ms problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 62333ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116250 ms. Remains : 521/521 places, 1193/1193 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 168 steps (0 resets) in 6 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-05-28 01:41:08] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-05-28 01:41:08] [INFO ] Invariant cache hit.
[2024-05-28 01:41:09] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 01:41:09] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 65 ms returned sat
[2024-05-28 01:41:10] [INFO ] [Real]Absence check using state equation in 1365 ms returned sat
[2024-05-28 01:41:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:41:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-28 01:41:11] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 82 ms returned sat
[2024-05-28 01:41:13] [INFO ] [Nat]Absence check using state equation in 2159 ms returned sat
[2024-05-28 01:41:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 01:41:14] [INFO ] [Nat]Added 120 Read/Feed constraints in 830 ms returned sat
[2024-05-28 01:41:14] [INFO ] Deduced a trap composed of 226 places in 328 ms of which 4 ms to minimize.
[2024-05-28 01:41:16] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1869 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2321 reset in 646 ms.
Product exploration explored 100000 steps with 2321 reset in 514 ms.
Support contains 32 out of 521 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 521/521 places, 1193/1193 transitions.
Applied a total of 0 rules in 48 ms. Remains 521 /521 variables (removed 0) and now considering 1193/1193 (removed 0) transitions.
Running 1191 sub problems to find dead transitions.
[2024-05-28 01:41:17] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-05-28 01:41:17] [INFO ] Invariant cache hit.
[2024-05-28 01:41:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:41:28] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-05-28 01:41:28] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-28 01:41:28] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:41:28] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-28 01:41:29] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2024-05-28 01:41:29] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-05-28 01:41:29] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-05-28 01:41:29] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
[2024-05-28 01:41:29] [INFO ] Deduced a trap composed of 229 places in 262 ms of which 4 ms to minimize.
[2024-05-28 01:41:29] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 3 ms to minimize.
[2024-05-28 01:41:29] [INFO ] Deduced a trap composed of 224 places in 222 ms of which 3 ms to minimize.
[2024-05-28 01:41:30] [INFO ] Deduced a trap composed of 219 places in 228 ms of which 3 ms to minimize.
[2024-05-28 01:41:30] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-05-28 01:41:30] [INFO ] Deduced a trap composed of 111 places in 256 ms of which 3 ms to minimize.
[2024-05-28 01:41:31] [INFO ] Deduced a trap composed of 235 places in 260 ms of which 4 ms to minimize.
[2024-05-28 01:41:31] [INFO ] Deduced a trap composed of 341 places in 255 ms of which 4 ms to minimize.
[2024-05-28 01:41:31] [INFO ] Deduced a trap composed of 255 places in 263 ms of which 3 ms to minimize.
[2024-05-28 01:41:31] [INFO ] Deduced a trap composed of 230 places in 203 ms of which 2 ms to minimize.
[2024-05-28 01:41:32] [INFO ] Deduced a trap composed of 257 places in 193 ms of which 3 ms to minimize.
[2024-05-28 01:41:32] [INFO ] Deduced a trap composed of 252 places in 189 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:41:34] [INFO ] Deduced a trap composed of 198 places in 299 ms of which 4 ms to minimize.
[2024-05-28 01:41:35] [INFO ] Deduced a trap composed of 37 places in 340 ms of which 3 ms to minimize.
[2024-05-28 01:41:36] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/1694 variables, and 58 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1191/1191 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 23/58 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:41:46] [INFO ] Deduced a trap composed of 285 places in 261 ms of which 4 ms to minimize.
[2024-05-28 01:41:46] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 2 ms to minimize.
[2024-05-28 01:41:46] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 3 ms to minimize.
[2024-05-28 01:41:46] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-28 01:41:46] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:41:47] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:41:47] [INFO ] Deduced a trap composed of 262 places in 314 ms of which 4 ms to minimize.
[2024-05-28 01:41:47] [INFO ] Deduced a trap composed of 275 places in 285 ms of which 5 ms to minimize.
[2024-05-28 01:41:48] [INFO ] Deduced a trap composed of 273 places in 258 ms of which 3 ms to minimize.
[2024-05-28 01:41:48] [INFO ] Deduced a trap composed of 167 places in 234 ms of which 3 ms to minimize.
[2024-05-28 01:41:48] [INFO ] Deduced a trap composed of 293 places in 251 ms of which 4 ms to minimize.
[2024-05-28 01:41:49] [INFO ] Deduced a trap composed of 282 places in 219 ms of which 3 ms to minimize.
[2024-05-28 01:41:49] [INFO ] Deduced a trap composed of 285 places in 206 ms of which 3 ms to minimize.
[2024-05-28 01:41:49] [INFO ] Deduced a trap composed of 337 places in 207 ms of which 3 ms to minimize.
[2024-05-28 01:41:49] [INFO ] Deduced a trap composed of 306 places in 209 ms of which 3 ms to minimize.
[2024-05-28 01:41:49] [INFO ] Deduced a trap composed of 269 places in 253 ms of which 2 ms to minimize.
[2024-05-28 01:41:50] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 3 ms to minimize.
[2024-05-28 01:41:50] [INFO ] Deduced a trap composed of 232 places in 294 ms of which 4 ms to minimize.
[2024-05-28 01:41:51] [INFO ] Deduced a trap composed of 303 places in 257 ms of which 4 ms to minimize.
[2024-05-28 01:41:51] [INFO ] Deduced a trap composed of 305 places in 251 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:41:59] [INFO ] Deduced a trap composed of 294 places in 269 ms of which 4 ms to minimize.
[2024-05-28 01:41:59] [INFO ] Deduced a trap composed of 257 places in 205 ms of which 2 ms to minimize.
SMT process timed out in 41946ms, After SMT, problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 41965ms
[2024-05-28 01:41:59] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-05-28 01:41:59] [INFO ] Invariant cache hit.
[2024-05-28 01:41:59] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-28 01:41:59] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-05-28 01:41:59] [INFO ] Invariant cache hit.
[2024-05-28 01:42:00] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 01:42:10] [INFO ] Implicit Places using invariants and state equation in 10561 ms returned []
Implicit Place search using SMT with State Equation took 11001 ms to find 0 implicit places.
[2024-05-28 01:42:10] [INFO ] Redundant transitions in 15 ms returned []
Running 1191 sub problems to find dead transitions.
[2024-05-28 01:42:10] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-05-28 01:42:10] [INFO ] Invariant cache hit.
[2024-05-28 01:42:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:42:21] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-28 01:42:21] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 01:42:21] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 01:42:21] [INFO ] Deduced a trap composed of 44 places in 26 ms of which 1 ms to minimize.
[2024-05-28 01:42:21] [INFO ] Deduced a trap composed of 44 places in 25 ms of which 0 ms to minimize.
[2024-05-28 01:42:21] [INFO ] Deduced a trap composed of 44 places in 26 ms of which 0 ms to minimize.
[2024-05-28 01:42:21] [INFO ] Deduced a trap composed of 44 places in 26 ms of which 1 ms to minimize.
[2024-05-28 01:42:21] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-28 01:42:22] [INFO ] Deduced a trap composed of 229 places in 206 ms of which 3 ms to minimize.
[2024-05-28 01:42:22] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 2 ms to minimize.
[2024-05-28 01:42:22] [INFO ] Deduced a trap composed of 224 places in 221 ms of which 2 ms to minimize.
[2024-05-28 01:42:22] [INFO ] Deduced a trap composed of 219 places in 190 ms of which 3 ms to minimize.
[2024-05-28 01:42:22] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 1 ms to minimize.
[2024-05-28 01:42:23] [INFO ] Deduced a trap composed of 111 places in 245 ms of which 3 ms to minimize.
[2024-05-28 01:42:23] [INFO ] Deduced a trap composed of 235 places in 238 ms of which 3 ms to minimize.
[2024-05-28 01:42:23] [INFO ] Deduced a trap composed of 341 places in 221 ms of which 3 ms to minimize.
[2024-05-28 01:42:24] [INFO ] Deduced a trap composed of 255 places in 325 ms of which 3 ms to minimize.
[2024-05-28 01:42:24] [INFO ] Deduced a trap composed of 230 places in 193 ms of which 3 ms to minimize.
[2024-05-28 01:42:24] [INFO ] Deduced a trap composed of 257 places in 193 ms of which 3 ms to minimize.
[2024-05-28 01:42:24] [INFO ] Deduced a trap composed of 252 places in 193 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:42:27] [INFO ] Deduced a trap composed of 198 places in 296 ms of which 4 ms to minimize.
[2024-05-28 01:42:28] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 2 ms to minimize.
[2024-05-28 01:42:28] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-05-28 01:42:35] [INFO ] Deduced a trap composed of 287 places in 211 ms of which 2 ms to minimize.
[2024-05-28 01:42:35] [INFO ] Deduced a trap composed of 273 places in 244 ms of which 3 ms to minimize.
[2024-05-28 01:42:36] [INFO ] Deduced a trap composed of 275 places in 196 ms of which 3 ms to minimize.
[2024-05-28 01:42:37] [INFO ] Deduced a trap composed of 287 places in 223 ms of which 3 ms to minimize.
[2024-05-28 01:42:37] [INFO ] Deduced a trap composed of 323 places in 185 ms of which 3 ms to minimize.
[2024-05-28 01:42:37] [INFO ] Deduced a trap composed of 273 places in 222 ms of which 3 ms to minimize.
[2024-05-28 01:42:38] [INFO ] Deduced a trap composed of 247 places in 259 ms of which 3 ms to minimize.
[2024-05-28 01:42:38] [INFO ] Deduced a trap composed of 258 places in 194 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/1694 variables, and 66 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1191/1191 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 31/66 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:42:49] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-28 01:42:49] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-28 01:42:50] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:42:50] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
[2024-05-28 01:42:51] [INFO ] Deduced a trap composed of 321 places in 313 ms of which 4 ms to minimize.
[2024-05-28 01:42:51] [INFO ] Deduced a trap composed of 343 places in 289 ms of which 4 ms to minimize.
[2024-05-28 01:42:52] [INFO ] Deduced a trap composed of 270 places in 286 ms of which 3 ms to minimize.
[2024-05-28 01:42:53] [INFO ] Deduced a trap composed of 287 places in 261 ms of which 3 ms to minimize.
[2024-05-28 01:42:55] [INFO ] Deduced a trap composed of 354 places in 245 ms of which 3 ms to minimize.
[2024-05-28 01:42:55] [INFO ] Deduced a trap composed of 359 places in 241 ms of which 3 ms to minimize.
[2024-05-28 01:42:55] [INFO ] Deduced a trap composed of 330 places in 223 ms of which 3 ms to minimize.
[2024-05-28 01:42:56] [INFO ] Deduced a trap composed of 344 places in 250 ms of which 4 ms to minimize.
[2024-05-28 01:42:58] [INFO ] Deduced a trap composed of 332 places in 285 ms of which 3 ms to minimize.
[2024-05-28 01:42:58] [INFO ] Deduced a trap composed of 351 places in 253 ms of which 3 ms to minimize.
[2024-05-28 01:42:58] [INFO ] Deduced a trap composed of 348 places in 245 ms of which 3 ms to minimize.
[2024-05-28 01:43:00] [INFO ] Deduced a trap composed of 258 places in 299 ms of which 4 ms to minimize.
[2024-05-28 01:43:01] [INFO ] Deduced a trap composed of 300 places in 320 ms of which 4 ms to minimize.
[2024-05-28 01:43:01] [INFO ] Deduced a trap composed of 320 places in 291 ms of which 3 ms to minimize.
[2024-05-28 01:43:02] [INFO ] Deduced a trap composed of 322 places in 288 ms of which 4 ms to minimize.
[2024-05-28 01:43:02] [INFO ] Deduced a trap composed of 309 places in 267 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-28 01:43:12] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 2 ms to minimize.
SMT process timed out in 61718ms, After SMT, problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 61729ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 114771 ms. Remains : 521/521 places, 1193/1193 transitions.
Treatment of property PolyORBLF-PT-S02J04T10-LTLCardinality-02 finished in 365984 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 X(p1)))'
Support contains 11 out of 731 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 731/731 places, 1403/1403 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 721 transition count 1393
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 721 transition count 1393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 720 transition count 1392
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 720 transition count 1392
Applied a total of 22 rules in 45 ms. Remains 720 /731 variables (removed 11) and now considering 1392/1403 (removed 11) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 01:43:12] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 720 cols
[2024-05-28 01:43:12] [INFO ] Computed 42 invariants in 21 ms
[2024-05-28 01:43:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:43:28] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 2 ms to minimize.
[2024-05-28 01:43:28] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 01:43:28] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:43:28] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 1 ms to minimize.
[2024-05-28 01:43:28] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 0 ms to minimize.
[2024-05-28 01:43:29] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:43:29] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 01:43:29] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 01:43:29] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 01:43:29] [INFO ] Deduced a trap composed of 383 places in 398 ms of which 5 ms to minimize.
[2024-05-28 01:43:29] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:43:30] [INFO ] Deduced a trap composed of 490 places in 425 ms of which 5 ms to minimize.
[2024-05-28 01:43:31] [INFO ] Deduced a trap composed of 207 places in 321 ms of which 4 ms to minimize.
[2024-05-28 01:43:31] [INFO ] Deduced a trap composed of 274 places in 295 ms of which 3 ms to minimize.
[2024-05-28 01:43:31] [INFO ] Deduced a trap composed of 227 places in 293 ms of which 4 ms to minimize.
[2024-05-28 01:43:32] [INFO ] Deduced a trap composed of 151 places in 384 ms of which 4 ms to minimize.
[2024-05-28 01:43:32] [INFO ] Deduced a trap composed of 204 places in 303 ms of which 3 ms to minimize.
[2024-05-28 01:43:33] [INFO ] Deduced a trap composed of 494 places in 362 ms of which 5 ms to minimize.
[2024-05-28 01:43:34] [INFO ] Deduced a trap composed of 47 places in 229 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 19/19 constraints]
After SMT, in 41851ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41867ms
[2024-05-28 01:43:54] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 01:43:54] [INFO ] Invariant cache hit.
[2024-05-28 01:43:55] [INFO ] Implicit Places using invariants in 763 ms returned []
[2024-05-28 01:43:55] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 01:43:55] [INFO ] Invariant cache hit.
[2024-05-28 01:43:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 01:44:08] [INFO ] Implicit Places using invariants and state equation in 13329 ms returned []
Implicit Place search using SMT with State Equation took 14093 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-05-28 01:44:08] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 01:44:08] [INFO ] Invariant cache hit.
[2024-05-28 01:44:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:44:25] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-28 01:44:25] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-28 01:44:25] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 1 ms to minimize.
[2024-05-28 01:44:25] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 0 ms to minimize.
[2024-05-28 01:44:25] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 01:44:25] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 01:44:26] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 01:44:26] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 1 ms to minimize.
[2024-05-28 01:44:26] [INFO ] Deduced a trap composed of 383 places in 299 ms of which 4 ms to minimize.
[2024-05-28 01:44:26] [INFO ] Deduced a trap composed of 357 places in 318 ms of which 4 ms to minimize.
[2024-05-28 01:44:27] [INFO ] Deduced a trap composed of 383 places in 367 ms of which 5 ms to minimize.
[2024-05-28 01:44:27] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 4 ms to minimize.
[2024-05-28 01:44:27] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-28 01:44:28] [INFO ] Deduced a trap composed of 391 places in 350 ms of which 5 ms to minimize.
[2024-05-28 01:44:28] [INFO ] Deduced a trap composed of 495 places in 316 ms of which 5 ms to minimize.
[2024-05-28 01:44:29] [INFO ] Deduced a trap composed of 395 places in 378 ms of which 5 ms to minimize.
[2024-05-28 01:44:29] [INFO ] Deduced a trap composed of 381 places in 272 ms of which 4 ms to minimize.
[2024-05-28 01:44:29] [INFO ] Deduced a trap composed of 367 places in 272 ms of which 4 ms to minimize.
[2024-05-28 01:44:30] [INFO ] Deduced a trap composed of 233 places in 348 ms of which 4 ms to minimize.
[2024-05-28 01:44:30] [INFO ] Deduced a trap composed of 227 places in 325 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:44:33] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 3 ms to minimize.
[2024-05-28 01:44:35] [INFO ] Deduced a trap composed of 426 places in 410 ms of which 4 ms to minimize.
[2024-05-28 01:44:35] [INFO ] Deduced a trap composed of 395 places in 390 ms of which 5 ms to minimize.
[2024-05-28 01:44:36] [INFO ] Deduced a trap composed of 386 places in 313 ms of which 4 ms to minimize.
[2024-05-28 01:44:36] [INFO ] Deduced a trap composed of 399 places in 347 ms of which 4 ms to minimize.
[2024-05-28 01:44:36] [INFO ] Deduced a trap composed of 422 places in 302 ms of which 4 ms to minimize.
[2024-05-28 01:44:37] [INFO ] Deduced a trap composed of 438 places in 373 ms of which 5 ms to minimize.
[2024-05-28 01:44:37] [INFO ] Deduced a trap composed of 69 places in 172 ms of which 3 ms to minimize.
[2024-05-28 01:44:39] [INFO ] Deduced a trap composed of 493 places in 321 ms of which 4 ms to minimize.
[2024-05-28 01:44:40] [INFO ] Deduced a trap composed of 492 places in 298 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 30/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:45:04] [INFO ] Deduced a trap composed of 506 places in 400 ms of which 5 ms to minimize.
[2024-05-28 01:45:08] [INFO ] Deduced a trap composed of 377 places in 425 ms of which 5 ms to minimize.
[2024-05-28 01:45:08] [INFO ] Deduced a trap composed of 377 places in 369 ms of which 4 ms to minimize.
[2024-05-28 01:45:09] [INFO ] Deduced a trap composed of 378 places in 356 ms of which 4 ms to minimize.
[2024-05-28 01:45:09] [INFO ] Deduced a trap composed of 359 places in 329 ms of which 4 ms to minimize.
(s1 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 75 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 35/35 constraints]
After SMT, in 61812ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 61825ms
Starting structural reductions in LTL mode, iteration 1 : 720/731 places, 1392/1403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117851 ms. Remains : 720/731 places, 1392/1403 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 497 ms.
Product exploration explored 100000 steps with 50000 reset in 494 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 p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J04T10-LTLCardinality-04 finished in 119060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 1403/1403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 731 transition count 1331
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 659 transition count 1331
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 144 place count 659 transition count 1252
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 302 place count 580 transition count 1252
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 303 place count 579 transition count 1251
Iterating global reduction 2 with 1 rules applied. Total rules applied 304 place count 579 transition count 1251
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 480 place count 491 transition count 1163
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 488 place count 483 transition count 1155
Iterating global reduction 2 with 8 rules applied. Total rules applied 496 place count 483 transition count 1155
Applied a total of 496 rules in 75 ms. Remains 483 /731 variables (removed 248) and now considering 1155/1403 (removed 248) transitions.
Running 1153 sub problems to find dead transitions.
[2024-05-28 01:45:11] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
// Phase 1: matrix 1135 rows 483 cols
[2024-05-28 01:45:11] [INFO ] Computed 42 invariants in 17 ms
[2024-05-28 01:45:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:45:21] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:45:21] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-28 01:45:21] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-28 01:45:21] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:45:21] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-05-28 01:45:21] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 0 ms to minimize.
[2024-05-28 01:45:21] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 0 ms to minimize.
[2024-05-28 01:45:21] [INFO ] Deduced a trap composed of 70 places in 281 ms of which 3 ms to minimize.
[2024-05-28 01:45:22] [INFO ] Deduced a trap composed of 96 places in 245 ms of which 2 ms to minimize.
[2024-05-28 01:45:22] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 0 ms to minimize.
[2024-05-28 01:45:22] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 0 ms to minimize.
[2024-05-28 01:45:22] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-28 01:45:22] [INFO ] Deduced a trap composed of 195 places in 272 ms of which 4 ms to minimize.
[2024-05-28 01:45:22] [INFO ] Deduced a trap composed of 185 places in 263 ms of which 3 ms to minimize.
[2024-05-28 01:45:23] [INFO ] Deduced a trap composed of 197 places in 219 ms of which 4 ms to minimize.
[2024-05-28 01:45:24] [INFO ] Deduced a trap composed of 194 places in 256 ms of which 3 ms to minimize.
[2024-05-28 01:45:24] [INFO ] Deduced a trap composed of 206 places in 343 ms of which 4 ms to minimize.
[2024-05-28 01:45:24] [INFO ] Deduced a trap composed of 197 places in 265 ms of which 3 ms to minimize.
[2024-05-28 01:45:25] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 2 ms to minimize.
[2024-05-28 01:45:25] [INFO ] Deduced a trap composed of 326 places in 201 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:45:26] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 2 ms to minimize.
[2024-05-28 01:45:27] [INFO ] Deduced a trap composed of 321 places in 253 ms of which 4 ms to minimize.
[2024-05-28 01:45:27] [INFO ] Deduced a trap composed of 320 places in 218 ms of which 3 ms to minimize.
[2024-05-28 01:45:30] [INFO ] Deduced a trap composed of 307 places in 240 ms of which 3 ms to minimize.
[2024-05-28 01:45:31] [INFO ] Deduced a trap composed of 191 places in 265 ms of which 3 ms to minimize.
[2024-05-28 01:45:31] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 66 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 26/66 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:45:51] [INFO ] Deduced a trap composed of 78 places in 187 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 67 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 27/27 constraints]
After SMT, in 41744ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 41755ms
[2024-05-28 01:45:53] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:45:53] [INFO ] Invariant cache hit.
[2024-05-28 01:45:53] [INFO ] Implicit Places using invariants in 617 ms returned []
[2024-05-28 01:45:53] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:45:53] [INFO ] Invariant cache hit.
[2024-05-28 01:45:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 01:46:07] [INFO ] Implicit Places using invariants and state equation in 13891 ms returned []
Implicit Place search using SMT with State Equation took 14509 ms to find 0 implicit places.
[2024-05-28 01:46:07] [INFO ] Redundant transitions in 19 ms returned []
Running 1153 sub problems to find dead transitions.
[2024-05-28 01:46:07] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:46:07] [INFO ] Invariant cache hit.
[2024-05-28 01:46:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:46:18] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2024-05-28 01:46:18] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-05-28 01:46:18] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-28 01:46:18] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 3 ms to minimize.
[2024-05-28 01:46:18] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
[2024-05-28 01:46:19] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-05-28 01:46:19] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
[2024-05-28 01:46:19] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 0 ms to minimize.
[2024-05-28 01:46:19] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-05-28 01:46:19] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:46:19] [INFO ] Deduced a trap composed of 71 places in 254 ms of which 3 ms to minimize.
[2024-05-28 01:46:19] [INFO ] Deduced a trap composed of 226 places in 218 ms of which 3 ms to minimize.
[2024-05-28 01:46:20] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 4 ms to minimize.
[2024-05-28 01:46:20] [INFO ] Deduced a trap composed of 194 places in 221 ms of which 3 ms to minimize.
[2024-05-28 01:46:20] [INFO ] Deduced a trap composed of 213 places in 215 ms of which 3 ms to minimize.
[2024-05-28 01:46:21] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 2 ms to minimize.
[2024-05-28 01:46:21] [INFO ] Deduced a trap composed of 124 places in 160 ms of which 3 ms to minimize.
[2024-05-28 01:46:22] [INFO ] Deduced a trap composed of 75 places in 188 ms of which 2 ms to minimize.
[2024-05-28 01:46:22] [INFO ] Deduced a trap composed of 180 places in 260 ms of which 2 ms to minimize.
[2024-05-28 01:46:24] [INFO ] Deduced a trap composed of 293 places in 258 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:46:34] [INFO ] Deduced a trap composed of 269 places in 291 ms of which 3 ms to minimize.
[2024-05-28 01:46:35] [INFO ] Deduced a trap composed of 217 places in 297 ms of which 3 ms to minimize.
[2024-05-28 01:46:36] [INFO ] Deduced a trap composed of 221 places in 289 ms of which 4 ms to minimize.
[2024-05-28 01:46:36] [INFO ] Deduced a trap composed of 210 places in 241 ms of which 3 ms to minimize.
[2024-05-28 01:46:37] [INFO ] Deduced a trap composed of 170 places in 253 ms of which 4 ms to minimize.
[2024-05-28 01:46:39] [INFO ] Deduced a trap composed of 211 places in 271 ms of which 3 ms to minimize.
[2024-05-28 01:46:39] [INFO ] Deduced a trap composed of 200 places in 236 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 67 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:46:59] [INFO ] Deduced a trap composed of 202 places in 270 ms of which 3 ms to minimize.
[2024-05-28 01:47:03] [INFO ] Deduced a trap composed of 228 places in 301 ms of which 3 ms to minimize.
[2024-05-28 01:47:03] [INFO ] Deduced a trap composed of 224 places in 266 ms of which 3 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 481/1618 variables, and 70 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 30/30 constraints]
After SMT, in 62166ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 62178ms
Starting structural reductions in SI_LTL mode, iteration 1 : 483/731 places, 1155/1403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118556 ms. Remains : 483/731 places, 1155/1403 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLCardinality-08
Product exploration explored 100000 steps with 43 reset in 650 ms.
Product exploration explored 100000 steps with 35 reset in 707 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 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 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 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 37072 steps (19 resets) in 239 ms. (154 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 216 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 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 1155/1155 transitions.
Applied a total of 0 rules in 33 ms. Remains 483 /483 variables (removed 0) and now considering 1155/1155 (removed 0) transitions.
Running 1153 sub problems to find dead transitions.
[2024-05-28 01:47:12] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:47:12] [INFO ] Invariant cache hit.
[2024-05-28 01:47:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:47:22] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-28 01:47:22] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-28 01:47:22] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-05-28 01:47:22] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 1 ms to minimize.
[2024-05-28 01:47:22] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-28 01:47:22] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 0 ms to minimize.
[2024-05-28 01:47:22] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-28 01:47:23] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-05-28 01:47:23] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-28 01:47:23] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 0 ms to minimize.
[2024-05-28 01:47:23] [INFO ] Deduced a trap composed of 71 places in 282 ms of which 3 ms to minimize.
[2024-05-28 01:47:23] [INFO ] Deduced a trap composed of 226 places in 246 ms of which 4 ms to minimize.
[2024-05-28 01:47:24] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 3 ms to minimize.
[2024-05-28 01:47:24] [INFO ] Deduced a trap composed of 194 places in 217 ms of which 3 ms to minimize.
[2024-05-28 01:47:24] [INFO ] Deduced a trap composed of 213 places in 230 ms of which 3 ms to minimize.
[2024-05-28 01:47:25] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 2 ms to minimize.
[2024-05-28 01:47:25] [INFO ] Deduced a trap composed of 124 places in 163 ms of which 2 ms to minimize.
[2024-05-28 01:47:26] [INFO ] Deduced a trap composed of 75 places in 199 ms of which 2 ms to minimize.
[2024-05-28 01:47:26] [INFO ] Deduced a trap composed of 180 places in 292 ms of which 4 ms to minimize.
[2024-05-28 01:47:29] [INFO ] Deduced a trap composed of 293 places in 268 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 60 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:47:48] [INFO ] Deduced a trap composed of 204 places in 308 ms of which 3 ms to minimize.
[2024-05-28 01:47:48] [INFO ] Deduced a trap composed of 223 places in 293 ms of which 4 ms to minimize.
[2024-05-28 01:47:51] [INFO ] Deduced a trap composed of 183 places in 288 ms of which 3 ms to minimize.
[2024-05-28 01:47:52] [INFO ] Deduced a trap composed of 213 places in 297 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 64 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 24/24 constraints]
After SMT, in 41741ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 41758ms
[2024-05-28 01:47:54] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:47:54] [INFO ] Invariant cache hit.
[2024-05-28 01:47:54] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-28 01:47:54] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:47:54] [INFO ] Invariant cache hit.
[2024-05-28 01:47:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 01:48:07] [INFO ] Implicit Places using invariants and state equation in 13114 ms returned []
Implicit Place search using SMT with State Equation took 13651 ms to find 0 implicit places.
[2024-05-28 01:48:07] [INFO ] Redundant transitions in 16 ms returned []
Running 1153 sub problems to find dead transitions.
[2024-05-28 01:48:07] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:48:07] [INFO ] Invariant cache hit.
[2024-05-28 01:48:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:48:18] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-05-28 01:48:18] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-05-28 01:48:18] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-28 01:48:18] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-28 01:48:18] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-28 01:48:18] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-28 01:48:18] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-05-28 01:48:18] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-28 01:48:19] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-05-28 01:48:19] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2024-05-28 01:48:19] [INFO ] Deduced a trap composed of 71 places in 292 ms of which 4 ms to minimize.
[2024-05-28 01:48:19] [INFO ] Deduced a trap composed of 226 places in 257 ms of which 3 ms to minimize.
[2024-05-28 01:48:20] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2024-05-28 01:48:20] [INFO ] Deduced a trap composed of 194 places in 249 ms of which 4 ms to minimize.
[2024-05-28 01:48:20] [INFO ] Deduced a trap composed of 213 places in 257 ms of which 3 ms to minimize.
[2024-05-28 01:48:21] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 3 ms to minimize.
[2024-05-28 01:48:21] [INFO ] Deduced a trap composed of 124 places in 152 ms of which 2 ms to minimize.
[2024-05-28 01:48:22] [INFO ] Deduced a trap composed of 75 places in 215 ms of which 3 ms to minimize.
[2024-05-28 01:48:22] [INFO ] Deduced a trap composed of 180 places in 291 ms of which 4 ms to minimize.
[2024-05-28 01:48:24] [INFO ] Deduced a trap composed of 293 places in 251 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:48:34] [INFO ] Deduced a trap composed of 269 places in 288 ms of which 3 ms to minimize.
[2024-05-28 01:48:35] [INFO ] Deduced a trap composed of 217 places in 267 ms of which 4 ms to minimize.
[2024-05-28 01:48:36] [INFO ] Deduced a trap composed of 221 places in 199 ms of which 3 ms to minimize.
[2024-05-28 01:48:36] [INFO ] Deduced a trap composed of 210 places in 239 ms of which 3 ms to minimize.
[2024-05-28 01:48:37] [INFO ] Deduced a trap composed of 170 places in 223 ms of which 3 ms to minimize.
[2024-05-28 01:48:39] [INFO ] Deduced a trap composed of 211 places in 263 ms of which 3 ms to minimize.
[2024-05-28 01:48:39] [INFO ] Deduced a trap composed of 200 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 67 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:48:58] [INFO ] Deduced a trap composed of 202 places in 295 ms of which 3 ms to minimize.
[2024-05-28 01:49:02] [INFO ] Deduced a trap composed of 228 places in 312 ms of which 3 ms to minimize.
[2024-05-28 01:49:02] [INFO ] Deduced a trap composed of 224 places in 261 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 70 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 30/30 constraints]
After SMT, in 62088ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 62099ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 117572 ms. Remains : 483/483 places, 1155/1155 transitions.
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 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 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 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 24308 steps (10 resets) in 168 ms. (143 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 277 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 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 39 reset in 548 ms.
Product exploration explored 100000 steps with 36 reset in 518 ms.
Support contains 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 1155/1155 transitions.
Applied a total of 0 rules in 18 ms. Remains 483 /483 variables (removed 0) and now considering 1155/1155 (removed 0) transitions.
Running 1153 sub problems to find dead transitions.
[2024-05-28 01:49:11] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:49:11] [INFO ] Invariant cache hit.
[2024-05-28 01:49:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:49:21] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
[2024-05-28 01:49:21] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-28 01:49:21] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-28 01:49:21] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:49:21] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:49:21] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-05-28 01:49:22] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-28 01:49:22] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-28 01:49:22] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:49:22] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 0 ms to minimize.
[2024-05-28 01:49:22] [INFO ] Deduced a trap composed of 71 places in 311 ms of which 4 ms to minimize.
[2024-05-28 01:49:23] [INFO ] Deduced a trap composed of 226 places in 282 ms of which 3 ms to minimize.
[2024-05-28 01:49:23] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 4 ms to minimize.
[2024-05-28 01:49:23] [INFO ] Deduced a trap composed of 194 places in 304 ms of which 4 ms to minimize.
[2024-05-28 01:49:24] [INFO ] Deduced a trap composed of 213 places in 307 ms of which 4 ms to minimize.
[2024-05-28 01:49:24] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 2 ms to minimize.
[2024-05-28 01:49:25] [INFO ] Deduced a trap composed of 124 places in 186 ms of which 2 ms to minimize.
[2024-05-28 01:49:25] [INFO ] Deduced a trap composed of 75 places in 250 ms of which 2 ms to minimize.
[2024-05-28 01:49:26] [INFO ] Deduced a trap composed of 180 places in 285 ms of which 3 ms to minimize.
[2024-05-28 01:49:28] [INFO ] Deduced a trap composed of 293 places in 296 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 60 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:49:46] [INFO ] Deduced a trap composed of 204 places in 350 ms of which 4 ms to minimize.
[2024-05-28 01:49:46] [INFO ] Deduced a trap composed of 223 places in 333 ms of which 4 ms to minimize.
[2024-05-28 01:49:49] [INFO ] Deduced a trap composed of 183 places in 337 ms of which 4 ms to minimize.
[2024-05-28 01:49:50] [INFO ] Deduced a trap composed of 213 places in 312 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 64 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 24/24 constraints]
After SMT, in 41715ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 41726ms
[2024-05-28 01:49:53] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:49:53] [INFO ] Invariant cache hit.
[2024-05-28 01:49:54] [INFO ] Implicit Places using invariants in 616 ms returned []
[2024-05-28 01:49:54] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:49:54] [INFO ] Invariant cache hit.
[2024-05-28 01:49:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 01:50:09] [INFO ] Implicit Places using invariants and state equation in 14910 ms returned []
Implicit Place search using SMT with State Equation took 15533 ms to find 0 implicit places.
[2024-05-28 01:50:09] [INFO ] Redundant transitions in 24 ms returned []
Running 1153 sub problems to find dead transitions.
[2024-05-28 01:50:09] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:50:09] [INFO ] Invariant cache hit.
[2024-05-28 01:50:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:50:18] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2024-05-28 01:50:18] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:50:18] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-28 01:50:18] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-28 01:50:18] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-05-28 01:50:18] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-05-28 01:50:18] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:50:19] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:50:19] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-28 01:50:19] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:50:19] [INFO ] Deduced a trap composed of 71 places in 286 ms of which 3 ms to minimize.
[2024-05-28 01:50:19] [INFO ] Deduced a trap composed of 226 places in 237 ms of which 3 ms to minimize.
[2024-05-28 01:50:20] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 3 ms to minimize.
[2024-05-28 01:50:20] [INFO ] Deduced a trap composed of 194 places in 230 ms of which 3 ms to minimize.
[2024-05-28 01:50:20] [INFO ] Deduced a trap composed of 213 places in 254 ms of which 3 ms to minimize.
[2024-05-28 01:50:21] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 2 ms to minimize.
[2024-05-28 01:50:21] [INFO ] Deduced a trap composed of 124 places in 197 ms of which 4 ms to minimize.
[2024-05-28 01:50:22] [INFO ] Deduced a trap composed of 75 places in 233 ms of which 3 ms to minimize.
[2024-05-28 01:50:23] [INFO ] Deduced a trap composed of 180 places in 273 ms of which 3 ms to minimize.
[2024-05-28 01:50:25] [INFO ] Deduced a trap composed of 293 places in 286 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:50:34] [INFO ] Deduced a trap composed of 269 places in 251 ms of which 2 ms to minimize.
[2024-05-28 01:50:35] [INFO ] Deduced a trap composed of 217 places in 334 ms of which 3 ms to minimize.
[2024-05-28 01:50:36] [INFO ] Deduced a trap composed of 221 places in 295 ms of which 4 ms to minimize.
[2024-05-28 01:50:36] [INFO ] Deduced a trap composed of 210 places in 261 ms of which 3 ms to minimize.
[2024-05-28 01:50:37] [INFO ] Deduced a trap composed of 170 places in 329 ms of which 4 ms to minimize.
[2024-05-28 01:50:39] [INFO ] Deduced a trap composed of 211 places in 238 ms of which 3 ms to minimize.
[2024-05-28 01:50:39] [INFO ] Deduced a trap composed of 200 places in 278 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 67 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:51:00] [INFO ] Deduced a trap composed of 202 places in 303 ms of which 3 ms to minimize.
[2024-05-28 01:51:04] [INFO ] Deduced a trap composed of 228 places in 316 ms of which 4 ms to minimize.
[2024-05-28 01:51:04] [INFO ] Deduced a trap composed of 224 places in 311 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 70 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 30/30 constraints]
After SMT, in 62220ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 62238ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 119559 ms. Remains : 483/483 places, 1155/1155 transitions.
Treatment of property PolyORBLF-PT-S02J04T10-LTLCardinality-08 finished in 359888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 731 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 731/731 places, 1403/1403 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 721 transition count 1393
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 721 transition count 1393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 720 transition count 1392
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 720 transition count 1392
Applied a total of 22 rules in 39 ms. Remains 720 /731 variables (removed 11) and now considering 1392/1403 (removed 11) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 01:51:11] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 720 cols
[2024-05-28 01:51:11] [INFO ] Computed 42 invariants in 34 ms
[2024-05-28 01:51:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:51:29] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
[2024-05-28 01:51:29] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2024-05-28 01:51:29] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 01:51:29] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 1 ms to minimize.
[2024-05-28 01:51:29] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 1 ms to minimize.
[2024-05-28 01:51:29] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-28 01:51:29] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 01:51:29] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:51:29] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 01:51:30] [INFO ] Deduced a trap composed of 383 places in 402 ms of which 5 ms to minimize.
[2024-05-28 01:51:30] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-28 01:51:31] [INFO ] Deduced a trap composed of 490 places in 399 ms of which 5 ms to minimize.
[2024-05-28 01:51:32] [INFO ] Deduced a trap composed of 207 places in 439 ms of which 5 ms to minimize.
[2024-05-28 01:51:32] [INFO ] Deduced a trap composed of 274 places in 413 ms of which 4 ms to minimize.
[2024-05-28 01:51:32] [INFO ] Deduced a trap composed of 227 places in 349 ms of which 5 ms to minimize.
[2024-05-28 01:51:33] [INFO ] Deduced a trap composed of 151 places in 315 ms of which 4 ms to minimize.
[2024-05-28 01:51:33] [INFO ] Deduced a trap composed of 204 places in 313 ms of which 4 ms to minimize.
[2024-05-28 01:51:34] [INFO ] Deduced a trap composed of 494 places in 396 ms of which 4 ms to minimize.
SMT process timed out in 22738ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 22759ms
[2024-05-28 01:51:34] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 01:51:34] [INFO ] Invariant cache hit.
[2024-05-28 01:51:34] [INFO ] Implicit Places using invariants in 712 ms returned []
[2024-05-28 01:51:34] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 01:51:34] [INFO ] Invariant cache hit.
[2024-05-28 01:51:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 01:51:51] [INFO ] Implicit Places using invariants and state equation in 17050 ms returned []
Implicit Place search using SMT with State Equation took 17763 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-05-28 01:51:52] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 01:51:52] [INFO ] Invariant cache hit.
[2024-05-28 01:51:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:52:08] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-28 01:52:08] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-05-28 01:52:09] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-28 01:52:09] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:52:09] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 01:52:09] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 1 ms to minimize.
[2024-05-28 01:52:09] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-28 01:52:09] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-28 01:52:10] [INFO ] Deduced a trap composed of 383 places in 399 ms of which 5 ms to minimize.
[2024-05-28 01:52:10] [INFO ] Deduced a trap composed of 357 places in 397 ms of which 6 ms to minimize.
[2024-05-28 01:52:10] [INFO ] Deduced a trap composed of 383 places in 403 ms of which 5 ms to minimize.
[2024-05-28 01:52:11] [INFO ] Deduced a trap composed of 64 places in 395 ms of which 5 ms to minimize.
[2024-05-28 01:52:11] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 01:52:12] [INFO ] Deduced a trap composed of 391 places in 381 ms of which 5 ms to minimize.
[2024-05-28 01:52:12] [INFO ] Deduced a trap composed of 495 places in 346 ms of which 5 ms to minimize.
[2024-05-28 01:52:13] [INFO ] Deduced a trap composed of 395 places in 336 ms of which 5 ms to minimize.
[2024-05-28 01:52:13] [INFO ] Deduced a trap composed of 381 places in 270 ms of which 3 ms to minimize.
[2024-05-28 01:52:13] [INFO ] Deduced a trap composed of 367 places in 267 ms of which 4 ms to minimize.
[2024-05-28 01:52:14] [INFO ] Deduced a trap composed of 233 places in 328 ms of which 4 ms to minimize.
[2024-05-28 01:52:14] [INFO ] Deduced a trap composed of 227 places in 338 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:52:18] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 4 ms to minimize.
[2024-05-28 01:52:19] [INFO ] Deduced a trap composed of 426 places in 414 ms of which 5 ms to minimize.
[2024-05-28 01:52:20] [INFO ] Deduced a trap composed of 395 places in 364 ms of which 4 ms to minimize.
[2024-05-28 01:52:20] [INFO ] Deduced a trap composed of 386 places in 295 ms of which 4 ms to minimize.
[2024-05-28 01:52:20] [INFO ] Deduced a trap composed of 399 places in 355 ms of which 4 ms to minimize.
[2024-05-28 01:52:21] [INFO ] Deduced a trap composed of 422 places in 292 ms of which 4 ms to minimize.
[2024-05-28 01:52:21] [INFO ] Deduced a trap composed of 438 places in 387 ms of which 5 ms to minimize.
[2024-05-28 01:52:21] [INFO ] Deduced a trap composed of 69 places in 177 ms of which 3 ms to minimize.
[2024-05-28 01:52:24] [INFO ] Deduced a trap composed of 493 places in 367 ms of which 5 ms to minimize.
[2024-05-28 01:52:24] [INFO ] Deduced a trap composed of 492 places in 358 ms of which 5 ms to minimize.
SMT process timed out in 32394ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 32409ms
Starting structural reductions in LTL mode, iteration 1 : 720/731 places, 1392/1403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72978 ms. Remains : 720/731 places, 1392/1403 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T10-LTLCardinality-11 finished in 73144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 1403/1403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 731 transition count 1334
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 139 place count 662 transition count 1333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 661 transition count 1333
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 140 place count 661 transition count 1252
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 302 place count 580 transition count 1252
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 303 place count 579 transition count 1251
Iterating global reduction 3 with 1 rules applied. Total rules applied 304 place count 579 transition count 1251
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 480 place count 491 transition count 1163
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 488 place count 483 transition count 1155
Iterating global reduction 3 with 8 rules applied. Total rules applied 496 place count 483 transition count 1155
Applied a total of 496 rules in 91 ms. Remains 483 /731 variables (removed 248) and now considering 1155/1403 (removed 248) transitions.
Running 1153 sub problems to find dead transitions.
[2024-05-28 01:52:24] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
// Phase 1: matrix 1135 rows 483 cols
[2024-05-28 01:52:24] [INFO ] Computed 42 invariants in 36 ms
[2024-05-28 01:52:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:52:35] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
[2024-05-28 01:52:35] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-28 01:52:35] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:52:35] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:52:35] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:52:35] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-28 01:52:35] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-28 01:52:35] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
[2024-05-28 01:52:35] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:52:36] [INFO ] Deduced a trap composed of 198 places in 303 ms of which 3 ms to minimize.
[2024-05-28 01:52:36] [INFO ] Deduced a trap composed of 195 places in 253 ms of which 4 ms to minimize.
[2024-05-28 01:52:36] [INFO ] Deduced a trap composed of 289 places in 291 ms of which 3 ms to minimize.
[2024-05-28 01:52:37] [INFO ] Deduced a trap composed of 187 places in 295 ms of which 3 ms to minimize.
[2024-05-28 01:52:37] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:52:37] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 3 ms to minimize.
[2024-05-28 01:52:38] [INFO ] Deduced a trap composed of 50 places in 286 ms of which 3 ms to minimize.
[2024-05-28 01:52:38] [INFO ] Deduced a trap composed of 107 places in 255 ms of which 3 ms to minimize.
[2024-05-28 01:52:39] [INFO ] Deduced a trap composed of 175 places in 239 ms of which 3 ms to minimize.
[2024-05-28 01:52:41] [INFO ] Deduced a trap composed of 310 places in 293 ms of which 3 ms to minimize.
[2024-05-28 01:52:42] [INFO ] Deduced a trap composed of 310 places in 353 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 60 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:52:56] [INFO ] Deduced a trap composed of 225 places in 297 ms of which 4 ms to minimize.
[2024-05-28 01:52:56] [INFO ] Deduced a trap composed of 209 places in 301 ms of which 4 ms to minimize.
[2024-05-28 01:52:56] [INFO ] Deduced a trap composed of 186 places in 276 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 63 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 23/23 constraints]
After SMT, in 42075ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 42088ms
[2024-05-28 01:53:06] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:53:06] [INFO ] Invariant cache hit.
[2024-05-28 01:53:07] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-05-28 01:53:07] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:53:07] [INFO ] Invariant cache hit.
[2024-05-28 01:53:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 01:53:18] [INFO ] Implicit Places using invariants and state equation in 11408 ms returned []
Implicit Place search using SMT with State Equation took 12060 ms to find 0 implicit places.
[2024-05-28 01:53:18] [INFO ] Redundant transitions in 37 ms returned []
Running 1153 sub problems to find dead transitions.
[2024-05-28 01:53:18] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:53:18] [INFO ] Invariant cache hit.
[2024-05-28 01:53:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:53:29] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-28 01:53:29] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-05-28 01:53:29] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:53:29] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-28 01:53:29] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:53:29] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:53:29] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-28 01:53:29] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-05-28 01:53:29] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 0 ms to minimize.
[2024-05-28 01:53:30] [INFO ] Deduced a trap composed of 308 places in 278 ms of which 4 ms to minimize.
[2024-05-28 01:53:30] [INFO ] Deduced a trap composed of 67 places in 312 ms of which 5 ms to minimize.
[2024-05-28 01:53:30] [INFO ] Deduced a trap composed of 107 places in 256 ms of which 3 ms to minimize.
[2024-05-28 01:53:31] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-28 01:53:31] [INFO ] Deduced a trap composed of 184 places in 281 ms of which 3 ms to minimize.
[2024-05-28 01:53:31] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 3 ms to minimize.
[2024-05-28 01:53:32] [INFO ] Deduced a trap composed of 195 places in 273 ms of which 4 ms to minimize.
[2024-05-28 01:53:33] [INFO ] Deduced a trap composed of 86 places in 184 ms of which 3 ms to minimize.
[2024-05-28 01:53:34] [INFO ] Deduced a trap composed of 293 places in 288 ms of which 4 ms to minimize.
[2024-05-28 01:53:35] [INFO ] Deduced a trap composed of 184 places in 321 ms of which 4 ms to minimize.
[2024-05-28 01:53:36] [INFO ] Deduced a trap composed of 179 places in 280 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:53:37] [INFO ] Deduced a trap composed of 204 places in 188 ms of which 2 ms to minimize.
[2024-05-28 01:53:37] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 2 ms to minimize.
[2024-05-28 01:53:44] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 3 ms to minimize.
[2024-05-28 01:53:44] [INFO ] Deduced a trap composed of 298 places in 275 ms of which 4 ms to minimize.
[2024-05-28 01:53:47] [INFO ] Deduced a trap composed of 224 places in 312 ms of which 4 ms to minimize.
[2024-05-28 01:53:47] [INFO ] Deduced a trap composed of 226 places in 269 ms of which 4 ms to minimize.
[2024-05-28 01:53:48] [INFO ] Deduced a trap composed of 199 places in 264 ms of which 3 ms to minimize.
[2024-05-28 01:53:48] [INFO ] Deduced a trap composed of 216 places in 231 ms of which 3 ms to minimize.
[2024-05-28 01:53:50] [INFO ] Deduced a trap composed of 237 places in 262 ms of which 3 ms to minimize.
[2024-05-28 01:53:50] [INFO ] Deduced a trap composed of 240 places in 232 ms of which 3 ms to minimize.
SMT process timed out in 32065ms, After SMT, problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 32082ms
Starting structural reductions in SI_LTL mode, iteration 1 : 483/731 places, 1155/1403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86376 ms. Remains : 483/731 places, 1155/1403 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLCardinality-14
Product exploration explored 100000 steps with 345 reset in 591 ms.
Product exploration explored 100000 steps with 285 reset in 479 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 156 steps (0 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 1155/1155 transitions.
Applied a total of 0 rules in 32 ms. Remains 483 /483 variables (removed 0) and now considering 1155/1155 (removed 0) transitions.
Running 1153 sub problems to find dead transitions.
[2024-05-28 01:53:52] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:53:52] [INFO ] Invariant cache hit.
[2024-05-28 01:53:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:54:02] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-05-28 01:54:02] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-28 01:54:03] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-28 01:54:03] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:54:03] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2024-05-28 01:54:03] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-05-28 01:54:03] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-28 01:54:03] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2024-05-28 01:54:03] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-28 01:54:03] [INFO ] Deduced a trap composed of 308 places in 305 ms of which 3 ms to minimize.
[2024-05-28 01:54:04] [INFO ] Deduced a trap composed of 67 places in 272 ms of which 3 ms to minimize.
[2024-05-28 01:54:04] [INFO ] Deduced a trap composed of 107 places in 253 ms of which 2 ms to minimize.
[2024-05-28 01:54:04] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:54:05] [INFO ] Deduced a trap composed of 184 places in 293 ms of which 4 ms to minimize.
[2024-05-28 01:54:05] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 2 ms to minimize.
[2024-05-28 01:54:05] [INFO ] Deduced a trap composed of 195 places in 261 ms of which 5 ms to minimize.
[2024-05-28 01:54:06] [INFO ] Deduced a trap composed of 86 places in 172 ms of which 3 ms to minimize.
[2024-05-28 01:54:07] [INFO ] Deduced a trap composed of 293 places in 254 ms of which 4 ms to minimize.
[2024-05-28 01:54:08] [INFO ] Deduced a trap composed of 184 places in 257 ms of which 3 ms to minimize.
[2024-05-28 01:54:08] [INFO ] Deduced a trap composed of 179 places in 257 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:54:09] [INFO ] Deduced a trap composed of 204 places in 180 ms of which 2 ms to minimize.
[2024-05-28 01:54:10] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 62 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:54:27] [INFO ] Deduced a trap composed of 227 places in 306 ms of which 4 ms to minimize.
[2024-05-28 01:54:27] [INFO ] Deduced a trap composed of 212 places in 313 ms of which 4 ms to minimize.
[2024-05-28 01:54:28] [INFO ] Deduced a trap composed of 214 places in 303 ms of which 3 ms to minimize.
[2024-05-28 01:54:28] [INFO ] Deduced a trap composed of 232 places in 292 ms of which 3 ms to minimize.
[2024-05-28 01:54:28] [INFO ] Deduced a trap composed of 220 places in 296 ms of which 3 ms to minimize.
[2024-05-28 01:54:29] [INFO ] Deduced a trap composed of 224 places in 298 ms of which 3 ms to minimize.
[2024-05-28 01:54:33] [INFO ] Deduced a trap composed of 74 places in 178 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 69 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 29/29 constraints]
After SMT, in 41835ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 41850ms
[2024-05-28 01:54:34] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:54:34] [INFO ] Invariant cache hit.
[2024-05-28 01:54:35] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-05-28 01:54:35] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:54:35] [INFO ] Invariant cache hit.
[2024-05-28 01:54:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 01:54:46] [INFO ] Implicit Places using invariants and state equation in 11138 ms returned []
Implicit Place search using SMT with State Equation took 11810 ms to find 0 implicit places.
[2024-05-28 01:54:46] [INFO ] Redundant transitions in 16 ms returned []
Running 1153 sub problems to find dead transitions.
[2024-05-28 01:54:46] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:54:46] [INFO ] Invariant cache hit.
[2024-05-28 01:54:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:54:56] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-05-28 01:54:56] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2024-05-28 01:54:57] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-28 01:54:57] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-28 01:54:57] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-28 01:54:57] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-05-28 01:54:57] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-28 01:54:57] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-28 01:54:57] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-05-28 01:54:57] [INFO ] Deduced a trap composed of 308 places in 296 ms of which 4 ms to minimize.
[2024-05-28 01:54:58] [INFO ] Deduced a trap composed of 67 places in 277 ms of which 4 ms to minimize.
[2024-05-28 01:54:58] [INFO ] Deduced a trap composed of 107 places in 268 ms of which 4 ms to minimize.
[2024-05-28 01:54:58] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-28 01:54:59] [INFO ] Deduced a trap composed of 184 places in 289 ms of which 4 ms to minimize.
[2024-05-28 01:54:59] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 3 ms to minimize.
[2024-05-28 01:54:59] [INFO ] Deduced a trap composed of 195 places in 288 ms of which 3 ms to minimize.
[2024-05-28 01:55:00] [INFO ] Deduced a trap composed of 86 places in 184 ms of which 2 ms to minimize.
[2024-05-28 01:55:01] [INFO ] Deduced a trap composed of 293 places in 280 ms of which 3 ms to minimize.
[2024-05-28 01:55:02] [INFO ] Deduced a trap composed of 184 places in 290 ms of which 3 ms to minimize.
[2024-05-28 01:55:03] [INFO ] Deduced a trap composed of 179 places in 264 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:55:04] [INFO ] Deduced a trap composed of 204 places in 164 ms of which 2 ms to minimize.
[2024-05-28 01:55:04] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 2 ms to minimize.
[2024-05-28 01:55:10] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 3 ms to minimize.
[2024-05-28 01:55:11] [INFO ] Deduced a trap composed of 298 places in 292 ms of which 4 ms to minimize.
[2024-05-28 01:55:13] [INFO ] Deduced a trap composed of 224 places in 304 ms of which 3 ms to minimize.
[2024-05-28 01:55:13] [INFO ] Deduced a trap composed of 226 places in 284 ms of which 4 ms to minimize.
[2024-05-28 01:55:14] [INFO ] Deduced a trap composed of 199 places in 277 ms of which 3 ms to minimize.
[2024-05-28 01:55:15] [INFO ] Deduced a trap composed of 216 places in 226 ms of which 3 ms to minimize.
[2024-05-28 01:55:16] [INFO ] Deduced a trap composed of 237 places in 320 ms of which 3 ms to minimize.
[2024-05-28 01:55:17] [INFO ] Deduced a trap composed of 240 places in 278 ms of which 4 ms to minimize.
[2024-05-28 01:55:17] [INFO ] Deduced a trap composed of 232 places in 306 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 71 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 71 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 31/31 constraints]
After SMT, in 61845ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 61856ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 115578 ms. Remains : 483/483 places, 1155/1155 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 244 steps (0 resets) in 10 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 336 reset in 586 ms.
Product exploration explored 100000 steps with 334 reset in 600 ms.
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 1155/1155 transitions.
Applied a total of 0 rules in 21 ms. Remains 483 /483 variables (removed 0) and now considering 1155/1155 (removed 0) transitions.
Running 1153 sub problems to find dead transitions.
[2024-05-28 01:55:50] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:55:50] [INFO ] Invariant cache hit.
[2024-05-28 01:55:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:56:00] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-05-28 01:56:00] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-28 01:56:00] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2024-05-28 01:56:00] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-28 01:56:00] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-28 01:56:00] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-28 01:56:01] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-05-28 01:56:01] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-28 01:56:01] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 0 ms to minimize.
[2024-05-28 01:56:01] [INFO ] Deduced a trap composed of 308 places in 281 ms of which 3 ms to minimize.
[2024-05-28 01:56:01] [INFO ] Deduced a trap composed of 67 places in 287 ms of which 3 ms to minimize.
[2024-05-28 01:56:02] [INFO ] Deduced a trap composed of 107 places in 269 ms of which 3 ms to minimize.
[2024-05-28 01:56:02] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-28 01:56:02] [INFO ] Deduced a trap composed of 184 places in 289 ms of which 3 ms to minimize.
[2024-05-28 01:56:03] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 3 ms to minimize.
[2024-05-28 01:56:03] [INFO ] Deduced a trap composed of 195 places in 287 ms of which 4 ms to minimize.
[2024-05-28 01:56:04] [INFO ] Deduced a trap composed of 86 places in 185 ms of which 3 ms to minimize.
[2024-05-28 01:56:05] [INFO ] Deduced a trap composed of 293 places in 283 ms of which 4 ms to minimize.
[2024-05-28 01:56:07] [INFO ] Deduced a trap composed of 184 places in 280 ms of which 4 ms to minimize.
[2024-05-28 01:56:07] [INFO ] Deduced a trap composed of 179 places in 259 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:56:08] [INFO ] Deduced a trap composed of 204 places in 186 ms of which 2 ms to minimize.
[2024-05-28 01:56:08] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 62 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:56:25] [INFO ] Deduced a trap composed of 227 places in 280 ms of which 3 ms to minimize.
[2024-05-28 01:56:25] [INFO ] Deduced a trap composed of 212 places in 257 ms of which 3 ms to minimize.
[2024-05-28 01:56:25] [INFO ] Deduced a trap composed of 214 places in 256 ms of which 4 ms to minimize.
[2024-05-28 01:56:26] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 3 ms to minimize.
[2024-05-28 01:56:26] [INFO ] Deduced a trap composed of 220 places in 248 ms of which 4 ms to minimize.
[2024-05-28 01:56:26] [INFO ] Deduced a trap composed of 224 places in 249 ms of which 3 ms to minimize.
[2024-05-28 01:56:30] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 69 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 29/29 constraints]
After SMT, in 41915ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 41930ms
[2024-05-28 01:56:32] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:56:32] [INFO ] Invariant cache hit.
[2024-05-28 01:56:32] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-05-28 01:56:32] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:56:32] [INFO ] Invariant cache hit.
[2024-05-28 01:56:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 01:56:44] [INFO ] Implicit Places using invariants and state equation in 11732 ms returned []
Implicit Place search using SMT with State Equation took 12253 ms to find 0 implicit places.
[2024-05-28 01:56:44] [INFO ] Redundant transitions in 20 ms returned []
Running 1153 sub problems to find dead transitions.
[2024-05-28 01:56:44] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-05-28 01:56:44] [INFO ] Invariant cache hit.
[2024-05-28 01:56:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:56:55] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-05-28 01:56:55] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-05-28 01:56:55] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:56:55] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-28 01:56:55] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:56:55] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-28 01:56:55] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-28 01:56:55] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:56:55] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:56:56] [INFO ] Deduced a trap composed of 308 places in 303 ms of which 3 ms to minimize.
[2024-05-28 01:56:56] [INFO ] Deduced a trap composed of 67 places in 287 ms of which 4 ms to minimize.
[2024-05-28 01:56:56] [INFO ] Deduced a trap composed of 107 places in 268 ms of which 3 ms to minimize.
[2024-05-28 01:56:57] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-28 01:56:57] [INFO ] Deduced a trap composed of 184 places in 277 ms of which 4 ms to minimize.
[2024-05-28 01:56:57] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 3 ms to minimize.
[2024-05-28 01:56:58] [INFO ] Deduced a trap composed of 195 places in 304 ms of which 4 ms to minimize.
[2024-05-28 01:56:59] [INFO ] Deduced a trap composed of 86 places in 167 ms of which 2 ms to minimize.
[2024-05-28 01:56:59] [INFO ] Deduced a trap composed of 293 places in 256 ms of which 3 ms to minimize.
[2024-05-28 01:57:01] [INFO ] Deduced a trap composed of 184 places in 249 ms of which 3 ms to minimize.
[2024-05-28 01:57:01] [INFO ] Deduced a trap composed of 179 places in 212 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:57:03] [INFO ] Deduced a trap composed of 204 places in 185 ms of which 2 ms to minimize.
[2024-05-28 01:57:03] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 2 ms to minimize.
[2024-05-28 01:57:09] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 4 ms to minimize.
[2024-05-28 01:57:10] [INFO ] Deduced a trap composed of 298 places in 293 ms of which 3 ms to minimize.
[2024-05-28 01:57:12] [INFO ] Deduced a trap composed of 224 places in 302 ms of which 4 ms to minimize.
[2024-05-28 01:57:13] [INFO ] Deduced a trap composed of 226 places in 269 ms of which 4 ms to minimize.
[2024-05-28 01:57:14] [INFO ] Deduced a trap composed of 199 places in 280 ms of which 4 ms to minimize.
[2024-05-28 01:57:14] [INFO ] Deduced a trap composed of 216 places in 285 ms of which 3 ms to minimize.
[2024-05-28 01:57:16] [INFO ] Deduced a trap composed of 237 places in 285 ms of which 3 ms to minimize.
[2024-05-28 01:57:16] [INFO ] Deduced a trap composed of 240 places in 245 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 70 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 30/70 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-05-28 01:57:27] [INFO ] Deduced a trap composed of 186 places in 316 ms of which 4 ms to minimize.
[2024-05-28 01:57:27] [INFO ] Deduced a trap composed of 226 places in 320 ms of which 4 ms to minimize.
[2024-05-28 01:57:28] [INFO ] Deduced a trap composed of 195 places in 304 ms of which 4 ms to minimize.
[2024-05-28 01:57:38] [INFO ] Deduced a trap composed of 210 places in 338 ms of which 3 ms to minimize.
[2024-05-28 01:57:38] [INFO ] Deduced a trap composed of 218 places in 329 ms of which 3 ms to minimize.
[2024-05-28 01:57:38] [INFO ] Deduced a trap composed of 216 places in 301 ms of which 4 ms to minimize.
[2024-05-28 01:57:39] [INFO ] Deduced a trap composed of 231 places in 302 ms of which 3 ms to minimize.
[2024-05-28 01:57:39] [INFO ] Deduced a trap composed of 231 places in 244 ms of which 3 ms to minimize.
[2024-05-28 01:57:39] [INFO ] Deduced a trap composed of 240 places in 308 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 79 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 39/39 constraints]
After SMT, in 62479ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 62498ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116741 ms. Remains : 483/483 places, 1155/1155 transitions.
Treatment of property PolyORBLF-PT-S02J04T10-LTLCardinality-14 finished in 322477 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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-28 01:57:47] [INFO ] Flatten gal took : 104 ms
[2024-05-28 01:57:47] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-28 01:57:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 731 places, 1403 transitions and 6082 arcs took 15 ms.
Total runtime 1433988 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S02J04T10

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 3804
MODEL NAME: /home/mcc/execution/413/model
731 places, 1403 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-S02J04T10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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