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.r480-tall-171624189700652.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 DES-PT-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189700652
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 08:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 08:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 08:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 37K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717192509831

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-05a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:55:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:55:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:55:11] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-31 21:55:11] [INFO ] Transformed 135 places.
[2024-05-31 21:55:11] [INFO ] Transformed 92 transitions.
[2024-05-31 21:55:11] [INFO ] Found NUPN structural information;
[2024-05-31 21:55:11] [INFO ] Parsed PT model containing 135 places and 92 transitions and 457 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-05a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Applied a total of 0 rules in 13 ms. Remains 135 /135 variables (removed 0) and now considering 78/78 (removed 0) transitions.
// Phase 1: matrix 78 rows 135 cols
[2024-05-31 21:55:11] [INFO ] Computed 59 invariants in 9 ms
[2024-05-31 21:55:11] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-31 21:55:11] [INFO ] Invariant cache hit.
[2024-05-31 21:55:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:55:12] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-31 21:55:12] [INFO ] Invariant cache hit.
[2024-05-31 21:55:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 34/180 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 13/194 constraints. Problems are: Problem set: 0 solved, 77 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 78/213 variables, 135/329 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 330 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4143 ms.
Refiners :[Domain max(s): 135/135 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 34/180 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 13/194 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:55:16] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 11 ms to minimize.
[2024-05-31 21:55:17] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 78/213 variables, 135/331 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 77/409 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:55:18] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-31 21:55:19] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (OVERLAPS) 0/213 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 411 constraints, problems are : Problem set: 0 solved, 77 unsolved in 9429 ms.
Refiners :[Domain max(s): 135/135 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints]
After SMT, in 13638ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 13657ms
Finished structural reductions in LTL mode , in 1 iterations and 14165 ms. Remains : 135/135 places, 78/78 transitions.
Support contains 58 out of 135 places after structural reductions.
[2024-05-31 21:55:25] [INFO ] Flatten gal took : 32 ms
[2024-05-31 21:55:26] [INFO ] Flatten gal took : 12 ms
[2024-05-31 21:55:26] [INFO ] Input system was already deterministic with 78 transitions.
Reduction of identical properties reduced properties to check from 32 to 30
RANDOM walk for 40000 steps (872 resets) in 1299 ms. (30 steps per ms) remains 2/30 properties
BEST_FIRST walk for 40003 steps (206 resets) in 263 ms. (151 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (188 resets) in 253 ms. (157 steps per ms) remains 2/2 properties
[2024-05-31 21:55:26] [INFO ] Invariant cache hit.
[2024-05-31 21:55:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/16 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 66/82 variables, 29/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 66/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 40/122 variables, 23/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 40/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/128 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 6/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp30 is UNSAT
At refinement iteration 14 (OVERLAPS) 77/205 variables, 128/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 1/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/213 variables, 7/323 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/213 variables, 7/330 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/213 variables, 0/330 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/213 variables, 0/330 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 330 constraints, problems are : Problem set: 1 solved, 1 unsolved in 131 ms.
Refiners :[Domain max(s): 135/135 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 77/81 variables, 33/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 77/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/122 variables, 23/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 41/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/128 variables, 2/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 6/187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 77/205 variables, 128/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 1/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/213 variables, 7/323 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/213 variables, 7/330 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/213 variables, 1/331 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/213 variables, 0/331 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/213 variables, 0/331 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 331 constraints, problems are : Problem set: 1 solved, 1 unsolved in 138 ms.
Refiners :[Domain max(s): 135/135 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 273ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 223 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=74 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA DES-PT-05a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 38 stabilizing places and 32 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(X((X((!p0&&G(p1))) U (X(p3)&&p2)))))'
Support contains 8 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 15 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
// Phase 1: matrix 77 rows 134 cols
[2024-05-31 21:55:27] [INFO ] Computed 59 invariants in 4 ms
[2024-05-31 21:55:27] [INFO ] Implicit Places using invariants in 102 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 5 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 133/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 601 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p1) p0), (NOT p3), true, (NOT p1)]
Running random walk in product with property : DES-PT-05a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DES-PT-05a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-00 finished in 787 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(F(!p0))||(F(!p0)&&G(!p1)))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 17 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
[2024-05-31 21:55:28] [INFO ] Invariant cache hit.
[2024-05-31 21:55:28] [INFO ] Implicit Places using invariants in 86 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 114 ms. Remains : 133/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 102 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : DES-PT-05a-LTLFireability-01
Product exploration explored 100000 steps with 2241 reset in 378 ms.
Product exploration explored 100000 steps with 2200 reset in 308 ms.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 90 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[p0, (AND p1 p0), p0]
RANDOM walk for 31029 steps (703 resets) in 276 ms. (112 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 152 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 116 ms :[p0, (AND p1 p0), p0]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
// Phase 1: matrix 77 rows 133 cols
[2024-05-31 21:55:29] [INFO ] Computed 58 invariants in 3 ms
[2024-05-31 21:55:29] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-31 21:55:29] [INFO ] Invariant cache hit.
[2024-05-31 21:55:30] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-31 21:55:30] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 21:55:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/210 variables, 133/191 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:55:30] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:55:31] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:55:31] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1934 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/210 variables, 133/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 76/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 270 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5848 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
After SMT, in 7802ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 7804ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8051 ms. Remains : 133/133 places, 77/77 transitions.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 153 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[p0, (AND p1 p0), p0]
RANDOM walk for 24737 steps (544 resets) in 167 ms. (147 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 154 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 105 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 111 ms :[p0, (AND p1 p0), p0]
Product exploration explored 100000 steps with 2208 reset in 213 ms.
Product exploration explored 100000 steps with 2221 reset in 233 ms.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-31 21:55:39] [INFO ] Invariant cache hit.
[2024-05-31 21:55:39] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-31 21:55:39] [INFO ] Invariant cache hit.
[2024-05-31 21:55:39] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-05-31 21:55:39] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 21:55:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/210 variables, 133/191 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:55:40] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:55:40] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:55:40] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1944 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/210 variables, 133/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 76/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 270 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5569 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
After SMT, in 7529ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 7531ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7813 ms. Remains : 133/133 places, 77/77 transitions.
Treatment of property DES-PT-05a-LTLFireability-01 finished in 18891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G((!p0||G(!p1)))) U (X(G((!p0||G(!p1))))&&p2))))'
Support contains 7 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 78/78 (removed 0) transitions.
// Phase 1: matrix 78 rows 135 cols
[2024-05-31 21:55:47] [INFO ] Computed 59 invariants in 3 ms
[2024-05-31 21:55:47] [INFO ] Implicit Places using invariants in 129 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/135 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 134 /134 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 134/135 places, 78/78 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p1 p0), true, p1]
Running random walk in product with property : DES-PT-05a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 272 steps with 6 reset in 2 ms.
FORMULA DES-PT-05a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-02 finished in 321 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(p1)||p0)))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 14 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
// Phase 1: matrix 77 rows 134 cols
[2024-05-31 21:55:47] [INFO ] Computed 59 invariants in 2 ms
[2024-05-31 21:55:47] [INFO ] Implicit Places using invariants in 87 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 4 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 108 ms. Remains : 133/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-05a-LTLFireability-03
Product exploration explored 100000 steps with 18184 reset in 200 ms.
Product exploration explored 100000 steps with 18161 reset in 220 ms.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (905 resets) in 183 ms. (217 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (268 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
// Phase 1: matrix 77 rows 133 cols
[2024-05-31 21:55:48] [INFO ] Computed 58 invariants in 1 ms
Problem apf1 is UNSAT
After SMT solving in domain Real declared 4/210 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 11 ms.
Refiners :[Positive P Invariants (semi-flows): 0/33 constraints, Generalized P Invariants (flows): 0/25 constraints, State Equation: 0/133 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 16ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 10 factoid took 197 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-05-31 21:55:48] [INFO ] Invariant cache hit.
[2024-05-31 21:55:48] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-31 21:55:48] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-31 21:55:48] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-31 21:55:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:55:48] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-31 21:55:48] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 21:55:48] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-31 21:55:48] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-31 21:55:49] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-31 21:55:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2024-05-31 21:55:49] [INFO ] Computed and/alt/rep : 74/240/74 causal constraints (skipped 2 transitions) in 5 ms.
[2024-05-31 21:55:49] [INFO ] Added : 72 causal constraints over 15 iterations in 162 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 4 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-31 21:55:49] [INFO ] Invariant cache hit.
[2024-05-31 21:55:49] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-31 21:55:49] [INFO ] Invariant cache hit.
[2024-05-31 21:55:49] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-05-31 21:55:49] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 21:55:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/210 variables, 133/191 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:55:50] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:55:50] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-31 21:55:50] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1815 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/210 variables, 133/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 76/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 270 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5680 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
After SMT, in 7513ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 7514ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7777 ms. Remains : 133/133 places, 77/77 transitions.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 17 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2024-05-31 21:55:57] [INFO ] Invariant cache hit.
[2024-05-31 21:55:57] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-31 21:55:57] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-31 21:55:57] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-31 21:55:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:55:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-31 21:55:57] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-31 21:55:57] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-31 21:55:57] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:55:57] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-31 21:55:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2024-05-31 21:55:57] [INFO ] Computed and/alt/rep : 74/240/74 causal constraints (skipped 2 transitions) in 5 ms.
[2024-05-31 21:55:57] [INFO ] Added : 72 causal constraints over 15 iterations in 151 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18161 reset in 211 ms.
Product exploration explored 100000 steps with 18147 reset in 211 ms.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 4 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-31 21:55:58] [INFO ] Invariant cache hit.
[2024-05-31 21:55:58] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-31 21:55:58] [INFO ] Invariant cache hit.
[2024-05-31 21:55:58] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-31 21:55:58] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 21:55:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/210 variables, 133/191 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:55:59] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:55:59] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
[2024-05-31 21:55:59] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1806 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/210 variables, 133/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 76/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 270 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5711 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
After SMT, in 7537ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 7539ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7788 ms. Remains : 133/133 places, 77/77 transitions.
Treatment of property DES-PT-05a-LTLFireability-03 finished in 18799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||F(p1))))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 135 /135 variables (removed 0) and now considering 78/78 (removed 0) transitions.
// Phase 1: matrix 78 rows 135 cols
[2024-05-31 21:56:06] [INFO ] Computed 59 invariants in 1 ms
[2024-05-31 21:56:06] [INFO ] Implicit Places using invariants in 94 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/135 places, 78/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 134 /134 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 134/135 places, 78/78 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-05a-LTLFireability-04
Product exploration explored 100000 steps with 2413 reset in 194 ms.
Product exploration explored 100000 steps with 2391 reset in 215 ms.
Computed a total of 37 stabilizing places and 32 stable transitions
Computed a total of 37 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 1154 steps (25 resets) in 34 ms. (32 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 78/78 transitions.
Applied a total of 0 rules in 12 ms. Remains 134 /134 variables (removed 0) and now considering 78/78 (removed 0) transitions.
// Phase 1: matrix 78 rows 134 cols
[2024-05-31 21:56:07] [INFO ] Computed 58 invariants in 1 ms
[2024-05-31 21:56:07] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-31 21:56:07] [INFO ] Invariant cache hit.
[2024-05-31 21:56:07] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-05-31 21:56:07] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-31 21:56:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 12/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 33/178 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 13/192 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 78/212 variables, 134/326 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:56:09] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/212 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:56:09] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:56:09] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-31 21:56:09] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/212 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 330 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3413 ms.
Refiners :[Domain max(s): 134/134 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 12/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 33/178 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 13/192 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:56:11] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-31 21:56:11] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:56:11] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:56:12] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 78/212 variables, 134/334 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 77/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 14 (OVERLAPS) 0/212 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 411 constraints, problems are : Problem set: 0 solved, 77 unsolved in 9159 ms.
Refiners :[Domain max(s): 134/134 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 8/8 constraints]
After SMT, in 12584ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 12586ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12878 ms. Remains : 134/134 places, 78/78 transitions.
Computed a total of 37 stabilizing places and 32 stable transitions
Computed a total of 37 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 470 steps (8 resets) in 14 ms. (31 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 2414 reset in 204 ms.
Product exploration explored 100000 steps with 2401 reset in 216 ms.
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 78/78 transitions.
Applied a total of 0 rules in 4 ms. Remains 134 /134 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-31 21:56:21] [INFO ] Invariant cache hit.
[2024-05-31 21:56:21] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-31 21:56:21] [INFO ] Invariant cache hit.
[2024-05-31 21:56:21] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-05-31 21:56:21] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-31 21:56:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 12/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 33/178 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 13/192 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 78/212 variables, 134/326 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:56:22] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/212 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:56:23] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:56:23] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:56:23] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/212 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 330 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3350 ms.
Refiners :[Domain max(s): 134/134 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 12/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 33/178 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 13/192 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:56:25] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
[2024-05-31 21:56:25] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:56:25] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:56:25] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 78/212 variables, 134/334 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 77/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 14 (OVERLAPS) 0/212 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 411 constraints, problems are : Problem set: 0 solved, 77 unsolved in 9300 ms.
Refiners :[Domain max(s): 134/134 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 8/8 constraints]
After SMT, in 12664ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 12665ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12944 ms. Remains : 134/134 places, 78/78 transitions.
Treatment of property DES-PT-05a-LTLFireability-04 finished in 27967 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)))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 3 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
// Phase 1: matrix 77 rows 134 cols
[2024-05-31 21:56:34] [INFO ] Computed 59 invariants in 2 ms
[2024-05-31 21:56:34] [INFO ] Implicit Places using invariants in 89 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 0 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 133/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05a-LTLFireability-06
Entered a terminal (fully accepting) state of product in 135 steps with 2 reset in 1 ms.
FORMULA DES-PT-05a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-06 finished in 181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 9 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
[2024-05-31 21:56:34] [INFO ] Invariant cache hit.
[2024-05-31 21:56:34] [INFO ] Implicit Places using invariants in 78 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 91 ms. Remains : 133/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-05a-LTLFireability-07
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA DES-PT-05a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-07 finished in 135 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 U (p1||G(!p0))))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 9 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
[2024-05-31 21:56:34] [INFO ] Invariant cache hit.
[2024-05-31 21:56:34] [INFO ] Implicit Places using invariants in 90 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 133/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DES-PT-05a-LTLFireability-08
Product exploration explored 100000 steps with 3550 reset in 204 ms.
Product exploration explored 100000 steps with 3535 reset in 227 ms.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Detected a total of 36/133 stabilizing places and 31/77 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 122 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 1117 steps (23 resets) in 15 ms. (69 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 313 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 11 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
// Phase 1: matrix 77 rows 133 cols
[2024-05-31 21:56:35] [INFO ] Computed 58 invariants in 3 ms
[2024-05-31 21:56:35] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-31 21:56:35] [INFO ] Invariant cache hit.
[2024-05-31 21:56:36] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-05-31 21:56:36] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 21:56:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/210 variables, 133/191 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:56:36] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:56:37] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-31 21:56:37] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1877 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/210 variables, 133/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 76/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 270 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5644 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
After SMT, in 7535ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 7536ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7839 ms. Remains : 133/133 places, 77/77 transitions.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Detected a total of 36/133 stabilizing places and 31/77 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 665 steps (11 resets) in 10 ms. (60 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 280 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 3565 reset in 224 ms.
Product exploration explored 100000 steps with 3593 reset in 227 ms.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-31 21:56:44] [INFO ] Invariant cache hit.
[2024-05-31 21:56:45] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-31 21:56:45] [INFO ] Invariant cache hit.
[2024-05-31 21:56:45] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-31 21:56:45] [INFO ] Redundant transitions in 0 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 21:56:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/210 variables, 133/191 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:56:45] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:56:46] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:56:46] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1865 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/210 variables, 133/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 76/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 270 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5507 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
After SMT, in 7388ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 7390ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7640 ms. Remains : 133/133 places, 77/77 transitions.
Treatment of property DES-PT-05a-LTLFireability-08 finished in 18166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&X(p1)))))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 3 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
// Phase 1: matrix 77 rows 134 cols
[2024-05-31 21:56:52] [INFO ] Computed 59 invariants in 2 ms
[2024-05-31 21:56:52] [INFO ] Implicit Places using invariants in 87 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 133/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-05a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA DES-PT-05a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-09 finished in 304 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 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 3 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
[2024-05-31 21:56:52] [INFO ] Invariant cache hit.
[2024-05-31 21:56:53] [INFO ] Implicit Places using invariants in 89 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 133/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05a-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Detected a total of 36/133 stabilizing places and 31/77 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-05a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-05a-LTLFireability-10 finished in 591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 7 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
[2024-05-31 21:56:53] [INFO ] Invariant cache hit.
[2024-05-31 21:56:53] [INFO ] Implicit Places using invariants in 86 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 133/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-05a-LTLFireability-11
Product exploration explored 100000 steps with 2238 reset in 211 ms.
Product exploration explored 100000 steps with 2237 reset in 230 ms.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Detected a total of 36/133 stabilizing places and 31/77 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 147 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 279 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 7 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
// Phase 1: matrix 77 rows 133 cols
[2024-05-31 21:56:54] [INFO ] Computed 58 invariants in 1 ms
[2024-05-31 21:56:54] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-31 21:56:54] [INFO ] Invariant cache hit.
[2024-05-31 21:56:54] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-31 21:56:55] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 21:56:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/210 variables, 133/191 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:56:55] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:56:55] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:56:55] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1803 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/210 variables, 133/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 76/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 270 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5538 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
After SMT, in 7365ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 7365ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7584 ms. Remains : 133/133 places, 77/77 transitions.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Detected a total of 36/133 stabilizing places and 31/77 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 124 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 20 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 269 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2226 reset in 214 ms.
Product exploration explored 100000 steps with 2226 reset in 246 ms.
Support contains 5 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-31 21:57:03] [INFO ] Invariant cache hit.
[2024-05-31 21:57:03] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-31 21:57:03] [INFO ] Invariant cache hit.
[2024-05-31 21:57:03] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-31 21:57:03] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 21:57:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/210 variables, 133/191 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:57:04] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:57:04] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-31 21:57:04] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1918 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/210 variables, 133/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 76/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 270 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5492 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
After SMT, in 7431ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 7433ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7694 ms. Remains : 133/133 places, 77/77 transitions.
Treatment of property DES-PT-05a-LTLFireability-11 finished in 17731 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(p1)&&X(p2)&&p0))&&X((G(p4)&&p3))))'
Support contains 12 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 3 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
// Phase 1: matrix 77 rows 134 cols
[2024-05-31 21:57:11] [INFO ] Computed 59 invariants in 1 ms
[2024-05-31 21:57:11] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-31 21:57:11] [INFO ] Invariant cache hit.
[2024-05-31 21:57:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:57:11] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-31 21:57:11] [INFO ] Invariant cache hit.
[2024-05-31 21:57:11] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/211 variables, 134/193 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:57:12] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:57:12] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:57:12] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/211 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 197 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2010 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/211 variables, 134/196 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 76/273 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/211 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 273 constraints, problems are : Problem set: 0 solved, 76 unsolved in 4369 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
After SMT, in 6392ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 6393ms
Starting structural reductions in LTL mode, iteration 1 : 134/135 places, 77/78 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6609 ms. Remains : 134/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p4) (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p3) (NOT p4)), (NOT p1), (NOT p2), true, (NOT p4)]
Running random walk in product with property : DES-PT-05a-LTLFireability-12
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA DES-PT-05a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-12 finished in 6919 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)&&F(G(p1))))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 10 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
[2024-05-31 21:57:18] [INFO ] Invariant cache hit.
[2024-05-31 21:57:18] [INFO ] Implicit Places using invariants in 88 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 133/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-05a-LTLFireability-13
Product exploration explored 100000 steps with 2208 reset in 202 ms.
Product exploration explored 100000 steps with 2192 reset in 223 ms.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Support contains 4 out of 133 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
// Phase 1: matrix 77 rows 133 cols
[2024-05-31 21:57:19] [INFO ] Computed 58 invariants in 1 ms
[2024-05-31 21:57:19] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-31 21:57:19] [INFO ] Invariant cache hit.
[2024-05-31 21:57:19] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-31 21:57:19] [INFO ] Redundant transitions in 2 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 21:57:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/210 variables, 133/191 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:57:19] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:57:20] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:57:20] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1908 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/210 variables, 133/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 76/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 270 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5452 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
After SMT, in 7380ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 7381ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7617 ms. Remains : 133/133 places, 77/77 transitions.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
RANDOM walk for 14 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Product exploration explored 100000 steps with 2192 reset in 211 ms.
Product exploration explored 100000 steps with 2207 reset in 222 ms.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-31 21:57:27] [INFO ] Invariant cache hit.
[2024-05-31 21:57:27] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 21:57:27] [INFO ] Invariant cache hit.
[2024-05-31 21:57:27] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-31 21:57:27] [INFO ] Redundant transitions in 0 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 21:57:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/210 variables, 133/191 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:57:28] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 21:57:28] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-31 21:57:28] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1833 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/210 variables, 133/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 76/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 270 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5669 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
After SMT, in 7515ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 7516ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7734 ms. Remains : 133/133 places, 77/77 transitions.
Treatment of property DES-PT-05a-LTLFireability-13 finished in 17065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)||X(X(F(p2)))))'
Support contains 7 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 4 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
// Phase 1: matrix 77 rows 134 cols
[2024-05-31 21:57:35] [INFO ] Computed 59 invariants in 3 ms
[2024-05-31 21:57:35] [INFO ] Implicit Places using invariants in 96 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 0 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 133/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 298 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-05a-LTLFireability-14
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 0 ms.
FORMULA DES-PT-05a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-14 finished in 443 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(F(!p0))||(F(!p0)&&G(!p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||F(p1))))))'
Found a Lengthening insensitive property : DES-PT-05a-LTLFireability-04
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Applied a total of 0 rules in 4 ms. Remains 135 /135 variables (removed 0) and now considering 78/78 (removed 0) transitions.
// Phase 1: matrix 78 rows 135 cols
[2024-05-31 21:57:36] [INFO ] Computed 59 invariants in 2 ms
[2024-05-31 21:57:36] [INFO ] Implicit Places using invariants in 112 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 134/135 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 134 /134 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 119 ms. Remains : 134/135 places, 78/78 transitions.
Running random walk in product with property : DES-PT-05a-LTLFireability-04
Product exploration explored 100000 steps with 2380 reset in 196 ms.
Product exploration explored 100000 steps with 2384 reset in 217 ms.
Computed a total of 37 stabilizing places and 32 stable transitions
Computed a total of 37 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 799 steps (16 resets) in 15 ms. (49 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 78/78 transitions.
Applied a total of 0 rules in 6 ms. Remains 134 /134 variables (removed 0) and now considering 78/78 (removed 0) transitions.
// Phase 1: matrix 78 rows 134 cols
[2024-05-31 21:57:37] [INFO ] Computed 58 invariants in 2 ms
[2024-05-31 21:57:37] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-31 21:57:37] [INFO ] Invariant cache hit.
[2024-05-31 21:57:37] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-05-31 21:57:37] [INFO ] Redundant transitions in 0 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-31 21:57:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 12/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 33/178 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 13/192 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 78/212 variables, 134/326 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:57:39] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/212 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:57:39] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-31 21:57:39] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-31 21:57:39] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/212 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 330 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3456 ms.
Refiners :[Domain max(s): 134/134 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 12/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 33/178 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 13/192 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:57:41] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-31 21:57:41] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:57:41] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:57:42] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 78/212 variables, 134/334 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 77/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 14 (OVERLAPS) 0/212 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 411 constraints, problems are : Problem set: 0 solved, 77 unsolved in 9267 ms.
Refiners :[Domain max(s): 134/134 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 8/8 constraints]
After SMT, in 12735ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 12736ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13068 ms. Remains : 134/134 places, 78/78 transitions.
Computed a total of 37 stabilizing places and 32 stable transitions
Computed a total of 37 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 1494 steps (29 resets) in 22 ms. (64 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 2433 reset in 208 ms.
Product exploration explored 100000 steps with 2398 reset in 218 ms.
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 78/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 134 /134 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-31 21:57:51] [INFO ] Invariant cache hit.
[2024-05-31 21:57:51] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-31 21:57:51] [INFO ] Invariant cache hit.
[2024-05-31 21:57:51] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-05-31 21:57:51] [INFO ] Redundant transitions in 0 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-31 21:57:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 12/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 33/178 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 13/192 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 78/212 variables, 134/326 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:57:53] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/212 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:57:53] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-31 21:57:53] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:57:53] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/212 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 330 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3422 ms.
Refiners :[Domain max(s): 134/134 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 12/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 33/178 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 13/192 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:57:55] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-31 21:57:55] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:57:55] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:57:56] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 78/212 variables, 134/334 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 77/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 14 (OVERLAPS) 0/212 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 411 constraints, problems are : Problem set: 0 solved, 77 unsolved in 9438 ms.
Refiners :[Domain max(s): 134/134 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 8/8 constraints]
After SMT, in 12877ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 12879ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13154 ms. Remains : 134/134 places, 78/78 transitions.
Treatment of property DES-PT-05a-LTLFireability-04 finished in 28420 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 U (p1||G(!p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
[2024-05-31 21:58:04] [INFO ] Flatten gal took : 12 ms
[2024-05-31 21:58:04] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 21:58:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 78 transitions and 393 arcs took 7 ms.
Total runtime 173512 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DES-PT-05a-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-05a-LTLFireability-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-05a-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-05a-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-05a-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-05a-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717192892107

--------------------
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 DES-PT-05a-LTLFireability-01
ltl formula formula --ltl=/tmp/1998/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 135 places, 78 transitions and 393 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( 1/ 4): LTL layer: formula: /tmp/1998/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1998/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1998/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1998/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 137 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 136, there are 91 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~60 levels ~10000 states ~59128 transitions
pnml2lts-mc( 2/ 4): ~60 levels ~20000 states ~132352 transitions
pnml2lts-mc( 2/ 4): ~60 levels ~40000 states ~290668 transitions
pnml2lts-mc( 2/ 4): ~60 levels ~80000 states ~615908 transitions
pnml2lts-mc( 2/ 4): ~61 levels ~160000 states ~1233232 transitions
pnml2lts-mc( 2/ 4): ~61 levels ~320000 states ~2611876 transitions
pnml2lts-mc( 3/ 4): ~229 levels ~640000 states ~4831168 transitions
pnml2lts-mc( 3/ 4): ~229 levels ~1280000 states ~10280636 transitions
pnml2lts-mc( 3/ 4): ~275 levels ~2560000 states ~21533576 transitions
pnml2lts-mc( 3/ 4): ~344 levels ~5120000 states ~45185448 transitions
pnml2lts-mc( 2/ 4): ~561 levels ~10240000 states ~95651828 transitions
pnml2lts-mc( 2/ 4): ~570 levels ~20480000 states ~205643352 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 30620994
pnml2lts-mc( 0/ 4): unique states count: 33546278
pnml2lts-mc( 0/ 4): unique transitions count: 349523560
pnml2lts-mc( 0/ 4): - self-loop count: 962
pnml2lts-mc( 0/ 4): - claim dead count: 290901028
pnml2lts-mc( 0/ 4): - claim found count: 25066061
pnml2lts-mc( 0/ 4): - claim success count: 33546517
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3503
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33546675 states 349527718 transitions, fanout: 10.419
pnml2lts-mc( 0/ 4): Total exploration time 99.440 sec (99.350 sec minimum, 99.378 sec on average)
pnml2lts-mc( 0/ 4): States per second: 337356, Transitions per second: 3514961
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.3MB, 8.1 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 78 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.3MB (~256.0MB paged-in)
ltl formula name DES-PT-05a-LTLFireability-03
ltl formula formula --ltl=/tmp/1998/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 135 places, 78 transitions and 393 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( 1/ 4): LTL layer: formula: /tmp/1998/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1998/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1998/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1998/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 137 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 136, there are 94 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13
pnml2lts-mc( 0/ 4): unique states count: 13
pnml2lts-mc( 0/ 4): unique transitions count: 36
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 39
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 37
pnml2lts-mc( 0/ 4): - cum. max stack depth: 23
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 37 states 126 transitions, fanout: 3.405
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 67.7 B/state, compr.: 12.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 78 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DES-PT-05a-LTLFireability-04
ltl formula formula --ltl=/tmp/1998/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 135 places, 78 transitions and 393 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/1998/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1998/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1998/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1998/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 137 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 136, there are 101 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~46 levels ~10000 states ~35712 transitions
pnml2lts-mc( 2/ 4): ~46 levels ~20000 states ~73312 transitions
pnml2lts-mc( 2/ 4): ~46 levels ~40000 states ~159328 transitions
pnml2lts-mc( 2/ 4): ~62 levels ~80000 states ~376512 transitions
pnml2lts-mc( 2/ 4): ~62 levels ~160000 states ~846760 transitions
pnml2lts-mc( 2/ 4): ~88 levels ~320000 states ~1849560 transitions
pnml2lts-mc( 1/ 4): ~249 levels ~640000 states ~3939828 transitions
pnml2lts-mc( 0/ 4): ~301 levels ~1280000 states ~6218840 transitions
pnml2lts-mc( 1/ 4): ~789 levels ~2560000 states ~15903404 transitions
pnml2lts-mc( 1/ 4): ~878 levels ~5120000 states ~33248644 transitions
pnml2lts-mc( 2/ 4): ~138 levels ~10240000 states ~71557112 transitions
pnml2lts-mc( 1/ 4): ~1017 levels ~20480000 states ~145144220 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 30928366
pnml2lts-mc( 0/ 4): unique states count: 33547690
pnml2lts-mc( 0/ 4): unique transitions count: 260857100
pnml2lts-mc( 0/ 4): - self-loop count: 1494
pnml2lts-mc( 0/ 4): - claim dead count: 211905690
pnml2lts-mc( 0/ 4): - claim found count: 15398855
pnml2lts-mc( 0/ 4): - claim success count: 33549397
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4539
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33550041 states 260886286 transitions, fanout: 7.776
pnml2lts-mc( 0/ 4): Total exploration time 88.950 sec (88.930 sec minimum, 88.940 sec on average)
pnml2lts-mc( 0/ 4): States per second: 377179, Transitions per second: 2932954
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 259.0MB, 8.1 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 78 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 259.0MB (~256.0MB paged-in)
ltl formula name DES-PT-05a-LTLFireability-08
ltl formula formula --ltl=/tmp/1998/ltl_3_
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 135 places, 78 transitions and 393 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.020 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1998/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1998/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1998/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1998/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 136 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 136, there are 90 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~46 levels ~10000 states ~27176 transitions
pnml2lts-mc( 1/ 4): ~46 levels ~20000 states ~76048 transitions
pnml2lts-mc( 1/ 4): ~61 levels ~40000 states ~145216 transitions
pnml2lts-mc( 1/ 4): ~73 levels ~80000 states ~351340 transitions
pnml2lts-mc( 1/ 4): ~73 levels ~160000 states ~772552 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~74!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 172478
pnml2lts-mc( 0/ 4): unique states count: 172770
pnml2lts-mc( 0/ 4): unique transitions count: 795867
pnml2lts-mc( 0/ 4): - self-loop count: 22
pnml2lts-mc( 0/ 4): - claim dead count: 622107
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 172779
pnml2lts-mc( 0/ 4): - cum. max stack depth: 358
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 172779 states 795894 transitions, fanout: 4.606
pnml2lts-mc( 0/ 4): Total exploration time 0.700 sec (0.700 sec minimum, 0.700 sec on average)
pnml2lts-mc( 0/ 4): States per second: 246827, Transitions per second: 1136992
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.7MB, 10.6 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 78 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.7MB (~256.0MB paged-in)
ltl formula name DES-PT-05a-LTLFireability-11
ltl formula formula --ltl=/tmp/1998/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 135 places, 78 transitions and 393 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1998/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1998/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1998/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1998/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 136 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 136, there are 187 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): ~186 levels ~10000 states ~43724 transitions
pnml2lts-mc( 1/ 4): ~256 levels ~20000 states ~105968 transitions
pnml2lts-mc( 1/ 4): ~256 levels ~40000 states ~226852 transitions
pnml2lts-mc( 1/ 4): ~256 levels ~80000 states ~472988 transitions
pnml2lts-mc( 1/ 4): ~303 levels ~160000 states ~921484 transitions
pnml2lts-mc( 1/ 4): ~333 levels ~320000 states ~1975244 transitions
pnml2lts-mc( 1/ 4): ~334 levels ~640000 states ~4151504 transitions
pnml2lts-mc( 1/ 4): ~343 levels ~1280000 states ~9317920 transitions
pnml2lts-mc( 0/ 4): ~456 levels ~2560000 states ~24008448 transitions
pnml2lts-mc( 1/ 4): ~380 levels ~5120000 states ~48161832 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~464!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5542691
pnml2lts-mc( 0/ 4): unique states count: 5543975
pnml2lts-mc( 0/ 4): unique transitions count: 59520286
pnml2lts-mc( 0/ 4): - self-loop count: 653
pnml2lts-mc( 0/ 4): - claim dead count: 53969511
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 5544011
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1441
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5544011 states 59520442 transitions, fanout: 10.736
pnml2lts-mc( 0/ 4): Total exploration time 14.790 sec (14.790 sec minimum, 14.790 sec on average)
pnml2lts-mc( 0/ 4): States per second: 374849, Transitions per second: 4024370
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 43.3MB, 8.2 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 16.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 78 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 43.3MB (~256.0MB paged-in)
ltl formula name DES-PT-05a-LTLFireability-13
ltl formula formula --ltl=/tmp/1998/ltl_5_
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
pnml2lts-mc( 0/ 4): Petri net has 135 places, 78 transitions and 393 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1998/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1998/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1998/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1998/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 136 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 136, there are 105 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~45 levels ~10000 states ~55472 transitions
pnml2lts-mc( 2/ 4): ~45 levels ~20000 states ~120828 transitions
pnml2lts-mc( 2/ 4): ~96 levels ~40000 states ~260968 transitions
pnml2lts-mc( 3/ 4): ~220 levels ~80000 states ~415572 transitions
pnml2lts-mc( 3/ 4): ~225 levels ~160000 states ~879492 transitions
pnml2lts-mc( 3/ 4): ~225 levels ~320000 states ~1918076 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~218!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 325382
pnml2lts-mc( 0/ 4): unique states count: 326065
pnml2lts-mc( 0/ 4): unique transitions count: 2477405
pnml2lts-mc( 0/ 4): - self-loop count: 382
pnml2lts-mc( 0/ 4): - claim dead count: 2148650
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 326078
pnml2lts-mc( 0/ 4): - cum. max stack depth: 789
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 326078 states 2477465 transitions, fanout: 7.598
pnml2lts-mc( 0/ 4): Total exploration time 1.280 sec (1.280 sec minimum, 1.280 sec on average)
pnml2lts-mc( 0/ 4): States per second: 254748, Transitions per second: 1935520
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 3.1MB, 9.9 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 78 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~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="DES-PT-05a"
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 DES-PT-05a, 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 r480-tall-171624189700652"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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