Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 24K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 163K Apr 11 17:07 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 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 251K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 295K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 807K 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-S02J06T08-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S02J06T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S02J06T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S02J06T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S02J06T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S02J06T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S02J06T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S02J06T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S02J06T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S02J06T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S02J06T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S02J06T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S02J06T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S02J06T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S02J06T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S02J06T08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717253197764

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:46:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:46:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:46:39] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2024-06-01 14:46:39] [INFO ] Transformed 690 places.
[2024-06-01 14:46:39] [INFO ] Transformed 1434 transitions.
[2024-06-01 14:46:39] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
FORMULA PolyORBLF-PT-S02J06T08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 157 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 206 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:46:40] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-06-01 14:46:40] [INFO ] Computed 52 invariants in 69 ms
[2024-06-01 14:46:40] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:46:58] [INFO ] Deduced a trap composed of 72 places in 750 ms of which 52 ms to minimize.
[2024-06-01 14:46:58] [INFO ] Deduced a trap composed of 72 places in 565 ms of which 16 ms to minimize.
[2024-06-01 14:47:03] [INFO ] Deduced a trap composed of 72 places in 4485 ms of which 13 ms to minimize.
SMT process timed out in 23132ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 23247ms
[2024-06-01 14:47:03] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:47:03] [INFO ] Invariant cache hit.
[2024-06-01 14:47:04] [INFO ] Implicit Places using invariants in 846 ms returned [68, 179, 290, 342, 457, 481, 561, 568]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 857 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/690 places, 1290/1306 transitions.
Applied a total of 0 rules in 27 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24433 ms. Remains : 664/690 places, 1290/1306 transitions.
Support contains 157 out of 664 places after structural reductions.
[2024-06-01 14:47:04] [INFO ] Flatten gal took : 245 ms
[2024-06-01 14:47:04] [INFO ] Flatten gal took : 174 ms
[2024-06-01 14:47:05] [INFO ] Input system was already deterministic with 1290 transitions.
RANDOM walk for 40001 steps (10 resets) in 2319 ms. (17 steps per ms) remains 5/18 properties
BEST_FIRST walk for 40002 steps (8 resets) in 538 ms. (74 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (10 resets) in 319 ms. (125 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (10 resets) in 264 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 385 ms. (103 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 4/4 properties
[2024-06-01 14:47:06] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 664 cols
[2024-06-01 14:47:06] [INFO ] Computed 44 invariants in 27 ms
[2024-06-01 14:47:06] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 70/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
At refinement iteration 5 (OVERLAPS) 541/634 variables, 19/26 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/634 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 7 (OVERLAPS) 6/640 variables, 6/32 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 0/32 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 662/1938 variables, and 43 constraints, problems are : Problem set: 4 solved, 0 unsolved in 1434 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1491ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 9 simplifications.
FORMULA PolyORBLF-PT-S02J06T08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S02J06T08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 9 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 664 transition count 1242
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 616 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 96 place count 616 transition count 1162
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 256 place count 536 transition count 1162
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 368 place count 480 transition count 1106
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 372 place count 476 transition count 1102
Iterating global reduction 2 with 4 rules applied. Total rules applied 376 place count 476 transition count 1102
Applied a total of 376 rules in 277 ms. Remains 476 /664 variables (removed 188) and now considering 1102/1290 (removed 188) transitions.
Running 1100 sub problems to find dead transitions.
[2024-06-01 14:47:08] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
// Phase 1: matrix 1086 rows 476 cols
[2024-06-01 14:47:08] [INFO ] Computed 44 invariants in 31 ms
[2024-06-01 14:47:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 14:47:21] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
[2024-06-01 14:47:21] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:47:21] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:47:21] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:47:22] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 1 ms to minimize.
[2024-06-01 14:47:22] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:47:22] [INFO ] Deduced a trap composed of 174 places in 326 ms of which 55 ms to minimize.
[2024-06-01 14:47:22] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:47:22] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:47:23] [INFO ] Deduced a trap composed of 47 places in 194 ms of which 3 ms to minimize.
[2024-06-01 14:47:26] [INFO ] Deduced a trap composed of 107 places in 264 ms of which 4 ms to minimize.
[2024-06-01 14:47:26] [INFO ] Deduced a trap composed of 95 places in 269 ms of which 3 ms to minimize.
[2024-06-01 14:47:26] [INFO ] Deduced a trap composed of 87 places in 310 ms of which 4 ms to minimize.
[2024-06-01 14:47:27] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 474/1562 variables, and 56 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/476 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 14:47:36] [INFO ] Deduced a trap composed of 72 places in 363 ms of which 4 ms to minimize.
[2024-06-01 14:47:37] [INFO ] Deduced a trap composed of 167 places in 279 ms of which 3 ms to minimize.
[2024-06-01 14:47:45] [INFO ] Deduced a trap composed of 300 places in 287 ms of which 4 ms to minimize.
[2024-06-01 14:47:50] [INFO ] Deduced a trap composed of 207 places in 362 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/1562 variables, and 60 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/476 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1100 constraints, Known Traps: 18/18 constraints]
After SMT, in 42047ms problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 42063ms
[2024-06-01 14:47:50] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
[2024-06-01 14:47:50] [INFO ] Invariant cache hit.
[2024-06-01 14:47:51] [INFO ] Implicit Places using invariants in 774 ms returned []
[2024-06-01 14:47:51] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
[2024-06-01 14:47:51] [INFO ] Invariant cache hit.
[2024-06-01 14:47:52] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:48:00] [INFO ] Implicit Places using invariants and state equation in 9287 ms returned []
Implicit Place search using SMT with State Equation took 10081 ms to find 0 implicit places.
[2024-06-01 14:48:01] [INFO ] Redundant transitions in 118 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-06-01 14:48:01] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
[2024-06-01 14:48:01] [INFO ] Invariant cache hit.
[2024-06-01 14:48:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 14:48:10] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 2 ms to minimize.
[2024-06-01 14:48:10] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:48:10] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:48:11] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:48:11] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:48:11] [INFO ] Deduced a trap composed of 174 places in 314 ms of which 4 ms to minimize.
[2024-06-01 14:48:11] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:48:12] [INFO ] Deduced a trap composed of 54 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:48:12] [INFO ] Deduced a trap composed of 182 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:48:13] [INFO ] Deduced a trap composed of 48 places in 298 ms of which 3 ms to minimize.
[2024-06-01 14:48:13] [INFO ] Deduced a trap composed of 42 places in 299 ms of which 4 ms to minimize.
[2024-06-01 14:48:13] [INFO ] Deduced a trap composed of 49 places in 318 ms of which 3 ms to minimize.
[2024-06-01 14:48:13] [INFO ] Deduced a trap composed of 93 places in 219 ms of which 4 ms to minimize.
[2024-06-01 14:48:15] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 6 ms to minimize.
[2024-06-01 14:48:16] [INFO ] Deduced a trap composed of 177 places in 300 ms of which 3 ms to minimize.
[2024-06-01 14:48:16] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 4 ms to minimize.
[2024-06-01 14:48:22] [INFO ] Deduced a trap composed of 153 places in 270 ms of which 4 ms to minimize.
[2024-06-01 14:48:23] [INFO ] Deduced a trap composed of 184 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:48:24] [INFO ] Deduced a trap composed of 217 places in 283 ms of which 4 ms to minimize.
[2024-06-01 14:48:25] [INFO ] Deduced a trap composed of 201 places in 308 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 14:48:32] [INFO ] Deduced a trap composed of 301 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:48:33] [INFO ] Deduced a trap composed of 312 places in 309 ms of which 3 ms to minimize.
SMT process timed out in 32003ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 32033ms
Starting structural reductions in SI_LTL mode, iteration 1 : 476/664 places, 1102/1290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84618 ms. Remains : 476/664 places, 1102/1290 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLCardinality-00
Product exploration explored 100000 steps with 6429 reset in 661 ms.
Product exploration explored 100000 steps with 6442 reset in 405 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 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 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 58 steps (0 resets) in 6 ms. (8 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 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:48:34] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
[2024-06-01 14:48:34] [INFO ] Invariant cache hit.
[2024-06-01 14:48:35] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-01 14:48:35] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 150 ms returned sat
[2024-06-01 14:48:36] [INFO ] [Real]Absence check using state equation in 1396 ms returned sat
[2024-06-01 14:48:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:48:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 15 ms returned sat
[2024-06-01 14:48:37] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 42 ms returned sat
[2024-06-01 14:48:41] [INFO ] [Nat]Absence check using state equation in 3829 ms returned sat
[2024-06-01 14:48:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:48:41] [INFO ] [Nat]Added 96 Read/Feed constraints in 290 ms returned sat
[2024-06-01 14:48:42] [INFO ] Deduced a trap composed of 49 places in 293 ms of which 3 ms to minimize.
[2024-06-01 14:48:42] [INFO ] Deduced a trap composed of 48 places in 314 ms of which 3 ms to minimize.
[2024-06-01 14:48:43] [INFO ] Deduced a trap composed of 160 places in 303 ms of which 3 ms to minimize.
[2024-06-01 14:48:43] [INFO ] Deduced a trap composed of 49 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:48:44] [INFO ] Deduced a trap composed of 49 places in 297 ms of which 3 ms to minimize.
[2024-06-01 14:48:44] [INFO ] Deduced a trap composed of 48 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:48:45] [INFO ] Deduced a trap composed of 50 places in 330 ms of which 4 ms to minimize.
[2024-06-01 14:48:45] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 2 ms to minimize.
[2024-06-01 14:48:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3635 ms
[2024-06-01 14:48:45] [INFO ] Computed and/alt/rep : 432/1509/424 causal constraints (skipped 660 transitions) in 138 ms.
[2024-06-01 14:48:48] [INFO ] Added : 131 causal constraints over 27 iterations in 3427 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 1102/1102 transitions.
Applied a total of 0 rules in 45 ms. Remains 476 /476 variables (removed 0) and now considering 1102/1102 (removed 0) transitions.
Running 1100 sub problems to find dead transitions.
[2024-06-01 14:48:48] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
[2024-06-01 14:48:48] [INFO ] Invariant cache hit.
[2024-06-01 14:48:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 48 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 174 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:48:59] [INFO ] Deduced a trap composed of 54 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:48:59] [INFO ] Deduced a trap composed of 182 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:49:00] [INFO ] Deduced a trap composed of 48 places in 230 ms of which 3 ms to minimize.
[2024-06-01 14:49:00] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 2 ms to minimize.
[2024-06-01 14:49:00] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:49:00] [INFO ] Deduced a trap composed of 93 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:49:02] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:49:03] [INFO ] Deduced a trap composed of 177 places in 313 ms of which 3 ms to minimize.
[2024-06-01 14:49:03] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 5 ms to minimize.
[2024-06-01 14:49:09] [INFO ] Deduced a trap composed of 153 places in 275 ms of which 3 ms to minimize.
[2024-06-01 14:49:10] [INFO ] Deduced a trap composed of 184 places in 262 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 474/1562 variables, and 60 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/476 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 14:49:26] [INFO ] Deduced a trap composed of 300 places in 283 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/1562 variables, and 61 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/476 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1100 constraints, Known Traps: 19/19 constraints]
After SMT, in 41983ms problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 41997ms
[2024-06-01 14:49:30] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
[2024-06-01 14:49:30] [INFO ] Invariant cache hit.
[2024-06-01 14:49:31] [INFO ] Implicit Places using invariants in 616 ms returned []
[2024-06-01 14:49:31] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
[2024-06-01 14:49:31] [INFO ] Invariant cache hit.
[2024-06-01 14:49:32] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:49:40] [INFO ] Implicit Places using invariants and state equation in 8844 ms returned []
Implicit Place search using SMT with State Equation took 9466 ms to find 0 implicit places.
[2024-06-01 14:49:40] [INFO ] Redundant transitions in 78 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-06-01 14:49:40] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
[2024-06-01 14:49:40] [INFO ] Invariant cache hit.
[2024-06-01 14:49:40] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 14:49:49] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:49:49] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:49:49] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:49:49] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:49:49] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:49:50] [INFO ] Deduced a trap composed of 174 places in 296 ms of which 4 ms to minimize.
[2024-06-01 14:49:50] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:49:51] [INFO ] Deduced a trap composed of 54 places in 332 ms of which 4 ms to minimize.
[2024-06-01 14:49:51] [INFO ] Deduced a trap composed of 182 places in 269 ms of which 3 ms to minimize.
[2024-06-01 14:49:51] [INFO ] Deduced a trap composed of 48 places in 296 ms of which 3 ms to minimize.
[2024-06-01 14:49:52] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:49:52] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:49:52] [INFO ] Deduced a trap composed of 93 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:49:53] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:49:54] [INFO ] Deduced a trap composed of 177 places in 284 ms of which 3 ms to minimize.
[2024-06-01 14:49:55] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 3 ms to minimize.
[2024-06-01 14:50:00] [INFO ] Deduced a trap composed of 153 places in 231 ms of which 2 ms to minimize.
[2024-06-01 14:50:01] [INFO ] Deduced a trap composed of 184 places in 285 ms of which 3 ms to minimize.
[2024-06-01 14:50:02] [INFO ] Deduced a trap composed of 217 places in 308 ms of which 4 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 201 places in 308 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 14:50:10] [INFO ] Deduced a trap composed of 301 places in 275 ms of which 3 ms to minimize.
[2024-06-01 14:50:10] [INFO ] Deduced a trap composed of 312 places in 226 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 474/1562 variables, and 64 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/476 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 22/64 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD231 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/476 variables, 2/66 constraints. Problems are: Problem set: 17 solved, 1083 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/1562 variables, and 66 constraints, problems are : Problem set: 17 solved, 1083 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/476 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1100 constraints, Known Traps: 22/22 constraints]
After SMT, in 62149ms problems are : Problem set: 17 solved, 1083 unsolved
Search for dead transitions found 17 dead transitions in 62165ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 476/476 places, 1085/1102 transitions.
Applied a total of 0 rules in 51 ms. Remains 476 /476 variables (removed 0) and now considering 1085/1085 (removed 0) transitions.
[2024-06-01 14:50:42] [INFO ] Redundant transitions in 28 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 113873 ms. Remains : 476/476 places, 1085/1102 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 125 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 69 steps (0 resets) in 11 ms. (5 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 105 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 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:50:43] [INFO ] Flow matrix only has 1069 transitions (discarded 16 similar events)
// Phase 1: matrix 1069 rows 476 cols
[2024-06-01 14:50:43] [INFO ] Computed 44 invariants in 12 ms
[2024-06-01 14:50:43] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-01 14:50:43] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 79 ms returned sat
[2024-06-01 14:50:46] [INFO ] [Real]Absence check using state equation in 2313 ms returned sat
[2024-06-01 14:50:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:50:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-06-01 14:50:46] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 76 ms returned sat
[2024-06-01 14:50:48] [INFO ] [Nat]Absence check using state equation in 2073 ms returned sat
[2024-06-01 14:50:48] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:50:49] [INFO ] [Nat]Added 96 Read/Feed constraints in 574 ms returned sat
[2024-06-01 14:50:49] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 2 ms to minimize.
[2024-06-01 14:50:50] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:50:51] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 2 ms to minimize.
[2024-06-01 14:50:51] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:50:52] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 3407 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6454 reset in 451 ms.
Product exploration explored 100000 steps with 6470 reset in 412 ms.
Support contains 9 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 1085/1085 transitions.
Applied a total of 0 rules in 20 ms. Remains 476 /476 variables (removed 0) and now considering 1085/1085 (removed 0) transitions.
Running 1083 sub problems to find dead transitions.
[2024-06-01 14:50:53] [INFO ] Flow matrix only has 1069 transitions (discarded 16 similar events)
[2024-06-01 14:50:53] [INFO ] Invariant cache hit.
[2024-06-01 14:50:53] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
[2024-06-01 14:51:02] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:51:02] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:51:02] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:51:02] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:51:02] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 2 ms to minimize.
[2024-06-01 14:51:02] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:51:02] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:51:02] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:51:03] [INFO ] Deduced a trap composed of 175 places in 262 ms of which 3 ms to minimize.
[2024-06-01 14:51:03] [INFO ] Deduced a trap composed of 72 places in 315 ms of which 4 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 247 places in 294 ms of which 4 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 179 places in 298 ms of which 4 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 175 places in 275 ms of which 4 ms to minimize.
[2024-06-01 14:51:06] [INFO ] Deduced a trap composed of 212 places in 188 ms of which 3 ms to minimize.
[2024-06-01 14:51:06] [INFO ] Deduced a trap composed of 89 places in 278 ms of which 4 ms to minimize.
[2024-06-01 14:51:08] [INFO ] Deduced a trap composed of 186 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:51:10] [INFO ] Deduced a trap composed of 257 places in 297 ms of which 3 ms to minimize.
[2024-06-01 14:51:10] [INFO ] Deduced a trap composed of 234 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:51:10] [INFO ] Deduced a trap composed of 238 places in 295 ms of which 3 ms to minimize.
[2024-06-01 14:51:11] [INFO ] Deduced a trap composed of 236 places in 293 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
[2024-06-01 14:51:12] [INFO ] Deduced a trap composed of 265 places in 280 ms of which 4 ms to minimize.
[2024-06-01 14:51:14] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 474/1545 variables, and 64 constraints, problems are : Problem set: 0 solved, 1083 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/476 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1083/1083 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1083 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 22/64 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
[2024-06-01 14:51:32] [INFO ] Deduced a trap composed of 206 places in 280 ms of which 3 ms to minimize.
[2024-06-01 14:51:33] [INFO ] Deduced a trap composed of 192 places in 274 ms of which 3 ms to minimize.
[2024-06-01 14:51:33] [INFO ] Deduced a trap composed of 206 places in 216 ms of which 4 ms to minimize.
[2024-06-01 14:51:33] [INFO ] Deduced a trap composed of 175 places in 312 ms of which 4 ms to minimize.
[2024-06-01 14:51:34] [INFO ] Deduced a trap composed of 226 places in 291 ms of which 4 ms to minimize.
[2024-06-01 14:51:34] [INFO ] Deduced a trap composed of 229 places in 257 ms of which 4 ms to minimize.
[2024-06-01 14:51:34] [INFO ] Deduced a trap composed of 229 places in 254 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/1545 variables, and 71 constraints, problems are : Problem set: 0 solved, 1083 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/476 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1083 constraints, Known Traps: 29/29 constraints]
After SMT, in 41676ms problems are : Problem set: 0 solved, 1083 unsolved
Search for dead transitions found 0 dead transitions in 41686ms
[2024-06-01 14:51:35] [INFO ] Flow matrix only has 1069 transitions (discarded 16 similar events)
[2024-06-01 14:51:35] [INFO ] Invariant cache hit.
[2024-06-01 14:51:36] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-06-01 14:51:36] [INFO ] Flow matrix only has 1069 transitions (discarded 16 similar events)
[2024-06-01 14:51:36] [INFO ] Invariant cache hit.
[2024-06-01 14:51:36] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:51:45] [INFO ] Implicit Places using invariants and state equation in 9570 ms returned []
Implicit Place search using SMT with State Equation took 10010 ms to find 0 implicit places.
[2024-06-01 14:51:45] [INFO ] Redundant transitions in 16 ms returned []
Running 1083 sub problems to find dead transitions.
[2024-06-01 14:51:45] [INFO ] Flow matrix only has 1069 transitions (discarded 16 similar events)
[2024-06-01 14:51:45] [INFO ] Invariant cache hit.
[2024-06-01 14:51:45] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
[2024-06-01 14:51:55] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2024-06-01 14:51:55] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:51:55] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:51:55] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:51:56] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:51:56] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:51:56] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:51:56] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:51:56] [INFO ] Deduced a trap composed of 175 places in 253 ms of which 4 ms to minimize.
[2024-06-01 14:51:57] [INFO ] Deduced a trap composed of 72 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:51:57] [INFO ] Deduced a trap composed of 247 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:51:57] [INFO ] Deduced a trap composed of 179 places in 220 ms of which 4 ms to minimize.
[2024-06-01 14:51:58] [INFO ] Deduced a trap composed of 175 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:51:59] [INFO ] Deduced a trap composed of 212 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:52:00] [INFO ] Deduced a trap composed of 89 places in 330 ms of which 3 ms to minimize.
[2024-06-01 14:52:01] [INFO ] Deduced a trap composed of 186 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:52:03] [INFO ] Deduced a trap composed of 257 places in 268 ms of which 3 ms to minimize.
[2024-06-01 14:52:04] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 5 ms to minimize.
[2024-06-01 14:52:04] [INFO ] Deduced a trap composed of 238 places in 328 ms of which 6 ms to minimize.
[2024-06-01 14:52:04] [INFO ] Deduced a trap composed of 236 places in 281 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
[2024-06-01 14:52:06] [INFO ] Deduced a trap composed of 265 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:52:08] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 3 ms to minimize.
[2024-06-01 14:52:10] [INFO ] Deduced a trap composed of 282 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 312 places in 273 ms of which 3 ms to minimize.
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 313 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:52:13] [INFO ] Deduced a trap composed of 311 places in 243 ms of which 4 ms to minimize.
[2024-06-01 14:52:14] [INFO ] Deduced a trap composed of 194 places in 270 ms of which 4 ms to minimize.
[2024-06-01 14:52:16] [INFO ] Deduced a trap composed of 186 places in 277 ms of which 4 ms to minimize.
[2024-06-01 14:52:16] [INFO ] Deduced a trap composed of 170 places in 244 ms of which 4 ms to minimize.
[2024-06-01 14:52:17] [INFO ] Deduced a trap composed of 255 places in 283 ms of which 4 ms to minimize.
[2024-06-01 14:52:17] [INFO ] Deduced a trap composed of 284 places in 258 ms of which 4 ms to minimize.
[2024-06-01 14:52:17] [INFO ] Deduced a trap composed of 254 places in 309 ms of which 4 ms to minimize.
SMT process timed out in 32300ms, After SMT, problems are : Problem set: 0 solved, 1083 unsolved
Search for dead transitions found 0 dead transitions in 32313ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 84063 ms. Remains : 476/476 places, 1085/1085 transitions.
Treatment of property PolyORBLF-PT-S02J06T08-LTLCardinality-00 finished in 309760 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((F(G(p0))&&G(p1))))'
Support contains 47 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 664 transition count 1242
Reduce places removed 48 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 56 rules applied. Total rules applied 104 place count 616 transition count 1234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 608 transition count 1234
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 112 place count 608 transition count 1162
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 256 place count 536 transition count 1162
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 352 place count 488 transition count 1114
Applied a total of 352 rules in 238 ms. Remains 488 /664 variables (removed 176) and now considering 1114/1290 (removed 176) transitions.
Running 1112 sub problems to find dead transitions.
[2024-06-01 14:52:18] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 488 cols
[2024-06-01 14:52:18] [INFO ] Computed 44 invariants in 29 ms
[2024-06-01 14:52:18] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:52:28] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:52:28] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:52:28] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:52:28] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 2 ms to minimize.
[2024-06-01 14:52:28] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:52:29] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:52:29] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:52:29] [INFO ] Deduced a trap composed of 191 places in 311 ms of which 3 ms to minimize.
[2024-06-01 14:52:30] [INFO ] Deduced a trap composed of 50 places in 293 ms of which 4 ms to minimize.
[2024-06-01 14:52:30] [INFO ] Deduced a trap composed of 89 places in 285 ms of which 3 ms to minimize.
[2024-06-01 14:52:30] [INFO ] Deduced a trap composed of 167 places in 300 ms of which 4 ms to minimize.
[2024-06-01 14:52:31] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:52:34] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 3 ms to minimize.
[2024-06-01 14:52:34] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:52:36] [INFO ] Deduced a trap composed of 180 places in 277 ms of which 4 ms to minimize.
[2024-06-01 14:52:36] [INFO ] Deduced a trap composed of 174 places in 280 ms of which 4 ms to minimize.
[2024-06-01 14:52:37] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:52:40] [INFO ] Deduced a trap composed of 222 places in 275 ms of which 4 ms to minimize.
[2024-06-01 14:52:40] [INFO ] Deduced a trap composed of 218 places in 306 ms of which 4 ms to minimize.
SMT process timed out in 22436ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 22453ms
[2024-06-01 14:52:40] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 14:52:40] [INFO ] Invariant cache hit.
[2024-06-01 14:52:41] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-06-01 14:52:41] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 14:52:41] [INFO ] Invariant cache hit.
[2024-06-01 14:52:42] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:52:47] [INFO ] Implicit Places using invariants and state equation in 6313 ms returned []
Implicit Place search using SMT with State Equation took 6825 ms to find 0 implicit places.
[2024-06-01 14:52:47] [INFO ] Redundant transitions in 39 ms returned []
Running 1112 sub problems to find dead transitions.
[2024-06-01 14:52:47] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 14:52:47] [INFO ] Invariant cache hit.
[2024-06-01 14:52:47] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:52:57] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 3 ms to minimize.
[2024-06-01 14:52:57] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 2 ms to minimize.
[2024-06-01 14:52:57] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:52:57] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:52:57] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:52:57] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:52:57] [INFO ] Deduced a trap composed of 196 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:52:57] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:52:58] [INFO ] Deduced a trap composed of 193 places in 260 ms of which 4 ms to minimize.
[2024-06-01 14:52:58] [INFO ] Deduced a trap composed of 50 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:52:59] [INFO ] Deduced a trap composed of 184 places in 264 ms of which 4 ms to minimize.
[2024-06-01 14:52:59] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:53:00] [INFO ] Deduced a trap composed of 70 places in 258 ms of which 4 ms to minimize.
[2024-06-01 14:53:00] [INFO ] Deduced a trap composed of 93 places in 234 ms of which 4 ms to minimize.
[2024-06-01 14:53:07] [INFO ] Deduced a trap composed of 198 places in 271 ms of which 4 ms to minimize.
[2024-06-01 14:53:08] [INFO ] Deduced a trap composed of 217 places in 274 ms of which 4 ms to minimize.
[2024-06-01 14:53:08] [INFO ] Deduced a trap composed of 246 places in 277 ms of which 4 ms to minimize.
[2024-06-01 14:53:09] [INFO ] Deduced a trap composed of 225 places in 285 ms of which 3 ms to minimize.
[2024-06-01 14:53:10] [INFO ] Deduced a trap composed of 231 places in 278 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1586 variables, and 61 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/488 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:53:26] [INFO ] Deduced a trap composed of 275 places in 266 ms of which 3 ms to minimize.
[2024-06-01 14:53:27] [INFO ] Deduced a trap composed of 272 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:53:32] [INFO ] Deduced a trap composed of 194 places in 293 ms of which 4 ms to minimize.
[2024-06-01 14:53:42] [INFO ] Deduced a trap composed of 312 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:53:45] [INFO ] Deduced a trap composed of 201 places in 305 ms of which 4 ms to minimize.
[2024-06-01 14:53:46] [INFO ] Deduced a trap composed of 207 places in 272 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1586 variables, and 67 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/488 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 25/25 constraints]
After SMT, in 62122ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 62141ms
Starting structural reductions in SI_LTL mode, iteration 1 : 488/664 places, 1114/1290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91716 ms. Remains : 488/664 places, 1114/1290 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLCardinality-01
Product exploration explored 100000 steps with 30 reset in 728 ms.
Stack based approach found an accepted trace after 320 steps with 0 reset with depth 321 and stack size 321 in 3 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLCardinality-01 finished in 92587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G(p1)))))'
Support contains 11 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 664 transition count 1242
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 616 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 96 place count 616 transition count 1162
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 256 place count 536 transition count 1162
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 368 place count 480 transition count 1106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 371 place count 477 transition count 1103
Iterating global reduction 2 with 3 rules applied. Total rules applied 374 place count 477 transition count 1103
Applied a total of 374 rules in 112 ms. Remains 477 /664 variables (removed 187) and now considering 1103/1290 (removed 187) transitions.
Running 1101 sub problems to find dead transitions.
[2024-06-01 14:53:50] [INFO ] Flow matrix only has 1087 transitions (discarded 16 similar events)
// Phase 1: matrix 1087 rows 477 cols
[2024-06-01 14:53:50] [INFO ] Computed 44 invariants in 31 ms
[2024-06-01 14:53:50] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:54:00] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:54:00] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:54:00] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-06-01 14:54:00] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:54:00] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:54:00] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:54:00] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:54:00] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:54:01] [INFO ] Deduced a trap composed of 181 places in 287 ms of which 3 ms to minimize.
[2024-06-01 14:54:01] [INFO ] Deduced a trap composed of 173 places in 208 ms of which 2 ms to minimize.
[2024-06-01 14:54:01] [INFO ] Deduced a trap composed of 166 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:54:02] [INFO ] Deduced a trap composed of 171 places in 289 ms of which 3 ms to minimize.
[2024-06-01 14:54:02] [INFO ] Deduced a trap composed of 101 places in 283 ms of which 4 ms to minimize.
[2024-06-01 14:54:03] [INFO ] Deduced a trap composed of 100 places in 271 ms of which 4 ms to minimize.
[2024-06-01 14:54:04] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 3 ms to minimize.
[2024-06-01 14:54:04] [INFO ] Deduced a trap composed of 166 places in 270 ms of which 4 ms to minimize.
[2024-06-01 14:54:05] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:54:11] [INFO ] Deduced a trap composed of 248 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:54:11] [INFO ] Deduced a trap composed of 204 places in 236 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/1564 variables, and 56 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/31 constraints, State Equation: 0/477 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:54:18] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:54:18] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:54:19] [INFO ] Deduced a trap composed of 128 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:54:19] [INFO ] Deduced a trap composed of 236 places in 273 ms of which 4 ms to minimize.
[2024-06-01 14:54:19] [INFO ] Deduced a trap composed of 239 places in 229 ms of which 2 ms to minimize.
[2024-06-01 14:54:20] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:54:20] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:54:21] [INFO ] Deduced a trap composed of 287 places in 247 ms of which 4 ms to minimize.
[2024-06-01 14:54:23] [INFO ] Deduced a trap composed of 276 places in 287 ms of which 3 ms to minimize.
[2024-06-01 14:54:24] [INFO ] Deduced a trap composed of 211 places in 215 ms of which 3 ms to minimize.
[2024-06-01 14:54:24] [INFO ] Deduced a trap composed of 196 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:54:24] [INFO ] Deduced a trap composed of 213 places in 216 ms of which 3 ms to minimize.
[2024-06-01 14:54:25] [INFO ] Deduced a trap composed of 208 places in 330 ms of which 3 ms to minimize.
[2024-06-01 14:54:25] [INFO ] Deduced a trap composed of 229 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:54:25] [INFO ] Deduced a trap composed of 201 places in 209 ms of which 2 ms to minimize.
[2024-06-01 14:54:25] [INFO ] Deduced a trap composed of 187 places in 293 ms of which 4 ms to minimize.
[2024-06-01 14:54:26] [INFO ] Deduced a trap composed of 231 places in 277 ms of which 4 ms to minimize.
[2024-06-01 14:54:26] [INFO ] Deduced a trap composed of 205 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:54:27] [INFO ] Deduced a trap composed of 229 places in 263 ms of which 4 ms to minimize.
[2024-06-01 14:54:27] [INFO ] Deduced a trap composed of 205 places in 247 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/1564 variables, and 76 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/31 constraints, State Equation: 0/477 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1101 constraints, Known Traps: 39/39 constraints]
After SMT, in 42062ms problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 42079ms
[2024-06-01 14:54:32] [INFO ] Flow matrix only has 1087 transitions (discarded 16 similar events)
[2024-06-01 14:54:32] [INFO ] Invariant cache hit.
[2024-06-01 14:54:33] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-06-01 14:54:33] [INFO ] Flow matrix only has 1087 transitions (discarded 16 similar events)
[2024-06-01 14:54:33] [INFO ] Invariant cache hit.
[2024-06-01 14:54:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:54:42] [INFO ] Implicit Places using invariants and state equation in 9188 ms returned []
Implicit Place search using SMT with State Equation took 9614 ms to find 0 implicit places.
[2024-06-01 14:54:42] [INFO ] Redundant transitions in 22 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-06-01 14:54:42] [INFO ] Flow matrix only has 1087 transitions (discarded 16 similar events)
[2024-06-01 14:54:42] [INFO ] Invariant cache hit.
[2024-06-01 14:54:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:54:51] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:54:51] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-06-01 14:54:51] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:54:51] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:54:51] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 2 ms to minimize.
[2024-06-01 14:54:52] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:54:52] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:54:52] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:54:52] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 3 ms to minimize.
[2024-06-01 14:54:53] [INFO ] Deduced a trap composed of 183 places in 297 ms of which 4 ms to minimize.
[2024-06-01 14:54:53] [INFO ] Deduced a trap composed of 166 places in 262 ms of which 3 ms to minimize.
[2024-06-01 14:54:54] [INFO ] Deduced a trap composed of 176 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:54:55] [INFO ] Deduced a trap composed of 178 places in 270 ms of which 4 ms to minimize.
[2024-06-01 14:54:56] [INFO ] Deduced a trap composed of 81 places in 240 ms of which 4 ms to minimize.
[2024-06-01 14:54:56] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 4 ms to minimize.
[2024-06-01 14:55:02] [INFO ] Deduced a trap composed of 219 places in 266 ms of which 3 ms to minimize.
[2024-06-01 14:55:03] [INFO ] Deduced a trap composed of 237 places in 301 ms of which 4 ms to minimize.
[2024-06-01 14:55:05] [INFO ] Deduced a trap composed of 232 places in 302 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/1564 variables, and 55 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/31 constraints, State Equation: 0/477 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:55:23] [INFO ] Deduced a trap composed of 224 places in 279 ms of which 4 ms to minimize.
[2024-06-01 14:55:24] [INFO ] Deduced a trap composed of 238 places in 237 ms of which 4 ms to minimize.
[2024-06-01 14:55:24] [INFO ] Deduced a trap composed of 233 places in 282 ms of which 4 ms to minimize.
[2024-06-01 14:55:24] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 4 ms to minimize.
[2024-06-01 14:55:25] [INFO ] Deduced a trap composed of 160 places in 300 ms of which 3 ms to minimize.
[2024-06-01 14:55:29] [INFO ] Deduced a trap composed of 69 places in 266 ms of which 4 ms to minimize.
[2024-06-01 14:55:29] [INFO ] Deduced a trap composed of 165 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:55:35] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:55:35] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:55:35] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:55:35] [INFO ] Deduced a trap composed of 295 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:55:36] [INFO ] Deduced a trap composed of 178 places in 231 ms of which 3 ms to minimize.
[2024-06-01 14:55:36] [INFO ] Deduced a trap composed of 166 places in 285 ms of which 3 ms to minimize.
[2024-06-01 14:55:40] [INFO ] Deduced a trap composed of 247 places in 240 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/1564 variables, and 69 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/31 constraints, State Equation: 0/477 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1101 constraints, Known Traps: 32/32 constraints]
After SMT, in 61907ms problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 61919ms
Starting structural reductions in SI_LTL mode, iteration 1 : 477/664 places, 1103/1290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113767 ms. Remains : 477/664 places, 1103/1290 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLCardinality-06
Product exploration explored 100000 steps with 26 reset in 641 ms.
Stack based approach found an accepted trace after 508 steps with 0 reset with depth 509 and stack size 509 in 3 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLCardinality-06 finished in 114577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 21 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:55:45] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 664 cols
[2024-06-01 14:55:45] [INFO ] Computed 44 invariants in 32 ms
[2024-06-01 14:55:45] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:55:59] [INFO ] Deduced a trap composed of 162 places in 264 ms of which 4 ms to minimize.
[2024-06-01 14:55:59] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:55:59] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 2 ms to minimize.
[2024-06-01 14:55:59] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:55:59] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:55:59] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 0 ms to minimize.
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 326 places in 387 ms of which 5 ms to minimize.
[2024-06-01 14:56:01] [INFO ] Deduced a trap composed of 134 places in 262 ms of which 3 ms to minimize.
[2024-06-01 14:56:02] [INFO ] Deduced a trap composed of 337 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:56:03] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 3 ms to minimize.
[2024-06-01 14:56:03] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 2 ms to minimize.
[2024-06-01 14:56:04] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:56:05] [INFO ] Deduced a trap composed of 480 places in 285 ms of which 4 ms to minimize.
[2024-06-01 14:56:06] [INFO ] Deduced a trap composed of 380 places in 325 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 59 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 59 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 17/17 constraints]
After SMT, in 42151ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42174ms
[2024-06-01 14:56:27] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:56:27] [INFO ] Invariant cache hit.
[2024-06-01 14:56:28] [INFO ] Implicit Places using invariants in 744 ms returned []
[2024-06-01 14:56:28] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:56:28] [INFO ] Invariant cache hit.
[2024-06-01 14:56:29] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:56:39] [INFO ] Implicit Places using invariants and state equation in 11017 ms returned []
Implicit Place search using SMT with State Equation took 11772 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:56:39] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:56:39] [INFO ] Invariant cache hit.
[2024-06-01 14:56:39] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:56:52] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 3 ms to minimize.
[2024-06-01 14:56:52] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:56:52] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:56:52] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:56:52] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:56:53] [INFO ] Deduced a trap composed of 162 places in 387 ms of which 5 ms to minimize.
[2024-06-01 14:56:53] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:56:53] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:56:54] [INFO ] Deduced a trap composed of 3 places in 367 ms of which 4 ms to minimize.
[2024-06-01 14:56:55] [INFO ] Deduced a trap composed of 326 places in 386 ms of which 5 ms to minimize.
[2024-06-01 14:56:55] [INFO ] Deduced a trap composed of 54 places in 377 ms of which 4 ms to minimize.
[2024-06-01 14:56:57] [INFO ] Deduced a trap composed of 72 places in 364 ms of which 5 ms to minimize.
[2024-06-01 14:56:57] [INFO ] Deduced a trap composed of 330 places in 334 ms of which 4 ms to minimize.
[2024-06-01 14:56:58] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:56:58] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 3 ms to minimize.
[2024-06-01 14:56:58] [INFO ] Deduced a trap composed of 339 places in 290 ms of which 4 ms to minimize.
[2024-06-01 14:57:00] [INFO ] Deduced a trap composed of 341 places in 394 ms of which 5 ms to minimize.
[2024-06-01 14:57:00] [INFO ] Deduced a trap composed of 312 places in 422 ms of which 4 ms to minimize.
[2024-06-01 14:57:00] [INFO ] Deduced a trap composed of 19 places in 334 ms of which 4 ms to minimize.
[2024-06-01 14:57:04] [INFO ] Deduced a trap composed of 390 places in 350 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:57:08] [INFO ] Deduced a trap composed of 336 places in 354 ms of which 5 ms to minimize.
[2024-06-01 14:57:09] [INFO ] Deduced a trap composed of 394 places in 374 ms of which 5 ms to minimize.
[2024-06-01 14:57:09] [INFO ] Deduced a trap composed of 331 places in 332 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 662/1938 variables, and 65 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 23/65 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 465 places in 273 ms of which 4 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 472 places in 275 ms of which 4 ms to minimize.
[2024-06-01 14:57:40] [INFO ] Deduced a trap composed of 447 places in 197 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 68 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 26/26 constraints]
After SMT, in 61910ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 61922ms
Finished structural reductions in LTL mode , in 1 iterations and 115899 ms. Remains : 664/664 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 388 ms.
Product exploration explored 100000 steps with 50000 reset in 413 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J06T08-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T08-LTLCardinality-09 finished in 116802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 14 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:57:42] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:57:42] [INFO ] Invariant cache hit.
[2024-06-01 14:57:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:57:53] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 2 ms to minimize.
[2024-06-01 14:57:53] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-06-01 14:57:53] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:57:53] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:57:53] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2024-06-01 14:57:54] [INFO ] Deduced a trap composed of 162 places in 306 ms of which 4 ms to minimize.
[2024-06-01 14:57:54] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:57:54] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:57:55] [INFO ] Deduced a trap composed of 3 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:57:55] [INFO ] Deduced a trap composed of 326 places in 360 ms of which 5 ms to minimize.
[2024-06-01 14:57:56] [INFO ] Deduced a trap composed of 54 places in 336 ms of which 5 ms to minimize.
[2024-06-01 14:57:58] [INFO ] Deduced a trap composed of 72 places in 314 ms of which 4 ms to minimize.
[2024-06-01 14:57:58] [INFO ] Deduced a trap composed of 330 places in 302 ms of which 5 ms to minimize.
[2024-06-01 14:57:58] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:57:59] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:57:59] [INFO ] Deduced a trap composed of 339 places in 359 ms of which 4 ms to minimize.
[2024-06-01 14:58:01] [INFO ] Deduced a trap composed of 341 places in 291 ms of which 3 ms to minimize.
[2024-06-01 14:58:01] [INFO ] Deduced a trap composed of 312 places in 260 ms of which 3 ms to minimize.
[2024-06-01 14:58:01] [INFO ] Deduced a trap composed of 19 places in 275 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 61 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20074 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:58:19] [INFO ] Deduced a trap composed of 378 places in 389 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 62 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 20/20 constraints]
After SMT, in 41566ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41577ms
[2024-06-01 14:58:23] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:58:23] [INFO ] Invariant cache hit.
[2024-06-01 14:58:24] [INFO ] Implicit Places using invariants in 759 ms returned []
[2024-06-01 14:58:24] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:58:24] [INFO ] Invariant cache hit.
[2024-06-01 14:58:25] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:58:36] [INFO ] Implicit Places using invariants and state equation in 11941 ms returned []
Implicit Place search using SMT with State Equation took 12702 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:58:36] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:58:36] [INFO ] Invariant cache hit.
[2024-06-01 14:58:36] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 162 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:58:50] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 4 ms to minimize.
[2024-06-01 14:58:51] [INFO ] Deduced a trap composed of 326 places in 321 ms of which 3 ms to minimize.
[2024-06-01 14:58:51] [INFO ] Deduced a trap composed of 54 places in 297 ms of which 3 ms to minimize.
[2024-06-01 14:58:53] [INFO ] Deduced a trap composed of 72 places in 344 ms of which 5 ms to minimize.
[2024-06-01 14:58:53] [INFO ] Deduced a trap composed of 330 places in 321 ms of which 4 ms to minimize.
[2024-06-01 14:58:54] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:58:54] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:58:54] [INFO ] Deduced a trap composed of 339 places in 363 ms of which 4 ms to minimize.
[2024-06-01 14:58:56] [INFO ] Deduced a trap composed of 341 places in 384 ms of which 5 ms to minimize.
[2024-06-01 14:58:57] [INFO ] Deduced a trap composed of 312 places in 372 ms of which 5 ms to minimize.
[2024-06-01 14:58:57] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 3 ms to minimize.
[2024-06-01 14:59:00] [INFO ] Deduced a trap composed of 390 places in 368 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 336 places in 379 ms of which 5 ms to minimize.
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 394 places in 371 ms of which 5 ms to minimize.
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 331 places in 341 ms of which 5 ms to minimize.
[2024-06-01 14:59:07] [INFO ] Deduced a trap composed of 147 places in 349 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 5.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 8.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 66 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 24/66 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:59:26] [INFO ] Deduced a trap composed of 388 places in 335 ms of which 5 ms to minimize.
[2024-06-01 14:59:27] [INFO ] Deduced a trap composed of 391 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:59:37] [INFO ] Deduced a trap composed of 460 places in 396 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 27/27 constraints]
After SMT, in 62160ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 62172ms
Finished structural reductions in LTL mode , in 1 iterations and 116471 ms. Remains : 664/664 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLCardinality-11
Product exploration explored 100000 steps with 4831 reset in 397 ms.
Product exploration explored 100000 steps with 4814 reset in 322 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 84 steps (0 resets) in 5 ms. (14 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 77 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:59:39] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:59:39] [INFO ] Invariant cache hit.
[2024-06-01 14:59:40] [INFO ] [Real]Absence check using 14 positive place invariants in 25 ms returned sat
[2024-06-01 14:59:40] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 173 ms returned sat
[2024-06-01 14:59:42] [INFO ] [Real]Absence check using state equation in 2151 ms returned sat
[2024-06-01 14:59:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:59:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 14:59:43] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 90 ms returned sat
[2024-06-01 14:59:46] [INFO ] [Nat]Absence check using state equation in 2828 ms returned sat
[2024-06-01 14:59:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:59:47] [INFO ] [Nat]Added 96 Read/Feed constraints in 389 ms returned sat
[2024-06-01 14:59:47] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:59:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 485 ms
[2024-06-01 14:59:47] [INFO ] Computed and/alt/rep : 808/3133/800 causal constraints (skipped 472 transitions) in 133 ms.
[2024-06-01 14:59:57] [INFO ] Added : 325 causal constraints over 65 iterations in 10025 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 664 transition count 1234
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 608 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 608 transition count 1154
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 528 transition count 1154
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 400 place count 464 transition count 1090
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 404 place count 460 transition count 1086
Iterating global reduction 2 with 4 rules applied. Total rules applied 408 place count 460 transition count 1086
Applied a total of 408 rules in 111 ms. Remains 460 /664 variables (removed 204) and now considering 1086/1290 (removed 204) transitions.
Running 1084 sub problems to find dead transitions.
[2024-06-01 14:59:57] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
// Phase 1: matrix 1070 rows 460 cols
[2024-06-01 14:59:57] [INFO ] Computed 44 invariants in 25 ms
[2024-06-01 14:59:57] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2024-06-01 15:00:06] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:00:06] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:00:06] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2024-06-01 15:00:06] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:00:06] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:00:06] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 159 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 166 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:00:08] [INFO ] Deduced a trap composed of 73 places in 213 ms of which 3 ms to minimize.
[2024-06-01 15:00:08] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:00:09] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:00:13] [INFO ] Deduced a trap composed of 292 places in 221 ms of which 3 ms to minimize.
[2024-06-01 15:00:13] [INFO ] Deduced a trap composed of 298 places in 228 ms of which 2 ms to minimize.
[2024-06-01 15:00:14] [INFO ] Deduced a trap composed of 284 places in 210 ms of which 2 ms to minimize.
[2024-06-01 15:00:15] [INFO ] Deduced a trap composed of 163 places in 246 ms of which 2 ms to minimize.
[2024-06-01 15:00:15] [INFO ] Deduced a trap composed of 174 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:00:15] [INFO ] Deduced a trap composed of 187 places in 213 ms of which 3 ms to minimize.
[2024-06-01 15:00:16] [INFO ] Deduced a trap composed of 222 places in 228 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2024-06-01 15:00:17] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1530 variables, and 63 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1084/1084 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1084 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2024-06-01 15:00:37] [INFO ] Deduced a trap composed of 198 places in 210 ms of which 3 ms to minimize.
[2024-06-01 15:00:37] [INFO ] Deduced a trap composed of 226 places in 205 ms of which 3 ms to minimize.
[2024-06-01 15:00:39] [INFO ] Deduced a trap composed of 210 places in 193 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1530 variables, and 66 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1084 constraints, Known Traps: 24/24 constraints]
After SMT, in 42263ms problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 42281ms
[2024-06-01 15:00:40] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2024-06-01 15:00:40] [INFO ] Invariant cache hit.
[2024-06-01 15:00:40] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-06-01 15:00:40] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2024-06-01 15:00:40] [INFO ] Invariant cache hit.
[2024-06-01 15:00:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:00:48] [INFO ] Implicit Places using invariants and state equation in 7692 ms returned []
Implicit Place search using SMT with State Equation took 8132 ms to find 0 implicit places.
[2024-06-01 15:00:48] [INFO ] Redundant transitions in 37 ms returned []
Running 1084 sub problems to find dead transitions.
[2024-06-01 15:00:48] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2024-06-01 15:00:48] [INFO ] Invariant cache hit.
[2024-06-01 15:00:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2024-06-01 15:00:56] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:00:56] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:00:56] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:00:56] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:00:56] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:00:56] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 0 ms to minimize.
[2024-06-01 15:00:56] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:00:56] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:00:57] [INFO ] Deduced a trap composed of 176 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:00:57] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:00:59] [INFO ] Deduced a trap composed of 73 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:00:59] [INFO ] Deduced a trap composed of 151 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:01:02] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-06-01 15:01:03] [INFO ] Deduced a trap composed of 298 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:01:03] [INFO ] Deduced a trap composed of 284 places in 194 ms of which 2 ms to minimize.
[2024-06-01 15:01:04] [INFO ] Deduced a trap composed of 190 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:01:04] [INFO ] Deduced a trap composed of 174 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:01:05] [INFO ] Deduced a trap composed of 181 places in 235 ms of which 2 ms to minimize.
[2024-06-01 15:01:05] [INFO ] Deduced a trap composed of 180 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:01:06] [INFO ] Deduced a trap composed of 206 places in 208 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2024-06-01 15:01:16] [INFO ] Deduced a trap composed of 184 places in 226 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1530 variables, and 63 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1084/1084 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1084 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD169 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/460 variables, 2/65 constraints. Problems are: Problem set: 11 solved, 1073 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1530 variables, and 65 constraints, problems are : Problem set: 11 solved, 1073 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1084 constraints, Known Traps: 21/21 constraints]
After SMT, in 61773ms problems are : Problem set: 11 solved, 1073 unsolved
Search for dead transitions found 11 dead transitions in 61788ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 460/664 places, 1075/1290 transitions.
Applied a total of 0 rules in 41 ms. Remains 460 /460 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2024-06-01 15:01:50] [INFO ] Redundant transitions in 32 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 112448 ms. Remains : 460/664 places, 1075/1290 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 96 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 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 81 steps (0 resets) in 5 ms. (13 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 122 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 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:01:50] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
// Phase 1: matrix 1059 rows 460 cols
[2024-06-01 15:01:50] [INFO ] Computed 44 invariants in 17 ms
[2024-06-01 15:01:51] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-06-01 15:01:51] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 99 ms returned sat
[2024-06-01 15:01:52] [INFO ] [Real]Absence check using state equation in 1721 ms returned sat
[2024-06-01 15:01:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:01:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-06-01 15:01:53] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 61 ms returned sat
[2024-06-01 15:01:57] [INFO ] [Nat]Absence check using state equation in 3957 ms returned sat
[2024-06-01 15:01:57] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:01:59] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:02:00] [INFO ] [Nat]Added 96 Read/Feed constraints in 3034 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6175 reset in 365 ms.
Product exploration explored 100000 steps with 6164 reset in 518 ms.
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 1075/1075 transitions.
Applied a total of 0 rules in 20 ms. Remains 460 /460 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
Running 1073 sub problems to find dead transitions.
[2024-06-01 15:02:01] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
[2024-06-01 15:02:01] [INFO ] Invariant cache hit.
[2024-06-01 15:02:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
[2024-06-01 15:02:09] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:02:09] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 0 ms to minimize.
[2024-06-01 15:02:09] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:02:09] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:02:09] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 0 ms to minimize.
[2024-06-01 15:02:09] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:02:09] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 0 ms to minimize.
[2024-06-01 15:02:09] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:02:10] [INFO ] Deduced a trap composed of 176 places in 295 ms of which 3 ms to minimize.
[2024-06-01 15:02:10] [INFO ] Deduced a trap composed of 180 places in 274 ms of which 4 ms to minimize.
[2024-06-01 15:02:10] [INFO ] Deduced a trap composed of 168 places in 278 ms of which 3 ms to minimize.
[2024-06-01 15:02:11] [INFO ] Deduced a trap composed of 183 places in 270 ms of which 3 ms to minimize.
[2024-06-01 15:02:11] [INFO ] Deduced a trap composed of 55 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:02:12] [INFO ] Deduced a trap composed of 71 places in 250 ms of which 4 ms to minimize.
[2024-06-01 15:02:16] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 2 ms to minimize.
[2024-06-01 15:02:18] [INFO ] Deduced a trap composed of 191 places in 260 ms of which 3 ms to minimize.
[2024-06-01 15:02:18] [INFO ] Deduced a trap composed of 239 places in 265 ms of which 3 ms to minimize.
[2024-06-01 15:02:18] [INFO ] Deduced a trap composed of 231 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:02:19] [INFO ] Deduced a trap composed of 226 places in 242 ms of which 4 ms to minimize.
[2024-06-01 15:02:19] [INFO ] Deduced a trap composed of 238 places in 232 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1073 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 458/1519 variables, and 62 constraints, problems are : Problem set: 0 solved, 1073 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1073/1073 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1073 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
[2024-06-01 15:02:41] [INFO ] Deduced a trap composed of 284 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:02:42] [INFO ] Deduced a trap composed of 239 places in 221 ms of which 3 ms to minimize.
[2024-06-01 15:02:42] [INFO ] Deduced a trap composed of 227 places in 230 ms of which 2 ms to minimize.
[2024-06-01 15:02:42] [INFO ] Deduced a trap composed of 238 places in 217 ms of which 3 ms to minimize.
[2024-06-01 15:02:43] [INFO ] Deduced a trap composed of 240 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:02:43] [INFO ] Deduced a trap composed of 229 places in 201 ms of which 2 ms to minimize.
SMT process timed out in 41822ms, After SMT, problems are : Problem set: 0 solved, 1073 unsolved
Search for dead transitions found 0 dead transitions in 41833ms
[2024-06-01 15:02:43] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
[2024-06-01 15:02:43] [INFO ] Invariant cache hit.
[2024-06-01 15:02:43] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-06-01 15:02:43] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
[2024-06-01 15:02:43] [INFO ] Invariant cache hit.
[2024-06-01 15:02:44] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:02:51] [INFO ] Implicit Places using invariants and state equation in 7835 ms returned []
Implicit Place search using SMT with State Equation took 8295 ms to find 0 implicit places.
[2024-06-01 15:02:51] [INFO ] Redundant transitions in 21 ms returned []
Running 1073 sub problems to find dead transitions.
[2024-06-01 15:02:51] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
[2024-06-01 15:02:51] [INFO ] Invariant cache hit.
[2024-06-01 15:02:51] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
[2024-06-01 15:02:59] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:03:00] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 0 ms to minimize.
[2024-06-01 15:03:00] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:03:00] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:03:00] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:03:00] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:03:00] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:03:00] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:03:00] [INFO ] Deduced a trap composed of 176 places in 300 ms of which 3 ms to minimize.
[2024-06-01 15:03:01] [INFO ] Deduced a trap composed of 180 places in 296 ms of which 4 ms to minimize.
[2024-06-01 15:03:01] [INFO ] Deduced a trap composed of 168 places in 276 ms of which 3 ms to minimize.
[2024-06-01 15:03:02] [INFO ] Deduced a trap composed of 183 places in 268 ms of which 2 ms to minimize.
[2024-06-01 15:03:02] [INFO ] Deduced a trap composed of 55 places in 195 ms of which 3 ms to minimize.
[2024-06-01 15:03:03] [INFO ] Deduced a trap composed of 71 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:03:06] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 3 ms to minimize.
[2024-06-01 15:03:08] [INFO ] Deduced a trap composed of 191 places in 252 ms of which 3 ms to minimize.
[2024-06-01 15:03:09] [INFO ] Deduced a trap composed of 239 places in 270 ms of which 3 ms to minimize.
[2024-06-01 15:03:09] [INFO ] Deduced a trap composed of 231 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:03:09] [INFO ] Deduced a trap composed of 226 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:03:09] [INFO ] Deduced a trap composed of 238 places in 281 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
[2024-06-01 15:03:16] [INFO ] Deduced a trap composed of 242 places in 187 ms of which 3 ms to minimize.
[2024-06-01 15:03:16] [INFO ] Deduced a trap composed of 236 places in 198 ms of which 3 ms to minimize.
[2024-06-01 15:03:17] [INFO ] Deduced a trap composed of 250 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:03:17] [INFO ] Deduced a trap composed of 245 places in 220 ms of which 2 ms to minimize.
[2024-06-01 15:03:17] [INFO ] Deduced a trap composed of 241 places in 195 ms of which 3 ms to minimize.
[2024-06-01 15:03:17] [INFO ] Deduced a trap composed of 229 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:03:19] [INFO ] Deduced a trap composed of 174 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:03:19] [INFO ] Deduced a trap composed of 212 places in 189 ms of which 3 ms to minimize.
[2024-06-01 15:03:19] [INFO ] Deduced a trap composed of 224 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:03:20] [INFO ] Deduced a trap composed of 198 places in 184 ms of which 3 ms to minimize.
[2024-06-01 15:03:20] [INFO ] Deduced a trap composed of 212 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:03:20] [INFO ] Deduced a trap composed of 208 places in 239 ms of which 3 ms to minimize.
[2024-06-01 15:03:20] [INFO ] Deduced a trap composed of 210 places in 220 ms of which 2 ms to minimize.
[2024-06-01 15:03:21] [INFO ] Deduced a trap composed of 201 places in 225 ms of which 4 ms to minimize.
[2024-06-01 15:03:21] [INFO ] Deduced a trap composed of 207 places in 239 ms of which 3 ms to minimize.
[2024-06-01 15:03:21] [INFO ] Deduced a trap composed of 249 places in 231 ms of which 3 ms to minimize.
[2024-06-01 15:03:21] [INFO ] Deduced a trap composed of 203 places in 222 ms of which 2 ms to minimize.
[2024-06-01 15:03:21] [INFO ] Deduced a trap composed of 187 places in 217 ms of which 2 ms to minimize.
[2024-06-01 15:03:22] [INFO ] Deduced a trap composed of 268 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:03:22] [INFO ] Deduced a trap composed of 217 places in 274 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1519 variables, and 82 constraints, problems are : Problem set: 0 solved, 1073 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1073/1073 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1073 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
[2024-06-01 15:03:39] [INFO ] Deduced a trap composed of 231 places in 266 ms of which 3 ms to minimize.
[2024-06-01 15:03:40] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 3 ms to minimize.
[2024-06-01 15:03:46] [INFO ] Deduced a trap composed of 284 places in 265 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1519 variables, and 85 constraints, problems are : Problem set: 0 solved, 1073 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1073 constraints, Known Traps: 43/43 constraints]
After SMT, in 61839ms problems are : Problem set: 0 solved, 1073 unsolved
Search for dead transitions found 0 dead transitions in 61850ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112034 ms. Remains : 460/460 places, 1075/1075 transitions.
Treatment of property PolyORBLF-PT-S02J06T08-LTLCardinality-11 finished in 371495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 7 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 15:03:53] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 664 cols
[2024-06-01 15:03:53] [INFO ] Computed 44 invariants in 27 ms
[2024-06-01 15:03:53] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 15:04:06] [INFO ] Deduced a trap composed of 162 places in 325 ms of which 5 ms to minimize.
[2024-06-01 15:04:06] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 2 ms to minimize.
[2024-06-01 15:04:06] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:04:06] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:04:06] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:04:06] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:04:07] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:04:07] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:04:07] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 0 ms to minimize.
[2024-06-01 15:04:07] [INFO ] Deduced a trap composed of 326 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:04:08] [INFO ] Deduced a trap composed of 134 places in 300 ms of which 3 ms to minimize.
[2024-06-01 15:04:09] [INFO ] Deduced a trap composed of 337 places in 390 ms of which 4 ms to minimize.
[2024-06-01 15:04:10] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:04:10] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:04:11] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:04:12] [INFO ] Deduced a trap composed of 480 places in 260 ms of which 3 ms to minimize.
[2024-06-01 15:04:12] [INFO ] Deduced a trap composed of 380 places in 265 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 59 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 59 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 17/17 constraints]
After SMT, in 41742ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41754ms
[2024-06-01 15:04:35] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 15:04:35] [INFO ] Invariant cache hit.
[2024-06-01 15:04:36] [INFO ] Implicit Places using invariants in 635 ms returned []
[2024-06-01 15:04:36] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 15:04:36] [INFO ] Invariant cache hit.
[2024-06-01 15:04:37] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:04:47] [INFO ] Implicit Places using invariants and state equation in 11205 ms returned []
Implicit Place search using SMT with State Equation took 11856 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2024-06-01 15:04:47] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 15:04:47] [INFO ] Invariant cache hit.
[2024-06-01 15:04:47] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 15:04:58] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:04:58] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:04:58] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:04:58] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
[2024-06-01 15:04:58] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:04:59] [INFO ] Deduced a trap composed of 162 places in 248 ms of which 4 ms to minimize.
[2024-06-01 15:04:59] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:04:59] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 2 ms to minimize.
[2024-06-01 15:05:00] [INFO ] Deduced a trap composed of 3 places in 234 ms of which 3 ms to minimize.
[2024-06-01 15:05:00] [INFO ] Deduced a trap composed of 326 places in 361 ms of which 5 ms to minimize.
[2024-06-01 15:05:01] [INFO ] Deduced a trap composed of 54 places in 249 ms of which 3 ms to minimize.
[2024-06-01 15:05:02] [INFO ] Deduced a trap composed of 72 places in 236 ms of which 3 ms to minimize.
[2024-06-01 15:05:02] [INFO ] Deduced a trap composed of 330 places in 242 ms of which 3 ms to minimize.
[2024-06-01 15:05:03] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 3 ms to minimize.
[2024-06-01 15:05:03] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:05:03] [INFO ] Deduced a trap composed of 339 places in 368 ms of which 5 ms to minimize.
[2024-06-01 15:05:05] [INFO ] Deduced a trap composed of 341 places in 393 ms of which 5 ms to minimize.
[2024-06-01 15:05:05] [INFO ] Deduced a trap composed of 312 places in 345 ms of which 5 ms to minimize.
[2024-06-01 15:05:05] [INFO ] Deduced a trap composed of 19 places in 375 ms of which 4 ms to minimize.
[2024-06-01 15:05:09] [INFO ] Deduced a trap composed of 390 places in 232 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 15:05:12] [INFO ] Deduced a trap composed of 336 places in 284 ms of which 4 ms to minimize.
[2024-06-01 15:05:13] [INFO ] Deduced a trap composed of 394 places in 363 ms of which 5 ms to minimize.
[2024-06-01 15:05:13] [INFO ] Deduced a trap composed of 331 places in 317 ms of which 3 ms to minimize.
[2024-06-01 15:05:16] [INFO ] Deduced a trap composed of 147 places in 267 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 66 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 24/66 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 15:05:36] [INFO ] Deduced a trap composed of 388 places in 394 ms of which 5 ms to minimize.
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 391 places in 313 ms of which 5 ms to minimize.
[2024-06-01 15:05:47] [INFO ] Deduced a trap composed of 460 places in 338 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 27/27 constraints]
After SMT, in 61853ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 61865ms
Finished structural reductions in LTL mode , in 1 iterations and 115489 ms. Remains : 664/664 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLCardinality-12
Product exploration explored 100000 steps with 10818 reset in 425 ms.
Product exploration explored 100000 steps with 10829 reset in 470 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 34 steps (0 resets) in 4 ms. (6 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 118 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:05:50] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 15:05:50] [INFO ] Invariant cache hit.
[2024-06-01 15:05:51] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 15:05:51] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 113 ms returned sat
[2024-06-01 15:05:53] [INFO ] [Real]Absence check using state equation in 2405 ms returned sat
[2024-06-01 15:05:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:05:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-06-01 15:05:54] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 159 ms returned sat
[2024-06-01 15:05:58] [INFO ] [Nat]Absence check using state equation in 4149 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 664 transition count 1234
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 608 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 608 transition count 1154
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 528 transition count 1154
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 398 place count 465 transition count 1091
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 402 place count 461 transition count 1087
Iterating global reduction 2 with 4 rules applied. Total rules applied 406 place count 461 transition count 1087
Applied a total of 406 rules in 101 ms. Remains 461 /664 variables (removed 203) and now considering 1087/1290 (removed 203) transitions.
Running 1085 sub problems to find dead transitions.
[2024-06-01 15:05:59] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
// Phase 1: matrix 1071 rows 461 cols
[2024-06-01 15:05:59] [INFO ] Computed 44 invariants in 12 ms
[2024-06-01 15:05:59] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:06:06] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:06:06] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 0 ms to minimize.
[2024-06-01 15:06:06] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:06:07] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:06:07] [INFO ] Deduced a trap composed of 172 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:06:07] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 2 ms to minimize.
[2024-06-01 15:06:08] [INFO ] Deduced a trap composed of 166 places in 186 ms of which 3 ms to minimize.
[2024-06-01 15:06:08] [INFO ] Deduced a trap composed of 77 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:06:08] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 0 ms to minimize.
[2024-06-01 15:06:09] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:06:09] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 0 ms to minimize.
[2024-06-01 15:06:10] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:06:10] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:06:10] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:06:12] [INFO ] Deduced a trap composed of 301 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:06:14] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 3 ms to minimize.
[2024-06-01 15:06:16] [INFO ] Deduced a trap composed of 175 places in 194 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/1532 variables, and 59 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/461 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1085/1085 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 10)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 7)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 2)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 10)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 1)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/1532 variables, and 59 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/461 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1085 constraints, Known Traps: 17/17 constraints]
After SMT, in 41718ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 41730ms
[2024-06-01 15:06:40] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:06:40] [INFO ] Invariant cache hit.
[2024-06-01 15:06:41] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-06-01 15:06:41] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:06:41] [INFO ] Invariant cache hit.
[2024-06-01 15:06:42] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:06:52] [INFO ] Implicit Places using invariants and state equation in 11110 ms returned []
Implicit Place search using SMT with State Equation took 11522 ms to find 0 implicit places.
[2024-06-01 15:06:52] [INFO ] Redundant transitions in 38 ms returned []
Running 1085 sub problems to find dead transitions.
[2024-06-01 15:06:52] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:06:52] [INFO ] Invariant cache hit.
[2024-06-01 15:06:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:07:00] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:07:01] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:07:01] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2024-06-01 15:07:01] [INFO ] Deduced a trap composed of 47 places in 303 ms of which 4 ms to minimize.
[2024-06-01 15:07:01] [INFO ] Deduced a trap composed of 47 places in 259 ms of which 3 ms to minimize.
[2024-06-01 15:07:02] [INFO ] Deduced a trap composed of 47 places in 236 ms of which 3 ms to minimize.
[2024-06-01 15:07:02] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:07:02] [INFO ] Deduced a trap composed of 159 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:07:02] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 0 ms to minimize.
[2024-06-01 15:07:03] [INFO ] Deduced a trap composed of 71 places in 252 ms of which 5 ms to minimize.
[2024-06-01 15:07:03] [INFO ] Deduced a trap composed of 189 places in 261 ms of which 3 ms to minimize.
[2024-06-01 15:07:05] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:07:05] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:07:10] [INFO ] Deduced a trap composed of 168 places in 265 ms of which 3 ms to minimize.
[2024-06-01 15:07:11] [INFO ] Deduced a trap composed of 153 places in 240 ms of which 3 ms to minimize.
[2024-06-01 15:07:12] [INFO ] Deduced a trap composed of 179 places in 311 ms of which 3 ms to minimize.
[2024-06-01 15:07:12] [INFO ] Deduced a trap composed of 187 places in 281 ms of which 3 ms to minimize.
[2024-06-01 15:07:13] [INFO ] Deduced a trap composed of 215 places in 265 ms of which 3 ms to minimize.
[2024-06-01 15:07:13] [INFO ] Deduced a trap composed of 208 places in 287 ms of which 3 ms to minimize.
[2024-06-01 15:07:15] [INFO ] Deduced a trap composed of 152 places in 245 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:07:24] [INFO ] Deduced a trap composed of 192 places in 240 ms of which 2 ms to minimize.
SMT process timed out in 31869ms, After SMT, problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 31880ms
Starting structural reductions in SI_LTL mode, iteration 1 : 461/664 places, 1087/1290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85288 ms. Remains : 461/664 places, 1087/1290 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 83 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 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 35 steps (0 resets) in 5 ms. (5 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 81 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 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:07:24] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:07:24] [INFO ] Invariant cache hit.
[2024-06-01 15:07:25] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 15:07:25] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 101 ms returned sat
[2024-06-01 15:07:27] [INFO ] [Real]Absence check using state equation in 2418 ms returned sat
[2024-06-01 15:07:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:07:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-06-01 15:07:28] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 125 ms returned sat
[2024-06-01 15:07:30] [INFO ] [Nat]Absence check using state equation in 2411 ms returned sat
[2024-06-01 15:07:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:07:31] [INFO ] [Nat]Added 96 Read/Feed constraints in 461 ms returned sat
[2024-06-01 15:07:31] [INFO ] Computed and/alt/rep : 424/1510/416 causal constraints (skipped 653 transitions) in 69 ms.
[2024-06-01 15:07:32] [INFO ] Added : 85 causal constraints over 17 iterations in 1164 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10847 reset in 513 ms.
Product exploration explored 100000 steps with 10846 reset in 493 ms.
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 1087/1087 transitions.
Applied a total of 0 rules in 42 ms. Remains 461 /461 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Running 1085 sub problems to find dead transitions.
[2024-06-01 15:07:33] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:07:33] [INFO ] Invariant cache hit.
[2024-06-01 15:07:33] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:07:43] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:07:43] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 0 ms to minimize.
[2024-06-01 15:07:43] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:07:43] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:07:43] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 3 ms to minimize.
[2024-06-01 15:07:44] [INFO ] Deduced a trap composed of 47 places in 260 ms of which 3 ms to minimize.
[2024-06-01 15:07:44] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:07:44] [INFO ] Deduced a trap composed of 159 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:07:44] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:07:44] [INFO ] Deduced a trap composed of 71 places in 250 ms of which 3 ms to minimize.
[2024-06-01 15:07:45] [INFO ] Deduced a trap composed of 189 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:07:47] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 2 ms to minimize.
[2024-06-01 15:07:47] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:07:53] [INFO ] Deduced a trap composed of 168 places in 304 ms of which 4 ms to minimize.
[2024-06-01 15:07:53] [INFO ] Deduced a trap composed of 153 places in 242 ms of which 3 ms to minimize.
[2024-06-01 15:07:54] [INFO ] Deduced a trap composed of 179 places in 272 ms of which 3 ms to minimize.
[2024-06-01 15:07:55] [INFO ] Deduced a trap composed of 187 places in 278 ms of which 3 ms to minimize.
SMT process timed out in 21705ms, After SMT, problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 21722ms
[2024-06-01 15:07:55] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:07:55] [INFO ] Invariant cache hit.
[2024-06-01 15:07:55] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-06-01 15:07:55] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:07:55] [INFO ] Invariant cache hit.
[2024-06-01 15:07:57] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:08:06] [INFO ] Implicit Places using invariants and state equation in 10184 ms returned []
Implicit Place search using SMT with State Equation took 10721 ms to find 0 implicit places.
[2024-06-01 15:08:06] [INFO ] Redundant transitions in 15 ms returned []
Running 1085 sub problems to find dead transitions.
[2024-06-01 15:08:06] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:08:06] [INFO ] Invariant cache hit.
[2024-06-01 15:08:06] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:08:14] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:08:14] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:08:14] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:08:14] [INFO ] Deduced a trap composed of 47 places in 434 ms of which 4 ms to minimize.
[2024-06-01 15:08:15] [INFO ] Deduced a trap composed of 47 places in 241 ms of which 3 ms to minimize.
[2024-06-01 15:08:15] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:08:15] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:08:15] [INFO ] Deduced a trap composed of 159 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:08:15] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:08:16] [INFO ] Deduced a trap composed of 71 places in 234 ms of which 2 ms to minimize.
[2024-06-01 15:08:16] [INFO ] Deduced a trap composed of 189 places in 233 ms of which 2 ms to minimize.
[2024-06-01 15:08:18] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 2 ms to minimize.
[2024-06-01 15:08:19] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 3 ms to minimize.
[2024-06-01 15:08:24] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 2 ms to minimize.
[2024-06-01 15:08:24] [INFO ] Deduced a trap composed of 153 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:08:25] [INFO ] Deduced a trap composed of 179 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:08:25] [INFO ] Deduced a trap composed of 187 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:08:25] [INFO ] Deduced a trap composed of 215 places in 220 ms of which 2 ms to minimize.
[2024-06-01 15:08:26] [INFO ] Deduced a trap composed of 208 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:08:27] [INFO ] Deduced a trap composed of 152 places in 210 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:08:35] [INFO ] Deduced a trap composed of 192 places in 190 ms of which 2 ms to minimize.
[2024-06-01 15:08:36] [INFO ] Deduced a trap composed of 191 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/1532 variables, and 64 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/461 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1085/1085 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 22/64 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:08:45] [INFO ] Deduced a trap composed of 201 places in 184 ms of which 3 ms to minimize.
[2024-06-01 15:08:45] [INFO ] Deduced a trap composed of 207 places in 191 ms of which 2 ms to minimize.
[2024-06-01 15:08:46] [INFO ] Deduced a trap composed of 203 places in 191 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/1532 variables, and 67 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/461 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1085 constraints, Known Traps: 25/25 constraints]
After SMT, in 61484ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 61493ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 94008 ms. Remains : 461/461 places, 1087/1087 transitions.
Treatment of property PolyORBLF-PT-S02J06T08-LTLCardinality-12 finished in 314121 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((G((p0||X(X(p1))))||F(p0))))'
Support contains 4 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 9 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 15:09:07] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 664 cols
[2024-06-01 15:09:07] [INFO ] Computed 44 invariants in 20 ms
[2024-06-01 15:09:07] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 15:09:21] [INFO ] Deduced a trap composed of 162 places in 265 ms of which 4 ms to minimize.
[2024-06-01 15:09:21] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:09:21] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:09:21] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:09:21] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:09:21] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:09:22] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 1 ms to minimize.
[2024-06-01 15:09:22] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 0 ms to minimize.
[2024-06-01 15:09:22] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:09:23] [INFO ] Deduced a trap composed of 326 places in 263 ms of which 3 ms to minimize.
[2024-06-01 15:09:24] [INFO ] Deduced a trap composed of 134 places in 284 ms of which 16 ms to minimize.
[2024-06-01 15:09:24] [INFO ] Deduced a trap composed of 337 places in 316 ms of which 3 ms to minimize.
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:09:26] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:09:27] [INFO ] Deduced a trap composed of 480 places in 335 ms of which 4 ms to minimize.
[2024-06-01 15:09:28] [INFO ] Deduced a trap composed of 380 places in 309 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 59 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 15:09:48] [INFO ] Deduced a trap composed of 461 places in 265 ms of which 4 ms to minimize.
[2024-06-01 15:09:49] [INFO ] Deduced a trap composed of 446 places in 260 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 61 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 19/19 constraints]
After SMT, in 41376ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41390ms
[2024-06-01 15:09:49] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 15:09:49] [INFO ] Invariant cache hit.
[2024-06-01 15:09:49] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-06-01 15:09:49] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 15:09:49] [INFO ] Invariant cache hit.
[2024-06-01 15:09:50] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:10:01] [INFO ] Implicit Places using invariants and state equation in 11811 ms returned []
Implicit Place search using SMT with State Equation took 12333 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2024-06-01 15:10:01] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 15:10:01] [INFO ] Invariant cache hit.
[2024-06-01 15:10:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 15:10:14] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:10:14] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:10:14] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:10:14] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:10:14] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:10:15] [INFO ] Deduced a trap composed of 162 places in 355 ms of which 5 ms to minimize.
[2024-06-01 15:10:15] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:10:15] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:10:16] [INFO ] Deduced a trap composed of 3 places in 357 ms of which 4 ms to minimize.
[2024-06-01 15:10:17] [INFO ] Deduced a trap composed of 326 places in 367 ms of which 4 ms to minimize.
[2024-06-01 15:10:17] [INFO ] Deduced a trap composed of 54 places in 370 ms of which 4 ms to minimize.
[2024-06-01 15:10:19] [INFO ] Deduced a trap composed of 72 places in 254 ms of which 3 ms to minimize.
[2024-06-01 15:10:19] [INFO ] Deduced a trap composed of 330 places in 367 ms of which 4 ms to minimize.
[2024-06-01 15:10:19] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:10:19] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 4 ms to minimize.
[2024-06-01 15:10:20] [INFO ] Deduced a trap composed of 339 places in 258 ms of which 4 ms to minimize.
[2024-06-01 15:10:21] [INFO ] Deduced a trap composed of 341 places in 376 ms of which 4 ms to minimize.
[2024-06-01 15:10:22] [INFO ] Deduced a trap composed of 312 places in 347 ms of which 5 ms to minimize.
[2024-06-01 15:10:22] [INFO ] Deduced a trap composed of 19 places in 294 ms of which 4 ms to minimize.
[2024-06-01 15:10:26] [INFO ] Deduced a trap composed of 390 places in 355 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 15:10:29] [INFO ] Deduced a trap composed of 336 places in 359 ms of which 4 ms to minimize.
[2024-06-01 15:10:29] [INFO ] Deduced a trap composed of 394 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:10:30] [INFO ] Deduced a trap composed of 331 places in 337 ms of which 5 ms to minimize.
[2024-06-01 15:10:33] [INFO ] Deduced a trap composed of 147 places in 365 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 66 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 24/66 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 15:10:51] [INFO ] Deduced a trap composed of 388 places in 376 ms of which 5 ms to minimize.
[2024-06-01 15:10:52] [INFO ] Deduced a trap composed of 391 places in 380 ms of which 6 ms to minimize.
[2024-06-01 15:11:01] [INFO ] Deduced a trap composed of 460 places in 294 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 27/27 constraints]
After SMT, in 62114ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 62133ms
Finished structural reductions in LTL mode , in 1 iterations and 115873 ms. Remains : 664/664 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLCardinality-13
Product exploration explored 100000 steps with 159 reset in 490 ms.
Product exploration explored 100000 steps with 159 reset in 458 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (13 resets) in 398 ms. (100 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 295 ms. (135 steps per ms) remains 1/1 properties
[2024-06-01 15:11:05] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 15:11:05] [INFO ] Invariant cache hit.
[2024-06-01 15:11:05] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 464/468 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/489 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/662 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1274/1936 variables, 662/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1936 variables, 96/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1936 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/1938 variables, 2/803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1938 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1938 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1938 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1938/1938 variables, and 804 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1304 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 664/664 constraints, ReadFeed: 96/96 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 464/468 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/489 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 662/1938 variables, and 43 constraints, problems are : Problem set: 1 solved, 0 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1506ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J06T08-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T08-LTLCardinality-13 finished in 119103 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : PolyORBLF-PT-S02J06T08-LTLCardinality-11
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 664 transition count 1234
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 608 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 608 transition count 1154
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 528 transition count 1154
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 400 place count 464 transition count 1090
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 404 place count 460 transition count 1086
Iterating global reduction 2 with 4 rules applied. Total rules applied 408 place count 460 transition count 1086
Applied a total of 408 rules in 83 ms. Remains 460 /664 variables (removed 204) and now considering 1086/1290 (removed 204) transitions.
Running 1084 sub problems to find dead transitions.
[2024-06-01 15:11:07] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
// Phase 1: matrix 1070 rows 460 cols
[2024-06-01 15:11:07] [INFO ] Computed 44 invariants in 24 ms
[2024-06-01 15:11:07] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2024-06-01 15:11:15] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:11:15] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:11:15] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:11:15] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:11:15] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:11:15] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:11:15] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:11:15] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:11:16] [INFO ] Deduced a trap composed of 159 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:11:16] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 2 ms to minimize.
[2024-06-01 15:11:16] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:11:17] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:11:18] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:11:22] [INFO ] Deduced a trap composed of 292 places in 244 ms of which 3 ms to minimize.
[2024-06-01 15:11:22] [INFO ] Deduced a trap composed of 298 places in 212 ms of which 3 ms to minimize.
[2024-06-01 15:11:22] [INFO ] Deduced a trap composed of 284 places in 197 ms of which 2 ms to minimize.
[2024-06-01 15:11:24] [INFO ] Deduced a trap composed of 163 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:11:24] [INFO ] Deduced a trap composed of 174 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:11:24] [INFO ] Deduced a trap composed of 187 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:11:25] [INFO ] Deduced a trap composed of 222 places in 261 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2024-06-01 15:11:26] [INFO ] Deduced a trap composed of 158 places in 279 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1530 variables, and 63 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1084/1084 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1084 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2024-06-01 15:11:47] [INFO ] Deduced a trap composed of 198 places in 191 ms of which 2 ms to minimize.
[2024-06-01 15:11:47] [INFO ] Deduced a trap composed of 226 places in 195 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1530 variables, and 65 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1084 constraints, Known Traps: 23/23 constraints]
After SMT, in 41660ms problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 41674ms
[2024-06-01 15:11:49] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2024-06-01 15:11:49] [INFO ] Invariant cache hit.
[2024-06-01 15:11:49] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-01 15:11:49] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2024-06-01 15:11:49] [INFO ] Invariant cache hit.
[2024-06-01 15:11:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:11:55] [INFO ] Implicit Places using invariants and state equation in 6495 ms returned []
Implicit Place search using SMT with State Equation took 6889 ms to find 0 implicit places.
Running 1084 sub problems to find dead transitions.
[2024-06-01 15:11:55] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2024-06-01 15:11:55] [INFO ] Invariant cache hit.
[2024-06-01 15:11:55] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2024-06-01 15:12:03] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2024-06-01 15:12:03] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:12:03] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 0 ms to minimize.
[2024-06-01 15:12:03] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:12:04] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:12:04] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 0 ms to minimize.
[2024-06-01 15:12:04] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 0 ms to minimize.
[2024-06-01 15:12:04] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:12:04] [INFO ] Deduced a trap composed of 176 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:12:04] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:12:06] [INFO ] Deduced a trap composed of 73 places in 206 ms of which 2 ms to minimize.
[2024-06-01 15:12:06] [INFO ] Deduced a trap composed of 151 places in 191 ms of which 2 ms to minimize.
[2024-06-01 15:12:09] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:12:10] [INFO ] Deduced a trap composed of 298 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:12:10] [INFO ] Deduced a trap composed of 284 places in 192 ms of which 2 ms to minimize.
[2024-06-01 15:12:11] [INFO ] Deduced a trap composed of 190 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:12:11] [INFO ] Deduced a trap composed of 174 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:12:12] [INFO ] Deduced a trap composed of 181 places in 206 ms of which 2 ms to minimize.
[2024-06-01 15:12:12] [INFO ] Deduced a trap composed of 180 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:12:12] [INFO ] Deduced a trap composed of 206 places in 187 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2024-06-01 15:12:22] [INFO ] Deduced a trap composed of 184 places in 191 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1530 variables, and 63 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1084/1084 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1084 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/460 variables, 2/65 constraints. Problems are: Problem set: 57 solved, 1027 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1530 variables, and 65 constraints, problems are : Problem set: 57 solved, 1027 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1084 constraints, Known Traps: 21/21 constraints]
After SMT, in 61504ms problems are : Problem set: 57 solved, 1027 unsolved
Search for dead transitions found 57 dead transitions in 61523ms
Found 57 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 57 transitions
Dead transitions reduction (with SMT) removed 57 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 460/664 places, 1029/1290 transitions.
Applied a total of 0 rules in 19 ms. Remains 460 /460 variables (removed 0) and now considering 1029/1029 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 110196 ms. Remains : 460/664 places, 1029/1290 transitions.
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLCardinality-11
Product exploration explored 100000 steps with 6181 reset in 314 ms.
Product exploration explored 100000 steps with 6150 reset in 318 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 72 steps (0 resets) in 6 ms. (10 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 70 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 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:12:58] [INFO ] Flow matrix only has 1013 transitions (discarded 16 similar events)
// Phase 1: matrix 1013 rows 460 cols
[2024-06-01 15:12:58] [INFO ] Computed 44 invariants in 14 ms
[2024-06-01 15:12:58] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-06-01 15:12:59] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 56 ms returned sat
[2024-06-01 15:13:00] [INFO ] [Real]Absence check using state equation in 1696 ms returned sat
[2024-06-01 15:13:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:13:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-06-01 15:13:01] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 61 ms returned sat
[2024-06-01 15:13:06] [INFO ] [Nat]Absence check using state equation in 4782 ms returned sat
[2024-06-01 15:13:06] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:13:07] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:13:07] [INFO ] [Nat]Added 96 Read/Feed constraints in 1597 ms returned sat
[2024-06-01 15:13:07] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:13:08] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:13:10] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2389 ms
Could not prove EG (NOT p0)
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 1029/1029 transitions.
Applied a total of 0 rules in 14 ms. Remains 460 /460 variables (removed 0) and now considering 1029/1029 (removed 0) transitions.
Running 1027 sub problems to find dead transitions.
[2024-06-01 15:13:10] [INFO ] Flow matrix only has 1013 transitions (discarded 16 similar events)
[2024-06-01 15:13:10] [INFO ] Invariant cache hit.
[2024-06-01 15:13:10] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-06-01 15:13:17] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:13:17] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:13:17] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:13:17] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:13:17] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:13:17] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:13:18] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:13:18] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:13:18] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 3 ms to minimize.
[2024-06-01 15:13:19] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:13:20] [INFO ] Deduced a trap composed of 75 places in 266 ms of which 3 ms to minimize.
[2024-06-01 15:13:21] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 3 ms to minimize.
[2024-06-01 15:13:22] [INFO ] Deduced a trap composed of 220 places in 195 ms of which 3 ms to minimize.
[2024-06-01 15:13:22] [INFO ] Deduced a trap composed of 192 places in 240 ms of which 4 ms to minimize.
[2024-06-01 15:13:22] [INFO ] Deduced a trap composed of 214 places in 235 ms of which 3 ms to minimize.
[2024-06-01 15:13:23] [INFO ] Deduced a trap composed of 224 places in 214 ms of which 3 ms to minimize.
[2024-06-01 15:13:24] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 3 ms to minimize.
[2024-06-01 15:13:26] [INFO ] Deduced a trap composed of 314 places in 285 ms of which 3 ms to minimize.
[2024-06-01 15:13:26] [INFO ] Deduced a trap composed of 284 places in 246 ms of which 3 ms to minimize.
[2024-06-01 15:13:27] [INFO ] Deduced a trap composed of 201 places in 245 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-06-01 15:13:28] [INFO ] Deduced a trap composed of 209 places in 250 ms of which 3 ms to minimize.
[2024-06-01 15:13:29] [INFO ] Deduced a trap composed of 220 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:13:29] [INFO ] Deduced a trap composed of 194 places in 293 ms of which 3 ms to minimize.
[2024-06-01 15:13:29] [INFO ] Deduced a trap composed of 191 places in 238 ms of which 4 ms to minimize.
[2024-06-01 15:13:30] [INFO ] Deduced a trap composed of 223 places in 211 ms of which 2 ms to minimize.
[2024-06-01 15:13:30] [INFO ] Deduced a trap composed of 225 places in 268 ms of which 4 ms to minimize.
[2024-06-01 15:13:30] [INFO ] Deduced a trap composed of 220 places in 209 ms of which 2 ms to minimize.
[2024-06-01 15:13:31] [INFO ] Deduced a trap composed of 230 places in 295 ms of which 3 ms to minimize.
[2024-06-01 15:13:31] [INFO ] Deduced a trap composed of 218 places in 257 ms of which 4 ms to minimize.
[2024-06-01 15:13:31] [INFO ] Deduced a trap composed of 216 places in 255 ms of which 3 ms to minimize.
SMT process timed out in 21533ms, After SMT, problems are : Problem set: 0 solved, 1027 unsolved
Search for dead transitions found 0 dead transitions in 21541ms
[2024-06-01 15:13:31] [INFO ] Flow matrix only has 1013 transitions (discarded 16 similar events)
[2024-06-01 15:13:31] [INFO ] Invariant cache hit.
[2024-06-01 15:13:32] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-06-01 15:13:32] [INFO ] Flow matrix only has 1013 transitions (discarded 16 similar events)
[2024-06-01 15:13:32] [INFO ] Invariant cache hit.
[2024-06-01 15:13:32] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:13:42] [INFO ] Implicit Places using invariants and state equation in 9963 ms returned []
Implicit Place search using SMT with State Equation took 10435 ms to find 0 implicit places.
[2024-06-01 15:13:42] [INFO ] Redundant transitions in 12 ms returned []
Running 1027 sub problems to find dead transitions.
[2024-06-01 15:13:42] [INFO ] Flow matrix only has 1013 transitions (discarded 16 similar events)
[2024-06-01 15:13:42] [INFO ] Invariant cache hit.
[2024-06-01 15:13:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-06-01 15:13:48] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:13:49] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:13:49] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 0 ms to minimize.
[2024-06-01 15:13:49] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 0 ms to minimize.
[2024-06-01 15:13:49] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:13:49] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:13:49] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:13:49] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:13:49] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:13:50] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 2 ms to minimize.
[2024-06-01 15:13:51] [INFO ] Deduced a trap composed of 75 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:13:52] [INFO ] Deduced a trap composed of 234 places in 210 ms of which 2 ms to minimize.
[2024-06-01 15:13:53] [INFO ] Deduced a trap composed of 220 places in 189 ms of which 3 ms to minimize.
[2024-06-01 15:13:53] [INFO ] Deduced a trap composed of 192 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:13:53] [INFO ] Deduced a trap composed of 214 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:13:54] [INFO ] Deduced a trap composed of 224 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:13:55] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:13:56] [INFO ] Deduced a trap composed of 314 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:13:56] [INFO ] Deduced a trap composed of 284 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:13:57] [INFO ] Deduced a trap composed of 201 places in 172 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-06-01 15:13:58] [INFO ] Deduced a trap composed of 209 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:13:58] [INFO ] Deduced a trap composed of 220 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:13:59] [INFO ] Deduced a trap composed of 194 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:13:59] [INFO ] Deduced a trap composed of 191 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:13:59] [INFO ] Deduced a trap composed of 223 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:13:59] [INFO ] Deduced a trap composed of 225 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:13:59] [INFO ] Deduced a trap composed of 220 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:14:00] [INFO ] Deduced a trap composed of 230 places in 167 ms of which 3 ms to minimize.
[2024-06-01 15:14:00] [INFO ] Deduced a trap composed of 218 places in 239 ms of which 4 ms to minimize.
[2024-06-01 15:14:00] [INFO ] Deduced a trap composed of 216 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:14:00] [INFO ] Deduced a trap composed of 224 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:14:01] [INFO ] Deduced a trap composed of 211 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:14:01] [INFO ] Deduced a trap composed of 217 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:14:01] [INFO ] Deduced a trap composed of 216 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:14:01] [INFO ] Deduced a trap composed of 222 places in 233 ms of which 3 ms to minimize.
[2024-06-01 15:14:02] [INFO ] Deduced a trap composed of 227 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:14:02] [INFO ] Deduced a trap composed of 222 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:14:02] [INFO ] Deduced a trap composed of 224 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:14:02] [INFO ] Deduced a trap composed of 250 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:14:02] [INFO ] Deduced a trap composed of 240 places in 182 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-06-01 15:14:12] [INFO ] Deduced a trap composed of 172 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:14:13] [INFO ] Deduced a trap composed of 203 places in 241 ms of which 3 ms to minimize.
[2024-06-01 15:14:13] [INFO ] Deduced a trap composed of 200 places in 226 ms of which 3 ms to minimize.
SMT process timed out in 31294ms, After SMT, problems are : Problem set: 0 solved, 1027 unsolved
Search for dead transitions found 0 dead transitions in 31303ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63329 ms. Remains : 460/460 places, 1029/1029 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 92 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 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 78 steps (0 resets) in 4 ms. (15 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 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 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:14:13] [INFO ] Flow matrix only has 1013 transitions (discarded 16 similar events)
[2024-06-01 15:14:13] [INFO ] Invariant cache hit.
[2024-06-01 15:14:14] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-06-01 15:14:14] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 89 ms returned sat
[2024-06-01 15:14:15] [INFO ] [Real]Absence check using state equation in 1362 ms returned sat
[2024-06-01 15:14:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:14:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-06-01 15:14:16] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 66 ms returned sat
[2024-06-01 15:14:19] [INFO ] [Nat]Absence check using state equation in 3563 ms returned sat
[2024-06-01 15:14:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:14:21] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:14:21] [INFO ] [Nat]Added 96 Read/Feed constraints in 1831 ms returned sat
[2024-06-01 15:14:21] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:14:23] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1636 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6179 reset in 294 ms.
Product exploration explored 100000 steps with 6132 reset in 312 ms.
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 1029/1029 transitions.
Applied a total of 0 rules in 13 ms. Remains 460 /460 variables (removed 0) and now considering 1029/1029 (removed 0) transitions.
Running 1027 sub problems to find dead transitions.
[2024-06-01 15:14:24] [INFO ] Flow matrix only has 1013 transitions (discarded 16 similar events)
[2024-06-01 15:14:24] [INFO ] Invariant cache hit.
[2024-06-01 15:14:24] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-06-01 15:14:30] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:14:31] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:14:31] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2024-06-01 15:14:31] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:14:31] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2024-06-01 15:14:31] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:14:31] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 0 ms to minimize.
[2024-06-01 15:14:31] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:14:31] [INFO ] Deduced a trap composed of 158 places in 264 ms of which 3 ms to minimize.
[2024-06-01 15:14:32] [INFO ] Deduced a trap composed of 55 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:14:33] [INFO ] Deduced a trap composed of 75 places in 271 ms of which 4 ms to minimize.
[2024-06-01 15:14:35] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 3 ms to minimize.
[2024-06-01 15:14:35] [INFO ] Deduced a trap composed of 220 places in 236 ms of which 3 ms to minimize.
[2024-06-01 15:14:35] [INFO ] Deduced a trap composed of 192 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:14:36] [INFO ] Deduced a trap composed of 214 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:14:36] [INFO ] Deduced a trap composed of 224 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:14:37] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:14:38] [INFO ] Deduced a trap composed of 314 places in 183 ms of which 3 ms to minimize.
[2024-06-01 15:14:39] [INFO ] Deduced a trap composed of 284 places in 194 ms of which 2 ms to minimize.
[2024-06-01 15:14:40] [INFO ] Deduced a trap composed of 201 places in 187 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-06-01 15:14:41] [INFO ] Deduced a trap composed of 209 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:14:41] [INFO ] Deduced a trap composed of 220 places in 222 ms of which 3 ms to minimize.
[2024-06-01 15:14:41] [INFO ] Deduced a trap composed of 194 places in 191 ms of which 3 ms to minimize.
[2024-06-01 15:14:42] [INFO ] Deduced a trap composed of 191 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:14:42] [INFO ] Deduced a trap composed of 223 places in 205 ms of which 3 ms to minimize.
[2024-06-01 15:14:42] [INFO ] Deduced a trap composed of 225 places in 205 ms of which 2 ms to minimize.
[2024-06-01 15:14:42] [INFO ] Deduced a trap composed of 220 places in 191 ms of which 2 ms to minimize.
[2024-06-01 15:14:43] [INFO ] Deduced a trap composed of 230 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:14:43] [INFO ] Deduced a trap composed of 218 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:14:43] [INFO ] Deduced a trap composed of 216 places in 218 ms of which 2 ms to minimize.
[2024-06-01 15:14:43] [INFO ] Deduced a trap composed of 224 places in 216 ms of which 2 ms to minimize.
[2024-06-01 15:14:44] [INFO ] Deduced a trap composed of 211 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:14:44] [INFO ] Deduced a trap composed of 217 places in 221 ms of which 2 ms to minimize.
[2024-06-01 15:14:44] [INFO ] Deduced a trap composed of 216 places in 200 ms of which 3 ms to minimize.
[2024-06-01 15:14:44] [INFO ] Deduced a trap composed of 222 places in 206 ms of which 3 ms to minimize.
[2024-06-01 15:14:45] [INFO ] Deduced a trap composed of 227 places in 245 ms of which 2 ms to minimize.
[2024-06-01 15:14:45] [INFO ] Deduced a trap composed of 222 places in 223 ms of which 3 ms to minimize.
[2024-06-01 15:14:45] [INFO ] Deduced a trap composed of 224 places in 238 ms of which 3 ms to minimize.
SMT process timed out in 21524ms, After SMT, problems are : Problem set: 0 solved, 1027 unsolved
Search for dead transitions found 0 dead transitions in 21532ms
[2024-06-01 15:14:45] [INFO ] Flow matrix only has 1013 transitions (discarded 16 similar events)
[2024-06-01 15:14:45] [INFO ] Invariant cache hit.
[2024-06-01 15:14:46] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-06-01 15:14:46] [INFO ] Flow matrix only has 1013 transitions (discarded 16 similar events)
[2024-06-01 15:14:46] [INFO ] Invariant cache hit.
[2024-06-01 15:14:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:14:56] [INFO ] Implicit Places using invariants and state equation in 10762 ms returned []
Implicit Place search using SMT with State Equation took 11211 ms to find 0 implicit places.
[2024-06-01 15:14:56] [INFO ] Redundant transitions in 13 ms returned []
Running 1027 sub problems to find dead transitions.
[2024-06-01 15:14:56] [INFO ] Flow matrix only has 1013 transitions (discarded 16 similar events)
[2024-06-01 15:14:56] [INFO ] Invariant cache hit.
[2024-06-01 15:14:56] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-06-01 15:15:03] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:15:04] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 1 ms to minimize.
[2024-06-01 15:15:04] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:15:04] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:15:04] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:15:04] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 0 ms to minimize.
[2024-06-01 15:15:04] [INFO ] Deduced a trap composed of 46 places in 26 ms of which 0 ms to minimize.
[2024-06-01 15:15:04] [INFO ] Deduced a trap composed of 47 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:15:04] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:15:05] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 1 ms to minimize.
[2024-06-01 15:15:06] [INFO ] Deduced a trap composed of 75 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:15:07] [INFO ] Deduced a trap composed of 234 places in 189 ms of which 3 ms to minimize.
[2024-06-01 15:15:07] [INFO ] Deduced a trap composed of 220 places in 233 ms of which 3 ms to minimize.
[2024-06-01 15:15:07] [INFO ] Deduced a trap composed of 192 places in 234 ms of which 3 ms to minimize.
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 214 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 224 places in 244 ms of which 3 ms to minimize.
[2024-06-01 15:15:10] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 3 ms to minimize.
[2024-06-01 15:15:11] [INFO ] Deduced a trap composed of 314 places in 265 ms of which 3 ms to minimize.
[2024-06-01 15:15:11] [INFO ] Deduced a trap composed of 284 places in 248 ms of which 3 ms to minimize.
[2024-06-01 15:15:12] [INFO ] Deduced a trap composed of 201 places in 200 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-06-01 15:15:13] [INFO ] Deduced a trap composed of 209 places in 216 ms of which 2 ms to minimize.
[2024-06-01 15:15:14] [INFO ] Deduced a trap composed of 220 places in 218 ms of which 2 ms to minimize.
[2024-06-01 15:15:14] [INFO ] Deduced a trap composed of 194 places in 263 ms of which 3 ms to minimize.
[2024-06-01 15:15:14] [INFO ] Deduced a trap composed of 191 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:15:15] [INFO ] Deduced a trap composed of 223 places in 223 ms of which 2 ms to minimize.
[2024-06-01 15:15:15] [INFO ] Deduced a trap composed of 225 places in 201 ms of which 2 ms to minimize.
[2024-06-01 15:15:15] [INFO ] Deduced a trap composed of 220 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:15:15] [INFO ] Deduced a trap composed of 230 places in 210 ms of which 3 ms to minimize.
[2024-06-01 15:15:16] [INFO ] Deduced a trap composed of 218 places in 206 ms of which 3 ms to minimize.
[2024-06-01 15:15:16] [INFO ] Deduced a trap composed of 216 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:15:16] [INFO ] Deduced a trap composed of 224 places in 209 ms of which 2 ms to minimize.
[2024-06-01 15:15:16] [INFO ] Deduced a trap composed of 211 places in 206 ms of which 3 ms to minimize.
[2024-06-01 15:15:17] [INFO ] Deduced a trap composed of 217 places in 198 ms of which 3 ms to minimize.
[2024-06-01 15:15:17] [INFO ] Deduced a trap composed of 216 places in 191 ms of which 3 ms to minimize.
[2024-06-01 15:15:17] [INFO ] Deduced a trap composed of 222 places in 212 ms of which 3 ms to minimize.
[2024-06-01 15:15:17] [INFO ] Deduced a trap composed of 227 places in 215 ms of which 3 ms to minimize.
[2024-06-01 15:15:17] [INFO ] Deduced a trap composed of 222 places in 205 ms of which 3 ms to minimize.
[2024-06-01 15:15:18] [INFO ] Deduced a trap composed of 224 places in 257 ms of which 3 ms to minimize.
[2024-06-01 15:15:18] [INFO ] Deduced a trap composed of 250 places in 194 ms of which 3 ms to minimize.
[2024-06-01 15:15:18] [INFO ] Deduced a trap composed of 240 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1027 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 458/1473 variables, and 82 constraints, problems are : Problem set: 0 solved, 1027 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1027/1027 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1027 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-06-01 15:15:54] [INFO ] Deduced a trap composed of 185 places in 205 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1473 variables, and 83 constraints, problems are : Problem set: 0 solved, 1027 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1027 constraints, Known Traps: 41/41 constraints]
After SMT, in 61390ms problems are : Problem set: 0 solved, 1027 unsolved
Search for dead transitions found 0 dead transitions in 61404ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 94191 ms. Remains : 460/460 places, 1029/1029 transitions.
Treatment of property PolyORBLF-PT-S02J06T08-LTLCardinality-11 finished in 291191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : PolyORBLF-PT-S02J06T08-LTLCardinality-12
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 664 transition count 1234
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 608 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 608 transition count 1154
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 528 transition count 1154
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 398 place count 465 transition count 1091
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 402 place count 461 transition count 1087
Iterating global reduction 2 with 4 rules applied. Total rules applied 406 place count 461 transition count 1087
Applied a total of 406 rules in 73 ms. Remains 461 /664 variables (removed 203) and now considering 1087/1290 (removed 203) transitions.
Running 1085 sub problems to find dead transitions.
[2024-06-01 15:15:58] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
// Phase 1: matrix 1071 rows 461 cols
[2024-06-01 15:15:58] [INFO ] Computed 44 invariants in 17 ms
[2024-06-01 15:15:58] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:16:06] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:16:06] [INFO ] Deduced a trap composed of 46 places in 27 ms of which 0 ms to minimize.
[2024-06-01 15:16:06] [INFO ] Deduced a trap composed of 47 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:16:06] [INFO ] Deduced a trap composed of 46 places in 26 ms of which 0 ms to minimize.
[2024-06-01 15:16:06] [INFO ] Deduced a trap composed of 172 places in 270 ms of which 3 ms to minimize.
[2024-06-01 15:16:07] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:16:07] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 3 ms to minimize.
[2024-06-01 15:16:08] [INFO ] Deduced a trap composed of 77 places in 268 ms of which 3 ms to minimize.
[2024-06-01 15:16:08] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:16:08] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:16:09] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:16:10] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:16:10] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:16:10] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:16:12] [INFO ] Deduced a trap composed of 301 places in 260 ms of which 4 ms to minimize.
[2024-06-01 15:16:14] [INFO ] Deduced a trap composed of 168 places in 270 ms of which 3 ms to minimize.
[2024-06-01 15:16:16] [INFO ] Deduced a trap composed of 175 places in 180 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/1532 variables, and 59 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/461 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1085/1085 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/1532 variables, and 59 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/461 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1085 constraints, Known Traps: 17/17 constraints]
After SMT, in 41618ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 41632ms
[2024-06-01 15:16:40] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:16:40] [INFO ] Invariant cache hit.
[2024-06-01 15:16:40] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-06-01 15:16:40] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:16:40] [INFO ] Invariant cache hit.
[2024-06-01 15:16:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:16:52] [INFO ] Implicit Places using invariants and state equation in 11349 ms returned []
Implicit Place search using SMT with State Equation took 11790 ms to find 0 implicit places.
Running 1085 sub problems to find dead transitions.
[2024-06-01 15:16:52] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:16:52] [INFO ] Invariant cache hit.
[2024-06-01 15:16:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:16:59] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:17:00] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:17:00] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:17:00] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:17:00] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:17:00] [INFO ] Deduced a trap composed of 47 places in 258 ms of which 3 ms to minimize.
[2024-06-01 15:17:01] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:17:01] [INFO ] Deduced a trap composed of 159 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:17:01] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:17:01] [INFO ] Deduced a trap composed of 71 places in 188 ms of which 4 ms to minimize.
[2024-06-01 15:17:01] [INFO ] Deduced a trap composed of 189 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:17:03] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2024-06-01 15:17:03] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:17:08] [INFO ] Deduced a trap composed of 168 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:17:08] [INFO ] Deduced a trap composed of 153 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:17:08] [INFO ] Deduced a trap composed of 179 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:17:09] [INFO ] Deduced a trap composed of 187 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:17:09] [INFO ] Deduced a trap composed of 215 places in 248 ms of which 3 ms to minimize.
[2024-06-01 15:17:10] [INFO ] Deduced a trap composed of 208 places in 269 ms of which 2 ms to minimize.
[2024-06-01 15:17:11] [INFO ] Deduced a trap composed of 152 places in 272 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:17:20] [INFO ] Deduced a trap composed of 192 places in 287 ms of which 3 ms to minimize.
[2024-06-01 15:17:22] [INFO ] Deduced a trap composed of 191 places in 260 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/1532 variables, and 64 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/461 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1085/1085 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 22/64 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:17:32] [INFO ] Deduced a trap composed of 201 places in 294 ms of which 3 ms to minimize.
[2024-06-01 15:17:33] [INFO ] Deduced a trap composed of 207 places in 312 ms of which 3 ms to minimize.
[2024-06-01 15:17:33] [INFO ] Deduced a trap composed of 203 places in 284 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/1532 variables, and 67 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/461 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1085 constraints, Known Traps: 25/25 constraints]
After SMT, in 61499ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 61509ms
Starting structural reductions in LI_LTL mode, iteration 1 : 461/664 places, 1087/1290 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 115008 ms. Remains : 461/664 places, 1087/1290 transitions.
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLCardinality-12
Product exploration explored 100000 steps with 10798 reset in 304 ms.
Product exploration explored 100000 steps with 10815 reset in 308 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33 steps (0 resets) in 4 ms. (6 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 123 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:17:54] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:17:54] [INFO ] Invariant cache hit.
[2024-06-01 15:17:55] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 15:17:55] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 101 ms returned sat
[2024-06-01 15:17:57] [INFO ] [Real]Absence check using state equation in 2468 ms returned sat
[2024-06-01 15:17:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:17:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-06-01 15:17:58] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 127 ms returned sat
[2024-06-01 15:18:00] [INFO ] [Nat]Absence check using state equation in 2434 ms returned sat
[2024-06-01 15:18:00] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:18:01] [INFO ] [Nat]Added 96 Read/Feed constraints in 464 ms returned sat
[2024-06-01 15:18:01] [INFO ] Computed and/alt/rep : 424/1510/416 causal constraints (skipped 653 transitions) in 94 ms.
[2024-06-01 15:18:03] [INFO ] Added : 85 causal constraints over 17 iterations in 1596 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 1087/1087 transitions.
Applied a total of 0 rules in 34 ms. Remains 461 /461 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Running 1085 sub problems to find dead transitions.
[2024-06-01 15:18:03] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:18:03] [INFO ] Invariant cache hit.
[2024-06-01 15:18:03] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:18:12] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:18:12] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:18:12] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:18:12] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 3 ms to minimize.
[2024-06-01 15:18:13] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 2 ms to minimize.
[2024-06-01 15:18:13] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:18:13] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:18:13] [INFO ] Deduced a trap composed of 159 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:18:13] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2024-06-01 15:18:14] [INFO ] Deduced a trap composed of 71 places in 305 ms of which 3 ms to minimize.
[2024-06-01 15:18:14] [INFO ] Deduced a trap composed of 189 places in 289 ms of which 3 ms to minimize.
[2024-06-01 15:18:17] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 3 ms to minimize.
[2024-06-01 15:18:17] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:18:22] [INFO ] Deduced a trap composed of 168 places in 276 ms of which 3 ms to minimize.
[2024-06-01 15:18:23] [INFO ] Deduced a trap composed of 153 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:18:23] [INFO ] Deduced a trap composed of 179 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:18:24] [INFO ] Deduced a trap composed of 187 places in 289 ms of which 3 ms to minimize.
SMT process timed out in 21515ms, After SMT, problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 21531ms
[2024-06-01 15:18:24] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:18:24] [INFO ] Invariant cache hit.
[2024-06-01 15:18:25] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-06-01 15:18:25] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:18:25] [INFO ] Invariant cache hit.
[2024-06-01 15:18:26] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:18:35] [INFO ] Implicit Places using invariants and state equation in 10720 ms returned []
Implicit Place search using SMT with State Equation took 11269 ms to find 0 implicit places.
[2024-06-01 15:18:35] [INFO ] Redundant transitions in 15 ms returned []
Running 1085 sub problems to find dead transitions.
[2024-06-01 15:18:35] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:18:35] [INFO ] Invariant cache hit.
[2024-06-01 15:18:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:18:43] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:18:43] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:18:43] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 3 ms to minimize.
[2024-06-01 15:18:44] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 2 ms to minimize.
[2024-06-01 15:18:44] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 2 ms to minimize.
[2024-06-01 15:18:44] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:18:44] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:18:45] [INFO ] Deduced a trap composed of 159 places in 189 ms of which 3 ms to minimize.
[2024-06-01 15:18:45] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 0 ms to minimize.
[2024-06-01 15:18:45] [INFO ] Deduced a trap composed of 71 places in 200 ms of which 2 ms to minimize.
[2024-06-01 15:18:45] [INFO ] Deduced a trap composed of 189 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:18:47] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-06-01 15:18:47] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:18:51] [INFO ] Deduced a trap composed of 168 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:18:52] [INFO ] Deduced a trap composed of 153 places in 191 ms of which 2 ms to minimize.
[2024-06-01 15:18:52] [INFO ] Deduced a trap composed of 179 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:18:53] [INFO ] Deduced a trap composed of 187 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:18:53] [INFO ] Deduced a trap composed of 215 places in 212 ms of which 3 ms to minimize.
[2024-06-01 15:18:53] [INFO ] Deduced a trap composed of 208 places in 189 ms of which 3 ms to minimize.
[2024-06-01 15:18:55] [INFO ] Deduced a trap composed of 152 places in 177 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:19:03] [INFO ] Deduced a trap composed of 192 places in 197 ms of which 3 ms to minimize.
[2024-06-01 15:19:04] [INFO ] Deduced a trap composed of 191 places in 202 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/1532 variables, and 64 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/461 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1085/1085 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 22/64 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:19:16] [INFO ] Deduced a trap composed of 201 places in 216 ms of which 2 ms to minimize.
[2024-06-01 15:19:16] [INFO ] Deduced a trap composed of 207 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:19:16] [INFO ] Deduced a trap composed of 203 places in 213 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/1532 variables, and 67 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/461 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1085 constraints, Known Traps: 25/25 constraints]
After SMT, in 61594ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 61603ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 94469 ms. Remains : 461/461 places, 1087/1087 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 119 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 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 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 76 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 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:19:37] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:19:37] [INFO ] Invariant cache hit.
[2024-06-01 15:19:38] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-01 15:19:38] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 73 ms returned sat
[2024-06-01 15:19:41] [INFO ] [Real]Absence check using state equation in 2785 ms returned sat
[2024-06-01 15:19:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:19:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 15:19:41] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 177 ms returned sat
[2024-06-01 15:19:44] [INFO ] [Nat]Absence check using state equation in 2905 ms returned sat
[2024-06-01 15:19:44] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:19:45] [INFO ] [Nat]Added 96 Read/Feed constraints in 558 ms returned sat
[2024-06-01 15:19:45] [INFO ] Computed and/alt/rep : 424/1510/416 causal constraints (skipped 653 transitions) in 70 ms.
[2024-06-01 15:19:46] [INFO ] Added : 85 causal constraints over 17 iterations in 1187 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10820 reset in 374 ms.
Product exploration explored 100000 steps with 10802 reset in 328 ms.
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 1087/1087 transitions.
Applied a total of 0 rules in 14 ms. Remains 461 /461 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Running 1085 sub problems to find dead transitions.
[2024-06-01 15:19:47] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:19:47] [INFO ] Invariant cache hit.
[2024-06-01 15:19:47] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:19:56] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 0 ms to minimize.
[2024-06-01 15:19:56] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:19:56] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:19:57] [INFO ] Deduced a trap composed of 47 places in 271 ms of which 4 ms to minimize.
[2024-06-01 15:19:57] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 3 ms to minimize.
[2024-06-01 15:19:57] [INFO ] Deduced a trap composed of 47 places in 241 ms of which 3 ms to minimize.
[2024-06-01 15:19:57] [INFO ] Deduced a trap composed of 46 places in 206 ms of which 3 ms to minimize.
[2024-06-01 15:19:58] [INFO ] Deduced a trap composed of 159 places in 200 ms of which 2 ms to minimize.
[2024-06-01 15:19:58] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:19:58] [INFO ] Deduced a trap composed of 71 places in 224 ms of which 3 ms to minimize.
[2024-06-01 15:19:59] [INFO ] Deduced a trap composed of 189 places in 254 ms of which 2 ms to minimize.
[2024-06-01 15:20:01] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:20:01] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:20:06] [INFO ] Deduced a trap composed of 168 places in 247 ms of which 3 ms to minimize.
[2024-06-01 15:20:06] [INFO ] Deduced a trap composed of 153 places in 235 ms of which 3 ms to minimize.
[2024-06-01 15:20:07] [INFO ] Deduced a trap composed of 179 places in 249 ms of which 3 ms to minimize.
[2024-06-01 15:20:07] [INFO ] Deduced a trap composed of 187 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:20:08] [INFO ] Deduced a trap composed of 215 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:20:08] [INFO ] Deduced a trap composed of 208 places in 226 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/1532 variables, and 61 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/461 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1085/1085 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:20:17] [INFO ] Deduced a trap composed of 208 places in 277 ms of which 4 ms to minimize.
[2024-06-01 15:20:21] [INFO ] Deduced a trap composed of 285 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:20:28] [INFO ] Deduced a trap composed of 167 places in 264 ms of which 3 ms to minimize.
[2024-06-01 15:20:28] [INFO ] Deduced a trap composed of 203 places in 247 ms of which 3 ms to minimize.
SMT process timed out in 41565ms, After SMT, problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 41574ms
[2024-06-01 15:20:28] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:20:28] [INFO ] Invariant cache hit.
[2024-06-01 15:20:29] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-06-01 15:20:29] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:20:29] [INFO ] Invariant cache hit.
[2024-06-01 15:20:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:20:41] [INFO ] Implicit Places using invariants and state equation in 11731 ms returned []
Implicit Place search using SMT with State Equation took 12151 ms to find 0 implicit places.
[2024-06-01 15:20:41] [INFO ] Redundant transitions in 16 ms returned []
Running 1085 sub problems to find dead transitions.
[2024-06-01 15:20:41] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
[2024-06-01 15:20:41] [INFO ] Invariant cache hit.
[2024-06-01 15:20:41] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:20:49] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:20:49] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2024-06-01 15:20:49] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:20:49] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 3 ms to minimize.
[2024-06-01 15:20:50] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 2 ms to minimize.
[2024-06-01 15:20:50] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 3 ms to minimize.
[2024-06-01 15:20:50] [INFO ] Deduced a trap composed of 46 places in 197 ms of which 2 ms to minimize.
[2024-06-01 15:20:50] [INFO ] Deduced a trap composed of 159 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:20:50] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:20:51] [INFO ] Deduced a trap composed of 71 places in 212 ms of which 3 ms to minimize.
[2024-06-01 15:20:51] [INFO ] Deduced a trap composed of 189 places in 214 ms of which 2 ms to minimize.
[2024-06-01 15:20:53] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:20:53] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:20:58] [INFO ] Deduced a trap composed of 168 places in 240 ms of which 3 ms to minimize.
[2024-06-01 15:20:58] [INFO ] Deduced a trap composed of 153 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:20:59] [INFO ] Deduced a trap composed of 179 places in 258 ms of which 3 ms to minimize.
[2024-06-01 15:20:59] [INFO ] Deduced a trap composed of 187 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:21:00] [INFO ] Deduced a trap composed of 215 places in 206 ms of which 2 ms to minimize.
[2024-06-01 15:21:00] [INFO ] Deduced a trap composed of 208 places in 268 ms of which 3 ms to minimize.
[2024-06-01 15:21:02] [INFO ] Deduced a trap composed of 152 places in 252 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:21:10] [INFO ] Deduced a trap composed of 192 places in 276 ms of which 3 ms to minimize.
[2024-06-01 15:21:12] [INFO ] Deduced a trap composed of 191 places in 281 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/1532 variables, and 64 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/461 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1085/1085 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 22/64 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 15:21:20] [INFO ] Deduced a trap composed of 201 places in 284 ms of which 3 ms to minimize.
[2024-06-01 15:21:21] [INFO ] Deduced a trap composed of 207 places in 246 ms of which 4 ms to minimize.
[2024-06-01 15:21:21] [INFO ] Deduced a trap composed of 203 places in 245 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/1532 variables, and 67 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/461 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1085 constraints, Known Traps: 25/25 constraints]
After SMT, in 61706ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 61716ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 115484 ms. Remains : 461/461 places, 1087/1087 transitions.
Treatment of property PolyORBLF-PT-S02J06T08-LTLCardinality-12 finished in 344645 ms.
[2024-06-01 15:21:42] [INFO ] Flatten gal took : 66 ms
[2024-06-01 15:21:43] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 15:21:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 664 places, 1290 transitions and 5602 arcs took 11 ms.
Total runtime 2103884 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-LTLCardinality-00
FORMULA PolyORBLF-PT-S02J06T08-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717255751753

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-PT-S02J06T08-LTLCardinality-00
ltl formula formula --ltl=/tmp/4661/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 1290 transitions and 5602 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4661/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4661/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4661/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.030 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4661/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 679 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 1293 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~23 levels ~10000 states ~17316 transitions
pnml2lts-mc( 1/ 4): ~23 levels ~20000 states ~35792 transitions
pnml2lts-mc( 1/ 4): ~23 levels ~40000 states ~71984 transitions
pnml2lts-mc( 1/ 4): ~73 levels ~80000 states ~155036 transitions
pnml2lts-mc( 1/ 4): ~73 levels ~160000 states ~343640 transitions
pnml2lts-mc( 1/ 4): ~80 levels ~320000 states ~722448 transitions
pnml2lts-mc( 1/ 4): ~80 levels ~640000 states ~1352328 transitions
pnml2lts-mc( 1/ 4): ~80 levels ~1280000 states ~2825768 transitions
pnml2lts-mc( 1/ 4): ~168 levels ~2560000 states ~5776924 transitions
pnml2lts-mc( 2/ 4): ~122 levels ~5120000 states ~11335968 transitions
pnml2lts-mc( 3/ 4): ~122 levels ~10240000 states ~23701732 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 15229981
pnml2lts-mc( 0/ 4): unique states count: 15230406
pnml2lts-mc( 0/ 4): unique transitions count: 37123263
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 21893193
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 15231191
pnml2lts-mc( 0/ 4): - cum. max stack depth: 523
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 15231191 states 37126286 transitions, fanout: 2.438
pnml2lts-mc( 0/ 4): Total exploration time 445.630 sec (445.600 sec minimum, 445.615 sec on average)
pnml2lts-mc( 0/ 4): States per second: 34179, Transitions per second: 83312
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 180.2MB, 12.4 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 45.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1320 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 180.2MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S02J06T08-LTLCardinality-11
ltl formula formula --ltl=/tmp/4661/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 1290 transitions and 5602 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.060 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4661/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4661/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4661/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4661/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 679 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 1292 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~25 levels ~10000 states ~15772 transitions
pnml2lts-mc( 3/ 4): ~25 levels ~20000 states ~33172 transitions
pnml2lts-mc( 3/ 4): ~25 levels ~40000 states ~68108 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 42139
pnml2lts-mc( 0/ 4): unique states count: 42139
pnml2lts-mc( 0/ 4): unique transitions count: 73304
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 31437
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 42627
pnml2lts-mc( 0/ 4): - cum. max stack depth: 100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 42627 states 74724 transitions, fanout: 1.753
pnml2lts-mc( 0/ 4): Total exploration time 1.310 sec (1.310 sec minimum, 1.310 sec on average)
pnml2lts-mc( 0/ 4): States per second: 32540, Transitions per second: 57041
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.6MB, 15.1 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1320 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.6MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S02J06T08-LTLCardinality-12
ltl formula formula --ltl=/tmp/4661/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 1290 transitions and 5602 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.050 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4661/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4661/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4661/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4661/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 679 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 1292 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 433
pnml2lts-mc( 0/ 4): unique states count: 433
pnml2lts-mc( 0/ 4): unique transitions count: 602
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 258
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 544
pnml2lts-mc( 0/ 4): - cum. max stack depth: 44
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 544 states 891 transitions, fanout: 1.638
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 27200, Transitions per second: 44550
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 44.2 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1320 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S02J06T08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446700251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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