About the Execution of GreatSPN+red for UtilityControlRoom-PT-Z2T3N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3489.315 | 883831.00 | 952395.00 | 3371.40 | FFFFFF?FFFFFFFFF | normal |
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.r443-smll-171701109900172.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 greatspnxred
Input is UtilityControlRoom-PT-Z2T3N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r443-smll-171701109900172
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 28K Apr 13 05:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 13 05:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 13 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 155K Apr 13 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 51K Apr 13 05:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 256K Apr 13 05:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 13 05:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 333K Apr 13 05:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.4K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 116K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717072985217
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z2T3N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 12:43:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 12:43:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 12:43:07] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-05-30 12:43:07] [INFO ] Transformed 174 places.
[2024-05-30 12:43:07] [INFO ] Transformed 270 transitions.
[2024-05-30 12:43:07] [INFO ] Parsed PT model containing 174 places and 270 transitions and 850 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2024-05-30 12:43:07] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-30 12:43:07] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-30 12:43:07] [INFO ] Reduced 10 identical enabling conditions.
Ensure Unique test removed 40 transitions
Reduce redundant transitions removed 40 transitions.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 125 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 44 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2024-05-30 12:43:07] [INFO ] Computed 23 invariants in 33 ms
[2024-05-30 12:43:08] [INFO ] Implicit Places using invariants in 360 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 417 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/174 places, 230/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 498 ms. Remains : 173/174 places, 230/230 transitions.
Support contains 125 out of 173 places after structural reductions.
[2024-05-30 12:43:08] [INFO ] Flatten gal took : 80 ms
[2024-05-30 12:43:08] [INFO ] Flatten gal took : 55 ms
[2024-05-30 12:43:08] [INFO ] Input system was already deterministic with 230 transitions.
Support contains 124 out of 173 places (down from 125) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 24 to 21
RANDOM walk for 40000 steps (8 resets) in 1630 ms. (24 steps per ms) remains 1/21 properties
BEST_FIRST walk for 13473 steps (2 resets) in 120 ms. (111 steps per ms) remains 0/1 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 23 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 160 place count 103 transition count 140
Applied a total of 160 rules in 104 ms. Remains 103 /173 variables (removed 70) and now considering 140/230 (removed 90) transitions.
// Phase 1: matrix 140 rows 103 cols
[2024-05-30 12:43:10] [INFO ] Computed 22 invariants in 5 ms
[2024-05-30 12:43:10] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-30 12:43:10] [INFO ] Invariant cache hit.
[2024-05-30 12:43:10] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2024-05-30 12:43:10] [INFO ] Redundant transitions in 4 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-30 12:43:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/103 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 140/243 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4433 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/103 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 140/243 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4551 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 9269ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 9299ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/173 places, 140/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9832 ms. Remains : 103/173 places, 140/230 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 756 ms.
Stack based approach found an accepted trace after 2304 steps with 0 reset with depth 2305 and stack size 2305 in 17 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-00 finished in 10935 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((p0||G(p1))))'
Support contains 40 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 132 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 132 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 122 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 122 transition count 140
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 163 place count 101 transition count 120
Applied a total of 163 rules in 39 ms. Remains 101 /173 variables (removed 72) and now considering 120/230 (removed 110) transitions.
// Phase 1: matrix 120 rows 101 cols
[2024-05-30 12:43:20] [INFO ] Computed 21 invariants in 4 ms
[2024-05-30 12:43:20] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-30 12:43:20] [INFO ] Invariant cache hit.
[2024-05-30 12:43:21] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-30 12:43:21] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-30 12:43:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 120/221 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/221 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 122 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3665 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 120/221 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 110/232 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/221 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 232 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4229 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 7988ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 7992ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/173 places, 120/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8254 ms. Remains : 101/173 places, 120/230 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-01
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-01 finished in 8425 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 40 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 173 transition count 210
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 153 transition count 210
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 120 place count 113 transition count 170
Applied a total of 120 rules in 34 ms. Remains 113 /173 variables (removed 60) and now considering 170/230 (removed 60) transitions.
// Phase 1: matrix 170 rows 113 cols
[2024-05-30 12:43:29] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 12:43:29] [INFO ] Implicit Places using invariants in 181 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 183 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/173 places, 170/230 transitions.
Applied a total of 0 rules in 12 ms. Remains 112 /112 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 229 ms. Remains : 112/173 places, 170/230 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 754 ms.
Stack based approach found an accepted trace after 508 steps with 0 reset with depth 509 and stack size 509 in 5 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-02 finished in 1057 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((p0||F(p1))))'
Support contains 30 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 132 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 132 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 122 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 122 transition count 140
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 61 rules applied. Total rules applied 183 place count 91 transition count 110
Applied a total of 183 rules in 31 ms. Remains 91 /173 variables (removed 82) and now considering 110/230 (removed 120) transitions.
// Phase 1: matrix 110 rows 91 cols
[2024-05-30 12:43:30] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 12:43:30] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-30 12:43:30] [INFO ] Invariant cache hit.
[2024-05-30 12:43:30] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-05-30 12:43:30] [INFO ] Redundant transitions in 4 ms returned []
Running 90 sub problems to find dead transitions.
[2024-05-30 12:43:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/91 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/201 variables, 91/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 112 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2332 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/91 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/201 variables, 91/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 90/202 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 202 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3373 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 5753ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5759ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/173 places, 110/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6083 ms. Remains : 91/173 places, 110/230 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-03
Product exploration explored 100000 steps with 1150 reset in 584 ms.
Stack based approach found an accepted trace after 3231 steps with 27 reset with depth 408 and stack size 408 in 33 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-03 finished in 6844 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 (G(p2)||p1)))'
Support contains 33 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 8 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-05-30 12:43:37] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 12:43:37] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-30 12:43:37] [INFO ] Invariant cache hit.
[2024-05-30 12:43:37] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 12:43:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10837 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 12078 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 23138ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 23144ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23645 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p2)), true, (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-04
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-04 finished in 23924 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((X(F(!p0)) U (X(!p2)||p1)))))'
Support contains 30 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 4 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
[2024-05-30 12:44:01] [INFO ] Invariant cache hit.
[2024-05-30 12:44:01] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-30 12:44:01] [INFO ] Invariant cache hit.
[2024-05-30 12:44:01] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 12:44:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10098 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 12233 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 22543ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 22549ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23057 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-06
Product exploration explored 100000 steps with 6903 reset in 255 ms.
Product exploration explored 100000 steps with 6852 reset in 500 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 309 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
RANDOM walk for 719 steps (0 resets) in 10 ms. (65 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) p1))), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 570 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Support contains 30 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-30 12:44:26] [INFO ] Invariant cache hit.
[2024-05-30 12:44:26] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-30 12:44:26] [INFO ] Invariant cache hit.
[2024-05-30 12:44:26] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 12:44:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10409 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 13040 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 23561ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 23564ms
Finished structural reductions in LTL mode , in 1 iterations and 23889 ms. Remains : 153/153 places, 210/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 451 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
RANDOM walk for 506 steps (0 resets) in 13 ms. (36 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) p1))), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 834 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Product exploration explored 100000 steps with 6916 reset in 388 ms.
Product exploration explored 100000 steps with 6778 reset in 423 ms.
Support contains 30 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-30 12:44:53] [INFO ] Invariant cache hit.
[2024-05-30 12:44:54] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-30 12:44:54] [INFO ] Invariant cache hit.
[2024-05-30 12:44:54] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 12:44:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10647 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11980 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 22813ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 22818ms
Finished structural reductions in LTL mode , in 1 iterations and 23357 ms. Remains : 153/153 places, 210/210 transitions.
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-06 finished in 76415 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((!p1||G(p1)))&&F(!p2))||p0))))'
Support contains 73 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 173 cols
[2024-05-30 12:45:17] [INFO ] Computed 22 invariants in 3 ms
[2024-05-30 12:45:17] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-30 12:45:17] [INFO ] Invariant cache hit.
[2024-05-30 12:45:17] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-30 12:45:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 195 constraints, problems are : Problem set: 0 solved, 220 unsolved in 12860 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 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/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 220/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 415 constraints, problems are : Problem set: 0 solved, 220 unsolved in 14625 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 27672ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 27677ms
Finished structural reductions in LTL mode , in 1 iterations and 28063 ms. Remains : 173/173 places, 230/230 transitions.
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), false, p2, true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 99 steps with 28 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-07 finished in 28403 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(((!p1 U (p2||G(!p1)))&&p0)))'
Support contains 7 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 154 transition count 211
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 154 transition count 211
Applied a total of 38 rules in 6 ms. Remains 154 /173 variables (removed 19) and now considering 211/230 (removed 19) transitions.
// Phase 1: matrix 211 rows 154 cols
[2024-05-30 12:45:45] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 12:45:46] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-30 12:45:46] [INFO ] Invariant cache hit.
[2024-05-30 12:45:46] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-30 12:45:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 211/365 variables, 154/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 176 constraints, problems are : Problem set: 0 solved, 201 unsolved in 10141 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 211/365 variables, 154/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 201/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 377 constraints, problems are : Problem set: 0 solved, 201 unsolved in 11357 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 21687ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 21692ms
Starting structural reductions in LTL mode, iteration 1 : 154/173 places, 211/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22119 ms. Remains : 154/173 places, 211/230 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (AND (NOT p2) p1), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-08 finished in 22389 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(F((p0||(p1&&F(p2)))))))'
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 5 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-05-30 12:46:08] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 12:46:08] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-30 12:46:08] [INFO ] Invariant cache hit.
[2024-05-30 12:46:08] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 12:46:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10803 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 12771 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 23745ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 23749ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24185 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-09
Product exploration explored 100000 steps with 7425 reset in 468 ms.
Product exploration explored 100000 steps with 7224 reset in 460 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 291 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 22137 steps (4 resets) in 182 ms. (120 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR p0 (NOT p1) p2))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 3 factoid took 538 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 218 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2024-05-30 12:46:35] [INFO ] Invariant cache hit.
[2024-05-30 12:46:35] [INFO ] [Real]Absence check using 22 positive place invariants in 15 ms returned unsat
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR p0 (NOT p1) p2))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 3 factoid took 555 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-09 finished in 27673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 176 place count 95 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 94 transition count 131
Applied a total of 178 rules in 32 ms. Remains 94 /173 variables (removed 79) and now considering 131/230 (removed 99) transitions.
// Phase 1: matrix 131 rows 94 cols
[2024-05-30 12:46:35] [INFO ] Computed 22 invariants in 1 ms
[2024-05-30 12:46:36] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-30 12:46:36] [INFO ] Invariant cache hit.
[2024-05-30 12:46:36] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-05-30 12:46:36] [INFO ] Redundant transitions in 5 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-30 12:46:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 10/94 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 131/225 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 0/225 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 116 constraints, problems are : Problem set: 0 solved, 111 unsolved in 3969 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 10/94 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 131/225 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 111/227 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 227 constraints, problems are : Problem set: 0 solved, 111 unsolved in 5102 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 9182ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 9185ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/173 places, 131/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9725 ms. Remains : 94/173 places, 131/230 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-10
Product exploration explored 100000 steps with 1220 reset in 386 ms.
Stack based approach found an accepted trace after 1192 steps with 17 reset with depth 110 and stack size 110 in 6 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-10 finished in 10248 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 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 173 transition count 192
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 96 place count 135 transition count 172
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 96 place count 135 transition count 152
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 136 place count 115 transition count 152
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 174 place count 96 transition count 133
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 2 with 2 rules applied. Total rules applied 176 place count 95 transition count 132
Applied a total of 176 rules in 31 ms. Remains 95 /173 variables (removed 78) and now considering 132/230 (removed 98) transitions.
// Phase 1: matrix 132 rows 95 cols
[2024-05-30 12:46:46] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 12:46:46] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-30 12:46:46] [INFO ] Invariant cache hit.
[2024-05-30 12:46:46] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-30 12:46:46] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-30 12:46:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 10/95 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 132/227 variables, 95/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 117 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4194 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 10/95 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 132/227 variables, 95/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 111/228 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 228 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4962 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 9257ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 9261ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/173 places, 132/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9646 ms. Remains : 95/173 places, 132/230 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 410 ms.
Stack based approach found an accepted trace after 2877 steps with 2 reset with depth 2687 and stack size 2687 in 14 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-11 finished in 10257 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 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 178 place count 94 transition count 131
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 2 with 2 rules applied. Total rules applied 180 place count 93 transition count 130
Applied a total of 180 rules in 38 ms. Remains 93 /173 variables (removed 80) and now considering 130/230 (removed 100) transitions.
// Phase 1: matrix 130 rows 93 cols
[2024-05-30 12:46:56] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 12:46:56] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-30 12:46:56] [INFO ] Invariant cache hit.
[2024-05-30 12:46:56] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-05-30 12:46:56] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-30 12:46:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 10/93 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 130/223 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 0/223 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 115 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3783 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 10/93 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 130/223 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 109/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 224 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4776 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 8651ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 8654ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/173 places, 130/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9110 ms. Remains : 93/173 places, 130/230 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-12
Product exploration explored 100000 steps with 1247 reset in 382 ms.
Stack based approach found an accepted trace after 5727 steps with 74 reset with depth 319 and stack size 319 in 28 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-12 finished in 9583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 178 place count 94 transition count 131
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 2 with 2 rules applied. Total rules applied 180 place count 93 transition count 130
Applied a total of 180 rules in 21 ms. Remains 93 /173 variables (removed 80) and now considering 130/230 (removed 100) transitions.
// Phase 1: matrix 130 rows 93 cols
[2024-05-30 12:47:06] [INFO ] Computed 22 invariants in 1 ms
[2024-05-30 12:47:06] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-30 12:47:06] [INFO ] Invariant cache hit.
[2024-05-30 12:47:06] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-30 12:47:06] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-30 12:47:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 10/93 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 130/223 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 0/223 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 115 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4063 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 10/93 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 130/223 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 109/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 224 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4888 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 9018ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 9021ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/173 places, 130/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9366 ms. Remains : 93/173 places, 130/230 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-14
Product exploration explored 100000 steps with 1187 reset in 223 ms.
Stack based approach found an accepted trace after 8005 steps with 97 reset with depth 91 and stack size 91 in 20 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-14 finished in 9707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((p0&&F(p1)))))))'
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 5 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-05-30 12:47:15] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 12:47:15] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-30 12:47:15] [INFO ] Invariant cache hit.
[2024-05-30 12:47:16] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 12:47:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9986 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 12616 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 22765ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 22770ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23212 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-15
Product exploration explored 100000 steps with 2458 reset in 270 ms.
Product exploration explored 100000 steps with 2435 reset in 283 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 313 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
RANDOM walk for 127 steps (0 resets) in 5 ms. (21 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 1 factoid took 438 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
[2024-05-30 12:47:41] [INFO ] Invariant cache hit.
[2024-05-30 12:47:41] [INFO ] [Real]Absence check using 22 positive place invariants in 15 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 480 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-15 finished in 26081 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((X(F(!p0)) U (X(!p2)||p1)))))'
Found a Lengthening insensitive property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-06
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Support contains 30 out of 173 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 112 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 112 transition count 130
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 152 place count 102 transition count 120
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 102 transition count 120
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 172 place count 92 transition count 100
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 92 transition count 100
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 192 place count 82 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 202 place count 82 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 212 place count 82 transition count 80
Applied a total of 212 rules in 37 ms. Remains 82 /173 variables (removed 91) and now considering 80/230 (removed 150) transitions.
// Phase 1: matrix 80 rows 82 cols
[2024-05-30 12:47:42] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 12:47:42] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-30 12:47:42] [INFO ] Invariant cache hit.
[2024-05-30 12:47:42] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-30 12:47:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 104 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2371 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 70/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 174 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2369 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 4760ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 4762ms
Starting structural reductions in LI_LTL mode, iteration 1 : 82/173 places, 80/230 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5081 ms. Remains : 82/173 places, 80/230 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-06
Product exploration explored 100000 steps with 6978 reset in 355 ms.
Product exploration explored 100000 steps with 6792 reset in 385 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 622 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
RANDOM walk for 238 steps (0 resets) in 7 ms. (29 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) p1))), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 668 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Support contains 30 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 80/80 transitions.
Applied a total of 0 rules in 0 ms. Remains 82 /82 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-30 12:47:50] [INFO ] Invariant cache hit.
[2024-05-30 12:47:50] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-30 12:47:50] [INFO ] Invariant cache hit.
[2024-05-30 12:47:50] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-30 12:47:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 104 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1989 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 70/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 174 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2426 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 4433ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 4434ms
Finished structural reductions in LTL mode , in 1 iterations and 4633 ms. Remains : 82/82 places, 80/80 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 350 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
RANDOM walk for 211 steps (0 resets) in 6 ms. (30 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) p1))), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 660 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Product exploration explored 100000 steps with 6914 reset in 207 ms.
Product exploration explored 100000 steps with 7038 reset in 224 ms.
Support contains 30 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-30 12:47:57] [INFO ] Invariant cache hit.
[2024-05-30 12:47:57] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 12:47:57] [INFO ] Invariant cache hit.
[2024-05-30 12:47:57] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-30 12:47:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 104 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1930 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 70/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 174 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2475 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 4424ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 4426ms
Finished structural reductions in LTL mode , in 1 iterations and 4594 ms. Remains : 82/82 places, 80/80 transitions.
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-06 finished in 19855 ms.
[2024-05-30 12:48:01] [INFO ] Flatten gal took : 33 ms
[2024-05-30 12:48:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 23 ms.
[2024-05-30 12:48:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 173 places, 230 transitions and 660 arcs took 8 ms.
Total runtime 294796 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running UtilityControlRoom-PT-Z2T3N10
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 173
TRANSITIONS: 230
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.006s]
SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1744
MODEL NAME: /home/mcc/execution/415/model
173 places, 230 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-06 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717073869048
--------------------
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
MEDDLY ERROR: Insufficient memory
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="UtilityControlRoom-PT-Z2T3N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is UtilityControlRoom-PT-Z2T3N10, 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 r443-smll-171701109900172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z2T3N10.tgz
mv UtilityControlRoom-PT-Z2T3N10 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 '
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 ;