About the Execution of LTSMin+red for GPPP-PT-C0100N0000000100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 527.331 | 506960.00 | 928752.00 | 1043.80 | FTFTFFTFFTFFTTTF | 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.r496-tall-171640603400412.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is GPPP-PT-C0100N0000000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603400412
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 09:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Apr 12 09:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 09:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLFireability-00
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLFireability-01
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLFireability-02
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLFireability-03
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLFireability-04
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLFireability-05
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLFireability-06
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLFireability-07
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLFireability-08
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLFireability-09
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLFireability-10
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLFireability-11
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLFireability-12
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLFireability-13
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLFireability-14
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717196612110
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000000100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:03:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:03:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:03:33] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2024-05-31 23:03:33] [INFO ] Transformed 33 places.
[2024-05-31 23:03:33] [INFO ] Transformed 22 transitions.
[2024-05-31 23:03:33] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPPP-PT-C0100N0000000100-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 8 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-31 23:03:33] [INFO ] Computed 12 invariants in 12 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/33 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem TDEAD19 is UNSAT
At refinement iteration 6 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 1 solved, 20 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 20/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/55 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 65 constraints, problems are : Problem set: 1 solved, 20 unsolved in 8755 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 9215ms problems are : Problem set: 1 solved, 20 unsolved
Search for dead transitions found 1 dead transitions in 9225ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
// Phase 1: matrix 21 rows 33 cols
[2024-05-31 23:03:42] [INFO ] Computed 13 invariants in 4 ms
[2024-05-31 23:03:42] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 23:03:42] [INFO ] Invariant cache hit.
[2024-05-31 23:03:42] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33/33 places, 21/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9374 ms. Remains : 33/33 places, 21/22 transitions.
Support contains 30 out of 33 places after structural reductions.
[2024-05-31 23:03:43] [INFO ] Flatten gal took : 16 ms
[2024-05-31 23:03:43] [INFO ] Flatten gal took : 5 ms
[2024-05-31 23:03:43] [INFO ] Input system was already deterministic with 21 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40182 steps (12 resets) in 318 ms. (125 steps per ms) remains 2/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
[2024-05-31 23:03:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 12/31 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/33 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 21/54 variables, 33/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/54 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 46 constraints, problems are : Problem set: 1 solved, 1 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/31 variables, 5/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp23 is UNSAT
After SMT solving in domain Int declared 33/54 variables, and 13 constraints, problems are : Problem set: 2 solved, 0 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 459ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 31 stabilizing places and 19 stable transitions
Graph (complete) has 81 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
FORMULA GPPP-PT-C0100N0000000100-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(X(X(G(p1))))) U p2))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 7 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 32 cols
[2024-05-31 23:03:44] [INFO ] Computed 12 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 44 constraints, problems are : Problem set: 0 solved, 20 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 32/53 variables, and 12 constraints, problems are : Problem set: 0 solved, 20 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/32 constraints, PredecessorRefiner: 0/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 20220ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20220ms
[2024-05-31 23:04:04] [INFO ] Invariant cache hit.
[2024-05-31 23:04:04] [INFO ] Implicit Places using invariants in 43 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 21/21 transitions.
Applied a total of 0 rules in 14 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20293 ms. Remains : 31/33 places, 21/21 transitions.
Stuttering acceptance computed with spot in 369 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLFireability-00
Product exploration explored 100000 steps with 1789 reset in 276 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLFireability-00 finished in 21005 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&&X(X(X(p1)))))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 4 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-31 23:04:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 44 constraints, problems are : Problem set: 0 solved, 20 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SMT process timed out in 20207ms, After SMT, problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20207ms
[2024-05-31 23:04:25] [INFO ] Invariant cache hit.
[2024-05-31 23:04:25] [INFO ] Implicit Places using invariants in 41 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20254 ms. Remains : 30/33 places, 21/21 transitions.
Stuttering acceptance computed with spot in 434 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLFireability-02
Product exploration explored 100000 steps with 2548 reset in 174 ms.
Stack based approach found an accepted trace after 91 steps with 2 reset with depth 27 and stack size 27 in 1 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLFireability-02 finished in 20889 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||G(((p2 U (p3||G(p2)))||p1)))))'
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-31 23:04:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 44 constraints, problems are : Problem set: 0 solved, 20 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SMT process timed out in 20195ms, After SMT, problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20197ms
[2024-05-31 23:04:46] [INFO ] Invariant cache hit.
[2024-05-31 23:04:46] [INFO ] Implicit Places using invariants in 80 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20282 ms. Remains : 31/33 places, 21/21 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLFireability-03
Product exploration explored 100000 steps with 34 reset in 203 ms.
Product exploration explored 100000 steps with 34 reset in 270 ms.
Computed a total of 29 stabilizing places and 19 stable transitions
Computed a total of 29 stabilizing places and 19 stable transitions
Detected a total of 29/31 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3))), (X (NOT p0)), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (OR p1 p3))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1299 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40138 steps (12 resets) in 30 ms. (1294 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:04:48] [INFO ] Computed 11 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/25 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/27 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 46/52 variables, and 36 constraints, problems are : Problem set: 1 solved, 0 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 4/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 27/31 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 206ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3))), (X (NOT p0)), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (OR p1 p3))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 p3 p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) (NOT p2)))), (F (NOT (OR p1 p3))), (F (NOT p1)), (F p2), (F (NOT (OR p3 (NOT p2)))), (F p3), (F (NOT (OR p1 p3 (NOT p2))))]
Knowledge based reduction with 21 factoid took 3090 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Support contains 6 out of 31 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 30 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 28 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 28 transition count 17
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 7 place count 27 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 24 transition count 15
Applied a total of 12 rules in 45 ms. Remains 24 /31 variables (removed 7) and now considering 15/21 (removed 6) transitions.
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 24 cols
[2024-05-31 23:04:52] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 23:04:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/39 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 35 constraints, problems are : Problem set: 0 solved, 14 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SMT process timed out in 20257ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 20257ms
[2024-05-31 23:05:12] [INFO ] Invariant cache hit.
[2024-05-31 23:05:12] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 23:05:12] [INFO ] Invariant cache hit.
[2024-05-31 23:05:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:05:12] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 117 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/31 places, 15/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20421 ms. Remains : 23/31 places, 15/21 transitions.
Computed a total of 23 stabilizing places and 14 stable transitions
Graph (complete) has 59 edges and 23 vertex of which 21 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 23 stabilizing places and 14 stable transitions
Detected a total of 23/23 stabilizing places and 14/15 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (OR p1 p3)), (X (NOT (AND p2 (NOT p3)))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (OR p1 p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 527 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40129 steps (16 resets) in 39 ms. (1003 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
// Phase 1: matrix 15 rows 23 cols
[2024-05-31 23:05:13] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 23:05:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/21 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 34/38 variables, and 29 constraints, problems are : Problem set: 1 solved, 0 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 21/23 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 206ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (OR p1 p3)), (X (NOT (AND p2 (NOT p3)))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (OR p1 p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p2 p3))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p1 p3))), (F p2), (F p3), (F (NOT p1))]
Knowledge based reduction with 21 factoid took 1441 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 48 reset in 170 ms.
Product exploration explored 100000 steps with 48 reset in 138 ms.
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 14 sub problems to find dead transitions.
[2024-05-31 23:05:15] [INFO ] Invariant cache hit.
[2024-05-31 23:05:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/23 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 14/37 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/38 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/38 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 33 constraints, problems are : Problem set: 0 solved, 14 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 23/38 variables, and 9 constraints, problems are : Problem set: 0 solved, 14 unsolved in 20007 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/23 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 20229ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 20229ms
[2024-05-31 23:05:35] [INFO ] Invariant cache hit.
[2024-05-31 23:05:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-31 23:05:35] [INFO ] Invariant cache hit.
[2024-05-31 23:05:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:05:35] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-31 23:05:35] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-31 23:05:35] [INFO ] Invariant cache hit.
[2024-05-31 23:05:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/23 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 14/37 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/38 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/38 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 33 constraints, problems are : Problem set: 0 solved, 14 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 14/37 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/38 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 47 constraints, problems are : Problem set: 0 solved, 14 unsolved in 20180 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 20357ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 20358ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40677 ms. Remains : 23/23 places, 15/15 transitions.
Treatment of property GPPP-PT-C0100N0000000100-LTLFireability-03 finished in 89944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 79 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 29 transition count 17
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 6 place count 28 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 25 transition count 15
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 23 transition count 14
Applied a total of 14 rules in 6 ms. Remains 23 /33 variables (removed 10) and now considering 14/21 (removed 7) transitions.
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 23 cols
[2024-05-31 23:05:56] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 23:05:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/37 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 34 constraints, problems are : Problem set: 0 solved, 13 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 47 constraints, problems are : Problem set: 0 solved, 13 unsolved in 10007 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 10187ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 10188ms
[2024-05-31 23:06:06] [INFO ] Invariant cache hit.
[2024-05-31 23:06:06] [INFO ] Implicit Places using invariants in 31 ms returned [0, 3, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/33 places, 14/21 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 16 transition count 11
Applied a total of 7 rules in 2 ms. Remains 16 /20 variables (removed 4) and now considering 11/14 (removed 3) transitions.
// Phase 1: matrix 11 rows 16 cols
[2024-05-31 23:06:06] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 23:06:06] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-31 23:06:06] [INFO ] Invariant cache hit.
[2024-05-31 23:06:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:06:06] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/33 places, 11/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10295 ms. Remains : 16/33 places, 11/21 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLFireability-04
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLFireability-04 finished in 10344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 79 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 25 transition count 16
Applied a total of 12 rules in 12 ms. Remains 25 /33 variables (removed 8) and now considering 16/21 (removed 5) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 25 cols
[2024-05-31 23:06:06] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 23:06:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 15/40 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/41 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/41 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 36 constraints, problems are : Problem set: 0 solved, 15 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SMT process timed out in 20256ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 20256ms
[2024-05-31 23:06:26] [INFO ] Invariant cache hit.
[2024-05-31 23:06:26] [INFO ] Implicit Places using invariants in 161 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 170 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/33 places, 16/21 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 15
Applied a total of 2 rules in 3 ms. Remains 23 /24 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 23 cols
[2024-05-31 23:06:26] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 23:06:26] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-31 23:06:26] [INFO ] Invariant cache hit.
[2024-05-31 23:06:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:06:27] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 89 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/33 places, 15/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 20531 ms. Remains : 22/33 places, 15/21 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLFireability-05
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLFireability-05 finished in 20636 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||G(p1)||(p2&&X(F(!p1))))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 2 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 32 cols
[2024-05-31 23:06:27] [INFO ] Computed 12 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 44 constraints, problems are : Problem set: 0 solved, 20 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 32/53 variables, and 12 constraints, problems are : Problem set: 0 solved, 20 unsolved in 20005 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/32 constraints, PredecessorRefiner: 0/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 20204ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20205ms
[2024-05-31 23:06:47] [INFO ] Invariant cache hit.
[2024-05-31 23:06:47] [INFO ] Implicit Places using invariants in 35 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20253 ms. Remains : 30/33 places, 21/21 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, p1, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 86 ms.
Product exploration explored 100000 steps with 33333 reset in 98 ms.
Computed a total of 28 stabilizing places and 19 stable transitions
Computed a total of 28 stabilizing places and 19 stable transitions
Detected a total of 28/30 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 28 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000000100-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000000100-LTLFireability-06 finished in 20620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(p1)&&p0) U (p2 U (p3&&F(p4)))))))'
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-31 23:06:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 44 constraints, problems are : Problem set: 0 solved, 20 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 64 constraints, problems are : Problem set: 0 solved, 20 unsolved in 20000 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 20386ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20387ms
[2024-05-31 23:07:08] [INFO ] Invariant cache hit.
[2024-05-31 23:07:08] [INFO ] Implicit Places using invariants in 34 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20426 ms. Remains : 30/33 places, 21/21 transitions.
Stuttering acceptance computed with spot in 419 ms :[(OR (NOT p4) (NOT p3) (NOT p1)), (OR (NOT p4) (NOT p3)), (OR (NOT p4) (NOT p3)), (OR (NOT p4) (NOT p3)), (OR (NOT p4) (NOT p3)), true, (NOT p4), (OR (NOT p3) (NOT p4))]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLFireability-07 finished in 20863 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 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 79 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 26 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 24 transition count 15
Applied a total of 12 rules in 9 ms. Remains 24 /33 variables (removed 9) and now considering 15/21 (removed 6) transitions.
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 24 cols
[2024-05-31 23:07:08] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 23:07:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/39 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 35 constraints, problems are : Problem set: 0 solved, 14 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 38/39 variables, and 48 constraints, problems are : Problem set: 0 solved, 14 unsolved in 20006 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 20177ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 20179ms
[2024-05-31 23:07:28] [INFO ] Invariant cache hit.
[2024-05-31 23:07:28] [INFO ] Implicit Places using invariants in 39 ms returned [0, 3, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/33 places, 15/21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 14
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 4 place count 19 transition count 13
Applied a total of 4 rules in 2 ms. Remains 19 /21 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 19 cols
[2024-05-31 23:07:28] [INFO ] Computed 7 invariants in 0 ms
[2024-05-31 23:07:28] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-31 23:07:28] [INFO ] Invariant cache hit.
[2024-05-31 23:07:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:07:28] [INFO ] Implicit Places using invariants and state equation in 34 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 73 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/33 places, 13/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 20312 ms. Remains : 18/33 places, 13/21 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLFireability-08
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLFireability-08 finished in 20354 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 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 79 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 29 transition count 17
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 6 place count 28 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 25 transition count 15
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 23 transition count 14
Applied a total of 14 rules in 20 ms. Remains 23 /33 variables (removed 10) and now considering 14/21 (removed 7) transitions.
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 23 cols
[2024-05-31 23:07:29] [INFO ] Computed 10 invariants in 0 ms
[2024-05-31 23:07:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/37 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 34 constraints, problems are : Problem set: 0 solved, 13 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 47 constraints, problems are : Problem set: 0 solved, 13 unsolved in 14838 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 14995ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 14996ms
[2024-05-31 23:07:44] [INFO ] Invariant cache hit.
[2024-05-31 23:07:44] [INFO ] Implicit Places using invariants in 36 ms returned [0, 3, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/33 places, 14/21 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 16 transition count 11
Applied a total of 7 rules in 3 ms. Remains 16 /20 variables (removed 4) and now considering 11/14 (removed 3) transitions.
// Phase 1: matrix 11 rows 16 cols
[2024-05-31 23:07:44] [INFO ] Computed 6 invariants in 0 ms
[2024-05-31 23:07:44] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-31 23:07:44] [INFO ] Invariant cache hit.
[2024-05-31 23:07:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:07:44] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/33 places, 11/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15109 ms. Remains : 16/33 places, 11/21 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLFireability-09
Product exploration explored 100000 steps with 81 reset in 77 ms.
Product exploration explored 100000 steps with 81 reset in 82 ms.
Computed a total of 16 stabilizing places and 10 stable transitions
Computed a total of 16 stabilizing places and 10 stable transitions
Detected a total of 16/16 stabilizing places and 10/11 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3721 steps (0 resets) in 16 ms. (218 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Running 10 sub problems to find dead transitions.
[2024-05-31 23:07:44] [INFO ] Invariant cache hit.
[2024-05-31 23:07:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 10/26 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/27 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/27 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 23 constraints, problems are : Problem set: 0 solved, 10 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 10/26 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/27 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 33 constraints, problems are : Problem set: 0 solved, 10 unsolved in 13731 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 13839ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 13840ms
[2024-05-31 23:07:58] [INFO ] Invariant cache hit.
[2024-05-31 23:07:58] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-31 23:07:58] [INFO ] Invariant cache hit.
[2024-05-31 23:07:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:07:58] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-31 23:07:58] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-31 23:07:58] [INFO ] Invariant cache hit.
[2024-05-31 23:07:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 10/26 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/27 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/27 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 23 constraints, problems are : Problem set: 0 solved, 10 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 10/26 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/27 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 33 constraints, problems are : Problem set: 0 solved, 10 unsolved in 17128 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 17285ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 17285ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31202 ms. Remains : 16/16 places, 11/11 transitions.
Computed a total of 16 stabilizing places and 10 stable transitions
Computed a total of 16 stabilizing places and 10 stable transitions
Detected a total of 16/16 stabilizing places and 10/11 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3722 steps (0 resets) in 8 ms. (413 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 81 reset in 86 ms.
Product exploration explored 100000 steps with 81 reset in 87 ms.
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Running 10 sub problems to find dead transitions.
[2024-05-31 23:08:16] [INFO ] Invariant cache hit.
[2024-05-31 23:08:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 10/26 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/27 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/27 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 23 constraints, problems are : Problem set: 0 solved, 10 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 10/26 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/27 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 33 constraints, problems are : Problem set: 0 solved, 10 unsolved in 13677 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 13822ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 13823ms
[2024-05-31 23:08:30] [INFO ] Invariant cache hit.
[2024-05-31 23:08:30] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-31 23:08:30] [INFO ] Invariant cache hit.
[2024-05-31 23:08:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:08:30] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-31 23:08:30] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-31 23:08:30] [INFO ] Invariant cache hit.
[2024-05-31 23:08:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 10/26 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/27 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/27 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 23 constraints, problems are : Problem set: 0 solved, 10 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 10/26 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/27 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 33 constraints, problems are : Problem set: 0 solved, 10 unsolved in 12423 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 12579ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 12580ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26482 ms. Remains : 16/16 places, 11/11 transitions.
Treatment of property GPPP-PT-C0100N0000000100-LTLFireability-09 finished in 74226 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(!p0))&&((!p1 U (p2||G(!p1)))||X((!p0 U (G(!p0)||(!p0&&G(p1))))))))'
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 32 cols
[2024-05-31 23:08:43] [INFO ] Computed 12 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 44 constraints, problems are : Problem set: 0 solved, 20 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 32/53 variables, and 12 constraints, problems are : Problem set: 0 solved, 20 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/32 constraints, PredecessorRefiner: 0/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 20209ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20209ms
[2024-05-31 23:09:03] [INFO ] Invariant cache hit.
[2024-05-31 23:09:03] [INFO ] Implicit Places using invariants in 60 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20279 ms. Remains : 30/33 places, 21/21 transitions.
Stuttering acceptance computed with spot in 279 ms :[p0, p0, p0, (AND p0 p1 (NOT p2)), p0, true, (AND p0 (NOT p1)), (AND (NOT p2) p1), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLFireability-10 finished in 20575 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 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (complete) has 81 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 18
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 5 place count 29 transition count 18
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 25 transition count 16
Applied a total of 11 rules in 11 ms. Remains 25 /33 variables (removed 8) and now considering 16/21 (removed 5) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 25 cols
[2024-05-31 23:09:03] [INFO ] Computed 10 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/41 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 41/41 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 20006 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 0/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 20170ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 20171ms
[2024-05-31 23:09:23] [INFO ] Invariant cache hit.
[2024-05-31 23:09:24] [INFO ] Implicit Places using invariants in 38 ms returned [0, 3, 15]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 16/21 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 18 transition count 13
Applied a total of 7 rules in 2 ms. Remains 18 /22 variables (removed 4) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 18 cols
[2024-05-31 23:09:24] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 23:09:24] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-31 23:09:24] [INFO ] Invariant cache hit.
[2024-05-31 23:09:24] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/33 places, 13/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20276 ms. Remains : 18/33 places, 13/21 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLFireability-11
Product exploration explored 100000 steps with 3092 reset in 89 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLFireability-11 finished in 20435 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 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 79 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 26 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 24 transition count 15
Applied a total of 12 rules in 7 ms. Remains 24 /33 variables (removed 9) and now considering 15/21 (removed 6) transitions.
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 24 cols
[2024-05-31 23:09:24] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 23:09:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/39 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 35 constraints, problems are : Problem set: 0 solved, 14 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 24/39 variables, and 10 constraints, problems are : Problem set: 0 solved, 14 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/24 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 20256ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 20256ms
[2024-05-31 23:09:44] [INFO ] Invariant cache hit.
[2024-05-31 23:09:44] [INFO ] Implicit Places using invariants in 25 ms returned [0, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 15/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20290 ms. Remains : 22/33 places, 15/21 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLFireability-15
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLFireability-15 finished in 20329 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||G(((p2 U (p3||G(p2)))||p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-31 23:09:44] [INFO ] Flatten gal took : 9 ms
[2024-05-31 23:09:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 23:09:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 21 transitions and 80 arcs took 2 ms.
Total runtime 371629 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA GPPP-PT-C0100N0000000100-LTLFireability-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717197119070
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name GPPP-PT-C0100N0000000100-LTLFireability-03
ltl formula formula --ltl=/tmp/1259/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 33 places, 21 transitions and 80 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1259/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1259/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1259/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1259/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 34 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 34, there are 49 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~75488 transitions
pnml2lts-mc( 0/ 4): ~3073 levels ~20000 states ~114212 transitions
pnml2lts-mc( 0/ 4): ~3073 levels ~40000 states ~202924 transitions
pnml2lts-mc( 0/ 4): ~3073 levels ~80000 states ~436932 transitions
pnml2lts-mc( 0/ 4): ~3073 levels ~160000 states ~864812 transitions
pnml2lts-mc( 0/ 4): ~3073 levels ~320000 states ~1713288 transitions
pnml2lts-mc( 0/ 4): ~3841 levels ~640000 states ~4438164 transitions
pnml2lts-mc( 2/ 4): ~2874 levels ~1280000 states ~8099532 transitions
pnml2lts-mc( 2/ 4): ~2874 levels ~2560000 states ~19135276 transitions
pnml2lts-mc( 2/ 4): ~2874 levels ~5120000 states ~40779712 transitions
pnml2lts-mc( 0/ 4): ~4613 levels ~10240000 states ~77688140 transitions
pnml2lts-mc( 1/ 4): ~2872 levels ~20480000 states ~154607316 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 19679342
pnml2lts-mc( 0/ 4): unique states count: 33531146
pnml2lts-mc( 0/ 4): unique transitions count: 273849917
pnml2lts-mc( 0/ 4): - self-loop count: 3
pnml2lts-mc( 0/ 4): - claim dead count: 219558088
pnml2lts-mc( 0/ 4): - claim found count: 24723102
pnml2lts-mc( 0/ 4): - claim success count: 34355528
pnml2lts-mc( 0/ 4): - cum. max stack depth: 13990
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 34422807 states 282226241 transitions, fanout: 8.199
pnml2lts-mc( 0/ 4): Total exploration time 79.460 sec (79.420 sec minimum, 79.440 sec on average)
pnml2lts-mc( 0/ 4): States per second: 433209, Transitions per second: 3551803
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 290.4MB, 9.1 B/state, compr.: 6.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/53.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 290.4MB (~256.0MB paged-in)
ltl formula name GPPP-PT-C0100N0000000100-LTLFireability-09
ltl formula formula --ltl=/tmp/1259/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 33 places, 21 transitions and 80 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1259/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1259/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1259/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1259/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 34 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 34, there are 24 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~27352 transitions
pnml2lts-mc( 2/ 4): ~2868 levels ~20000 states ~49916 transitions
pnml2lts-mc( 2/ 4): ~2868 levels ~40000 states ~110012 transitions
pnml2lts-mc( 2/ 4): ~2868 levels ~80000 states ~255640 transitions
pnml2lts-mc( 2/ 4): ~2868 levels ~160000 states ~575204 transitions
pnml2lts-mc( 2/ 4): ~2868 levels ~320000 states ~1248428 transitions
pnml2lts-mc( 2/ 4): ~2868 levels ~640000 states ~2660108 transitions
pnml2lts-mc( 2/ 4): ~2868 levels ~1280000 states ~5752612 transitions
pnml2lts-mc( 2/ 4): ~2868 levels ~2560000 states ~11970240 transitions
pnml2lts-mc( 2/ 4): ~2868 levels ~5120000 states ~25972744 transitions
pnml2lts-mc( 2/ 4): ~2868 levels ~10240000 states ~56357472 transitions
pnml2lts-mc( 2/ 4): ~2868 levels ~20480000 states ~119803096 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 16568473
pnml2lts-mc( 0/ 4): unique states count: 33528201
pnml2lts-mc( 0/ 4): unique transitions count: 227868250
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 177373119
pnml2lts-mc( 0/ 4): - claim found count: 16950648
pnml2lts-mc( 0/ 4): - claim success count: 33532663
pnml2lts-mc( 0/ 4): - cum. max stack depth: 11495
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33533730 states 227907224 transitions, fanout: 6.796
pnml2lts-mc( 0/ 4): Total exploration time 53.530 sec (53.500 sec minimum, 53.513 sec on average)
pnml2lts-mc( 0/ 4): States per second: 626447, Transitions per second: 4257561
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 272.5MB, 8.5 B/state, compr.: 6.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/25.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 272.5MB (~256.0MB paged-in)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0100N0000000100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is GPPP-PT-C0100N0000000100, 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 r496-tall-171640603400412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000000100.tgz
mv GPPP-PT-C0100N0000000100 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 ;