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.r544-smll-171701111000203.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 UtilityControlRoom-PT-Z2T4N08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701111000203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 21K Apr 13 05:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 13 05:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 13 05:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K Apr 13 05:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 57K Apr 13 05:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 302K Apr 13 05:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 83K Apr 13 05:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 13 05:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717273739027

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z2T4N08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:29:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:29:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:29:02] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-06-01 20:29:02] [INFO ] Transformed 140 places.
[2024-06-01 20:29:02] [INFO ] Transformed 216 transitions.
[2024-06-01 20:29:02] [INFO ] Parsed PT model containing 140 places and 216 transitions and 680 arcs in 308 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 111 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 45 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2024-06-01 20:29:02] [INFO ] Computed 19 invariants in 53 ms
[2024-06-01 20:29:03] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-06-01 20:29:03] [INFO ] Invariant cache hit.
[2024-06-01 20:29:03] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-06-01 20:29:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/140 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/324 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 159 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7071 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/140 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/324 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 176/335 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 335 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7801 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 15133ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 15174ms
Finished structural reductions in LTL mode , in 1 iterations and 15964 ms. Remains : 140/140 places, 184/184 transitions.
Support contains 111 out of 140 places after structural reductions.
[2024-06-01 20:29:18] [INFO ] Flatten gal took : 63 ms
[2024-06-01 20:29:18] [INFO ] Flatten gal took : 27 ms
[2024-06-01 20:29:18] [INFO ] Input system was already deterministic with 184 transitions.
RANDOM walk for 40000 steps (8 resets) in 3790 ms. (10 steps per ms) remains 10/29 properties
BEST_FIRST walk for 40002 steps (8 resets) in 474 ms. (84 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
[2024-06-01 20:29:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
After SMT solving in domain Real declared 139/324 variables, and 18 constraints, problems are : Problem set: 10 solved, 0 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, State Equation: 0/140 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p1||G(F(p2))))))))'
Support contains 51 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2024-06-01 20:29:21] [INFO ] Invariant cache hit.
[2024-06-01 20:29:21] [INFO ] Implicit Places using invariants in 101 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/140 places, 184/184 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 139/140 places, 184/184 transitions.
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-01
Product exploration explored 100000 steps with 20047 reset in 561 ms.
Product exploration explored 100000 steps with 20088 reset in 454 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 287 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 410 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 397 ms. (100 steps per ms) remains 3/11 properties
BEST_FIRST walk for 5512 steps (0 resets) in 32 ms. (167 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F p0), (F p1), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 9 factoid took 707 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 374 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false, false, false]
Support contains 51 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 139 transition count 168
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 123 transition count 168
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 48 place count 115 transition count 160
Applied a total of 48 rules in 42 ms. Remains 115 /139 variables (removed 24) and now considering 160/184 (removed 24) transitions.
// Phase 1: matrix 160 rows 115 cols
[2024-06-01 20:29:25] [INFO ] Computed 18 invariants in 3 ms
[2024-06-01 20:29:25] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 20:29:25] [INFO ] Invariant cache hit.
[2024-06-01 20:29:25] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-06-01 20:29:25] [INFO ] Redundant transitions in 7 ms returned []
Running 136 sub problems to find dead transitions.
[2024-06-01 20:29:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 8/115 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 160/275 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/275 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 133 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4266 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 8/115 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 160/275 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 136/269 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 269 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4979 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 9362ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 9369ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/139 places, 160/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9654 ms. Remains : 115/139 places, 160/184 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 17 factoid took 575 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 399 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 353 ms. (112 steps per ms) remains 3/11 properties
BEST_FIRST walk for 5953 steps (0 resets) in 17 ms. (330 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F p0), (F p1), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 17 factoid took 1034 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 387 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 479 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false, false, false]
Product exploration explored 100000 steps with 40438 reset in 401 ms.
Product exploration explored 100000 steps with 40420 reset in 406 ms.
Support contains 51 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 160/160 transitions.
Applied a total of 0 rules in 8 ms. Remains 115 /115 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-06-01 20:29:39] [INFO ] Invariant cache hit.
[2024-06-01 20:29:39] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 20:29:39] [INFO ] Invariant cache hit.
[2024-06-01 20:29:39] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-06-01 20:29:39] [INFO ] Redundant transitions in 6 ms returned []
Running 136 sub problems to find dead transitions.
[2024-06-01 20:29:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 8/115 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 160/275 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/275 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 133 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4299 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 8/115 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 160/275 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 136/269 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 269 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 9413ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 9415ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9644 ms. Remains : 115/115 places, 160/160 transitions.
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-01 finished in 27634 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 8 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 13 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2024-06-01 20:29:48] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 20:29:49] [INFO ] Implicit Places using invariants in 111 ms returned [83]
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 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-02 finished in 243 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 17 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 13 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-06-01 20:29:49] [INFO ] Invariant cache hit.
[2024-06-01 20:29:49] [INFO ] Implicit Places using invariants in 118 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Product exploration explored 100000 steps with 50000 reset in 206 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-03 finished in 588 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 8 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 6 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-06-01 20:29:49] [INFO ] Invariant cache hit.
[2024-06-01 20:29:49] [INFO ] Implicit Places using invariants in 133 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Product exploration explored 100000 steps with 50000 reset in 235 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 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 UtilityControlRoom-PT-Z2T4N08-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-04 finished in 783 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(p1)||G(p2))))'
Support contains 33 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 140 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 108 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 108 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 92 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 91 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 91 transition count 104
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 122 place count 83 transition count 96
Iterating global reduction 2 with 8 rules applied. Total rules applied 130 place count 83 transition count 96
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 138 place count 75 transition count 80
Iterating global reduction 2 with 8 rules applied. Total rules applied 146 place count 75 transition count 80
Applied a total of 146 rules in 30 ms. Remains 75 /140 variables (removed 65) and now considering 80/184 (removed 104) transitions.
// Phase 1: matrix 80 rows 75 cols
[2024-06-01 20:29:50] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 20:29:50] [INFO ] Implicit Places using invariants in 69 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/140 places, 80/184 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 66 transition count 72
Applied a total of 16 rules in 6 ms. Remains 66 /74 variables (removed 8) and now considering 72/80 (removed 8) transitions.
// Phase 1: matrix 72 rows 66 cols
[2024-06-01 20:29:50] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 20:29:50] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 20:29:50] [INFO ] Invariant cache hit.
[2024-06-01 20:29:50] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/140 places, 72/184 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 250 ms. Remains : 66/140 places, 72/184 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 601 ms.
Stack based approach found an accepted trace after 2463 steps with 0 reset with depth 2464 and stack size 2464 in 24 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-07 finished in 949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p0)))))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 140 transition count 154
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 77 place count 110 transition count 137
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 108 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 80 place count 108 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 112 place count 92 transition count 120
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 91 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 91 transition count 104
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 122 place count 83 transition count 96
Iterating global reduction 3 with 8 rules applied. Total rules applied 130 place count 83 transition count 96
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 138 place count 75 transition count 80
Iterating global reduction 3 with 8 rules applied. Total rules applied 146 place count 75 transition count 80
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 153 place count 68 transition count 73
Iterating global reduction 3 with 7 rules applied. Total rules applied 160 place count 68 transition count 73
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 167 place count 68 transition count 66
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 167 place count 68 transition count 59
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 181 place count 61 transition count 59
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 198 place count 52 transition count 51
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 212 place count 45 transition count 44
Applied a total of 212 rules in 32 ms. Remains 45 /140 variables (removed 95) and now considering 44/184 (removed 140) transitions.
// Phase 1: matrix 44 rows 45 cols
[2024-06-01 20:29:51] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 20:29:51] [INFO ] Implicit Places using invariants in 57 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/140 places, 44/184 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 36 transition count 36
Applied a total of 16 rules in 4 ms. Remains 36 /44 variables (removed 8) and now considering 36/44 (removed 8) transitions.
// Phase 1: matrix 36 rows 36 cols
[2024-06-01 20:29:51] [INFO ] Computed 17 invariants in 0 ms
[2024-06-01 20:29:51] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 20:29:51] [INFO ] Invariant cache hit.
[2024-06-01 20:29:51] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/140 places, 36/184 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 206 ms. Remains : 36/140 places, 36/184 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-08
Product exploration explored 100000 steps with 2648 reset in 256 ms.
Stack based approach found an accepted trace after 93 steps with 2 reset with depth 28 and stack size 27 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-08 finished in 565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 140 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 108 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 108 transition count 120
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 92 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 91 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 91 transition count 104
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 121 place count 84 transition count 97
Iterating global reduction 2 with 7 rules applied. Total rules applied 128 place count 84 transition count 97
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 135 place count 77 transition count 83
Iterating global reduction 2 with 7 rules applied. Total rules applied 142 place count 77 transition count 83
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 149 place count 70 transition count 76
Iterating global reduction 2 with 7 rules applied. Total rules applied 156 place count 70 transition count 76
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 163 place count 70 transition count 69
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 163 place count 70 transition count 62
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 177 place count 63 transition count 62
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 196 place count 53 transition count 53
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 208 place count 47 transition count 47
Applied a total of 208 rules in 26 ms. Remains 47 /140 variables (removed 93) and now considering 47/184 (removed 137) transitions.
// Phase 1: matrix 47 rows 47 cols
[2024-06-01 20:29:52] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 20:29:52] [INFO ] Implicit Places using invariants in 77 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/140 places, 47/184 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 38 transition count 39
Applied a total of 16 rules in 4 ms. Remains 38 /46 variables (removed 8) and now considering 39/47 (removed 8) transitions.
// Phase 1: matrix 39 rows 38 cols
[2024-06-01 20:29:52] [INFO ] Computed 17 invariants in 0 ms
[2024-06-01 20:29:52] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 20:29:52] [INFO ] Invariant cache hit.
[2024-06-01 20:29:52] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/140 places, 39/184 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 238 ms. Remains : 38/140 places, 39/184 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 197 ms.
Stack based approach found an accepted trace after 261 steps with 0 reset with depth 262 and stack size 249 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-10 finished in 486 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 1 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 4 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2024-06-01 20:29:52] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 20:29:52] [INFO ] Implicit Places using invariants in 96 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-13 finished in 489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p1||G(F(p2))))))))'
Found a Shortening insensitive property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-01
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 51 out of 140 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 140 transition count 168
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 124 transition count 168
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 48 place count 116 transition count 160
Applied a total of 48 rules in 10 ms. Remains 116 /140 variables (removed 24) and now considering 160/184 (removed 24) transitions.
// Phase 1: matrix 160 rows 116 cols
[2024-06-01 20:29:53] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 20:29:53] [INFO ] Implicit Places using invariants in 95 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 115/140 places, 160/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 115 /115 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 111 ms. Remains : 115/140 places, 160/184 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-01
Product exploration explored 100000 steps with 40498 reset in 271 ms.
Product exploration explored 100000 steps with 40515 reset in 313 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 484 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 278 ms. (143 steps per ms) remains 3/11 properties
BEST_FIRST walk for 2698 steps (0 resets) in 10 ms. (245 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F p0), (F p1), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 7 factoid took 756 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 374 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false, false, false]
Support contains 51 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 160/160 transitions.
Applied a total of 0 rules in 6 ms. Remains 115 /115 variables (removed 0) and now considering 160/160 (removed 0) transitions.
// Phase 1: matrix 160 rows 115 cols
[2024-06-01 20:29:56] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 20:29:56] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 20:29:56] [INFO ] Invariant cache hit.
[2024-06-01 20:29:56] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-06-01 20:29:56] [INFO ] Redundant transitions in 8 ms returned []
Running 136 sub problems to find dead transitions.
[2024-06-01 20:29:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 8/115 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 160/275 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/275 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 133 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4452 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 8/115 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 160/275 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 136/269 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 269 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4877 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 9411ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 9413ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9651 ms. Remains : 115/115 places, 160/160 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 17 factoid took 556 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 388 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 186 ms. (213 steps per ms) remains 3/11 properties
BEST_FIRST walk for 2836 steps (0 resets) in 9 ms. (283 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F p0), (F p1), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 17 factoid took 1024 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 393 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 416 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false, false, false]
Product exploration explored 100000 steps with 40356 reset in 381 ms.
Product exploration explored 100000 steps with 40366 reset in 398 ms.
Support contains 51 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 160/160 transitions.
Applied a total of 0 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-06-01 20:30:10] [INFO ] Invariant cache hit.
[2024-06-01 20:30:10] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 20:30:10] [INFO ] Invariant cache hit.
[2024-06-01 20:30:10] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-06-01 20:30:10] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2024-06-01 20:30:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 8/115 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 160/275 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/275 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 133 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4596 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 8/115 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 160/275 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 136/269 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 269 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5087 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 9754ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 9757ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9987 ms. Remains : 115/115 places, 160/160 transitions.
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-01 finished in 27412 ms.
[2024-06-01 20:30:20] [INFO ] Flatten gal took : 35 ms
[2024-06-01 20:30:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 20:30:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 140 places, 184 transitions and 552 arcs took 8 ms.
Total runtime 78783 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717273821655

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name UtilityControlRoom-PT-Z2T4N08-LTLCardinality-01
ltl formula formula --ltl=/tmp/1555/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 140 places, 184 transitions and 552 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.030 real 0.020 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1555/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1555/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1555/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1555/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 142 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 141, there are 188 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): ~18 levels ~10000 states ~12116 transitions
pnml2lts-mc( 3/ 4): ~17 levels ~20000 states ~25096 transitions
pnml2lts-mc( 3/ 4): ~17 levels ~40000 states ~51352 transitions
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: 76545
pnml2lts-mc( 0/ 4): unique states count: 76545
pnml2lts-mc( 0/ 4): unique transitions count: 104976
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 28938
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 76760
pnml2lts-mc( 0/ 4): - cum. max stack depth: 69
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 76760 states 106519 transitions, fanout: 1.388
pnml2lts-mc( 0/ 4): Total exploration time 0.640 sec (0.640 sec minimum, 0.640 sec on average)
pnml2lts-mc( 0/ 4): States per second: 119938, Transitions per second: 166436
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, 23.1 B/state, compr.: 4.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 184 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)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-PT-Z2T4N08"
export BK_EXAMINATION="LTLCardinality"
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 UtilityControlRoom-PT-Z2T4N08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r544-smll-171701111000203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z2T4N08.tgz
mv UtilityControlRoom-PT-Z2T4N08 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;