fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683761400596
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldPPPt-PT-005A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
414.132 76001.00 103724.00 414.90 FFFFFFFFFFFTFFFF 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.r528-tall-171683761400596.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 ShieldPPPt-PT-005A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761400596
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 11 14:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 33K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-005A-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-005A-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-005A-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-005A-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-005A-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-005A-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-005A-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-005A-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-005A-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-005A-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-005A-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-005A-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-005A-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-005A-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-005A-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-005A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717256020213

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-005A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:33:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:33:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:33:41] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-06-01 15:33:41] [INFO ] Transformed 128 places.
[2024-06-01 15:33:41] [INFO ] Transformed 93 transitions.
[2024-06-01 15:33:41] [INFO ] Found NUPN structural information;
[2024-06-01 15:33:41] [INFO ] Parsed PT model containing 128 places and 93 transitions and 366 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-005A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-005A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-005A-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
Applied a total of 0 rules in 12 ms. Remains 128 /128 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 128 cols
[2024-06-01 15:33:41] [INFO ] Computed 56 invariants in 12 ms
[2024-06-01 15:33:41] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-01 15:33:41] [INFO ] Invariant cache hit.
[2024-06-01 15:33:42] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-01 15:33:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 312 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2136 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 91/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 403 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2631 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 4818ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4842ms
Finished structural reductions in LTL mode , in 1 iterations and 5261 ms. Remains : 128/128 places, 92/92 transitions.
Support contains 46 out of 128 places after structural reductions.
[2024-06-01 15:33:47] [INFO ] Flatten gal took : 29 ms
[2024-06-01 15:33:47] [INFO ] Flatten gal took : 13 ms
[2024-06-01 15:33:47] [INFO ] Input system was already deterministic with 92 transitions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 4225 steps (0 resets) in 191 ms. (22 steps per ms) remains 0/26 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G((X(p1)||G(p2))) U p2)||p0)))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 15:33:47] [INFO ] Invariant cache hit.
[2024-06-01 15:33:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 15:33:47] [INFO ] Invariant cache hit.
[2024-06-01 15:33:47] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-01 15:33:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 312 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1800 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 91/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 403 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2628 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 4454ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4455ms
Finished structural reductions in LTL mode , in 1 iterations and 4665 ms. Remains : 128/128 places, 92/92 transitions.
Stuttering acceptance computed with spot in 388 ms :[(AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-005A-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ShieldPPPt-PT-005A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-005A-LTLFireability-01 finished in 5110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(X(p1) U (p1||X(p0)))||X(p2))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
Applied a total of 0 rules in 8 ms. Remains 128 /128 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 15:33:52] [INFO ] Invariant cache hit.
[2024-06-01 15:33:52] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 15:33:52] [INFO ] Invariant cache hit.
[2024-06-01 15:33:52] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-01 15:33:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 312 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1734 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 91/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 403 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2492 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 4242ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4245ms
Finished structural reductions in LTL mode , in 1 iterations and 4454 ms. Remains : 128/128 places, 92/92 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-005A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-005A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-005A-LTLFireability-02 finished in 4575 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 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 125 transition count 90
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 125 transition count 88
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 123 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 122 transition count 87
Applied a total of 9 rules in 53 ms. Remains 122 /128 variables (removed 6) and now considering 87/92 (removed 5) transitions.
// Phase 1: matrix 87 rows 122 cols
[2024-06-01 15:33:57] [INFO ] Computed 55 invariants in 1 ms
[2024-06-01 15:33:57] [INFO ] Implicit Places using invariants in 67 ms returned [105, 109]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/128 places, 87/92 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 118 transition count 85
Applied a total of 4 rules in 6 ms. Remains 118 /120 variables (removed 2) and now considering 85/87 (removed 2) transitions.
// Phase 1: matrix 85 rows 118 cols
[2024-06-01 15:33:57] [INFO ] Computed 53 invariants in 1 ms
[2024-06-01 15:33:57] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 15:33:57] [INFO ] Invariant cache hit.
[2024-06-01 15:33:57] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 118/128 places, 85/92 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 288 ms. Remains : 118/128 places, 85/92 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005A-LTLFireability-04
Product exploration explored 100000 steps with 174 reset in 406 ms.
Stack based approach found an accepted trace after 56 steps with 0 reset with depth 57 and stack size 57 in 1 ms.
FORMULA ShieldPPPt-PT-005A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005A-LTLFireability-04 finished in 778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U (p1&&G(!p0)))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 128 cols
[2024-06-01 15:33:58] [INFO ] Computed 56 invariants in 6 ms
[2024-06-01 15:33:58] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 15:33:58] [INFO ] Invariant cache hit.
[2024-06-01 15:33:58] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-01 15:33:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 312 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1790 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 91/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 403 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2660 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 4464ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4467ms
Finished structural reductions in LTL mode , in 1 iterations and 4663 ms. Remains : 128/128 places, 92/92 transitions.
Stuttering acceptance computed with spot in 128 ms :[p0, (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : ShieldPPPt-PT-005A-LTLFireability-05
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-005A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-005A-LTLFireability-05 finished in 4811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(X(p1)))||G(p1))))'
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 15:34:02] [INFO ] Invariant cache hit.
[2024-06-01 15:34:02] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 15:34:02] [INFO ] Invariant cache hit.
[2024-06-01 15:34:03] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-01 15:34:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 312 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1791 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 91/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 403 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2596 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 4400ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4401ms
Finished structural reductions in LTL mode , in 1 iterations and 4577 ms. Remains : 128/128 places, 92/92 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-005A-LTLFireability-06
Product exploration explored 100000 steps with 223 reset in 256 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA ShieldPPPt-PT-005A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005A-LTLFireability-06 finished in 5051 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(p1)&&p0) U p2)||X(X(G(p3)))))'
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 15:34:07] [INFO ] Invariant cache hit.
[2024-06-01 15:34:08] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 15:34:08] [INFO ] Invariant cache hit.
[2024-06-01 15:34:08] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-01 15:34:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 312 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1774 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 91/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 403 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2587 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 4373ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4373ms
Finished structural reductions in LTL mode , in 1 iterations and 4547 ms. Remains : 128/128 places, 92/92 transitions.
Stuttering acceptance computed with spot in 367 ms :[true, (OR (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3)]
Running random walk in product with property : ShieldPPPt-PT-005A-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-005A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-005A-LTLFireability-07 finished in 4944 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((X(F(p1))||p0)))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 126 transition count 90
Applied a total of 4 rules in 6 ms. Remains 126 /128 variables (removed 2) and now considering 90/92 (removed 2) transitions.
// Phase 1: matrix 90 rows 126 cols
[2024-06-01 15:34:12] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 15:34:12] [INFO ] Implicit Places using invariants in 73 ms returned [119]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 90/92 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 125 transition count 88
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 123 transition count 88
Applied a total of 4 rules in 6 ms. Remains 123 /125 variables (removed 2) and now considering 88/90 (removed 2) transitions.
// Phase 1: matrix 88 rows 123 cols
[2024-06-01 15:34:12] [INFO ] Computed 55 invariants in 1 ms
[2024-06-01 15:34:13] [INFO ] Implicit Places using invariants in 69 ms returned [106, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/128 places, 88/92 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 119 transition count 86
Applied a total of 4 rules in 5 ms. Remains 119 /121 variables (removed 2) and now considering 86/88 (removed 2) transitions.
// Phase 1: matrix 86 rows 119 cols
[2024-06-01 15:34:13] [INFO ] Computed 53 invariants in 0 ms
[2024-06-01 15:34:13] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 15:34:13] [INFO ] Invariant cache hit.
[2024-06-01 15:34:13] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 119/128 places, 86/92 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 317 ms. Remains : 119/128 places, 86/92 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-005A-LTLFireability-09
Product exploration explored 100000 steps with 1097 reset in 201 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA ShieldPPPt-PT-005A-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005A-LTLFireability-09 finished in 601 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 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 126 transition count 90
Applied a total of 4 rules in 10 ms. Remains 126 /128 variables (removed 2) and now considering 90/92 (removed 2) transitions.
// Phase 1: matrix 90 rows 126 cols
[2024-06-01 15:34:13] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 15:34:13] [INFO ] Implicit Places using invariants in 67 ms returned [119]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 90/92 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 125 transition count 88
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 123 transition count 88
Applied a total of 4 rules in 5 ms. Remains 123 /125 variables (removed 2) and now considering 88/90 (removed 2) transitions.
// Phase 1: matrix 88 rows 123 cols
[2024-06-01 15:34:13] [INFO ] Computed 55 invariants in 1 ms
[2024-06-01 15:34:13] [INFO ] Implicit Places using invariants in 64 ms returned [106, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 64 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/128 places, 88/92 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 119 transition count 86
Applied a total of 4 rules in 4 ms. Remains 119 /121 variables (removed 2) and now considering 86/88 (removed 2) transitions.
// Phase 1: matrix 86 rows 119 cols
[2024-06-01 15:34:13] [INFO ] Computed 53 invariants in 0 ms
[2024-06-01 15:34:13] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 15:34:13] [INFO ] Invariant cache hit.
[2024-06-01 15:34:13] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 119/128 places, 86/92 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 307 ms. Remains : 119/128 places, 86/92 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005A-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 202 ms.
Stack based approach found an accepted trace after 98 steps with 0 reset with depth 99 and stack size 99 in 0 ms.
FORMULA ShieldPPPt-PT-005A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005A-LTLFireability-10 finished in 554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 128 cols
[2024-06-01 15:34:14] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 15:34:14] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 15:34:14] [INFO ] Invariant cache hit.
[2024-06-01 15:34:14] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-01 15:34:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 312 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1681 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 91/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 403 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2662 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 4355ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4356ms
Finished structural reductions in LTL mode , in 1 iterations and 4532 ms. Remains : 128/128 places, 92/92 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005A-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-005A-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-005A-LTLFireability-11 finished in 4994 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)||F(p1)))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 15:34:19] [INFO ] Invariant cache hit.
[2024-06-01 15:34:19] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 15:34:19] [INFO ] Invariant cache hit.
[2024-06-01 15:34:19] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-01 15:34:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 312 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1772 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 91/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 403 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2691 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 4476ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4478ms
Finished structural reductions in LTL mode , in 1 iterations and 4653 ms. Remains : 128/128 places, 92/92 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-005A-LTLFireability-12
Product exploration explored 100000 steps with 498 reset in 190 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA ShieldPPPt-PT-005A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005A-LTLFireability-12 finished in 4975 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 U p1))||p1)) U p2))'
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 15:34:24] [INFO ] Invariant cache hit.
[2024-06-01 15:34:24] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 15:34:24] [INFO ] Invariant cache hit.
[2024-06-01 15:34:24] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-01 15:34:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 312 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1777 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 91/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 403 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2588 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 4381ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4382ms
Finished structural reductions in LTL mode , in 1 iterations and 4552 ms. Remains : 128/128 places, 92/92 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-005A-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-005A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-005A-LTLFireability-13 finished in 4723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(G(F((!p0 U (p1||G(!p0))))) U G(p2))))'
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 15:34:28] [INFO ] Invariant cache hit.
[2024-06-01 15:34:28] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 15:34:28] [INFO ] Invariant cache hit.
[2024-06-01 15:34:28] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-01 15:34:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 312 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1723 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 91/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 403 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2542 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 4275ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4276ms
Finished structural reductions in LTL mode , in 1 iterations and 4455 ms. Remains : 128/128 places, 92/92 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) p0), (AND (NOT p1) p0 p2), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-005A-LTLFireability-14
Product exploration explored 100000 steps with 25353 reset in 174 ms.
Stack based approach found an accepted trace after 1799 steps with 441 reset with depth 7 and stack size 7 in 4 ms.
FORMULA ShieldPPPt-PT-005A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005A-LTLFireability-14 finished in 4868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F((!p1&&X((G(!p1)||F(!p2))))))))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 15:34:33] [INFO ] Invariant cache hit.
[2024-06-01 15:34:33] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 15:34:33] [INFO ] Invariant cache hit.
[2024-06-01 15:34:33] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-01 15:34:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 312 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1720 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 91/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 403 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2538 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 4268ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4268ms
Finished structural reductions in LTL mode , in 1 iterations and 4431 ms. Remains : 128/128 places, 92/92 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 p2), (AND p1 p2)]
Running random walk in product with property : ShieldPPPt-PT-005A-LTLFireability-15
Product exploration explored 100000 steps with 20030 reset in 163 ms.
Product exploration explored 100000 steps with 19969 reset in 191 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 p2), (AND p1 p2)]
RANDOM walk for 3803 steps (0 resets) in 33 ms. (111 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p2) p1))), (F p2), (F p0), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 4 factoid took 266 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 p2), (AND p1 p2)]
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 15:34:39] [INFO ] Invariant cache hit.
[2024-06-01 15:34:39] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 15:34:39] [INFO ] Invariant cache hit.
[2024-06-01 15:34:39] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-01 15:34:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 312 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1732 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 91/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 403 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2510 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 4252ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4253ms
Finished structural reductions in LTL mode , in 1 iterations and 4424 ms. Remains : 128/128 places, 92/92 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 p2), (AND p1 p2)]
RANDOM walk for 9153 steps (1 resets) in 54 ms. (166 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p2) p1))), (F p2), (F p0), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 4 factoid took 215 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 19975 reset in 160 ms.
Product exploration explored 100000 steps with 19962 reset in 179 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 p2), (AND p1 p2)]
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 92
Deduced a syphon composed of 2 places in 4 ms
Applied a total of 2 rules in 23 ms. Remains 128 /128 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 15:34:46] [INFO ] Redundant transitions in 2 ms returned []
Running 91 sub problems to find dead transitions.
// Phase 1: matrix 92 rows 128 cols
[2024-06-01 15:34:46] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 15:34:46] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-01 15:34:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 8 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 15:34:46] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/186 constraints. Problems are: Problem set: 2 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/186 constraints. Problems are: Problem set: 2 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 92/220 variables, 128/314 constraints. Problems are: Problem set: 2 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 2/316 constraints. Problems are: Problem set: 2 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/316 constraints. Problems are: Problem set: 2 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/220 variables, 0/316 constraints. Problems are: Problem set: 2 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 316 constraints, problems are : Problem set: 2 solved, 89 unsolved in 2639 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 2 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 2 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 3/128 variables, 56/181 constraints. Problems are: Problem set: 2 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 3/184 constraints. Problems are: Problem set: 2 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/186 constraints. Problems are: Problem set: 2 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/186 constraints. Problems are: Problem set: 2 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 92/220 variables, 128/314 constraints. Problems are: Problem set: 2 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 2/316 constraints. Problems are: Problem set: 2 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 89/405 constraints. Problems are: Problem set: 2 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/405 constraints. Problems are: Problem set: 2 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/220 variables, 0/405 constraints. Problems are: Problem set: 2 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 405 constraints, problems are : Problem set: 2 solved, 89 unsolved in 2307 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 89/91 constraints, Known Traps: 2/2 constraints]
After SMT, in 4966ms problems are : Problem set: 2 solved, 89 unsolved
Search for dead transitions found 2 dead transitions in 4968ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 128/128 places, 90/92 transitions.
Graph (complete) has 307 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 126 /128 variables (removed 2) and now considering 90/90 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 126/128 places, 90/92 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5015 ms. Remains : 126/128 places, 90/92 transitions.
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 128 cols
[2024-06-01 15:34:51] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 15:34:51] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 15:34:51] [INFO ] Invariant cache hit.
[2024-06-01 15:34:51] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-01 15:34:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 312 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1816 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 56/183 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/220 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 91/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 403 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2618 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 4444ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4445ms
Finished structural reductions in LTL mode , in 1 iterations and 4627 ms. Remains : 128/128 places, 92/92 transitions.
Treatment of property ShieldPPPt-PT-005A-LTLFireability-15 finished in 22084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F((!p1&&X((G(!p1)||F(!p2))))))))))'
[2024-06-01 15:34:55] [INFO ] Flatten gal took : 14 ms
[2024-06-01 15:34:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-06-01 15:34:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 92 transitions and 364 arcs took 4 ms.
Total runtime 74467 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldPPPt-PT-005A-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717256096214

--------------------
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 ShieldPPPt-PT-005A-LTLFireability-15
ltl formula formula --ltl=/tmp/1201/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 128 places, 92 transitions and 364 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1201/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1201/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1201/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1201/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 129 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 129, there are 116 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~1388 levels ~10000 states ~57108 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~1524!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4327
pnml2lts-mc( 0/ 4): unique states count: 9839
pnml2lts-mc( 0/ 4): unique transitions count: 58500
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1367
pnml2lts-mc( 0/ 4): - claim found count: 7063
pnml2lts-mc( 0/ 4): - claim success count: 9857
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5518
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9857 states 58553 transitions, fanout: 5.940
pnml2lts-mc( 0/ 4): Total exploration time 0.130 sec (0.130 sec minimum, 0.130 sec on average)
pnml2lts-mc( 0/ 4): States per second: 75823, Transitions per second: 450408
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 11.2 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 92 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)

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="ShieldPPPt-PT-005A"
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 ShieldPPPt-PT-005A, 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 r528-tall-171683761400596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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