Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r500-smll-171649587400092.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is HirschbergSinclair-PT-25, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587400092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 321K May 18 16:42 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 HirschbergSinclair-PT-25-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717241652887

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-25
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:34:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:34:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:34:15] [INFO ] Load time of PNML (sax parser for PT used): 372 ms
[2024-06-01 11:34:15] [INFO ] Transformed 600 places.
[2024-06-01 11:34:15] [INFO ] Transformed 545 transitions.
[2024-06-01 11:34:15] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 624 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-25-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 545/545 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 575 transition count 545
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 47 place count 553 transition count 523
Iterating global reduction 1 with 22 rules applied. Total rules applied 69 place count 553 transition count 523
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 87 place count 535 transition count 505
Iterating global reduction 1 with 18 rules applied. Total rules applied 105 place count 535 transition count 505
Applied a total of 105 rules in 466 ms. Remains 535 /600 variables (removed 65) and now considering 505/545 (removed 40) transitions.
// Phase 1: matrix 505 rows 535 cols
[2024-06-01 11:34:16] [INFO ] Computed 30 invariants in 56 ms
[2024-06-01 11:34:17] [INFO ] Implicit Places using invariants in 1095 ms returned []
[2024-06-01 11:34:17] [INFO ] Invariant cache hit.
[2024-06-01 11:34:19] [INFO ] Implicit Places using invariants and state equation in 1844 ms returned []
Implicit Place search using SMT with State Equation took 3008 ms to find 0 implicit places.
Running 480 sub problems to find dead transitions.
[2024-06-01 11:34:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 25/535 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 480 unsolved
SMT process timed out in 30491ms, After SMT, problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 30535ms
Starting structural reductions in LTL mode, iteration 1 : 535/600 places, 505/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34059 ms. Remains : 535/600 places, 505/545 transitions.
Support contains 43 out of 535 places after structural reductions.
[2024-06-01 11:34:50] [INFO ] Flatten gal took : 122 ms
[2024-06-01 11:34:50] [INFO ] Flatten gal took : 51 ms
[2024-06-01 11:34:50] [INFO ] Input system was already deterministic with 505 transitions.
Support contains 42 out of 535 places (down from 43) after GAL structural reductions.
RANDOM walk for 40000 steps (72 resets) in 2458 ms. (16 steps per ms) remains 2/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
[2024-06-01 11:34:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 342/347 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/482 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 505/987 variables, 482/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/987 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 53/1040 variables, 53/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1040 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1040 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1040/1040 variables, and 565 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1097 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 535/535 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 342/347 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/482 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 505/987 variables, 482/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/987 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/987 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 53/1040 variables, 53/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1040 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1040 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1040 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1040/1040 variables, and 567 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1167 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 535/535 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2296ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 528 ms.
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 535/535 places, 505/505 transitions.
Graph (complete) has 1012 edges and 535 vertex of which 517 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.5 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 227 rules applied. Total rules applied 228 place count 517 transition count 278
Reduce places removed 209 places and 0 transitions.
Graph (complete) has 536 edges and 308 vertex of which 269 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.1 ms
Discarding 39 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 210 rules applied. Total rules applied 438 place count 269 transition count 278
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 477 place count 269 transition count 239
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 482 place count 264 transition count 234
Iterating global reduction 3 with 5 rules applied. Total rules applied 487 place count 264 transition count 234
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 491 place count 264 transition count 230
Reduce places removed 4 places and 0 transitions.
Graph (complete) has 446 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 5 rules applied. Total rules applied 496 place count 254 transition count 230
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 502 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 503 place count 253 transition count 223
Iterating global reduction 6 with 1 rules applied. Total rules applied 504 place count 253 transition count 223
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 511 place count 253 transition count 216
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 518 place count 246 transition count 216
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 7 with 23 rules applied. Total rules applied 541 place count 223 transition count 193
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 7 with 123 rules applied. Total rules applied 664 place count 205 transition count 88
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 8 with 105 rules applied. Total rules applied 769 place count 100 transition count 88
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 769 place count 100 transition count 74
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 9 with 28 rules applied. Total rules applied 797 place count 86 transition count 74
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 798 place count 85 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 798 place count 85 transition count 73
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 800 place count 84 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 806 place count 81 transition count 70
Applied a total of 806 rules in 150 ms. Remains 81 /535 variables (removed 454) and now considering 70/505 (removed 435) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 81/535 places, 70/505 transitions.
RANDOM walk for 40000 steps (546 resets) in 967 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (232 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (229 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
Probably explored full state space saw : 3652 states, properties seen :1
Probabilistic random walk after 13782 steps, saw 3652 distinct states, run finished after 88 ms. (steps per millisecond=156 ) properties seen :1
Explored full state space saw : 3652 states, properties seen :0
Exhaustive walk after 13782 steps, saw 3652 distinct states, run finished after 48 ms. (steps per millisecond=287 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 535 stabilizing places and 505 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 535 transition count 505
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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)||(!p1 U (G(!p1)||(G(p3)&&p2)))))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 205 rules applied. Total rules applied 205 place count 511 transition count 276
Reduce places removed 205 places and 0 transitions.
Iterating post reduction 1 with 205 rules applied. Total rules applied 410 place count 306 transition count 276
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 416 place count 300 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 422 place count 300 transition count 270
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 425 place count 300 transition count 267
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 428 place count 297 transition count 267
Applied a total of 428 rules in 77 ms. Remains 297 /535 variables (removed 238) and now considering 267/505 (removed 238) transitions.
// Phase 1: matrix 267 rows 297 cols
[2024-06-01 11:34:56] [INFO ] Computed 30 invariants in 6 ms
[2024-06-01 11:34:56] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-06-01 11:34:56] [INFO ] Invariant cache hit.
[2024-06-01 11:34:57] [INFO ] Implicit Places using invariants and state equation in 1230 ms returned []
Implicit Place search using SMT with State Equation took 1731 ms to find 0 implicit places.
[2024-06-01 11:34:57] [INFO ] Redundant transitions in 23 ms returned []
Running 220 sub problems to find dead transitions.
[2024-06-01 11:34:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/251 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 222/473 variables, 251/281 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 1/474 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/474 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/564 variables, and 282 constraints, problems are : Problem set: 0 solved, 220 unsolved in 23106 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 252/297 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/251 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 222/473 variables, 251/281 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 220/501 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 1/474 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/564 variables, and 502 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 252/297 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 53224ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 53232ms
Starting structural reductions in SI_LTL mode, iteration 1 : 297/535 places, 267/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55074 ms. Remains : 297/535 places, 267/505 transitions.
Stuttering acceptance computed with spot in 483 ms :[(NOT p0), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p3))), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-00
Stuttering criterion allowed to conclude after 286 steps with 0 reset in 11 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-00 finished in 55664 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||F(p1)) U (p2||X(p0))))'
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 529 transition count 499
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 529 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 526 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 526 transition count 496
Applied a total of 18 rules in 69 ms. Remains 526 /535 variables (removed 9) and now considering 496/505 (removed 9) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-06-01 11:35:51] [INFO ] Computed 30 invariants in 11 ms
[2024-06-01 11:35:52] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-06-01 11:35:52] [INFO ] Invariant cache hit.
[2024-06-01 11:35:54] [INFO ] Implicit Places using invariants and state equation in 2544 ms returned []
Implicit Place search using SMT with State Equation took 3131 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-06-01 11:35:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 366.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 360.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 359.0)
(s26 0.0)
(s27 358.0)
(s28 0.0)
(s29 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
SMT process timed out in 30303ms, After SMT, problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 30313ms
Starting structural reductions in LTL mode, iteration 1 : 526/535 places, 496/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33517 ms. Remains : 526/535 places, 496/505 transitions.
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-01
Product exploration explored 100000 steps with 355 reset in 715 ms.
Product exploration explored 100000 steps with 354 reset in 590 ms.
Computed a total of 526 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 526 transition count 496
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 187 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
RANDOM walk for 1887 steps (0 resets) in 25 ms. (72 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2)]
Knowledge based reduction with 16 factoid took 532 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
[2024-06-01 11:36:28] [INFO ] Invariant cache hit.
[2024-06-01 11:36:29] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 226 ms returned sat
[2024-06-01 11:36:38] [INFO ] [Real]Absence check using state equation in 9241 ms returned sat
[2024-06-01 11:36:38] [INFO ] Computed and/alt/rep : 253/483/253 causal constraints (skipped 218 transitions) in 55 ms.
[2024-06-01 11:36:43] [INFO ] Added : 60 causal constraints over 12 iterations in 4920 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-06-01 11:36:43] [INFO ] Invariant cache hit.
[2024-06-01 11:36:44] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 240 ms returned sat
[2024-06-01 11:36:58] [INFO ] [Real]Absence check using state equation in 14130 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 496/496 transitions.
Applied a total of 0 rules in 14 ms. Remains 526 /526 variables (removed 0) and now considering 496/496 (removed 0) transitions.
[2024-06-01 11:36:58] [INFO ] Invariant cache hit.
[2024-06-01 11:36:58] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-06-01 11:36:58] [INFO ] Invariant cache hit.
[2024-06-01 11:37:01] [INFO ] Implicit Places using invariants and state equation in 2446 ms returned []
Implicit Place search using SMT with State Equation took 2844 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-06-01 11:37:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 556 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30065 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1022 variables, 471/1027 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 1027 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints]
After SMT, in 60351ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60365ms
Finished structural reductions in LTL mode , in 1 iterations and 63236 ms. Remains : 526/526 places, 496/496 transitions.
Computed a total of 526 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 526 transition count 496
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 142 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
RANDOM walk for 1873 steps (0 resets) in 20 ms. (89 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 16 factoid took 329 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
[2024-06-01 11:38:02] [INFO ] Invariant cache hit.
[2024-06-01 11:38:03] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 141 ms returned sat
[2024-06-01 11:38:11] [INFO ] [Real]Absence check using state equation in 8257 ms returned sat
[2024-06-01 11:38:12] [INFO ] Computed and/alt/rep : 253/483/253 causal constraints (skipped 218 transitions) in 68 ms.
[2024-06-01 11:38:18] [INFO ] Added : 80 causal constraints over 16 iterations in 6034 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-06-01 11:38:18] [INFO ] Invariant cache hit.
[2024-06-01 11:38:18] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 231 ms returned sat
[2024-06-01 11:38:33] [INFO ] [Real]Absence check using state equation in 14166 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 354 reset in 318 ms.
Product exploration explored 100000 steps with 355 reset in 402 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Support contains 5 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 496/496 transitions.
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 526 transition count 496
Deduced a syphon composed of 196 places in 2 ms
Applied a total of 196 rules in 111 ms. Remains 526 /526 variables (removed 0) and now considering 496/496 (removed 0) transitions.
[2024-06-01 11:38:34] [INFO ] Redundant transitions in 21 ms returned []
Running 471 sub problems to find dead transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-06-01 11:38:34] [INFO ] Computed 30 invariants in 5 ms
[2024-06-01 11:38:34] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
SMT process timed out in 30193ms, After SMT, problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 30204ms
Starting structural reductions in SI_LTL mode, iteration 1 : 526/526 places, 496/496 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30347 ms. Remains : 526/526 places, 496/496 transitions.
Support contains 5 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 496/496 transitions.
Applied a total of 0 rules in 62 ms. Remains 526 /526 variables (removed 0) and now considering 496/496 (removed 0) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-06-01 11:39:04] [INFO ] Computed 30 invariants in 7 ms
[2024-06-01 11:39:05] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-06-01 11:39:05] [INFO ] Invariant cache hit.
[2024-06-01 11:39:08] [INFO ] Implicit Places using invariants and state equation in 2528 ms returned []
Implicit Place search using SMT with State Equation took 3180 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-06-01 11:39:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
SMT process timed out in 30224ms, After SMT, problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 30234ms
Finished structural reductions in LTL mode , in 1 iterations and 33479 ms. Remains : 526/526 places, 496/496 transitions.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-01 finished in 226957 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))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 511 transition count 270
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 300 transition count 270
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 429 place count 293 transition count 263
Iterating global reduction 2 with 7 rules applied. Total rules applied 436 place count 293 transition count 263
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 440 place count 293 transition count 259
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 444 place count 289 transition count 259
Applied a total of 444 rules in 60 ms. Remains 289 /535 variables (removed 246) and now considering 259/505 (removed 246) transitions.
// Phase 1: matrix 259 rows 289 cols
[2024-06-01 11:39:38] [INFO ] Computed 30 invariants in 4 ms
[2024-06-01 11:39:39] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-06-01 11:39:39] [INFO ] Invariant cache hit.
[2024-06-01 11:39:39] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
[2024-06-01 11:39:39] [INFO ] Redundant transitions in 5 ms returned []
Running 213 sub problems to find dead transitions.
[2024-06-01 11:39:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 3/246 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 216/462 variables, 246/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/462 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/548 variables, and 276 constraints, problems are : Problem set: 0 solved, 213 unsolved in 16798 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 246/289 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 3/246 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 216/462 variables, 246/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 213/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/548 variables, and 489 constraints, problems are : Problem set: 0 solved, 213 unsolved in 22829 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 246/289 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
After SMT, in 39676ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39681ms
Starting structural reductions in SI_LTL mode, iteration 1 : 289/535 places, 259/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41057 ms. Remains : 289/535 places, 259/505 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-02
Product exploration explored 100000 steps with 365 reset in 360 ms.
Product exploration explored 100000 steps with 365 reset in 384 ms.
Computed a total of 289 stabilizing places and 259 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 289 transition count 259
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 1144 steps (0 resets) in 10 ms. (104 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2024-06-01 11:40:21] [INFO ] Invariant cache hit.
[2024-06-01 11:40:21] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 126 ms returned sat
[2024-06-01 11:40:24] [INFO ] [Real]Absence check using state equation in 3089 ms returned sat
[2024-06-01 11:40:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:40:25] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 96 ms returned sat
[2024-06-01 11:40:26] [INFO ] [Nat]Absence check using state equation in 1566 ms returned sat
[2024-06-01 11:40:26] [INFO ] Computed and/alt/rep : 206/229/206 causal constraints (skipped 7 transitions) in 23 ms.
[2024-06-01 11:40:29] [INFO ] Added : 182 causal constraints over 37 iterations in 2635 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 259/259 transitions.
Applied a total of 0 rules in 19 ms. Remains 289 /289 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2024-06-01 11:40:29] [INFO ] Invariant cache hit.
[2024-06-01 11:40:29] [INFO ] Implicit Places using invariants in 566 ms returned []
[2024-06-01 11:40:29] [INFO ] Invariant cache hit.
[2024-06-01 11:40:31] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 1885 ms to find 0 implicit places.
[2024-06-01 11:40:31] [INFO ] Redundant transitions in 6 ms returned []
Running 213 sub problems to find dead transitions.
[2024-06-01 11:40:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 3/246 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 216/462 variables, 246/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/462 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/548 variables, and 276 constraints, problems are : Problem set: 0 solved, 213 unsolved in 18054 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 246/289 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 3/246 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 216/462 variables, 246/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 213/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/548 variables, and 489 constraints, problems are : Problem set: 0 solved, 213 unsolved in 20276 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 246/289 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
After SMT, in 38385ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 38389ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40310 ms. Remains : 289/289 places, 259/259 transitions.
Computed a total of 289 stabilizing places and 259 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 289 transition count 259
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 1131 steps (0 resets) in 9 ms. (113 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-06-01 11:41:10] [INFO ] Invariant cache hit.
[2024-06-01 11:41:10] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 91 ms returned sat
[2024-06-01 11:41:13] [INFO ] [Real]Absence check using state equation in 3080 ms returned sat
[2024-06-01 11:41:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:41:13] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 84 ms returned sat
[2024-06-01 11:41:14] [INFO ] [Nat]Absence check using state equation in 967 ms returned sat
[2024-06-01 11:41:14] [INFO ] Computed and/alt/rep : 206/229/206 causal constraints (skipped 7 transitions) in 19 ms.
[2024-06-01 11:41:17] [INFO ] Added : 182 causal constraints over 37 iterations in 2585 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Product exploration explored 100000 steps with 366 reset in 365 ms.
Product exploration explored 100000 steps with 365 reset in 416 ms.
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 259/259 transitions.
Applied a total of 0 rules in 19 ms. Remains 289 /289 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2024-06-01 11:41:18] [INFO ] Invariant cache hit.
[2024-06-01 11:41:18] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-06-01 11:41:18] [INFO ] Invariant cache hit.
[2024-06-01 11:41:20] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
[2024-06-01 11:41:20] [INFO ] Redundant transitions in 2 ms returned []
Running 213 sub problems to find dead transitions.
[2024-06-01 11:41:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 3/246 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 216/462 variables, 246/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/462 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/548 variables, and 276 constraints, problems are : Problem set: 0 solved, 213 unsolved in 18112 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 246/289 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 3/246 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 216/462 variables, 246/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 213/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/548 variables, and 489 constraints, problems are : Problem set: 0 solved, 213 unsolved in 21675 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 246/289 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
After SMT, in 39838ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39843ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41719 ms. Remains : 289/289 places, 259/259 transitions.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-02 finished in 141503 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((X(X((p0&&X(p1))))||G(p2)))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 528 transition count 498
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 528 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 525 transition count 495
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 525 transition count 495
Applied a total of 20 rules in 35 ms. Remains 525 /535 variables (removed 10) and now considering 495/505 (removed 10) transitions.
// Phase 1: matrix 495 rows 525 cols
[2024-06-01 11:42:00] [INFO ] Computed 30 invariants in 8 ms
[2024-06-01 11:42:00] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-06-01 11:42:00] [INFO ] Invariant cache hit.
[2024-06-01 11:42:03] [INFO ] Implicit Places using invariants and state equation in 3077 ms returned []
Implicit Place search using SMT with State Equation took 3537 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-06-01 11:42:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
SMT process timed out in 30146ms, After SMT, problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 30166ms
Starting structural reductions in LTL mode, iteration 1 : 525/535 places, 495/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33742 ms. Remains : 525/535 places, 495/505 transitions.
Stuttering acceptance computed with spot in 435 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) p0), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-03
Product exploration explored 100000 steps with 16659 reset in 443 ms.
Product exploration explored 100000 steps with 16736 reset in 421 ms.
Computed a total of 525 stabilizing places and 495 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 transition count 495
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 186 ms. Reduced automaton from 10 states, 19 edges and 3 AP (stutter sensitive) to 10 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 501 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) p0), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 40000 steps (72 resets) in 257 ms. (155 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
[2024-06-01 11:42:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 458/461 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/478 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 495/973 variables, 478/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/973 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 47/1020 variables, 47/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1020 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 555 constraints, problems are : Problem set: 0 solved, 2 unsolved in 918 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 458/461 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/478 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 495/973 variables, 478/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/973 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 47/1020 variables, 47/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1020 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1020 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 557 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1013 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1958ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 787 ms.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 495/495 transitions.
Graph (complete) has 999 edges and 525 vertex of which 500 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 500 transition count 253
Reduce places removed 217 places and 0 transitions.
Graph (complete) has 491 edges and 283 vertex of which 113 are kept as prefixes of interest. Removing 170 places using SCC suffix rule.0 ms
Discarding 170 places :
Also discarding 70 output transitions
Drop transitions (Output transitions of discarded places.) removed 70 transitions
Iterating post reduction 1 with 218 rules applied. Total rules applied 461 place count 113 transition count 183
Drop transitions (Empty/Sink Transition effects.) removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 2 with 91 rules applied. Total rules applied 552 place count 113 transition count 92
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 552 place count 113 transition count 90
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 556 place count 111 transition count 90
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 573 place count 94 transition count 73
Reduce places removed 14 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 3 with 53 rules applied. Total rules applied 626 place count 80 transition count 34
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 665 place count 41 transition count 34
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 665 place count 41 transition count 19
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 695 place count 26 transition count 19
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 697 place count 24 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 697 place count 24 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 701 place count 22 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 703 place count 21 transition count 16
Applied a total of 703 rules in 41 ms. Remains 21 /525 variables (removed 504) and now considering 16/495 (removed 479) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 21/525 places, 16/495 transitions.
RANDOM walk for 30626 steps (1800 resets) in 65 ms. (464 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p2)))), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 (NOT p2))))
Knowledge based reduction with 6 factoid took 729 ms. Reduced automaton from 10 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-03 finished in 39731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F((G(p1)||G(!p1)))&&p0))))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 529 transition count 499
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 529 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 526 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 526 transition count 496
Applied a total of 18 rules in 54 ms. Remains 526 /535 variables (removed 9) and now considering 496/505 (removed 9) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-06-01 11:42:39] [INFO ] Computed 30 invariants in 11 ms
[2024-06-01 11:42:40] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-06-01 11:42:40] [INFO ] Invariant cache hit.
[2024-06-01 11:42:43] [INFO ] Implicit Places using invariants and state equation in 2836 ms returned []
Implicit Place search using SMT with State Equation took 3369 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-06-01 11:42:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
SMT process timed out in 30231ms, After SMT, problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 30241ms
Starting structural reductions in LTL mode, iteration 1 : 526/535 places, 496/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33668 ms. Remains : 526/535 places, 496/505 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), false, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-04
Stuttering criterion allowed to conclude after 1574 steps with 2 reset in 6 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-04 finished in 33926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 528 transition count 498
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 528 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 525 transition count 495
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 525 transition count 495
Applied a total of 20 rules in 80 ms. Remains 525 /535 variables (removed 10) and now considering 495/505 (removed 10) transitions.
// Phase 1: matrix 495 rows 525 cols
[2024-06-01 11:43:13] [INFO ] Computed 30 invariants in 8 ms
[2024-06-01 11:43:14] [INFO ] Implicit Places using invariants in 572 ms returned []
[2024-06-01 11:43:14] [INFO ] Invariant cache hit.
[2024-06-01 11:43:16] [INFO ] Implicit Places using invariants and state equation in 2593 ms returned []
Implicit Place search using SMT with State Equation took 3177 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-06-01 11:43:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 555 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1020 variables, 470/1025 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1025 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
After SMT, in 60216ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60224ms
Starting structural reductions in LTL mode, iteration 1 : 525/535 places, 495/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63490 ms. Remains : 525/535 places, 495/505 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-05
Product exploration explored 100000 steps with 369 reset in 363 ms.
Product exploration explored 100000 steps with 369 reset in 411 ms.
Computed a total of 525 stabilizing places and 495 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 transition count 495
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1063 steps (0 resets) in 6 ms. (151 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:44:18] [INFO ] Invariant cache hit.
[2024-06-01 11:44:19] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 110 ms returned sat
[2024-06-01 11:44:25] [INFO ] [Real]Absence check using state equation in 5713 ms returned sat
[2024-06-01 11:44:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:44:25] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 132 ms returned sat
[2024-06-01 11:44:30] [INFO ] [Nat]Absence check using state equation in 4523 ms returned sat
[2024-06-01 11:44:30] [INFO ] Computed and/alt/rep : 253/482/253 causal constraints (skipped 217 transitions) in 45 ms.
[2024-06-01 11:44:32] [INFO ] Added : 108 causal constraints over 22 iterations in 2126 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 525/525 places, 495/495 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 501 transition count 261
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 291 transition count 261
Applied a total of 420 rules in 24 ms. Remains 291 /525 variables (removed 234) and now considering 261/495 (removed 234) transitions.
// Phase 1: matrix 261 rows 291 cols
[2024-06-01 11:44:32] [INFO ] Computed 30 invariants in 2 ms
[2024-06-01 11:44:32] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-06-01 11:44:32] [INFO ] Invariant cache hit.
[2024-06-01 11:44:33] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1162 ms to find 0 implicit places.
[2024-06-01 11:44:33] [INFO ] Redundant transitions in 1 ms returned []
Running 215 sub problems to find dead transitions.
[2024-06-01 11:44:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 3/248 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 218/466 variables, 248/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/552 variables, and 278 constraints, problems are : Problem set: 0 solved, 215 unsolved in 11619 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 248/291 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 3/248 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 218/466 variables, 248/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 215/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/552 variables, and 493 constraints, problems are : Problem set: 0 solved, 215 unsolved in 14485 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 248/291 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 26135ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 26138ms
Starting structural reductions in SI_LTL mode, iteration 1 : 291/525 places, 261/495 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27332 ms. Remains : 291/525 places, 261/495 transitions.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 575 steps (0 resets) in 7 ms. (71 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 106 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:45:00] [INFO ] Invariant cache hit.
[2024-06-01 11:45:00] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 87 ms returned sat
[2024-06-01 11:45:01] [INFO ] [Real]Absence check using state equation in 1088 ms returned sat
[2024-06-01 11:45:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:45:02] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 84 ms returned sat
[2024-06-01 11:45:02] [INFO ] [Nat]Absence check using state equation in 914 ms returned sat
[2024-06-01 11:45:02] [INFO ] Computed and/alt/rep : 205/212/205 causal constraints (skipped 10 transitions) in 18 ms.
[2024-06-01 11:45:03] [INFO ] Added : 60 causal constraints over 12 iterations in 446 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 751 reset in 306 ms.
Product exploration explored 100000 steps with 752 reset in 454 ms.
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 261/261 transitions.
Applied a total of 0 rules in 15 ms. Remains 291 /291 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 11:45:04] [INFO ] Invariant cache hit.
[2024-06-01 11:45:04] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-06-01 11:45:04] [INFO ] Invariant cache hit.
[2024-06-01 11:45:05] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
[2024-06-01 11:45:05] [INFO ] Redundant transitions in 1 ms returned []
Running 215 sub problems to find dead transitions.
[2024-06-01 11:45:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 3/248 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 218/466 variables, 248/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/552 variables, and 278 constraints, problems are : Problem set: 0 solved, 215 unsolved in 11717 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 248/291 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 3/248 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 218/466 variables, 248/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 215/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/552 variables, and 493 constraints, problems are : Problem set: 0 solved, 215 unsolved in 14382 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 248/291 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 26140ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 26144ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27260 ms. Remains : 291/291 places, 261/261 transitions.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-05 finished in 137822 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(p1)&&p0)))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 529 transition count 499
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 529 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 526 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 526 transition count 496
Applied a total of 18 rules in 39 ms. Remains 526 /535 variables (removed 9) and now considering 496/505 (removed 9) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-06-01 11:45:31] [INFO ] Computed 30 invariants in 3 ms
[2024-06-01 11:45:32] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-06-01 11:45:32] [INFO ] Invariant cache hit.
[2024-06-01 11:45:34] [INFO ] Implicit Places using invariants and state equation in 2000 ms returned []
Implicit Place search using SMT with State Equation took 2426 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-06-01 11:45:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 556 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1022 variables, 471/1027 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 1027 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 526/535 places, 496/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62642 ms. Remains : 526/535 places, 496/505 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-06
Stuttering criterion allowed to conclude after 537 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-06 finished in 62775 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(G(p0))&&F(p1))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 511 transition count 275
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 1 with 206 rules applied. Total rules applied 412 place count 305 transition count 275
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 419 place count 298 transition count 268
Iterating global reduction 2 with 7 rules applied. Total rules applied 426 place count 298 transition count 268
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 430 place count 298 transition count 264
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 434 place count 294 transition count 264
Applied a total of 434 rules in 31 ms. Remains 294 /535 variables (removed 241) and now considering 264/505 (removed 241) transitions.
// Phase 1: matrix 264 rows 294 cols
[2024-06-01 11:46:34] [INFO ] Computed 30 invariants in 2 ms
[2024-06-01 11:46:34] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-06-01 11:46:34] [INFO ] Invariant cache hit.
[2024-06-01 11:46:35] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
[2024-06-01 11:46:35] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-01 11:46:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 3/251 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 221/472 variables, 251/281 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/472 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/558 variables, and 281 constraints, problems are : Problem set: 0 solved, 218 unsolved in 12092 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 251/294 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 3/251 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 221/472 variables, 251/281 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 218/499 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/558 variables, and 499 constraints, problems are : Problem set: 0 solved, 218 unsolved in 17650 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 251/294 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 29770ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 29774ms
Starting structural reductions in SI_LTL mode, iteration 1 : 294/535 places, 264/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31008 ms. Remains : 294/535 places, 264/505 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-07
Product exploration explored 100000 steps with 460 reset in 245 ms.
Product exploration explored 100000 steps with 460 reset in 277 ms.
Computed a total of 294 stabilizing places and 264 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 294 transition count 264
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 115 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 902 steps (0 resets) in 6 ms. (128 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 7 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-07 finished in 32211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 510 transition count 262
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 436 place count 292 transition count 262
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 443 place count 285 transition count 255
Iterating global reduction 2 with 7 rules applied. Total rules applied 450 place count 285 transition count 255
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 454 place count 285 transition count 251
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 458 place count 281 transition count 251
Applied a total of 458 rules in 25 ms. Remains 281 /535 variables (removed 254) and now considering 251/505 (removed 254) transitions.
// Phase 1: matrix 251 rows 281 cols
[2024-06-01 11:47:06] [INFO ] Computed 30 invariants in 1 ms
[2024-06-01 11:47:06] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-06-01 11:47:06] [INFO ] Invariant cache hit.
[2024-06-01 11:47:07] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
[2024-06-01 11:47:07] [INFO ] Redundant transitions in 1 ms returned []
Running 202 sub problems to find dead transitions.
[2024-06-01 11:47:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 2/234 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 204/438 variables, 234/264 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/532 variables, and 264 constraints, problems are : Problem set: 0 solved, 202 unsolved in 10599 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 234/281 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 2/234 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 204/438 variables, 234/264 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 202/466 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/438 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/532 variables, and 466 constraints, problems are : Problem set: 0 solved, 202 unsolved in 11713 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 234/281 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 22333ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 22336ms
Starting structural reductions in SI_LTL mode, iteration 1 : 281/535 places, 251/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23515 ms. Remains : 281/535 places, 251/505 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-09
Stuttering criterion allowed to conclude after 274 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-09 finished in 23579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(G(p1))))))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 528 transition count 498
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 528 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 525 transition count 495
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 525 transition count 495
Applied a total of 20 rules in 35 ms. Remains 525 /535 variables (removed 10) and now considering 495/505 (removed 10) transitions.
// Phase 1: matrix 495 rows 525 cols
[2024-06-01 11:47:30] [INFO ] Computed 30 invariants in 7 ms
[2024-06-01 11:47:30] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-06-01 11:47:30] [INFO ] Invariant cache hit.
[2024-06-01 11:47:32] [INFO ] Implicit Places using invariants and state equation in 2003 ms returned []
Implicit Place search using SMT with State Equation took 2383 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-06-01 11:47:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 555 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1020 variables, 470/1025 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1025 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Starting structural reductions in LTL mode, iteration 1 : 525/535 places, 495/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62597 ms. Remains : 525/535 places, 495/505 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-10
Stuttering criterion allowed to conclude after 541 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-10 finished in 62765 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)&&F(p1))))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 207 place count 512 transition count 275
Reduce places removed 207 places and 0 transitions.
Iterating post reduction 1 with 207 rules applied. Total rules applied 414 place count 305 transition count 275
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 420 place count 299 transition count 269
Iterating global reduction 2 with 6 rules applied. Total rules applied 426 place count 299 transition count 269
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 430 place count 299 transition count 265
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 434 place count 295 transition count 265
Applied a total of 434 rules in 25 ms. Remains 295 /535 variables (removed 240) and now considering 265/505 (removed 240) transitions.
// Phase 1: matrix 265 rows 295 cols
[2024-06-01 11:48:32] [INFO ] Computed 30 invariants in 2 ms
[2024-06-01 11:48:33] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-06-01 11:48:33] [INFO ] Invariant cache hit.
[2024-06-01 11:48:33] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 11:48:34] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1373 ms to find 0 implicit places.
[2024-06-01 11:48:34] [INFO ] Redundant transitions in 1 ms returned []
Running 222 sub problems to find dead transitions.
[2024-06-01 11:48:34] [INFO ] Invariant cache hit.
[2024-06-01 11:48:34] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 4/256 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 228/484 variables, 256/286 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 2/486 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (OVERLAPS) 0/486 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/560 variables, and 295 constraints, problems are : Problem set: 0 solved, 222 unsolved in 19930 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 258/295 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 4/256 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 228/484 variables, 256/286 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 222/515 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 2/486 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (OVERLAPS) 0/486 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/560 variables, and 517 constraints, problems are : Problem set: 0 solved, 222 unsolved in 25928 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 258/295 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
After SMT, in 45900ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 45902ms
Starting structural reductions in SI_LTL mode, iteration 1 : 295/535 places, 265/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47310 ms. Remains : 295/535 places, 265/505 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-11
Stuttering criterion allowed to conclude after 455 steps with 2 reset in 2 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-11 finished in 47441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 511 transition count 275
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 1 with 206 rules applied. Total rules applied 412 place count 305 transition count 275
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 419 place count 298 transition count 268
Iterating global reduction 2 with 7 rules applied. Total rules applied 426 place count 298 transition count 268
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 430 place count 298 transition count 264
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 434 place count 294 transition count 264
Applied a total of 434 rules in 24 ms. Remains 294 /535 variables (removed 241) and now considering 264/505 (removed 241) transitions.
// Phase 1: matrix 264 rows 294 cols
[2024-06-01 11:49:20] [INFO ] Computed 30 invariants in 2 ms
[2024-06-01 11:49:20] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-06-01 11:49:20] [INFO ] Invariant cache hit.
[2024-06-01 11:49:21] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
[2024-06-01 11:49:21] [INFO ] Redundant transitions in 0 ms returned []
Running 217 sub problems to find dead transitions.
[2024-06-01 11:49:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/249 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/468 variables, 249/279 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 2/470 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/470 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/558 variables, and 280 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14928 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/294 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/249 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/468 variables, 249/279 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 203/482 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 2/470 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 14/497 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/470 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/558 variables, and 497 constraints, problems are : Problem set: 0 solved, 217 unsolved in 25493 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/294 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 40453ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 40456ms
Starting structural reductions in SI_LTL mode, iteration 1 : 294/535 places, 264/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41882 ms. Remains : 294/535 places, 264/505 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-12
Stuttering criterion allowed to conclude after 285 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-12 finished in 41938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(F(p0)&&X(X(X(F(p1)))))))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 530 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 530 transition count 500
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 528 transition count 498
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 528 transition count 498
Applied a total of 14 rules in 35 ms. Remains 528 /535 variables (removed 7) and now considering 498/505 (removed 7) transitions.
// Phase 1: matrix 498 rows 528 cols
[2024-06-01 11:50:02] [INFO ] Computed 30 invariants in 3 ms
[2024-06-01 11:50:02] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-06-01 11:50:02] [INFO ] Invariant cache hit.
[2024-06-01 11:50:04] [INFO ] Implicit Places using invariants and state equation in 2231 ms returned []
Implicit Place search using SMT with State Equation took 2613 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-06-01 11:50:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 25/528 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 498/1026 variables, 528/558 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 558 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 25/528 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 498/1026 variables, 528/558 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 473/1031 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1031 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60192ms
Starting structural reductions in LTL mode, iteration 1 : 528/535 places, 498/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62843 ms. Remains : 528/535 places, 498/505 transitions.
Stuttering acceptance computed with spot in 549 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-13
Product exploration explored 100000 steps with 1238 reset in 665 ms.
Product exploration explored 100000 steps with 1238 reset in 489 ms.
Computed a total of 528 stabilizing places and 498 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 528 transition count 498
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 231 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 531 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 548 steps (0 resets) in 10 ms. (49 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 3 factoid took 378 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 593 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 520 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-06-01 11:51:09] [INFO ] Invariant cache hit.
[2024-06-01 11:51:10] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 171 ms returned sat
[2024-06-01 11:51:16] [INFO ] [Real]Absence check using state equation in 6274 ms returned sat
[2024-06-01 11:51:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:51:16] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 129 ms returned sat
[2024-06-01 11:51:20] [INFO ] [Nat]Absence check using state equation in 3077 ms returned sat
[2024-06-01 11:51:20] [INFO ] Computed and/alt/rep : 254/484/254 causal constraints (skipped 219 transitions) in 39 ms.
[2024-06-01 11:51:22] [INFO ] Added : 76 causal constraints over 16 iterations in 2546 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 498/498 transitions.
Applied a total of 0 rules in 19 ms. Remains 528 /528 variables (removed 0) and now considering 498/498 (removed 0) transitions.
[2024-06-01 11:51:22] [INFO ] Invariant cache hit.
[2024-06-01 11:51:23] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-06-01 11:51:23] [INFO ] Invariant cache hit.
[2024-06-01 11:51:25] [INFO ] Implicit Places using invariants and state equation in 2510 ms returned []
Implicit Place search using SMT with State Equation took 3111 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-06-01 11:51:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 25/528 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 498/1026 variables, 528/558 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 558 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 25/528 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 498/1026 variables, 528/558 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 473/1031 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1031 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60299ms
Finished structural reductions in LTL mode , in 1 iterations and 63431 ms. Remains : 528/528 places, 498/498 transitions.
Computed a total of 528 stabilizing places and 498 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 528 transition count 498
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 516 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 428 steps (0 resets) in 8 ms. (47 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 3 factoid took 370 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 543 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 544 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-06-01 11:52:28] [INFO ] Invariant cache hit.
[2024-06-01 11:52:29] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 169 ms returned sat
[2024-06-01 11:52:35] [INFO ] [Real]Absence check using state equation in 5832 ms returned sat
[2024-06-01 11:52:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:52:35] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 193 ms returned sat
[2024-06-01 11:52:38] [INFO ] [Nat]Absence check using state equation in 3113 ms returned sat
[2024-06-01 11:52:38] [INFO ] Computed and/alt/rep : 254/484/254 causal constraints (skipped 219 transitions) in 40 ms.
[2024-06-01 11:52:42] [INFO ] Added : 76 causal constraints over 16 iterations in 3225 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 438 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1208 reset in 651 ms.
Product exploration explored 100000 steps with 1245 reset in 414 ms.
Applying partial POR strategy [false, false, false, true, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 480 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 498/498 transitions.
Performed 210 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 528 transition count 498
Deduced a syphon composed of 210 places in 3 ms
Applied a total of 210 rules in 40 ms. Remains 528 /528 variables (removed 0) and now considering 498/498 (removed 0) transitions.
[2024-06-01 11:52:44] [INFO ] Redundant transitions in 5 ms returned []
Running 473 sub problems to find dead transitions.
// Phase 1: matrix 498 rows 528 cols
[2024-06-01 11:52:44] [INFO ] Computed 30 invariants in 5 ms
[2024-06-01 11:52:44] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 25/528 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
SMT process timed out in 30195ms, After SMT, problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 30204ms
Starting structural reductions in SI_LTL mode, iteration 1 : 528/528 places, 498/498 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30260 ms. Remains : 528/528 places, 498/498 transitions.
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 498/498 transitions.
Applied a total of 0 rules in 19 ms. Remains 528 /528 variables (removed 0) and now considering 498/498 (removed 0) transitions.
// Phase 1: matrix 498 rows 528 cols
[2024-06-01 11:53:14] [INFO ] Computed 30 invariants in 5 ms
[2024-06-01 11:53:15] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-06-01 11:53:15] [INFO ] Invariant cache hit.
[2024-06-01 11:53:17] [INFO ] Implicit Places using invariants and state equation in 2520 ms returned []
Implicit Place search using SMT with State Equation took 3095 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-06-01 11:53:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 25/528 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 366.0)
(s1 1.0)
(s2 366.0)
(s3 1.0)
(s4 0.0)
(s5 367.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 365.0)
(s11 1.0)
(s12 364.0)
(s13 1.0)
(s14 0.0)
(s15 365.0)
(s16 363.0)
(s17 1.0)
(s18 361.0)
(s19 1.0)
(s20 0.0)
(s21 360.0)
(s22 359.0)
(s23 1.0)
(s24 358.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 355.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 353.0)
(s38 0.0)
(s39 352.0)
(s40 0.0)
(s41 350.0)
(s42 0.0)
(s43 348.0)
(s44 0.0)
(s45 346.0)
(s46 343.0)
(s47 1.0)
(s48 0.0)
(s49 368.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 367.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 367.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 358.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 357.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 357.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 354.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
SMT process timed out in 30199ms, After SMT, problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 30206ms
Finished structural reductions in LTL mode , in 1 iterations and 33322 ms. Remains : 528/528 places, 498/498 transitions.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-13 finished in 225657 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 U (G(p1) U X(p0))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 528 transition count 498
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 528 transition count 498
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 526 transition count 496
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 526 transition count 496
Applied a total of 18 rules in 59 ms. Remains 526 /535 variables (removed 9) and now considering 496/505 (removed 9) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-06-01 11:53:48] [INFO ] Computed 30 invariants in 5 ms
[2024-06-01 11:53:48] [INFO ] Implicit Places using invariants in 767 ms returned []
[2024-06-01 11:53:48] [INFO ] Invariant cache hit.
[2024-06-01 11:53:51] [INFO ] Implicit Places using invariants and state equation in 2815 ms returned []
Implicit Place search using SMT with State Equation took 3584 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-06-01 11:53:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
SMT process timed out in 30136ms, After SMT, problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 30141ms
Starting structural reductions in LTL mode, iteration 1 : 526/535 places, 496/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33785 ms. Remains : 526/535 places, 496/505 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-14
Product exploration explored 100000 steps with 2622 reset in 667 ms.
Product exploration explored 100000 steps with 2649 reset in 557 ms.
Computed a total of 526 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 526 transition count 496
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 490 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 202 steps (0 resets) in 5 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 9 factoid took 552 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 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:54:24] [INFO ] Invariant cache hit.
[2024-06-01 11:54:25] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 165 ms returned sat
[2024-06-01 11:54:39] [INFO ] [Real]Absence check using state equation in 14205 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 526 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 : 526/526 places, 496/496 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 503 transition count 261
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 291 transition count 261
Applied a total of 424 rules in 24 ms. Remains 291 /526 variables (removed 235) and now considering 261/496 (removed 235) transitions.
// Phase 1: matrix 261 rows 291 cols
[2024-06-01 11:54:39] [INFO ] Computed 30 invariants in 2 ms
[2024-06-01 11:54:40] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-06-01 11:54:40] [INFO ] Invariant cache hit.
[2024-06-01 11:54:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 11:54:41] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 1557 ms to find 0 implicit places.
[2024-06-01 11:54:41] [INFO ] Redundant transitions in 1 ms returned []
Running 216 sub problems to find dead transitions.
[2024-06-01 11:54:41] [INFO ] Invariant cache hit.
[2024-06-01 11:54:41] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 4/250 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 220/470 variables, 250/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/470 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/552 variables, and 288 constraints, problems are : Problem set: 0 solved, 216 unsolved in 19978 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/291 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 4/250 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 220/470 variables, 250/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 216/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/470 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/552 variables, and 504 constraints, problems are : Problem set: 0 solved, 216 unsolved in 19862 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/291 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
After SMT, in 39883ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 39888ms
Starting structural reductions in SI_LTL mode, iteration 1 : 291/526 places, 261/496 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41480 ms. Remains : 291/526 places, 261/496 transitions.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 203 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 104 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 207 steps (0 resets) in 5 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 214 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 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:55:22] [INFO ] Invariant cache hit.
[2024-06-01 11:55:22] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 102 ms returned sat
[2024-06-01 11:55:25] [INFO ] [Real]Absence check using state equation in 2368 ms returned sat
[2024-06-01 11:55:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:55:25] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 64 ms returned sat
[2024-06-01 11:55:28] [INFO ] [Nat]Absence check using state equation in 3152 ms returned sat
[2024-06-01 11:55:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 11:55:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 34 ms returned sat
[2024-06-01 11:55:28] [INFO ] Computed and/alt/rep : 207/231/207 causal constraints (skipped 9 transitions) in 31 ms.
[2024-06-01 11:55:31] [INFO ] Added : 156 causal constraints over 32 iterations in 2791 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2368 reset in 773 ms.
Product exploration explored 100000 steps with 2404 reset in 499 ms.
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 261/261 transitions.
Applied a total of 0 rules in 7 ms. Remains 291 /291 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 11:55:32] [INFO ] Invariant cache hit.
[2024-06-01 11:55:33] [INFO ] Implicit Places using invariants in 543 ms returned []
[2024-06-01 11:55:33] [INFO ] Invariant cache hit.
[2024-06-01 11:55:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 11:55:34] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1664 ms to find 0 implicit places.
[2024-06-01 11:55:34] [INFO ] Redundant transitions in 1 ms returned []
Running 216 sub problems to find dead transitions.
[2024-06-01 11:55:34] [INFO ] Invariant cache hit.
[2024-06-01 11:55:34] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 4/250 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 220/470 variables, 250/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/470 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/552 variables, and 288 constraints, problems are : Problem set: 0 solved, 216 unsolved in 20497 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/291 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 4/250 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 220/470 variables, 250/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 216/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/470 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/552 variables, and 504 constraints, problems are : Problem set: 0 solved, 216 unsolved in 23649 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/291 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
After SMT, in 44191ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 44195ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45875 ms. Remains : 291/291 places, 261/261 transitions.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-14 finished in 150968 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 528 transition count 498
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 528 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 525 transition count 495
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 525 transition count 495
Applied a total of 20 rules in 55 ms. Remains 525 /535 variables (removed 10) and now considering 495/505 (removed 10) transitions.
// Phase 1: matrix 495 rows 525 cols
[2024-06-01 11:56:18] [INFO ] Computed 30 invariants in 4 ms
[2024-06-01 11:56:19] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-06-01 11:56:19] [INFO ] Invariant cache hit.
[2024-06-01 11:56:22] [INFO ] Implicit Places using invariants and state equation in 2978 ms returned []
Implicit Place search using SMT with State Equation took 3635 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-06-01 11:56:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 555 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1020 variables, 470/1025 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1025 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
After SMT, in 60257ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60265ms
Starting structural reductions in LTL mode, iteration 1 : 525/535 places, 495/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63957 ms. Remains : 525/535 places, 495/505 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-15
Entered a terminal (fully accepting) state of product in 198 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-15 finished in 64115 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||F(p1)) U (p2||X(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(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : HirschbergSinclair-PT-25-LTLFireability-05
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 511 transition count 271
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 301 transition count 271
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 427 place count 294 transition count 264
Iterating global reduction 2 with 7 rules applied. Total rules applied 434 place count 294 transition count 264
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 437 place count 294 transition count 261
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 440 place count 291 transition count 261
Applied a total of 440 rules in 40 ms. Remains 291 /535 variables (removed 244) and now considering 261/505 (removed 244) transitions.
// Phase 1: matrix 261 rows 291 cols
[2024-06-01 11:57:23] [INFO ] Computed 30 invariants in 2 ms
[2024-06-01 11:57:24] [INFO ] Implicit Places using invariants in 591 ms returned []
[2024-06-01 11:57:24] [INFO ] Invariant cache hit.
[2024-06-01 11:57:25] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-01 11:57:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 3/248 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 218/466 variables, 248/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/552 variables, and 278 constraints, problems are : Problem set: 0 solved, 215 unsolved in 18412 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 248/291 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 3/248 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 218/466 variables, 248/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 215/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/552 variables, and 493 constraints, problems are : Problem set: 0 solved, 215 unsolved in 22087 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 248/291 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 40532ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 40536ms
Starting structural reductions in LI_LTL mode, iteration 1 : 291/535 places, 261/505 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 42446 ms. Remains : 291/535 places, 261/505 transitions.
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-05
Product exploration explored 100000 steps with 752 reset in 286 ms.
Product exploration explored 100000 steps with 751 reset in 324 ms.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 568 steps (0 resets) in 7 ms. (71 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:58:07] [INFO ] Invariant cache hit.
[2024-06-01 11:58:08] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 129 ms returned sat
[2024-06-01 11:58:09] [INFO ] [Real]Absence check using state equation in 1664 ms returned sat
[2024-06-01 11:58:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:58:10] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 99 ms returned sat
[2024-06-01 11:58:11] [INFO ] [Nat]Absence check using state equation in 982 ms returned sat
[2024-06-01 11:58:11] [INFO ] Computed and/alt/rep : 205/212/205 causal constraints (skipped 10 transitions) in 18 ms.
[2024-06-01 11:58:11] [INFO ] Added : 60 causal constraints over 12 iterations in 496 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 261/261 transitions.
Applied a total of 0 rules in 13 ms. Remains 291 /291 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 11:58:11] [INFO ] Invariant cache hit.
[2024-06-01 11:58:12] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-06-01 11:58:12] [INFO ] Invariant cache hit.
[2024-06-01 11:58:12] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1327 ms to find 0 implicit places.
[2024-06-01 11:58:12] [INFO ] Redundant transitions in 1 ms returned []
Running 215 sub problems to find dead transitions.
[2024-06-01 11:58:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 3/248 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 218/466 variables, 248/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/552 variables, and 278 constraints, problems are : Problem set: 0 solved, 215 unsolved in 18392 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 248/291 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 3/248 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 218/466 variables, 248/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 215/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/552 variables, and 493 constraints, problems are : Problem set: 0 solved, 215 unsolved in 19857 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 248/291 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 38281ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 38283ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39630 ms. Remains : 291/291 places, 261/261 transitions.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 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 95 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 569 steps (0 resets) in 8 ms. (63 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 164 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 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:58:51] [INFO ] Invariant cache hit.
[2024-06-01 11:58:52] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 123 ms returned sat
[2024-06-01 11:58:53] [INFO ] [Real]Absence check using state equation in 1577 ms returned sat
[2024-06-01 11:58:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:58:54] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 107 ms returned sat
[2024-06-01 11:58:55] [INFO ] [Nat]Absence check using state equation in 1087 ms returned sat
[2024-06-01 11:58:55] [INFO ] Computed and/alt/rep : 205/212/205 causal constraints (skipped 10 transitions) in 27 ms.
[2024-06-01 11:58:55] [INFO ] Added : 60 causal constraints over 12 iterations in 462 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 750 reset in 504 ms.
Product exploration explored 100000 steps with 753 reset in 736 ms.
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 261/261 transitions.
Applied a total of 0 rules in 10 ms. Remains 291 /291 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 11:58:57] [INFO ] Invariant cache hit.
[2024-06-01 11:58:58] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-06-01 11:58:58] [INFO ] Invariant cache hit.
[2024-06-01 11:58:59] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1758 ms to find 0 implicit places.
[2024-06-01 11:58:59] [INFO ] Redundant transitions in 1 ms returned []
Running 215 sub problems to find dead transitions.
[2024-06-01 11:58:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 3/248 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 218/466 variables, 248/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/552 variables, and 278 constraints, problems are : Problem set: 0 solved, 215 unsolved in 15053 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 248/291 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 3/248 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 218/466 variables, 248/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 215/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/552 variables, and 493 constraints, problems are : Problem set: 0 solved, 215 unsolved in 21374 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 248/291 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 36452ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 36456ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38230 ms. Remains : 291/291 places, 261/261 transitions.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-05 finished in 132322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(F(p0)&&X(X(X(F(p1)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(p1) U X(p0))))'
Found a Shortening insensitive property : HirschbergSinclair-PT-25-LTLFireability-14
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 512 transition count 272
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 302 transition count 272
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 427 place count 295 transition count 265
Iterating global reduction 2 with 7 rules applied. Total rules applied 434 place count 295 transition count 265
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 438 place count 295 transition count 261
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 442 place count 291 transition count 261
Applied a total of 442 rules in 35 ms. Remains 291 /535 variables (removed 244) and now considering 261/505 (removed 244) transitions.
// Phase 1: matrix 261 rows 291 cols
[2024-06-01 11:59:36] [INFO ] Computed 30 invariants in 3 ms
[2024-06-01 11:59:37] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-06-01 11:59:37] [INFO ] Invariant cache hit.
[2024-06-01 11:59:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 11:59:38] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1870 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-06-01 11:59:38] [INFO ] Invariant cache hit.
[2024-06-01 11:59:38] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 4/250 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 220/470 variables, 250/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/470 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/552 variables, and 288 constraints, problems are : Problem set: 0 solved, 216 unsolved in 19592 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/291 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 4/250 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 220/470 variables, 250/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 216/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/470 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/552 variables, and 504 constraints, problems are : Problem set: 0 solved, 216 unsolved in 21304 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/291 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
After SMT, in 40952ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 40956ms
Starting structural reductions in LI_LTL mode, iteration 1 : 291/535 places, 261/505 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 42862 ms. Remains : 291/535 places, 261/505 transitions.
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-14
Product exploration explored 100000 steps with 2412 reset in 554 ms.
Product exploration explored 100000 steps with 2371 reset in 508 ms.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 425 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 242 steps (0 resets) in 11 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 9 factoid took 541 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 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:00:21] [INFO ] Invariant cache hit.
[2024-06-01 12:00:22] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 100 ms returned sat
[2024-06-01 12:00:24] [INFO ] [Real]Absence check using state equation in 2187 ms returned sat
[2024-06-01 12:00:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:00:24] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 100 ms returned sat
[2024-06-01 12:00:28] [INFO ] [Nat]Absence check using state equation in 3285 ms returned sat
[2024-06-01 12:00:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 12:00:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 32 ms returned sat
[2024-06-01 12:00:28] [INFO ] Computed and/alt/rep : 207/231/207 causal constraints (skipped 9 transitions) in 27 ms.
[2024-06-01 12:00:31] [INFO ] Added : 156 causal constraints over 32 iterations in 2737 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 291 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 : 291/291 places, 261/261 transitions.
Applied a total of 0 rules in 14 ms. Remains 291 /291 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:00:31] [INFO ] Invariant cache hit.
[2024-06-01 12:00:31] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-06-01 12:00:31] [INFO ] Invariant cache hit.
[2024-06-01 12:00:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 12:00:32] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 1903 ms to find 0 implicit places.
[2024-06-01 12:00:32] [INFO ] Redundant transitions in 1 ms returned []
Running 216 sub problems to find dead transitions.
[2024-06-01 12:00:32] [INFO ] Invariant cache hit.
[2024-06-01 12:00:32] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 4/250 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 220/470 variables, 250/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/470 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/552 variables, and 288 constraints, problems are : Problem set: 0 solved, 216 unsolved in 21083 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/291 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 4/250 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 220/470 variables, 250/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 216/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/470 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/552 variables, and 504 constraints, problems are : Problem set: 0 solved, 216 unsolved in 19554 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/291 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
After SMT, in 40679ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 40684ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42619 ms. Remains : 291/291 places, 261/261 transitions.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 176 steps (0 resets) in 5 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 170 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:01:14] [INFO ] Invariant cache hit.
[2024-06-01 12:01:14] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 101 ms returned sat
[2024-06-01 12:01:17] [INFO ] [Real]Absence check using state equation in 2393 ms returned sat
[2024-06-01 12:01:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:01:17] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 100 ms returned sat
[2024-06-01 12:01:20] [INFO ] [Nat]Absence check using state equation in 2883 ms returned sat
[2024-06-01 12:01:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 12:01:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 33 ms returned sat
[2024-06-01 12:01:20] [INFO ] Computed and/alt/rep : 207/231/207 causal constraints (skipped 9 transitions) in 29 ms.
[2024-06-01 12:01:23] [INFO ] Added : 156 causal constraints over 32 iterations in 2777 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2368 reset in 665 ms.
Product exploration explored 100000 steps with 2376 reset in 497 ms.
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 261/261 transitions.
Applied a total of 0 rules in 7 ms. Remains 291 /291 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:01:24] [INFO ] Invariant cache hit.
[2024-06-01 12:01:24] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-06-01 12:01:24] [INFO ] Invariant cache hit.
[2024-06-01 12:01:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 12:01:26] [INFO ] Implicit Places using invariants and state equation in 1221 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
[2024-06-01 12:01:26] [INFO ] Redundant transitions in 1 ms returned []
Running 216 sub problems to find dead transitions.
[2024-06-01 12:01:26] [INFO ] Invariant cache hit.
[2024-06-01 12:01:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 4/250 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 220/470 variables, 250/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/470 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/552 variables, and 288 constraints, problems are : Problem set: 0 solved, 216 unsolved in 20718 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/291 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 4/250 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 220/470 variables, 250/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 216/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/470 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/552 variables, and 504 constraints, problems are : Problem set: 0 solved, 216 unsolved in 23239 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/291 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
After SMT, in 44000ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 44004ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45592 ms. Remains : 291/291 places, 261/261 transitions.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-14 finished in 154323 ms.
[2024-06-01 12:02:10] [INFO ] Flatten gal took : 65 ms
[2024-06-01 12:02:10] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 12:02:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 535 places, 505 transitions and 1517 arcs took 11 ms.
Total runtime 1675227 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA HirschbergSinclair-PT-25-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : HirschbergSinclair-PT-25-LTLFireability-02
Could not compute solution for formula : HirschbergSinclair-PT-25-LTLFireability-05
FORMULA HirschbergSinclair-PT-25-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : HirschbergSinclair-PT-25-LTLFireability-14

BK_STOP 1717244434825

--------------------
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 HirschbergSinclair-PT-25-LTLFireability-01
ltl formula formula --ltl=/tmp/2673/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 535 places, 505 transitions and 1517 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.100 real 0.010 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2673/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2673/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2673/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2673/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 537 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 536, there are 539 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( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~510!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2065
pnml2lts-mc( 0/ 4): unique states count: 3387
pnml2lts-mc( 0/ 4): unique transitions count: 24236
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 2648
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 3391
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1368
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3391 states 24632 transitions, fanout: 7.264
pnml2lts-mc( 0/ 4): Total exploration time 0.240 sec (0.240 sec minimum, 0.240 sec on average)
pnml2lts-mc( 0/ 4): States per second: 14129, Transitions per second: 102633
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.5MB, 34.3 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 517 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.5MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-25-LTLFireability-02
ltl formula formula --ltl=/tmp/2673/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 535 places, 505 transitions and 1517 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.090 real 0.030 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2673/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2673/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2673/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2673/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 537 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 536, there are 507 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): ~527 levels ~10000 states ~35788 transitions
pnml2lts-mc( 3/ 4): ~535 levels ~20000 states ~54908 transitions
pnml2lts-mc( 3/ 4): ~535 levels ~40000 states ~107636 transitions
pnml2lts-mc( 0/ 4): ~533 levels ~80000 states ~228944 transitions
pnml2lts-mc( 0/ 4): ~534 levels ~160000 states ~481764 transitions
pnml2lts-mc( 0/ 4): ~534 levels ~320000 states ~1095616 transitions
pnml2lts-mc( 0/ 4): ~534 levels ~640000 states ~2232276 transitions
pnml2lts-mc( 0/ 4): ~534 levels ~1280000 states ~5056524 transitions
pnml2lts-mc( 0/ 4): ~534 levels ~2560000 states ~10853560 transitions
pnml2lts-mc( 0/ 4): ~534 levels ~5120000 states ~24034656 transitions
pnml2lts-mc( 0/ 4): ~534 levels ~10240000 states ~50439732 transitions
pnml2lts-mc( 0/ 4): ~534 levels ~20480000 states ~110093520 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33388430
pnml2lts-mc( 0/ 4): unique states count: 33390396
pnml2lts-mc( 0/ 4): unique transitions count: 191381397
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 157983247
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33400272
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2137
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33400272 states 191401696 transitions, fanout: 5.731
pnml2lts-mc( 0/ 4): Total exploration time 519.380 sec (519.370 sec minimum, 519.372 sec on average)
pnml2lts-mc( 0/ 4): States per second: 64308, Transitions per second: 368520
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 318.8MB, 10.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 517 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 318.8MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-25-LTLFireability-05
ltl formula formula --ltl=/tmp/2673/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 535 places, 505 transitions and 1517 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.080 real 0.030 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2673/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2673/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2673/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2673/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 537 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 536, there are 508 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~281 levels ~10000 states ~41112 transitions
pnml2lts-mc( 3/ 4): ~281 levels ~20000 states ~70644 transitions
pnml2lts-mc( 3/ 4): ~281 levels ~40000 states ~142916 transitions
pnml2lts-mc( 3/ 4): ~281 levels ~80000 states ~294520 transitions
pnml2lts-mc( 3/ 4): ~281 levels ~160000 states ~618076 transitions
pnml2lts-mc( 3/ 4): ~281 levels ~320000 states ~1352780 transitions
pnml2lts-mc( 3/ 4): ~281 levels ~640000 states ~2701876 transitions
pnml2lts-mc( 3/ 4): ~281 levels ~1280000 states ~5883416 transitions
pnml2lts-mc( 3/ 4): ~281 levels ~2560000 states ~13808512 transitions
pnml2lts-mc( 3/ 4): ~281 levels ~5120000 states ~34858492 transitions
pnml2lts-mc( 0/ 4): ~280 levels ~10240000 states ~74375588 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 15565168
pnml2lts-mc( 0/ 4): unique states count: 15566091
pnml2lts-mc( 0/ 4): unique transitions count: 120747020
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 105166578
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 15567209
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1121
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 15567209 states 120750128 transitions, fanout: 7.757
pnml2lts-mc( 0/ 4): Total exploration time 250.520 sec (250.500 sec minimum, 250.508 sec on average)
pnml2lts-mc( 0/ 4): States per second: 62140, Transitions per second: 481998
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 182.8MB, 12.3 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 46.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 517 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 182.8MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-25-LTLFireability-13
ltl formula formula --ltl=/tmp/2673/ltl_3_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 535 places, 505 transitions and 1517 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.080 real 0.010 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2673/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2673/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2673/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2673/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 537 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 536, there are 534 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~522!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 595
pnml2lts-mc( 0/ 4): unique states count: 1705
pnml2lts-mc( 0/ 4): unique transitions count: 15192
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 385
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1735
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1145
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1735 states 15387 transitions, fanout: 8.869
pnml2lts-mc( 0/ 4): Total exploration time 0.120 sec (0.120 sec minimum, 0.120 sec on average)
pnml2lts-mc( 0/ 4): States per second: 14458, Transitions per second: 128225
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 38.0 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 517 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-25-LTLFireability-14
ltl formula formula --ltl=/tmp/2673/ltl_4_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 535 places, 505 transitions and 1517 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.070 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2673/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2673/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2673/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2673/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 536 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 536, there are 524 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): ~326 levels ~10000 states ~23580 transitions
pnml2lts-mc( 0/ 4): ~326 levels ~20000 states ~41876 transitions
pnml2lts-mc( 0/ 4): ~326 levels ~40000 states ~80632 transitions
pnml2lts-mc( 0/ 4): ~326 levels ~80000 states ~160404 transitions
pnml2lts-mc( 0/ 4): ~326 levels ~160000 states ~325440 transitions
pnml2lts-mc( 0/ 4): ~326 levels ~320000 states ~694512 transitions
pnml2lts-mc( 0/ 4): ~326 levels ~640000 states ~1483676 transitions
pnml2lts-mc( 3/ 4): ~325 levels ~1280000 states ~3289464 transitions
pnml2lts-mc( 0/ 4): ~326 levels ~2560000 states ~6668600 transitions
pnml2lts-mc( 0/ 4): ~326 levels ~5120000 states ~13889864 transitions
pnml2lts-mc( 3/ 4): ~325 levels ~10240000 states ~31943836 transitions
pnml2lts-mc( 3/ 4): ~325 levels ~20480000 states ~67359300 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 22629546
pnml2lts-mc( 0/ 4): unique states count: 22630563
pnml2lts-mc( 0/ 4): unique transitions count: 73922230
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 51283811
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 22631730
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1319
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 22631730 states 73925590 transitions, fanout: 3.266
pnml2lts-mc( 0/ 4): Total exploration time 331.160 sec (331.150 sec minimum, 331.152 sec on average)
pnml2lts-mc( 0/ 4): States per second: 68341, Transitions per second: 223232
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 236.7MB, 11.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 67.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 517 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 236.7MB (~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="HirschbergSinclair-PT-25"
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 HirschbergSinclair-PT-25, 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 r500-smll-171649587400092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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