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-171654446900324.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-S06J04T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446900324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 25K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 329K Apr 11 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 160K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 538K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 11 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 11 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 11 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 11 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K Apr 23 07:44 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 11M 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-S06J04T06-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717255743185

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:29:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:29:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:29:05] [INFO ] Load time of PNML (sax parser for PT used): 633 ms
[2024-06-01 15:29:05] [INFO ] Transformed 632 places.
[2024-06-01 15:29:05] [INFO ] Transformed 10500 transitions.
[2024-06-01 15:29:05] [INFO ] Parsed PT model containing 632 places and 10500 transitions and 88770 arcs in 842 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 48 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2024-06-01 15:29:05] [INFO ] Reduced 7020 identical enabling conditions.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 219 out of 632 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 627 transition count 2425
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 627 transition count 2425
Applied a total of 10 rules in 166 ms. Remains 627 /632 variables (removed 5) and now considering 2425/2430 (removed 5) transitions.
Running 2419 sub problems to find dead transitions.
[2024-06-01 15:29:05] [INFO ] Flow matrix only has 2389 transitions (discarded 36 similar events)
// Phase 1: matrix 2389 rows 627 cols
[2024-06-01 15:29:06] [INFO ] Computed 54 invariants in 103 ms
[2024-06-01 15:29:06] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/3016 variables, and 41 constraints, problems are : Problem set: 0 solved, 2419 unsolved in 20103 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 27/35 constraints, State Equation: 0/627 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2419/1165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2419 unsolved
[2024-06-01 15:29:51] [INFO ] Deduced a trap composed of 302 places in 521 ms of which 40 ms to minimize.
[2024-06-01 15:29:52] [INFO ] Deduced a trap composed of 117 places in 321 ms of which 2 ms to minimize.
[2024-06-01 15:29:52] [INFO ] Deduced a trap composed of 152 places in 401 ms of which 3 ms to minimize.
[2024-06-01 15:29:53] [INFO ] Deduced a trap composed of 15 places in 353 ms of which 2 ms to minimize.
[2024-06-01 15:29:54] [INFO ] Deduced a trap composed of 301 places in 437 ms of which 3 ms to minimize.
[2024-06-01 15:30:03] [INFO ] Deduced a trap composed of 295 places in 462 ms of which 3 ms to minimize.
[2024-06-01 15:30:04] [INFO ] Deduced a trap composed of 307 places in 505 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/3016 variables, and 48 constraints, problems are : Problem set: 0 solved, 2419 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 27/35 constraints, State Equation: 0/627 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1165 constraints, Known Traps: 7/7 constraints]
After SMT, in 59886ms problems are : Problem set: 0 solved, 2419 unsolved
Search for dead transitions found 0 dead transitions in 59951ms
[2024-06-01 15:30:05] [INFO ] Flow matrix only has 2389 transitions (discarded 36 similar events)
[2024-06-01 15:30:05] [INFO ] Invariant cache hit.
[2024-06-01 15:30:06] [INFO ] Implicit Places using invariants in 390 ms returned [87, 225, 353, 430, 517, 591]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 416 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 621/632 places, 2425/2430 transitions.
Applied a total of 0 rules in 35 ms. Remains 621 /621 variables (removed 0) and now considering 2425/2425 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60616 ms. Remains : 621/632 places, 2425/2430 transitions.
Support contains 219 out of 621 places after structural reductions.
[2024-06-01 15:30:06] [INFO ] Flatten gal took : 320 ms
[2024-06-01 15:30:07] [INFO ] Flatten gal took : 165 ms
[2024-06-01 15:30:07] [INFO ] Input system was already deterministic with 2425 transitions.
RANDOM walk for 40000 steps (265 resets) in 1546 ms. (25 steps per ms) remains 2/27 properties
BEST_FIRST walk for 40004 steps (29 resets) in 310 ms. (128 steps per ms) remains 1/2 properties
[2024-06-01 15:30:08] [INFO ] Flow matrix only has 2389 transitions (discarded 36 similar events)
// Phase 1: matrix 2389 rows 621 cols
[2024-06-01 15:30:08] [INFO ] Computed 48 invariants in 73 ms
[2024-06-01 15:30:08] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 535/540 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/582 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 619/3010 variables, and 47 constraints, problems are : Problem set: 1 solved, 0 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/621 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 376ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
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(p1)&&p0)))'
Support contains 18 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 615 transition count 2382
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 572 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 571 transition count 2381
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 88 place count 571 transition count 2309
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 232 place count 499 transition count 2309
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 233 place count 498 transition count 2308
Iterating global reduction 3 with 1 rules applied. Total rules applied 234 place count 498 transition count 2308
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 376 place count 427 transition count 2237
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 379 place count 424 transition count 2234
Iterating global reduction 3 with 3 rules applied. Total rules applied 382 place count 424 transition count 2234
Applied a total of 382 rules in 286 ms. Remains 424 /621 variables (removed 197) and now considering 2234/2425 (removed 191) transitions.
Running 2228 sub problems to find dead transitions.
[2024-06-01 15:30:09] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
// Phase 1: matrix 2198 rows 424 cols
[2024-06-01 15:30:09] [INFO ] Computed 42 invariants in 73 ms
[2024-06-01 15:30:09] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-06-01 15:30:46] [INFO ] Deduced a trap composed of 118 places in 286 ms of which 3 ms to minimize.
[2024-06-01 15:30:47] [INFO ] Deduced a trap composed of 149 places in 369 ms of which 2 ms to minimize.
[2024-06-01 15:30:47] [INFO ] Deduced a trap composed of 15 places in 407 ms of which 1 ms to minimize.
[2024-06-01 15:30:49] [INFO ] Deduced a trap composed of 59 places in 261 ms of which 1 ms to minimize.
[2024-06-01 15:30:53] [INFO ] Deduced a trap composed of 29 places in 242 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/2622 variables, and 40 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2228/974 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-06-01 15:31:03] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:31:03] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:31:04] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:31:05] [INFO ] Deduced a trap composed of 153 places in 325 ms of which 2 ms to minimize.
[2024-06-01 15:31:05] [INFO ] Deduced a trap composed of 151 places in 297 ms of which 2 ms to minimize.
[2024-06-01 15:31:05] [INFO ] Deduced a trap composed of 148 places in 278 ms of which 2 ms to minimize.
[2024-06-01 15:31:06] [INFO ] Deduced a trap composed of 151 places in 269 ms of which 2 ms to minimize.
[2024-06-01 15:31:06] [INFO ] Deduced a trap composed of 147 places in 285 ms of which 2 ms to minimize.
[2024-06-01 15:31:09] [INFO ] Deduced a trap composed of 133 places in 287 ms of which 2 ms to minimize.
[2024-06-01 15:31:14] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
SMT process timed out in 64907ms, After SMT, problems are : Problem set: 0 solved, 2228 unsolved
Search for dead transitions found 0 dead transitions in 64941ms
[2024-06-01 15:31:14] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-06-01 15:31:14] [INFO ] Invariant cache hit.
[2024-06-01 15:31:14] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-06-01 15:31:14] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-06-01 15:31:14] [INFO ] Invariant cache hit.
[2024-06-01 15:31:16] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:31:31] [INFO ] Implicit Places using invariants and state equation in 17051 ms returned []
Implicit Place search using SMT with State Equation took 17542 ms to find 0 implicit places.
[2024-06-01 15:31:31] [INFO ] Redundant transitions in 180 ms returned []
Running 2228 sub problems to find dead transitions.
[2024-06-01 15:31:31] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-06-01 15:31:31] [INFO ] Invariant cache hit.
[2024-06-01 15:31:31] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-06-01 15:32:06] [INFO ] Deduced a trap composed of 112 places in 278 ms of which 2 ms to minimize.
[2024-06-01 15:32:06] [INFO ] Deduced a trap composed of 144 places in 286 ms of which 2 ms to minimize.
[2024-06-01 15:32:06] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 1 ms to minimize.
[2024-06-01 15:32:08] [INFO ] Deduced a trap composed of 59 places in 211 ms of which 1 ms to minimize.
[2024-06-01 15:32:22] [INFO ] Deduced a trap composed of 144 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:32:22] [INFO ] Deduced a trap composed of 32 places in 296 ms of which 2 ms to minimize.
[2024-06-01 15:32:22] [INFO ] Deduced a trap composed of 64 places in 281 ms of which 2 ms to minimize.
[2024-06-01 15:32:23] [INFO ] Deduced a trap composed of 61 places in 287 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/2622 variables, and 43 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2228/974 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-06-01 15:32:29] [INFO ] Deduced a trap composed of 133 places in 242 ms of which 2 ms to minimize.
[2024-06-01 15:32:34] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 10 ms to minimize.
[2024-06-01 15:32:34] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:32:34] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:32:34] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 4 ms to minimize.
[2024-06-01 15:32:36] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:32:50] [INFO ] Deduced a trap composed of 138 places in 238 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/2622 variables, and 50 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/974 constraints, Known Traps: 15/15 constraints]
After SMT, in 81843ms problems are : Problem set: 0 solved, 2228 unsolved
Search for dead transitions found 0 dead transitions in 81873ms
Starting structural reductions in SI_LTL mode, iteration 1 : 424/621 places, 2234/2425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164853 ms. Remains : 424/621 places, 2234/2425 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-00
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 5 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-00 finished in 165211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 50 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 615 transition count 2387
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 577 transition count 2387
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 76 place count 577 transition count 2351
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 148 place count 541 transition count 2351
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 540 transition count 2350
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 540 transition count 2350
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 304 place count 463 transition count 2273
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 307 place count 460 transition count 2270
Iterating global reduction 2 with 3 rules applied. Total rules applied 310 place count 460 transition count 2270
Applied a total of 310 rules in 289 ms. Remains 460 /621 variables (removed 161) and now considering 2270/2425 (removed 155) transitions.
Running 2264 sub problems to find dead transitions.
[2024-06-01 15:32:54] [INFO ] Flow matrix only has 2234 transitions (discarded 36 similar events)
// Phase 1: matrix 2234 rows 460 cols
[2024-06-01 15:32:54] [INFO ] Computed 42 invariants in 60 ms
[2024-06-01 15:32:54] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
[2024-06-01 15:33:31] [INFO ] Deduced a trap composed of 188 places in 395 ms of which 3 ms to minimize.
[2024-06-01 15:33:31] [INFO ] Deduced a trap composed of 188 places in 289 ms of which 2 ms to minimize.
[2024-06-01 15:33:31] [INFO ] Deduced a trap composed of 197 places in 269 ms of which 2 ms to minimize.
[2024-06-01 15:33:32] [INFO ] Deduced a trap composed of 142 places in 272 ms of which 2 ms to minimize.
[2024-06-01 15:33:32] [INFO ] Deduced a trap composed of 192 places in 265 ms of which 2 ms to minimize.
[2024-06-01 15:33:32] [INFO ] Deduced a trap composed of 191 places in 292 ms of which 2 ms to minimize.
[2024-06-01 15:33:33] [INFO ] Deduced a trap composed of 185 places in 302 ms of which 2 ms to minimize.
[2024-06-01 15:33:33] [INFO ] Deduced a trap composed of 184 places in 265 ms of which 3 ms to minimize.
[2024-06-01 15:33:33] [INFO ] Deduced a trap composed of 192 places in 301 ms of which 2 ms to minimize.
[2024-06-01 15:33:33] [INFO ] Deduced a trap composed of 171 places in 289 ms of which 2 ms to minimize.
[2024-06-01 15:33:34] [INFO ] Deduced a trap composed of 178 places in 276 ms of which 3 ms to minimize.
[2024-06-01 15:33:34] [INFO ] Deduced a trap composed of 15 places in 320 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/2694 variables, and 47 constraints, problems are : Problem set: 0 solved, 2264 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/460 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2264/1010 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
[2024-06-01 15:33:44] [INFO ] Deduced a trap composed of 61 places in 338 ms of which 3 ms to minimize.
[2024-06-01 15:33:51] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 1 ms to minimize.
[2024-06-01 15:33:51] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:33:52] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:33:52] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/2694 variables, and 52 constraints, problems are : Problem set: 0 solved, 2264 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/460 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1010 constraints, Known Traps: 17/17 constraints]
After SMT, in 64298ms problems are : Problem set: 0 solved, 2264 unsolved
Search for dead transitions found 0 dead transitions in 64333ms
[2024-06-01 15:33:58] [INFO ] Flow matrix only has 2234 transitions (discarded 36 similar events)
[2024-06-01 15:33:58] [INFO ] Invariant cache hit.
[2024-06-01 15:33:59] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-06-01 15:33:59] [INFO ] Flow matrix only has 2234 transitions (discarded 36 similar events)
[2024-06-01 15:33:59] [INFO ] Invariant cache hit.
[2024-06-01 15:34:01] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:34:13] [INFO ] Implicit Places using invariants and state equation in 14619 ms returned []
Implicit Place search using SMT with State Equation took 15040 ms to find 0 implicit places.
[2024-06-01 15:34:13] [INFO ] Redundant transitions in 82 ms returned []
Running 2264 sub problems to find dead transitions.
[2024-06-01 15:34:13] [INFO ] Flow matrix only has 2234 transitions (discarded 36 similar events)
[2024-06-01 15:34:13] [INFO ] Invariant cache hit.
[2024-06-01 15:34:13] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 177 places in 429 ms of which 3 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 191 places in 396 ms of which 3 ms to minimize.
[2024-06-01 15:34:48] [INFO ] Deduced a trap composed of 185 places in 414 ms of which 2 ms to minimize.
[2024-06-01 15:34:48] [INFO ] Deduced a trap composed of 182 places in 492 ms of which 3 ms to minimize.
[2024-06-01 15:34:49] [INFO ] Deduced a trap composed of 174 places in 461 ms of which 2 ms to minimize.
[2024-06-01 15:34:49] [INFO ] Deduced a trap composed of 191 places in 459 ms of which 3 ms to minimize.
[2024-06-01 15:34:50] [INFO ] Deduced a trap composed of 176 places in 409 ms of which 3 ms to minimize.
[2024-06-01 15:34:50] [INFO ] Deduced a trap composed of 187 places in 365 ms of which 2 ms to minimize.
[2024-06-01 15:34:50] [INFO ] Deduced a trap composed of 180 places in 363 ms of which 2 ms to minimize.
[2024-06-01 15:34:51] [INFO ] Deduced a trap composed of 50 places in 268 ms of which 3 ms to minimize.
[2024-06-01 15:34:51] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/2694 variables, and 46 constraints, problems are : Problem set: 0 solved, 2264 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/460 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2264/1010 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
[2024-06-01 15:35:09] [INFO ] Deduced a trap composed of 61 places in 305 ms of which 2 ms to minimize.
[2024-06-01 15:35:14] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:35:14] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 1 ms to minimize.
[2024-06-01 15:35:14] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:35:14] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 0 ms to minimize.
[2024-06-01 15:35:18] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2024-06-01 15:35:19] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/2694 variables, and 53 constraints, problems are : Problem set: 0 solved, 2264 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/460 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1010 constraints, Known Traps: 18/18 constraints]
After SMT, in 79948ms problems are : Problem set: 0 solved, 2264 unsolved
Search for dead transitions found 0 dead transitions in 79971ms
Starting structural reductions in SI_LTL mode, iteration 1 : 460/621 places, 2270/2425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159738 ms. Remains : 460/621 places, 2270/2425 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-01
Stuttering criterion allowed to conclude after 82 steps with 1 reset in 23 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-01 finished in 159878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||X((G(p1) U (!p0&&G(p1))))) U p2))'
Support contains 56 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 615 transition count 2425
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 609 transition count 2419
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 609 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 2418
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 2418
Applied a total of 20 rules in 70 ms. Remains 608 /621 variables (removed 13) and now considering 2418/2425 (removed 7) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:35:33] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-06-01 15:35:34] [INFO ] Computed 42 invariants in 47 ms
[2024-06-01 15:35:34] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:36:12] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 3 ms to minimize.
[2024-06-01 15:36:13] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:36:25] [INFO ] Deduced a trap composed of 84 places in 566 ms of which 4 ms to minimize.
[2024-06-01 15:36:25] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 2 ms to minimize.
[2024-06-01 15:36:25] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:36:28] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:36:28] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:36:29] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:36:31] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 40 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 9/9 constraints]
After SMT, in 61147ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 61172ms
[2024-06-01 15:36:35] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:36:35] [INFO ] Invariant cache hit.
[2024-06-01 15:36:35] [INFO ] Implicit Places using invariants in 629 ms returned []
[2024-06-01 15:36:35] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:36:35] [INFO ] Invariant cache hit.
[2024-06-01 15:36:37] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:36:53] [INFO ] Implicit Places using invariants and state equation in 17520 ms returned []
Implicit Place search using SMT with State Equation took 18164 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:36:53] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:36:53] [INFO ] Invariant cache hit.
[2024-06-01 15:36:53] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:37:33] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-06-01 15:37:36] [INFO ] Deduced a trap composed of 112 places in 115 ms of which 2 ms to minimize.
(s566 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:37:51] [INFO ] Deduced a trap composed of 47 places in 426 ms of which 3 ms to minimize.
[2024-06-01 15:37:51] [INFO ] Deduced a trap composed of 84 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:37:52] [INFO ] Deduced a trap composed of 84 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:37:52] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:37:52] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 0 ms to minimize.
[2024-06-01 15:37:52] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-06-01 15:37:59] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 0 ms to minimize.
[2024-06-01 15:38:08] [INFO ] Deduced a trap composed of 110 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 81335ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 81359ms
Starting structural reductions in LTL mode, iteration 1 : 608/621 places, 2418/2425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160775 ms. Remains : 608/621 places, 2418/2425 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-02
Stuttering criterion allowed to conclude after 148 steps with 1 reset in 2 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-02 finished in 160955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(p1)))'
Support contains 20 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 621 transition count 2387
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 583 transition count 2387
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 76 place count 583 transition count 2315
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 220 place count 511 transition count 2315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 221 place count 510 transition count 2314
Iterating global reduction 2 with 1 rules applied. Total rules applied 222 place count 510 transition count 2314
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 292 place count 475 transition count 2279
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 295 place count 472 transition count 2276
Iterating global reduction 2 with 3 rules applied. Total rules applied 298 place count 472 transition count 2276
Applied a total of 298 rules in 257 ms. Remains 472 /621 variables (removed 149) and now considering 2276/2425 (removed 149) transitions.
Running 2270 sub problems to find dead transitions.
[2024-06-01 15:38:15] [INFO ] Flow matrix only has 2240 transitions (discarded 36 similar events)
// Phase 1: matrix 2240 rows 472 cols
[2024-06-01 15:38:15] [INFO ] Computed 48 invariants in 82 ms
[2024-06-01 15:38:15] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
[2024-06-01 15:38:47] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 3 ms to minimize.
[2024-06-01 15:38:53] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s3 0.0)
(s4 0.0)
(s5 10.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 3.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 9.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 4.0)
(s49 0.0)
(s50 4.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 1.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 3.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 4.0)
(s89 0.0)
(s90 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 3.0)
(s115 2.0)
(s116 2.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 4.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 10.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 4.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 2.0)
(s162 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 3.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s181 0.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 6.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s194 0.0)
(s195 0.0)
(s196 2.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s209 0.0)
(s210 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/2712 variables, and 33 constraints, problems are : Problem set: 0 solved, 2270 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 17/30 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2270/1016 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
[2024-06-01 15:38:59] [INFO ] Deduced a trap composed of 15 places in 358 ms of which 3 ms to minimize.
[2024-06-01 15:39:00] [INFO ] Deduced a trap composed of 60 places in 336 ms of which 2 ms to minimize.
[2024-06-01 15:39:00] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:39:12] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/2712 variables, and 37 constraints, problems are : Problem set: 0 solved, 2270 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 17/30 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1016 constraints, Known Traps: 6/6 constraints]
After SMT, in 60776ms problems are : Problem set: 0 solved, 2270 unsolved
Search for dead transitions found 0 dead transitions in 60814ms
[2024-06-01 15:39:15] [INFO ] Flow matrix only has 2240 transitions (discarded 36 similar events)
[2024-06-01 15:39:15] [INFO ] Invariant cache hit.
[2024-06-01 15:39:16] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-06-01 15:39:16] [INFO ] Flow matrix only has 2240 transitions (discarded 36 similar events)
[2024-06-01 15:39:16] [INFO ] Invariant cache hit.
[2024-06-01 15:39:18] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:39:33] [INFO ] Implicit Places using invariants and state equation in 16782 ms returned []
Implicit Place search using SMT with State Equation took 17470 ms to find 0 implicit places.
[2024-06-01 15:39:33] [INFO ] Redundant transitions in 172 ms returned []
Running 2270 sub problems to find dead transitions.
[2024-06-01 15:39:33] [INFO ] Flow matrix only has 2240 transitions (discarded 36 similar events)
[2024-06-01 15:39:33] [INFO ] Invariant cache hit.
[2024-06-01 15:39:33] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
[2024-06-01 15:40:08] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2024-06-01 15:40:13] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 1 ms to minimize.
[2024-06-01 15:40:19] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/2712 variables, and 34 constraints, problems are : Problem set: 0 solved, 2270 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 17/30 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2270/1016 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1746 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1861 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/464 variables, 4/38 constraints. Problems are: Problem set: 486 solved, 1784 unsolved
[2024-06-01 15:40:48] [INFO ] Deduced a trap composed of 35 places in 488 ms of which 3 ms to minimize.
[2024-06-01 15:40:49] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:40:50] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:40:50] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 1 ms to minimize.
[2024-06-01 15:40:50] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:40:51] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2712 variables, and 44 constraints, problems are : Problem set: 486 solved, 1784 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 17/30 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1016 constraints, Known Traps: 9/9 constraints]
After SMT, in 80177ms problems are : Problem set: 486 solved, 1784 unsolved
Search for dead transitions found 486 dead transitions in 80197ms
Found 486 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 486 transitions
Dead transitions reduction (with SMT) removed 486 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 472/621 places, 1790/2425 transitions.
Applied a total of 0 rules in 31 ms. Remains 472 /472 variables (removed 0) and now considering 1790/1790 (removed 0) transitions.
[2024-06-01 15:40:53] [INFO ] Redundant transitions in 72 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 159045 ms. Remains : 472/621 places, 1790/2425 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-05
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-05 finished in 159216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p1))))'
Support contains 20 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 615 transition count 2425
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 609 transition count 2419
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 609 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 2418
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 2418
Applied a total of 20 rules in 92 ms. Remains 608 /621 variables (removed 13) and now considering 2418/2425 (removed 7) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:40:54] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-06-01 15:40:54] [INFO ] Computed 42 invariants in 78 ms
[2024-06-01 15:40:54] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:41:32] [INFO ] Deduced a trap composed of 112 places in 119 ms of which 3 ms to minimize.
[2024-06-01 15:41:33] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:41:43] [INFO ] Deduced a trap composed of 84 places in 401 ms of which 2 ms to minimize.
[2024-06-01 15:41:43] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:41:43] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:41:46] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 1 ms to minimize.
[2024-06-01 15:41:46] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:41:46] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:41:48] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-06-01 15:41:52] [INFO ] Deduced a trap composed of 110 places in 157 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 60461ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 60501ms
[2024-06-01 15:41:54] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:41:54] [INFO ] Invariant cache hit.
[2024-06-01 15:41:55] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-06-01 15:41:55] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:41:55] [INFO ] Invariant cache hit.
[2024-06-01 15:41:57] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:42:24] [INFO ] Implicit Places using invariants and state equation in 28947 ms returned []
Implicit Place search using SMT with State Equation took 29527 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:42:24] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:42:24] [INFO ] Invariant cache hit.
[2024-06-01 15:42:24] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:43:03] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:43:06] [INFO ] Deduced a trap composed of 112 places in 136 ms of which 2 ms to minimize.
(s189 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 3.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 9.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 4.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 4.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 3.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 4.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 3.0)
(s142 2.0)
(s143 2.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 4.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 10.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 4.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:43:21] [INFO ] Deduced a trap composed of 47 places in 444 ms of which 3 ms to minimize.
[2024-06-01 15:43:21] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 1 ms to minimize.
[2024-06-01 15:43:22] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:43:22] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:43:22] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:43:22] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:43:29] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 0 ms to minimize.
[2024-06-01 15:43:38] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 80411ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 80439ms
Starting structural reductions in LTL mode, iteration 1 : 608/621 places, 2418/2425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170575 ms. Remains : 608/621 places, 2418/2425 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 60 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-06 finished in 170687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Support contains 12 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 615 transition count 2425
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 609 transition count 2419
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 609 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 2418
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 2418
Applied a total of 20 rules in 64 ms. Remains 608 /621 variables (removed 13) and now considering 2418/2425 (removed 7) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:43:44] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:43:44] [INFO ] Invariant cache hit.
[2024-06-01 15:43:44] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:44:21] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2024-06-01 15:44:24] [INFO ] Deduced a trap composed of 112 places in 109 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:44:31] [INFO ] Deduced a trap composed of 47 places in 431 ms of which 2 ms to minimize.
[2024-06-01 15:44:31] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:44:31] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:44:32] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:44:32] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:44:32] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:44:39] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 9)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 3)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 9)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 4)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 4)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(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 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 10)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 4)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 2)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 5)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 0)
(s258 0)
(s259 1)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 4)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 0)
(s296 1)
(s297 0)
(s298 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 1)
(s325 1)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 1)
(s335 1)
(s336 1)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 1)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 1)
(s351 0)
(s352 4)
(s353 0)
(s354 0)
(s355 1)
(s356 0)
(s357 0)
(s358 1)
(s359 0)
(s360 0)
(s361 0)
(s362 2)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 1)
(s368 0)
(s369 1)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 1)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 1)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 1)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 3)
(s503 0)
(s504 0)
(s505 0)
(s506 timeout
0)
(s507 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 40 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 9/9 constraints]
After SMT, in 59868ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 59890ms
[2024-06-01 15:44:44] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:44:44] [INFO ] Invariant cache hit.
[2024-06-01 15:44:45] [INFO ] Implicit Places using invariants in 563 ms returned []
[2024-06-01 15:44:45] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:44:45] [INFO ] Invariant cache hit.
[2024-06-01 15:44:47] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:45:11] [INFO ] Implicit Places using invariants and state equation in 26007 ms returned []
Implicit Place search using SMT with State Equation took 26585 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:45:11] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:45:11] [INFO ] Invariant cache hit.
[2024-06-01 15:45:11] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:45:47] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:45:49] [INFO ] Deduced a trap composed of 112 places in 176 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:46:07] [INFO ] Deduced a trap composed of 47 places in 646 ms of which 4 ms to minimize.
[2024-06-01 15:46:07] [INFO ] Deduced a trap composed of 84 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:46:08] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:46:08] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:46:08] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:46:08] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 3 ms to minimize.
[2024-06-01 15:46:15] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 0 ms to minimize.
[2024-06-01 15:46:24] [INFO ] Deduced a trap composed of 110 places in 142 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 79331ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 79352ms
Starting structural reductions in LTL mode, iteration 1 : 608/621 places, 2418/2425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165903 ms. Remains : 608/621 places, 2418/2425 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-07
Product exploration explored 100000 steps with 1571 reset in 700 ms.
Product exploration explored 100000 steps with 1586 reset in 833 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 126 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 498 steps (1 resets) in 14 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 90 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 54 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1), (NOT p1)]
Support contains 6 out of 608 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 608 transition count 2388
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 578 transition count 2382
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 572 transition count 2382
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 72 place count 572 transition count 2316
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 204 place count 506 transition count 2316
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 336 place count 440 transition count 2250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 340 place count 436 transition count 2246
Iterating global reduction 3 with 4 rules applied. Total rules applied 344 place count 436 transition count 2246
Applied a total of 344 rules in 142 ms. Remains 436 /608 variables (removed 172) and now considering 2246/2418 (removed 172) transitions.
Running 2240 sub problems to find dead transitions.
[2024-06-01 15:46:32] [INFO ] Flow matrix only has 2210 transitions (discarded 36 similar events)
// Phase 1: matrix 2210 rows 436 cols
[2024-06-01 15:46:33] [INFO ] Computed 42 invariants in 91 ms
[2024-06-01 15:46:33] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
[2024-06-01 15:47:04] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:47:10] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2646 variables, and 33 constraints, problems are : Problem set: 0 solved, 2240 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/436 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2240/986 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
[2024-06-01 15:47:16] [INFO ] Deduced a trap composed of 30 places in 511 ms of which 2 ms to minimize.
[2024-06-01 15:47:16] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:47:16] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 1 ms to minimize.
[2024-06-01 15:47:16] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 1 ms to minimize.
[2024-06-01 15:47:16] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:47:22] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:47:25] [INFO ] Deduced a trap composed of 56 places in 450 ms of which 3 ms to minimize.
[2024-06-01 15:47:26] [INFO ] Deduced a trap composed of 69 places in 439 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2646 variables, and 41 constraints, problems are : Problem set: 0 solved, 2240 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/436 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/986 constraints, Known Traps: 10/10 constraints]
After SMT, in 59914ms problems are : Problem set: 0 solved, 2240 unsolved
Search for dead transitions found 0 dead transitions in 59935ms
[2024-06-01 15:47:32] [INFO ] Flow matrix only has 2210 transitions (discarded 36 similar events)
[2024-06-01 15:47:32] [INFO ] Invariant cache hit.
[2024-06-01 15:47:33] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-06-01 15:47:33] [INFO ] Flow matrix only has 2210 transitions (discarded 36 similar events)
[2024-06-01 15:47:33] [INFO ] Invariant cache hit.
[2024-06-01 15:47:35] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:47:53] [INFO ] Implicit Places using invariants and state equation in 19825 ms returned []
Implicit Place search using SMT with State Equation took 20513 ms to find 0 implicit places.
[2024-06-01 15:47:53] [INFO ] Redundant transitions in 148 ms returned []
Running 2240 sub problems to find dead transitions.
[2024-06-01 15:47:53] [INFO ] Flow matrix only has 2210 transitions (discarded 36 similar events)
[2024-06-01 15:47:53] [INFO ] Invariant cache hit.
[2024-06-01 15:47:53] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
[2024-06-01 15:48:24] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-06-01 15:48:25] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:48:32] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2646 variables, and 34 constraints, problems are : Problem set: 0 solved, 2240 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/436 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2240/986 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
[2024-06-01 15:48:47] [INFO ] Deduced a trap composed of 93 places in 516 ms of which 2 ms to minimize.
[2024-06-01 15:48:48] [INFO ] Deduced a trap composed of 55 places in 138 ms of which 1 ms to minimize.
[2024-06-01 15:48:48] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 1 ms to minimize.
[2024-06-01 15:48:48] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:48:51] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
[2024-06-01 15:49:08] [INFO ] Deduced a trap composed of 55 places in 614 ms of which 4 ms to minimize.
[2024-06-01 15:49:09] [INFO ] Deduced a trap composed of 90 places in 443 ms of which 2 ms to minimize.
[2024-06-01 15:49:09] [INFO ] Deduced a trap composed of 55 places in 560 ms of which 3 ms to minimize.
[2024-06-01 15:49:10] [INFO ] Deduced a trap composed of 61 places in 616 ms of which 3 ms to minimize.
[2024-06-01 15:49:11] [INFO ] Deduced a trap composed of 29 places in 557 ms of which 3 ms to minimize.
[2024-06-01 15:49:11] [INFO ] Deduced a trap composed of 87 places in 466 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2646 variables, and 45 constraints, problems are : Problem set: 0 solved, 2240 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/436 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/986 constraints, Known Traps: 14/14 constraints]
After SMT, in 80176ms problems are : Problem set: 0 solved, 2240 unsolved
Search for dead transitions found 0 dead transitions in 80213ms
Starting structural reductions in SI_LTL mode, iteration 1 : 436/608 places, 2246/2418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160972 ms. Remains : 436/608 places, 2246/2418 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 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 46 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 327 steps (1 resets) in 7 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 79 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 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2112 reset in 972 ms.
Product exploration explored 100000 steps with 2099 reset in 758 ms.
Support contains 6 out of 436 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 436/436 places, 2246/2246 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 436 transition count 2240
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 430 transition count 2240
Applied a total of 12 rules in 125 ms. Remains 430 /436 variables (removed 6) and now considering 2240/2246 (removed 6) transitions.
Running 2234 sub problems to find dead transitions.
[2024-06-01 15:49:16] [INFO ] Flow matrix only has 2204 transitions (discarded 36 similar events)
// Phase 1: matrix 2204 rows 430 cols
[2024-06-01 15:49:16] [INFO ] Computed 42 invariants in 56 ms
[2024-06-01 15:49:16] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
[2024-06-01 15:49:54] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:49:57] [INFO ] Deduced a trap composed of 118 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:50:00] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/2634 variables, and 34 constraints, problems are : Problem set: 0 solved, 2234 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/430 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2234/980 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
[2024-06-01 15:50:05] [INFO ] Deduced a trap composed of 35 places in 472 ms of which 2 ms to minimize.
[2024-06-01 15:50:06] [INFO ] Deduced a trap composed of 54 places in 421 ms of which 1 ms to minimize.
[2024-06-01 15:50:06] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:50:06] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/2634 variables, and 38 constraints, problems are : Problem set: 0 solved, 2234 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/430 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/980 constraints, Known Traps: 7/7 constraints]
After SMT, in 66226ms problems are : Problem set: 0 solved, 2234 unsolved
Search for dead transitions found 0 dead transitions in 66267ms
[2024-06-01 15:50:22] [INFO ] Flow matrix only has 2204 transitions (discarded 36 similar events)
[2024-06-01 15:50:22] [INFO ] Invariant cache hit.
[2024-06-01 15:50:22] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-06-01 15:50:22] [INFO ] Flow matrix only has 2204 transitions (discarded 36 similar events)
[2024-06-01 15:50:22] [INFO ] Invariant cache hit.
[2024-06-01 15:50:24] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:50:36] [INFO ] Implicit Places using invariants and state equation in 13894 ms returned []
Implicit Place search using SMT with State Equation took 14533 ms to find 0 implicit places.
[2024-06-01 15:50:37] [INFO ] Redundant transitions in 143 ms returned []
Running 2234 sub problems to find dead transitions.
[2024-06-01 15:50:37] [INFO ] Flow matrix only has 2204 transitions (discarded 36 similar events)
[2024-06-01 15:50:37] [INFO ] Invariant cache hit.
[2024-06-01 15:50:37] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
[2024-06-01 15:51:11] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-06-01 15:51:16] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/2634 variables, and 33 constraints, problems are : Problem set: 0 solved, 2234 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/430 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2234/980 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
[2024-06-01 15:51:33] [INFO ] Deduced a trap composed of 55 places in 470 ms of which 3 ms to minimize.
[2024-06-01 15:51:33] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 1 ms to minimize.
[2024-06-01 15:51:33] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:51:33] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:51:38] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
[2024-06-01 15:51:52] [INFO ] Deduced a trap composed of 29 places in 496 ms of which 2 ms to minimize.
[2024-06-01 15:51:52] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:51:54] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/2634 variables, and 41 constraints, problems are : Problem set: 0 solved, 2234 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/430 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/980 constraints, Known Traps: 10/10 constraints]
After SMT, in 82189ms problems are : Problem set: 0 solved, 2234 unsolved
Search for dead transitions found 0 dead transitions in 82216ms
Starting structural reductions in SI_LTL mode, iteration 1 : 430/436 places, 2240/2246 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163308 ms. Remains : 430/436 places, 2240/2246 transitions.
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-07 finished in 494821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(!p0)&&G(p1))||G(!p0))))'
Support contains 4 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 615 transition count 2425
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 609 transition count 2419
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 609 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 2418
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 2418
Applied a total of 20 rules in 100 ms. Remains 608 /621 variables (removed 13) and now considering 2418/2425 (removed 7) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:51:59] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-06-01 15:51:59] [INFO ] Computed 42 invariants in 103 ms
[2024-06-01 15:51:59] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:52:40] [INFO ] Deduced a trap composed of 112 places in 155 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 32 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:52:45] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 2/2 constraints]
After SMT, in 61931ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 61958ms
[2024-06-01 15:53:01] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:53:01] [INFO ] Invariant cache hit.
[2024-06-01 15:53:02] [INFO ] Implicit Places using invariants in 679 ms returned []
[2024-06-01 15:53:02] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:53:02] [INFO ] Invariant cache hit.
[2024-06-01 15:53:04] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:53:25] [INFO ] Implicit Places using invariants and state equation in 23242 ms returned []
Implicit Place search using SMT with State Equation took 23923 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:53:25] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:53:25] [INFO ] Invariant cache hit.
[2024-06-01 15:53:25] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:54:06] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:54:10] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:54:24] [INFO ] Deduced a trap composed of 47 places in 520 ms of which 4 ms to minimize.
[2024-06-01 15:54:24] [INFO ] Deduced a trap composed of 84 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:54:24] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:54:24] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:54:25] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 1 ms to minimize.
[2024-06-01 15:54:25] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:54:32] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-06-01 15:54:42] [INFO ] Deduced a trap composed of 110 places in 182 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 81632ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 81661ms
Starting structural reductions in LTL mode, iteration 1 : 608/621 places, 2418/2425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167655 ms. Remains : 608/621 places, 2418/2425 transitions.
Stuttering acceptance computed with spot in 142 ms :[p0, p0, (AND (NOT p1) p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-10
Product exploration explored 100000 steps with 684 reset in 659 ms.
Product exploration explored 100000 steps with 671 reset in 633 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 172 ms. Reduced automaton from 3 states, 13 edges and 2 AP (stutter sensitive) to 3 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[p0, p0, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (282 resets) in 548 ms. (72 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (117 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
[2024-06-01 15:54:49] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:54:49] [INFO ] Invariant cache hit.
[2024-06-01 15:54:49] [INFO ] State equation strengthened by 168 read => feed constraints.
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) 38/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/73 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:54:49] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 122/195 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 593/2990 variables, and 32 constraints, problems are : Problem set: 1 solved, 0 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 287ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 448 ms. Reduced automaton from 3 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[p0]
Stuttering acceptance computed with spot in 50 ms :[p0]
Support contains 2 out of 608 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 608 transition count 2388
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 578 transition count 2382
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 572 transition count 2382
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 72 place count 572 transition count 2305
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 226 place count 495 transition count 2305
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 334 place count 441 transition count 2251
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 338 place count 437 transition count 2247
Iterating global reduction 3 with 4 rules applied. Total rules applied 342 place count 437 transition count 2247
Applied a total of 342 rules in 363 ms. Remains 437 /608 variables (removed 171) and now considering 2247/2418 (removed 171) transitions.
Running 2241 sub problems to find dead transitions.
[2024-06-01 15:54:50] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
// Phase 1: matrix 2211 rows 437 cols
[2024-06-01 15:54:50] [INFO ] Computed 42 invariants in 77 ms
[2024-06-01 15:54:50] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-06-01 15:55:24] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:55:25] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/2648 variables, and 33 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2241/987 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/2648 variables, and 33 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/987 constraints, Known Traps: 2/2 constraints]
After SMT, in 62300ms problems are : Problem set: 0 solved, 2241 unsolved
Search for dead transitions found 0 dead transitions in 62332ms
[2024-06-01 15:55:52] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-06-01 15:55:52] [INFO ] Invariant cache hit.
[2024-06-01 15:55:53] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-06-01 15:55:53] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-06-01 15:55:53] [INFO ] Invariant cache hit.
[2024-06-01 15:55:54] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:56:09] [INFO ] Implicit Places using invariants and state equation in 15844 ms returned []
Implicit Place search using SMT with State Equation took 16310 ms to find 0 implicit places.
[2024-06-01 15:56:09] [INFO ] Redundant transitions in 104 ms returned []
Running 2241 sub problems to find dead transitions.
[2024-06-01 15:56:09] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-06-01 15:56:09] [INFO ] Invariant cache hit.
[2024-06-01 15:56:09] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-06-01 15:56:48] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-06-01 15:56:53] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-06-01 15:56:55] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 3.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 9.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 4.0)
(s46 0.0)
(s47 4.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 3.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 4.0)
(s81 0.0)
(s82 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 3.0)
(s107 2.0)
(s108 2.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 4.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 10.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 4.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 2.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 3.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 6.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s176 0.0)
(s177 2.0)
(s178 0.0)
(s179 1.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 4.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 2.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 1.0)
(s240 2.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 4.0)
(s249 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/2648 variables, and 34 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2241/987 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-06-01 15:57:20] [INFO ] Deduced a trap composed of 55 places in 525 ms of which 3 ms to minimize.
[2024-06-01 15:57:20] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:57:20] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:57:20] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/431 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/2648 variables, and 38 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/987 constraints, Known Traps: 7/7 constraints]
After SMT, in 85468ms problems are : Problem set: 0 solved, 2241 unsolved
Search for dead transitions found 0 dead transitions in 85498ms
Starting structural reductions in SI_LTL mode, iteration 1 : 437/608 places, 2247/2418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164637 ms. Remains : 437/608 places, 2247/2418 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 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[p0]
RANDOM walk for 6565 steps (55 resets) in 76 ms. (85 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 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[p0]
Stuttering acceptance computed with spot in 30 ms :[p0]
Stuttering acceptance computed with spot in 22 ms :[p0]
Product exploration explored 100000 steps with 1049 reset in 826 ms.
Product exploration explored 100000 steps with 1022 reset in 751 ms.
Support contains 2 out of 437 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 437/437 places, 2247/2247 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 419 transition count 2229
Applied a total of 36 rules in 55 ms. Remains 419 /437 variables (removed 18) and now considering 2229/2247 (removed 18) transitions.
Running 2223 sub problems to find dead transitions.
[2024-06-01 15:57:36] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
// Phase 1: matrix 2193 rows 419 cols
[2024-06-01 15:57:36] [INFO ] Computed 42 invariants in 78 ms
[2024-06-01 15:57:36] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-06-01 15:58:10] [INFO ] Deduced a trap composed of 107 places in 324 ms of which 2 ms to minimize.
[2024-06-01 15:58:10] [INFO ] Deduced a trap composed of 144 places in 287 ms of which 2 ms to minimize.
[2024-06-01 15:58:11] [INFO ] Deduced a trap composed of 15 places in 293 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.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 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 7.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.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 1.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 2.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 9.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 2.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 2.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s169 0.0)
(s170 2.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 2.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 2.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 2.0)
(s392 1.0)
(s393 1.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 0.0)
(s407 0.0)
timeout
(s408 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/2612 variables, and 38 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2223/969 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-06-01 15:58:31] [INFO ] Deduced a trap composed of 136 places in 325 ms of which 4 ms to minimize.
[2024-06-01 15:58:31] [INFO ] Deduced a trap composed of 139 places in 296 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/2612 variables, and 40 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/969 constraints, Known Traps: 5/5 constraints]
After SMT, in 62194ms problems are : Problem set: 0 solved, 2223 unsolved
Search for dead transitions found 0 dead transitions in 62220ms
[2024-06-01 15:58:38] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-06-01 15:58:38] [INFO ] Invariant cache hit.
[2024-06-01 15:58:39] [INFO ] Implicit Places using invariants in 757 ms returned []
[2024-06-01 15:58:39] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-06-01 15:58:39] [INFO ] Invariant cache hit.
[2024-06-01 15:58:40] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:59:03] [INFO ] Implicit Places using invariants and state equation in 24052 ms returned []
Implicit Place search using SMT with State Equation took 24813 ms to find 0 implicit places.
[2024-06-01 15:59:03] [INFO ] Redundant transitions in 68 ms returned []
Running 2223 sub problems to find dead transitions.
[2024-06-01 15:59:03] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-06-01 15:59:03] [INFO ] Invariant cache hit.
[2024-06-01 15:59:03] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-06-01 15:59:39] [INFO ] Deduced a trap composed of 153 places in 354 ms of which 3 ms to minimize.
[2024-06-01 15:59:40] [INFO ] Deduced a trap composed of 139 places in 390 ms of which 2 ms to minimize.
[2024-06-01 15:59:40] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/2612 variables, and 38 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2223/969 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-06-01 16:00:00] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:00:00] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:00:00] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 0 ms to minimize.
[2024-06-01 16:00:00] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:00:03] [INFO ] Deduced a trap composed of 133 places in 313 ms of which 2 ms to minimize.
[2024-06-01 16:00:24] [INFO ] Deduced a trap composed of 115 places in 304 ms of which 2 ms to minimize.
[2024-06-01 16:00:25] [INFO ] Deduced a trap composed of 118 places in 390 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/2612 variables, and 45 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/969 constraints, Known Traps: 10/10 constraints]
After SMT, in 82212ms problems are : Problem set: 0 solved, 2223 unsolved
Search for dead transitions found 0 dead transitions in 82238ms
Starting structural reductions in SI_LTL mode, iteration 1 : 419/437 places, 2229/2247 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169422 ms. Remains : 419/437 places, 2229/2247 transitions.
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-10 finished in 506670 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||G((p1 U p2)))))'
Support contains 5 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 615 transition count 2387
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 577 transition count 2385
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 575 transition count 2385
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 80 place count 575 transition count 2313
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 224 place count 503 transition count 2313
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 378 place count 426 transition count 2236
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 381 place count 423 transition count 2233
Iterating global reduction 3 with 3 rules applied. Total rules applied 384 place count 423 transition count 2233
Applied a total of 384 rules in 150 ms. Remains 423 /621 variables (removed 198) and now considering 2233/2425 (removed 192) transitions.
Running 2227 sub problems to find dead transitions.
[2024-06-01 16:00:26] [INFO ] Flow matrix only has 2197 transitions (discarded 36 similar events)
// Phase 1: matrix 2197 rows 423 cols
[2024-06-01 16:00:26] [INFO ] Computed 42 invariants in 66 ms
[2024-06-01 16:00:26] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/417 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
[2024-06-01 16:01:03] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:01:07] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/2620 variables, and 33 constraints, problems are : Problem set: 0 solved, 2227 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 15/22 constraints, State Equation: 0/423 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2227/973 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/417 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 2 ms to minimize.
[2024-06-01 16:01:19] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/2620 variables, and 35 constraints, problems are : Problem set: 0 solved, 2227 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 15/22 constraints, State Equation: 0/423 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/973 constraints, Known Traps: 4/4 constraints]
After SMT, in 63941ms problems are : Problem set: 0 solved, 2227 unsolved
Search for dead transitions found 0 dead transitions in 63963ms
[2024-06-01 16:01:30] [INFO ] Flow matrix only has 2197 transitions (discarded 36 similar events)
[2024-06-01 16:01:30] [INFO ] Invariant cache hit.
[2024-06-01 16:01:30] [INFO ] Implicit Places using invariants in 563 ms returned []
[2024-06-01 16:01:30] [INFO ] Flow matrix only has 2197 transitions (discarded 36 similar events)
[2024-06-01 16:01:30] [INFO ] Invariant cache hit.
[2024-06-01 16:01:32] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:01:52] [INFO ] Implicit Places using invariants and state equation in 21543 ms returned []
Implicit Place search using SMT with State Equation took 22112 ms to find 0 implicit places.
[2024-06-01 16:01:52] [INFO ] Redundant transitions in 71 ms returned []
Running 2227 sub problems to find dead transitions.
[2024-06-01 16:01:52] [INFO ] Flow matrix only has 2197 transitions (discarded 36 similar events)
[2024-06-01 16:01:52] [INFO ] Invariant cache hit.
[2024-06-01 16:01:52] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/417 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
[2024-06-01 16:02:25] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:02:30] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 3 ms to minimize.
[2024-06-01 16:02:33] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/2620 variables, and 34 constraints, problems are : Problem set: 0 solved, 2227 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 15/22 constraints, State Equation: 0/423 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2227/973 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/417 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
[2024-06-01 16:02:46] [INFO ] Deduced a trap composed of 29 places in 535 ms of which 3 ms to minimize.
[2024-06-01 16:02:46] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:02:46] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 1 ms to minimize.
[2024-06-01 16:02:46] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 0 ms to minimize.
[2024-06-01 16:02:48] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 1 ms to minimize.
[2024-06-01 16:02:48] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 0 ms to minimize.
[2024-06-01 16:02:48] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
[2024-06-01 16:03:06] [INFO ] Deduced a trap composed of 29 places in 539 ms of which 2 ms to minimize.
[2024-06-01 16:03:09] [INFO ] Deduced a trap composed of 15 places in 282 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/2620 variables, and 43 constraints, problems are : Problem set: 0 solved, 2227 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 15/22 constraints, State Equation: 0/423 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/973 constraints, Known Traps: 12/12 constraints]
After SMT, in 81444ms problems are : Problem set: 0 solved, 2227 unsolved
Search for dead transitions found 0 dead transitions in 81466ms
Starting structural reductions in SI_LTL mode, iteration 1 : 423/621 places, 2233/2425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167785 ms. Remains : 423/621 places, 2233/2425 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-11
Stuttering criterion allowed to conclude after 481 steps with 1 reset in 5 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-11 finished in 167922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 615 transition count 2381
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 571 transition count 2381
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 88 place count 571 transition count 2309
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 232 place count 499 transition count 2309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 233 place count 498 transition count 2308
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 498 transition count 2308
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 386 place count 422 transition count 2232
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 389 place count 419 transition count 2229
Iterating global reduction 2 with 3 rules applied. Total rules applied 392 place count 419 transition count 2229
Applied a total of 392 rules in 204 ms. Remains 419 /621 variables (removed 202) and now considering 2229/2425 (removed 196) transitions.
Running 2223 sub problems to find dead transitions.
[2024-06-01 16:03:14] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
// Phase 1: matrix 2193 rows 419 cols
[2024-06-01 16:03:14] [INFO ] Computed 42 invariants in 82 ms
[2024-06-01 16:03:14] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-06-01 16:03:49] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:03:54] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:03:57] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/2612 variables, and 34 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 16/26 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2223/969 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-06-01 16:04:01] [INFO ] Deduced a trap composed of 30 places in 562 ms of which 3 ms to minimize.
[2024-06-01 16:04:01] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 2 ms to minimize.
[2024-06-01 16:04:01] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:04:01] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:04:01] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-06-01 16:04:02] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:04:03] [INFO ] Deduced a trap composed of 36 places in 461 ms of which 4 ms to minimize.
[2024-06-01 16:04:10] [INFO ] Deduced a trap composed of 58 places in 409 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/2612 variables, and 42 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 16/26 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/969 constraints, Known Traps: 11/11 constraints]
After SMT, in 63029ms problems are : Problem set: 0 solved, 2223 unsolved
Search for dead transitions found 0 dead transitions in 63053ms
[2024-06-01 16:04:17] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-06-01 16:04:17] [INFO ] Invariant cache hit.
[2024-06-01 16:04:18] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-06-01 16:04:18] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-06-01 16:04:18] [INFO ] Invariant cache hit.
[2024-06-01 16:04:19] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:04:33] [INFO ] Implicit Places using invariants and state equation in 15796 ms returned []
Implicit Place search using SMT with State Equation took 16487 ms to find 0 implicit places.
[2024-06-01 16:04:33] [INFO ] Redundant transitions in 80 ms returned []
Running 2223 sub problems to find dead transitions.
[2024-06-01 16:04:34] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-06-01 16:04:34] [INFO ] Invariant cache hit.
[2024-06-01 16:04:34] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-06-01 16:05:10] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-06-01 16:05:11] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 1 ms to minimize.
[2024-06-01 16:05:14] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/2612 variables, and 35 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 16/26 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2223/969 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-06-01 16:05:31] [INFO ] Deduced a trap composed of 50 places in 582 ms of which 3 ms to minimize.
[2024-06-01 16:05:31] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 5 ms to minimize.
[2024-06-01 16:05:31] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 2 ms to minimize.
[2024-06-01 16:05:32] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2024-06-01 16:05:32] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 1 ms to minimize.
[2024-06-01 16:05:36] [INFO ] Deduced a trap composed of 44 places in 483 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 2223 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 413/2612 variables, and 41 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 16/26 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/969 constraints, Known Traps: 10/10 constraints]
After SMT, in 83596ms problems are : Problem set: 0 solved, 2223 unsolved
Search for dead transitions found 0 dead transitions in 83638ms
Starting structural reductions in SI_LTL mode, iteration 1 : 419/621 places, 2229/2425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163486 ms. Remains : 419/621 places, 2229/2425 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-12
Stuttering criterion allowed to conclude after 194 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-12 finished in 163582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U !p1)&&X(p0))))'
Support contains 4 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 615 transition count 2425
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 609 transition count 2419
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 609 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 2418
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 2418
Applied a total of 20 rules in 85 ms. Remains 608 /621 variables (removed 13) and now considering 2418/2425 (removed 7) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 16:05:57] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-06-01 16:05:57] [INFO ] Computed 42 invariants in 92 ms
[2024-06-01 16:05:57] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 16:06:40] [INFO ] Deduced a trap composed of 112 places in 112 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 32 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 16:06:43] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 2/2 constraints]
After SMT, in 63189ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 63223ms
[2024-06-01 16:07:01] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 16:07:01] [INFO ] Invariant cache hit.
[2024-06-01 16:07:01] [INFO ] Implicit Places using invariants in 659 ms returned []
[2024-06-01 16:07:01] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 16:07:01] [INFO ] Invariant cache hit.
[2024-06-01 16:07:03] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:07:29] [INFO ] Implicit Places using invariants and state equation in 28154 ms returned []
Implicit Place search using SMT with State Equation took 28821 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-06-01 16:07:29] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 16:07:29] [INFO ] Invariant cache hit.
[2024-06-01 16:07:29] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 16:08:14] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-06-01 16:08:17] [INFO ] Deduced a trap composed of 112 places in 200 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 16:08:33] [INFO ] Deduced a trap composed of 47 places in 420 ms of which 2 ms to minimize.
[2024-06-01 16:08:33] [INFO ] Deduced a trap composed of 84 places in 178 ms of which 2 ms to minimize.
[2024-06-01 16:08:33] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:08:33] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 1 ms to minimize.
[2024-06-01 16:08:33] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 0 ms to minimize.
[2024-06-01 16:08:34] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-01 16:08:41] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 1 ms to minimize.
[2024-06-01 16:08:51] [INFO ] Deduced a trap composed of 110 places in 133 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 86093ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 86122ms
Starting structural reductions in LTL mode, iteration 1 : 608/621 places, 2418/2425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178264 ms. Remains : 608/621 places, 2418/2425 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-14 finished in 178424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((F(p1)&&p0))))))'
Support contains 4 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 615 transition count 2425
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 609 transition count 2419
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 609 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 2418
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 2418
Applied a total of 20 rules in 61 ms. Remains 608 /621 variables (removed 13) and now considering 2418/2425 (removed 7) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 16:08:56] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 16:08:56] [INFO ] Invariant cache hit.
[2024-06-01 16:08:56] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 31 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 16:09:42] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:09:42] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2024-06-01 16:09:43] [INFO ] Deduced a trap composed of 35 places in 605 ms of which 4 ms to minimize.
[2024-06-01 16:09:43] [INFO ] Deduced a trap composed of 84 places in 171 ms of which 2 ms to minimize.
[2024-06-01 16:09:43] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:09:43] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:09:47] [INFO ] Deduced a trap composed of 112 places in 161 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 38 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 7/7 constraints]
After SMT, in 64447ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 64471ms
[2024-06-01 16:10:00] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 16:10:00] [INFO ] Invariant cache hit.
[2024-06-01 16:10:01] [INFO ] Implicit Places using invariants in 826 ms returned []
[2024-06-01 16:10:01] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 16:10:01] [INFO ] Invariant cache hit.
[2024-06-01 16:10:03] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:10:31] [INFO ] Implicit Places using invariants and state equation in 29776 ms returned []
Implicit Place search using SMT with State Equation took 30606 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-06-01 16:10:31] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 16:10:31] [INFO ] Invariant cache hit.
[2024-06-01 16:10:31] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 16:11:14] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 2 ms to minimize.
[2024-06-01 16:11:18] [INFO ] Deduced a trap composed of 112 places in 160 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 16:11:33] [INFO ] Deduced a trap composed of 47 places in 723 ms of which 3 ms to minimize.
[2024-06-01 16:11:33] [INFO ] Deduced a trap composed of 84 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:11:33] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 2 ms to minimize.
[2024-06-01 16:11:33] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:11:33] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 1 ms to minimize.
[2024-06-01 16:11:34] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 2 ms to minimize.
[2024-06-01 16:11:42] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2024-06-01 16:11:52] [INFO ] Deduced a trap composed of 110 places in 185 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 83766ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 83796ms
Starting structural reductions in LTL mode, iteration 1 : 608/621 places, 2418/2425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178945 ms. Remains : 608/621 places, 2418/2425 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-15
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-15 finished in 179191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||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' '!(F(((X(!p0)&&G(p1))||G(!p0))))'
Found a Shortening insensitive property : PolyORBLF-PT-S06J04T06-LTLFireability-10
Stuttering acceptance computed with spot in 157 ms :[p0, p0, (AND (NOT p1) p0)]
Support contains 4 out of 621 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 615 transition count 2393
Reduce places removed 32 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 38 rules applied. Total rules applied 70 place count 583 transition count 2387
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 76 place count 577 transition count 2387
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 76 place count 577 transition count 2310
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 230 place count 500 transition count 2310
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 231 place count 499 transition count 2309
Iterating global reduction 3 with 1 rules applied. Total rules applied 232 place count 499 transition count 2309
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 350 place count 440 transition count 2250
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 353 place count 437 transition count 2247
Iterating global reduction 3 with 3 rules applied. Total rules applied 356 place count 437 transition count 2247
Applied a total of 356 rules in 236 ms. Remains 437 /621 variables (removed 184) and now considering 2247/2425 (removed 178) transitions.
Running 2241 sub problems to find dead transitions.
[2024-06-01 16:11:56] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
// Phase 1: matrix 2211 rows 437 cols
[2024-06-01 16:11:56] [INFO ] Computed 42 invariants in 77 ms
[2024-06-01 16:11:56] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-06-01 16:12:30] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-06-01 16:12:36] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:12:37] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:12:37] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:12:37] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-06-01 16:12:37] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:12:37] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:12:37] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
SMT process timed out in 41849ms, After SMT, problems are : Problem set: 0 solved, 2241 unsolved
Search for dead transitions found 0 dead transitions in 41881ms
[2024-06-01 16:12:37] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-06-01 16:12:37] [INFO ] Invariant cache hit.
[2024-06-01 16:12:38] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-06-01 16:12:38] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-06-01 16:12:38] [INFO ] Invariant cache hit.
[2024-06-01 16:12:39] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:13:02] [INFO ] Implicit Places using invariants and state equation in 24165 ms returned []
Implicit Place search using SMT with State Equation took 24668 ms to find 0 implicit places.
Running 2241 sub problems to find dead transitions.
[2024-06-01 16:13:02] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-06-01 16:13:02] [INFO ] Invariant cache hit.
[2024-06-01 16:13:02] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-06-01 16:13:34] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-06-01 16:13:40] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 2 ms to minimize.
[2024-06-01 16:13:41] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:13:41] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:13:41] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-06-01 16:13:41] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:13:41] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/2648 variables, and 38 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2241/987 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-06-01 16:13:55] [INFO ] Deduced a trap composed of 56 places in 470 ms of which 4 ms to minimize.
[2024-06-01 16:13:56] [INFO ] Deduced a trap composed of 113 places in 427 ms of which 2 ms to minimize.
[2024-06-01 16:13:56] [INFO ] Deduced a trap composed of 50 places in 426 ms of which 3 ms to minimize.
[2024-06-01 16:13:57] [INFO ] Deduced a trap composed of 35 places in 394 ms of which 2 ms to minimize.
[2024-06-01 16:13:57] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:13:58] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:13:58] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2024-06-01 16:13:58] [INFO ] Deduced a trap composed of 29 places in 369 ms of which 2 ms to minimize.
[2024-06-01 16:13:58] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2024-06-01 16:14:00] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/431 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/2648 variables, and 48 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/987 constraints, Known Traps: 17/17 constraints]
After SMT, in 80497ms problems are : Problem set: 0 solved, 2241 unsolved
Search for dead transitions found 0 dead transitions in 80521ms
Starting structural reductions in LI_LTL mode, iteration 1 : 437/621 places, 2247/2425 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 147316 ms. Remains : 437/621 places, 2247/2425 transitions.
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-10
Product exploration explored 100000 steps with 1086 reset in 745 ms.
Product exploration explored 100000 steps with 1128 reset in 678 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 165 ms. Reduced automaton from 3 states, 13 edges and 2 AP (stutter sensitive) to 3 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[p0, p0, (AND p0 (NOT p1))]
RANDOM walk for 40001 steps (415 resets) in 438 ms. (91 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (202 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
[2024-06-01 16:14:25] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-06-01 16:14:25] [INFO ] Invariant cache hit.
[2024-06-01 16:14:25] [INFO ] State equation strengthened by 168 read => feed constraints.
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) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 329/341 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:14:25] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 52/393 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 435/2648 variables, and 42 constraints, problems are : Problem set: 1 solved, 0 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 321ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 356 ms. Reduced automaton from 3 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[p0]
Stuttering acceptance computed with spot in 37 ms :[p0]
Support contains 2 out of 437 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 437/437 places, 2247/2247 transitions.
Applied a total of 0 rules in 51 ms. Remains 437 /437 variables (removed 0) and now considering 2247/2247 (removed 0) transitions.
Running 2241 sub problems to find dead transitions.
[2024-06-01 16:14:25] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-06-01 16:14:25] [INFO ] Invariant cache hit.
[2024-06-01 16:14:25] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-06-01 16:14:58] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:15:03] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-06-01 16:15:04] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 2 ms to minimize.
[2024-06-01 16:15:04] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 2 ms to minimize.
[2024-06-01 16:15:04] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:15:04] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 2 ms to minimize.
[2024-06-01 16:15:04] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/2648 variables, and 38 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2241/987 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-06-01 16:15:09] [INFO ] Deduced a trap composed of 56 places in 507 ms of which 3 ms to minimize.
[2024-06-01 16:15:09] [INFO ] Deduced a trap composed of 113 places in 451 ms of which 2 ms to minimize.
[2024-06-01 16:15:09] [INFO ] Deduced a trap composed of 50 places in 344 ms of which 1 ms to minimize.
[2024-06-01 16:15:10] [INFO ] Deduced a trap composed of 35 places in 391 ms of which 1 ms to minimize.
[2024-06-01 16:15:10] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:15:11] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:15:11] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:15:11] [INFO ] Deduced a trap composed of 29 places in 324 ms of which 2 ms to minimize.
[2024-06-01 16:15:11] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:15:12] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/2648 variables, and 48 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/987 constraints, Known Traps: 17/17 constraints]
After SMT, in 60380ms problems are : Problem set: 0 solved, 2241 unsolved
Search for dead transitions found 0 dead transitions in 60404ms
[2024-06-01 16:15:26] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-06-01 16:15:26] [INFO ] Invariant cache hit.
[2024-06-01 16:15:26] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-06-01 16:15:26] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-06-01 16:15:26] [INFO ] Invariant cache hit.
[2024-06-01 16:15:28] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:15:52] [INFO ] Implicit Places using invariants and state equation in 25717 ms returned []
Implicit Place search using SMT with State Equation took 26298 ms to find 0 implicit places.
[2024-06-01 16:15:52] [INFO ] Redundant transitions in 141 ms returned []
Running 2241 sub problems to find dead transitions.
[2024-06-01 16:15:52] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-06-01 16:15:52] [INFO ] Invariant cache hit.
[2024-06-01 16:15:52] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-06-01 16:16:26] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:16:30] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 2 ms to minimize.
[2024-06-01 16:16:31] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 2 ms to minimize.
[2024-06-01 16:16:31] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 2 ms to minimize.
[2024-06-01 16:16:31] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:16:31] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:16:32] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/2648 variables, and 38 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2241/987 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-06-01 16:16:45] [INFO ] Deduced a trap composed of 56 places in 524 ms of which 2 ms to minimize.
[2024-06-01 16:16:46] [INFO ] Deduced a trap composed of 113 places in 493 ms of which 2 ms to minimize.
[2024-06-01 16:16:46] [INFO ] Deduced a trap composed of 50 places in 447 ms of which 2 ms to minimize.
[2024-06-01 16:16:47] [INFO ] Deduced a trap composed of 35 places in 355 ms of which 2 ms to minimize.
[2024-06-01 16:16:47] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 0 ms to minimize.
[2024-06-01 16:16:48] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:16:48] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:16:48] [INFO ] Deduced a trap composed of 29 places in 345 ms of which 2 ms to minimize.
[2024-06-01 16:16:49] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:16:49] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/431 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/2648 variables, and 48 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/987 constraints, Known Traps: 17/17 constraints]
After SMT, in 80233ms problems are : Problem set: 0 solved, 2241 unsolved
Search for dead transitions found 0 dead transitions in 80260ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 167169 ms. Remains : 437/437 places, 2247/2247 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 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[p0]
RANDOM walk for 8880 steps (74 resets) in 115 ms. (76 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 144 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[p0]
Stuttering acceptance computed with spot in 44 ms :[p0]
Stuttering acceptance computed with spot in 56 ms :[p0]
Product exploration explored 100000 steps with 1005 reset in 816 ms.
Product exploration explored 100000 steps with 1042 reset in 716 ms.
Support contains 2 out of 437 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 437/437 places, 2247/2247 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 419 transition count 2229
Applied a total of 36 rules in 52 ms. Remains 419 /437 variables (removed 18) and now considering 2229/2247 (removed 18) transitions.
Running 2223 sub problems to find dead transitions.
[2024-06-01 16:17:15] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
// Phase 1: matrix 2193 rows 419 cols
[2024-06-01 16:17:15] [INFO ] Computed 42 invariants in 60 ms
[2024-06-01 16:17:15] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-06-01 16:17:47] [INFO ] Deduced a trap composed of 148 places in 359 ms of which 3 ms to minimize.
[2024-06-01 16:17:48] [INFO ] Deduced a trap composed of 144 places in 363 ms of which 2 ms to minimize.
[2024-06-01 16:17:48] [INFO ] Deduced a trap composed of 139 places in 327 ms of which 3 ms to minimize.
[2024-06-01 16:17:48] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 2 ms to minimize.
[2024-06-01 16:17:53] [INFO ] Deduced a trap composed of 29 places in 317 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/2612 variables, and 40 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2223/969 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/2612 variables, and 40 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/969 constraints, Known Traps: 5/5 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 2223 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
[2024-06-01 16:18:15] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-06-01 16:18:15] [INFO ] Invariant cache hit.
[2024-06-01 16:18:15] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-06-01 16:18:15] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-06-01 16:18:15] [INFO ] Invariant cache hit.
[2024-06-01 16:18:18] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:18:36] [INFO ] Implicit Places using invariants and state equation in 20706 ms returned []
Implicit Place search using SMT with State Equation took 21253 ms to find 0 implicit places.
[2024-06-01 16:18:36] [INFO ] Redundant transitions in 68 ms returned []
Running 2223 sub problems to find dead transitions.
[2024-06-01 16:18:36] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-06-01 16:18:36] [INFO ] Invariant cache hit.
[2024-06-01 16:18:36] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-06-01 16:19:12] [INFO ] Deduced a trap composed of 118 places in 349 ms of which 3 ms to minimize.
[2024-06-01 16:19:13] [INFO ] Deduced a trap composed of 151 places in 365 ms of which 2 ms to minimize.
[2024-06-01 16:19:13] [INFO ] Deduced a trap composed of 144 places in 276 ms of which 2 ms to minimize.
[2024-06-01 16:19:13] [INFO ] Deduced a trap composed of 15 places in 300 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/2612 variables, and 39 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2223/969 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-06-01 16:19:32] [INFO ] Deduced a trap composed of 58 places in 238 ms of which 1 ms to minimize.
[2024-06-01 16:19:33] [INFO ] Deduced a trap composed of 58 places in 230 ms of which 0 ms to minimize.
[2024-06-01 16:19:33] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 1 ms to minimize.
[2024-06-01 16:19:41] [INFO ] Deduced a trap composed of 136 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:19:44] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 2 ms to minimize.
[2024-06-01 16:19:44] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 1 ms to minimize.
[2024-06-01 16:19:44] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:19:45] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-06-01 16:19:45] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:19:59] [INFO ] Deduced a trap composed of 133 places in 511 ms of which 3 ms to minimize.
SMT process timed out in 82955ms, After SMT, problems are : Problem set: 0 solved, 2223 unsolved
Search for dead transitions found 0 dead transitions in 82975ms
Starting structural reductions in SI_LTL mode, iteration 1 : 419/437 places, 2229/2247 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164474 ms. Remains : 419/437 places, 2229/2247 transitions.
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-10 finished in 484305 ms.
[2024-06-01 16:20:00] [INFO ] Flatten gal took : 177 ms
[2024-06-01 16:20:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 16:20:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 621 places, 2425 transitions and 14858 arcs took 19 ms.
Total runtime 3055601 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717258871606

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-PT-S06J04T06-LTLFireability-07
ltl formula formula --ltl=/tmp/2565/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 621 places, 2425 transitions and 14858 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.680 real 0.100 user 0.160 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2565/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2565/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2565/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2565/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 648 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 622, there are 2446 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): ~212 levels ~10000 states ~31472 transitions
pnml2lts-mc( 0/ 4): ~212 levels ~20000 states ~73664 transitions
pnml2lts-mc( 3/ 4): ~230 levels ~40000 states ~154004 transitions
pnml2lts-mc( 3/ 4): ~400 levels ~80000 states ~348560 transitions
pnml2lts-mc( 3/ 4): ~400 levels ~160000 states ~699824 transitions
pnml2lts-mc( 2/ 4): ~862 levels ~320000 states ~1504960 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~2009!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 532441
pnml2lts-mc( 0/ 4): unique states count: 543188
pnml2lts-mc( 0/ 4): unique transitions count: 2287267
pnml2lts-mc( 0/ 4): - self-loop count: 4828
pnml2lts-mc( 0/ 4): - claim dead count: 1719959
pnml2lts-mc( 0/ 4): - claim found count: 253
pnml2lts-mc( 0/ 4): - claim success count: 543219
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10773
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 543219 states 2287394 transitions, fanout: 4.211
pnml2lts-mc( 0/ 4): Total exploration time 31.870 sec (31.850 sec minimum, 31.860 sec on average)
pnml2lts-mc( 0/ 4): States per second: 17045, Transitions per second: 71773
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 8.0MB, 14.9 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/5.0%
pnml2lts-mc( 0/ 4): Stored 2482 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 8.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S06J04T06-LTLFireability-10
ltl formula formula --ltl=/tmp/2565/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 621 places, 2425 transitions and 14858 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.510 real 0.110 user 0.160 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2565/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2565/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2565/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2565/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 647 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 622, there are 2470 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): ~289 levels ~10000 states ~110980 transitions
pnml2lts-mc( 1/ 4): ~289 levels ~20000 states ~230656 transitions
pnml2lts-mc( 1/ 4): ~289 levels ~40000 states ~471932 transitions
pnml2lts-mc( 0/ 4): ~731 levels ~80000 states ~1081684 transitions
pnml2lts-mc( 2/ 4): ~3107 levels ~160000 states ~1681748 transitions
pnml2lts-mc( 2/ 4): ~8223 levels ~320000 states ~3294348 transitions
pnml2lts-mc( 2/ 4): ~12458 levels ~640000 states ~7431076 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~13062!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 666725
pnml2lts-mc( 0/ 4): unique states count: 687902
pnml2lts-mc( 0/ 4): unique transitions count: 8984249
pnml2lts-mc( 0/ 4): - self-loop count: 50250
pnml2lts-mc( 0/ 4): - claim dead count: 8139600
pnml2lts-mc( 0/ 4): - claim found count: 1621
pnml2lts-mc( 0/ 4): - claim success count: 687905
pnml2lts-mc( 0/ 4): - cum. max stack depth: 21054
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 687905 states 8984289 transitions, fanout: 13.060
pnml2lts-mc( 0/ 4): Total exploration time 36.780 sec (36.770 sec minimum, 36.775 sec on average)
pnml2lts-mc( 0/ 4): States per second: 18703, Transitions per second: 244271
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 9.5MB, 14.0 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 2.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 2482 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 9.5MB (~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-S06J04T06"
export BK_EXAMINATION="LTLFireability"
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-S06J04T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446900324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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