fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r443-smll-171701110000203
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for UtilityControlRoom-PT-Z2T4N08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
525.535 109781.00 146655.00 778.50 TTFTTFTFFTFFTTFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r443-smll-171701110000203.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is UtilityControlRoom-PT-Z2T4N08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r443-smll-171701110000203
=====================================================================

--------------------
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 1717073948576

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 12:59:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 12:59:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 12:59:10] [INFO ] Load time of PNML (sax parser for PT used): 260 ms
[2024-05-30 12:59:10] [INFO ] Transformed 140 places.
[2024-05-30 12:59:10] [INFO ] Transformed 216 transitions.
[2024-05-30 12:59:10] [INFO ] Parsed PT model containing 140 places and 216 transitions and 680 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 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 13 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2024-05-30 12:59:11] [INFO ] Computed 19 invariants in 34 ms
[2024-05-30 12:59:11] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-30 12:59:11] [INFO ] Invariant cache hit.
[2024-05-30 12:59:11] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-30 12:59:11] [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 7446 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 9958 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 17666ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 17710ms
Finished structural reductions in LTL mode , in 1 iterations and 18436 ms. Remains : 140/140 places, 184/184 transitions.
Support contains 111 out of 140 places after structural reductions.
[2024-05-30 12:59:29] [INFO ] Flatten gal took : 58 ms
[2024-05-30 12:59:29] [INFO ] Flatten gal took : 25 ms
[2024-05-30 12:59:29] [INFO ] Input system was already deterministic with 184 transitions.
RANDOM walk for 40000 steps (8 resets) in 2513 ms. (15 steps per ms) remains 10/29 properties
BEST_FIRST walk for 40003 steps (8 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
[2024-05-30 12:59:31] [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 107 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 121ms 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-05-30 12:59:31] [INFO ] Invariant cache hit.
[2024-05-30 12:59:31] [INFO ] Implicit Places using invariants in 90 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 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 5 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 103 ms. Remains : 139/140 places, 184/184 transitions.
Stuttering acceptance computed with spot in 302 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 20121 reset in 692 ms.
Product exploration explored 100000 steps with 20024 reset in 424 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 262 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 376 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 384 ms. (103 steps per ms) remains 3/11 properties
BEST_FIRST walk for 4202 steps (0 resets) in 57 ms. (72 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 927 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 514 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 489 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 1 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 50 ms. Remains 115 /139 variables (removed 24) and now considering 160/184 (removed 24) transitions.
// Phase 1: matrix 160 rows 115 cols
[2024-05-30 12:59:35] [INFO ] Computed 18 invariants in 2 ms
[2024-05-30 12:59:36] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-30 12:59:36] [INFO ] Invariant cache hit.
[2024-05-30 12:59:36] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-30 12:59:36] [INFO ] Redundant transitions in 9 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-30 12:59:36] [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 5752 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 6845 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 12707ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 12714ms
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 13106 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 632 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 413 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 586 ms. (68 steps per ms) remains 2/11 properties
BEST_FIRST walk for 4965 steps (0 resets) in 17 ms. (275 steps per ms) remains 0/2 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 1295 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 468 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 455 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 534 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 40479 reset in 373 ms.
Product exploration explored 100000 steps with 40567 reset in 461 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 12 ms. Remains 115 /115 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-05-30 12:59:53] [INFO ] Invariant cache hit.
[2024-05-30 12:59:54] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-30 12:59:54] [INFO ] Invariant cache hit.
[2024-05-30 12:59:54] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-05-30 12:59:54] [INFO ] Redundant transitions in 9 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-30 12:59:54] [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 5867 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 6615 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 12609ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 12612ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12917 ms. Remains : 115/115 places, 160/160 transitions.
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-01 finished in 35457 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 20 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2024-05-30 13:00:06] [INFO ] Computed 19 invariants in 10 ms
[2024-05-30 13:00:07] [INFO ] Implicit Places using invariants in 177 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 188 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 8 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 220 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 117 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 361 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 17 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-30 13:00:07] [INFO ] Invariant cache hit.
[2024-05-30 13:00:07] [INFO ] Implicit Places using invariants in 101 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 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 123 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 69 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 120 ms.
Product exploration explored 100000 steps with 50000 reset in 134 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 488 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-05-30 13:00:07] [INFO ] Invariant cache hit.
[2024-05-30 13:00:07] [INFO ] Implicit Places using invariants in 94 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 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 4 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 110 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 97 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Product exploration explored 100000 steps with 50000 reset in 220 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 18 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 660 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 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 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 38 ms. Remains 75 /140 variables (removed 65) and now considering 80/184 (removed 104) transitions.
// Phase 1: matrix 80 rows 75 cols
[2024-05-30 13:00:08] [INFO ] Computed 19 invariants in 1 ms
[2024-05-30 13:00:08] [INFO ] Implicit Places using invariants in 82 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 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 1 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-05-30 13:00:08] [INFO ] Computed 18 invariants in 1 ms
[2024-05-30 13:00:08] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-30 13:00:08] [INFO ] Invariant cache hit.
[2024-05-30 13:00:08] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 188 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 317 ms. Remains : 66/140 places, 72/184 transitions.
Stuttering acceptance computed with spot in 60 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 571 ms.
Stack based approach found an accepted trace after 6310 steps with 0 reset with depth 6311 and stack size 6310 in 44 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-07 finished in 1020 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 1 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 28 ms. Remains 45 /140 variables (removed 95) and now considering 44/184 (removed 140) transitions.
// Phase 1: matrix 44 rows 45 cols
[2024-05-30 13:00:09] [INFO ] Computed 18 invariants in 1 ms
[2024-05-30 13:00:09] [INFO ] Implicit Places using invariants in 70 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 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 3 ms. Remains 36 /44 variables (removed 8) and now considering 36/44 (removed 8) transitions.
// Phase 1: matrix 36 rows 36 cols
[2024-05-30 13:00:09] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 13:00:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 13:00:09] [INFO ] Invariant cache hit.
[2024-05-30 13:00:09] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 97 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 199 ms. Remains : 36/140 places, 36/184 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-08
Product exploration explored 100000 steps with 2729 reset in 192 ms.
Stack based approach found an accepted trace after 609 steps with 21 reset with depth 38 and stack size 37 in 4 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-08 finished in 485 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 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 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 27 ms. Remains 47 /140 variables (removed 93) and now considering 47/184 (removed 137) transitions.
// Phase 1: matrix 47 rows 47 cols
[2024-05-30 13:00:09] [INFO ] Computed 18 invariants in 0 ms
[2024-05-30 13:00:10] [INFO ] Implicit Places using invariants in 85 ms returned [21]
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 : 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-05-30 13:00:10] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 13:00:10] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 13:00:10] [INFO ] Invariant cache hit.
[2024-05-30 13:00:10] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 147 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 266 ms. Remains : 38/140 places, 39/184 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 292 ms.
Stack based approach found an accepted trace after 124 steps with 0 reset with depth 125 and stack size 121 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-10 finished in 623 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 5 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2024-05-30 13:00:10] [INFO ] Computed 19 invariants in 1 ms
[2024-05-30 13:00:10] [INFO ] Implicit Places using invariants in 140 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 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 155 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 98 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 187 ms.
Product exploration explored 100000 steps with 50000 reset in 209 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 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-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-13 finished in 686 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 166 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 0 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 14 ms. Remains 116 /140 variables (removed 24) and now considering 160/184 (removed 24) transitions.
// Phase 1: matrix 160 rows 116 cols
[2024-05-30 13:00:11] [INFO ] Computed 19 invariants in 4 ms
[2024-05-30 13:00:11] [INFO ] Implicit Places using invariants in 140 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 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 6 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 162 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 40501 reset in 434 ms.
Product exploration explored 100000 steps with 40445 reset in 453 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 341 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 564 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 375 ms. (106 steps per ms) remains 3/11 properties
BEST_FIRST walk for 4295 steps (0 resets) in 16 ms. (252 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 978 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 483 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 488 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-05-30 13:00:15] [INFO ] Computed 18 invariants in 2 ms
[2024-05-30 13:00:16] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-30 13:00:16] [INFO ] Invariant cache hit.
[2024-05-30 13:00:16] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-05-30 13:00:16] [INFO ] Redundant transitions in 9 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-30 13:00:16] [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 5809 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 5945 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 11874ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 11877ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12180 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 690 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 492 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 357 ms. (111 steps per ms) remains 3/11 properties
BEST_FIRST walk for 4237 steps (0 resets) in 15 ms. (264 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 1293 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 478 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 484 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 487 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 40380 reset in 590 ms.
Product exploration explored 100000 steps with 40418 reset in 579 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 4 ms. Remains 115 /115 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-05-30 13:00:33] [INFO ] Invariant cache hit.
[2024-05-30 13:00:33] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-30 13:00:33] [INFO ] Invariant cache hit.
[2024-05-30 13:00:33] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-30 13:00:33] [INFO ] Redundant transitions in 2 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-30 13:00:33] [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 5602 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 6792 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 12470ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 12472ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12691 ms. Remains : 115/115 places, 160/160 transitions.
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-01 finished in 34909 ms.
[2024-05-30 13:00:46] [INFO ] Flatten gal took : 23 ms
[2024-05-30 13:00:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-05-30 13:00:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 140 places, 184 transitions and 552 arcs took 10 ms.
Total runtime 95892 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running UtilityControlRoom-PT-Z2T4N08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 140
TRANSITIONS: 184
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.003s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1591
MODEL NAME: /home/mcc/execution/412/model
140 places, 184 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717074058357

--------------------
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

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="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is UtilityControlRoom-PT-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 r443-smll-171701110000203"
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 ;