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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 23K Apr 13 05:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 13 05:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Apr 13 05:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 212K Apr 13 05:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 13 05:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 13 05:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 13 05:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 274K Apr 13 05:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K 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 191K 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-Z4T3N06-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717274282377

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-Z4T3N06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:38:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:38:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:38:04] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-06-01 20:38:04] [INFO ] Transformed 228 places.
[2024-06-01 20:38:04] [INFO ] Transformed 450 transitions.
[2024-06-01 20:38:04] [INFO ] Parsed PT model containing 228 places and 450 transitions and 1446 arcs in 418 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 111 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 222 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Applied a total of 0 rules in 19 ms. Remains 228 /228 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 228 cols
[2024-06-01 20:38:05] [INFO ] Computed 15 invariants in 28 ms
[2024-06-01 20:38:05] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-06-01 20:38:05] [INFO ] Invariant cache hit.
[2024-06-01 20:38:05] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-01 20:38:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 6/228 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 354/582 variables, 228/243 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (OVERLAPS) 0/582 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 243 constraints, problems are : Problem set: 0 solved, 348 unsolved in 17273 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 6/228 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 354/582 variables, 228/243 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 348/591 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/582 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 591 constraints, problems are : Problem set: 0 solved, 348 unsolved in 27059 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints]
After SMT, in 45053ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 45095ms
Finished structural reductions in LTL mode , in 1 iterations and 46017 ms. Remains : 228/228 places, 354/354 transitions.
Support contains 222 out of 228 places after structural reductions.
[2024-06-01 20:38:51] [INFO ] Flatten gal took : 88 ms
[2024-06-01 20:38:51] [INFO ] Flatten gal took : 39 ms
[2024-06-01 20:38:51] [INFO ] Input system was already deterministic with 354 transitions.
RANDOM walk for 40000 steps (8 resets) in 2294 ms. (17 steps per ms) remains 5/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
[2024-06-01 20:38:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 203/582 variables, and 7 constraints, problems are : Problem set: 5 solved, 0 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 7/15 constraints, State Equation: 0/228 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1||G(p2))&&p0))))'
Support contains 156 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 228 transition count 330
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 204 transition count 330
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 198 transition count 324
Applied a total of 60 rules in 62 ms. Remains 198 /228 variables (removed 30) and now considering 324/354 (removed 30) transitions.
// Phase 1: matrix 324 rows 198 cols
[2024-06-01 20:38:53] [INFO ] Computed 15 invariants in 11 ms
[2024-06-01 20:38:53] [INFO ] Implicit Places using invariants in 127 ms returned [161]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 197/228 places, 324/354 transitions.
Applied a total of 0 rules in 12 ms. Remains 197 /197 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 206 ms. Remains : 197/228 places, 324/354 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 1346 ms.
Stack based approach found an accepted trace after 9204 steps with 0 reset with depth 9205 and stack size 9205 in 92 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-00 finished in 2024 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 24 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 21 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 156 cols
[2024-06-01 20:38:55] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 20:38:55] [INFO ] Implicit Places using invariants in 215 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 218 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 12 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 252 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 347 ms.
Product exploration explored 100000 steps with 50000 reset in 259 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 33 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-Z4T3N06-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-02 finished in 1029 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&&F(((p1&&X(X(F(p0))))||G(F(p0))))))))'
Support contains 12 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 20 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2024-06-01 20:38:56] [INFO ] Invariant cache hit.
[2024-06-01 20:38:56] [INFO ] Implicit Places using invariants in 150 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 152 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 175 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 320 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-03
Product exploration explored 100000 steps with 3449 reset in 289 ms.
Product exploration explored 100000 steps with 3445 reset in 308 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 p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 138 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 141 steps (0 resets) in 5 ms. (23 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 9 factoid took 190 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-06-01 20:38:58] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 20:38:58] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 20:38:58] [INFO ] Invariant cache hit.
[2024-06-01 20:38:58] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 20:38:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 11257 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 19864 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 31520ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 31529ms
Finished structural reductions in LTL mode , in 1 iterations and 31943 ms. Remains : 155/155 places, 282/282 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 p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 138 steps (0 resets) in 12 ms. (10 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3424 reset in 282 ms.
Product exploration explored 100000 steps with 3448 reset in 301 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 324 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 155 transition count 306
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 155 transition count 306
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 155 transition count 306
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 72 place count 155 transition count 282
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 152 transition count 210
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 152 transition count 210
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 96 place count 134 transition count 192
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 114 place count 134 transition count 192
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 150 place count 98 transition count 120
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 186 place count 98 transition count 120
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 222 place count 62 transition count 84
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 258 place count 62 transition count 84
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 276 place count 62 transition count 66
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 276 rules in 50 ms. Remains 62 /155 variables (removed 93) and now considering 66/282 (removed 216) transitions.
[2024-06-01 20:39:32] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
// Phase 1: matrix 66 rows 62 cols
[2024-06-01 20:39:32] [INFO ] Computed 14 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 20:39:32] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 12 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 6/62 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 20:39:33] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 3 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 20:39:33] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 20:39:33] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 20:39:33] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 20:39:33] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 5/20 constraints. Problems are: Problem set: 15 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 15 solved, 45 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 6 (OVERLAPS) 66/128 variables, 62/82 constraints. Problems are: Problem set: 18 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/82 constraints. Problems are: Problem set: 18 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/82 constraints. Problems are: Problem set: 18 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 82 constraints, problems are : Problem set: 18 solved, 42 unsolved in 1513 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 18 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 18 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 18 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 18/62 variables, 14/15 constraints. Problems are: Problem set: 18 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 5/20 constraints. Problems are: Problem set: 18 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 18 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 66/128 variables, 62/82 constraints. Problems are: Problem set: 18 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 42/124 constraints. Problems are: Problem set: 18 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/124 constraints. Problems are: Problem set: 18 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/124 constraints. Problems are: Problem set: 18 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 124 constraints, problems are : Problem set: 18 solved, 42 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 42/60 constraints, Known Traps: 6/6 constraints]
After SMT, in 2413ms problems are : Problem set: 18 solved, 42 unsolved
Search for dead transitions found 18 dead transitions in 2414ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/155 places, 48/282 transitions.
Graph (complete) has 84 edges and 62 vertex of which 50 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 50 /62 variables (removed 12) and now considering 48/48 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/155 places, 48/282 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2484 ms. Remains : 50/155 places, 48/282 transitions.
Support contains 12 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 12 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-06-01 20:39:34] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 20:39:35] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 20:39:35] [INFO ] Invariant cache hit.
[2024-06-01 20:39:35] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 20:39:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 12621 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 20655 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 33624ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 33628ms
Finished structural reductions in LTL mode , in 1 iterations and 34022 ms. Remains : 155/155 places, 282/282 transitions.
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-03 finished in 73058 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&&X(F(p1))))))'
Support contains 8 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 9 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 156 cols
[2024-06-01 20:40:09] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 20:40:09] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 20:40:09] [INFO ] Invariant cache hit.
[2024-06-01 20:40:09] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 20:40:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/156 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/438 variables, 156/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 171 constraints, problems are : Problem set: 0 solved, 276 unsolved in 11833 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/156 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/438 variables, 156/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 276/447 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/438 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 447 constraints, problems are : Problem set: 0 solved, 276 unsolved in 18331 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 30508ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 30512ms
Starting structural reductions in LTL mode, iteration 1 : 156/228 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30895 ms. Remains : 156/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-04
Product exploration explored 100000 steps with 6190 reset in 296 ms.
Product exploration explored 100000 steps with 6186 reset in 319 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 p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 65 steps (0 resets) in 6 ms. (9 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-06-01 20:40:41] [INFO ] Invariant cache hit.
[2024-06-01 20:40:41] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-06-01 20:40:41] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-06-01 20:40:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:40:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 20:40:42] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2024-06-01 20:40:42] [INFO ] Computed and/alt/rep : 276/606/276 causal constraints (skipped 0 transitions) in 30 ms.
[2024-06-01 20:40:43] [INFO ] Added : 198 causal constraints over 40 iterations in 1162 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 20:40:43] [INFO ] Invariant cache hit.
[2024-06-01 20:40:43] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 3 factoid took 230 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-04 finished in 34902 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((F(p0)&&(p1||F(p2))))))'
Support contains 59 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 14 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2024-06-01 20:40:44] [INFO ] Invariant cache hit.
[2024-06-01 20:40:44] [INFO ] Implicit Places using invariants in 164 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 181 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-05
Product exploration explored 100000 steps with 3678 reset in 292 ms.
Product exploration explored 100000 steps with 3690 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 p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 182 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
RANDOM walk for 47 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 325 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 59 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 9 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-06-01 20:40:46] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 20:40:46] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 20:40:46] [INFO ] Invariant cache hit.
[2024-06-01 20:40:46] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-06-01 20:40:46] [INFO ] Redundant transitions in 17 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-01 20:40:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 11752 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 19803 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 31894ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 31899ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32225 ms. Remains : 155/155 places, 282/282 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 p0 p2 p1), (X p0), (X p2), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
RANDOM walk for 204 steps (0 resets) in 5 ms. (34 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X p2), (X (X p0)), (X (X p2))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p2))), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 3682 reset in 293 ms.
Product exploration explored 100000 steps with 3683 reset in 313 ms.
Support contains 59 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 8 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-06-01 20:41:19] [INFO ] Invariant cache hit.
[2024-06-01 20:41:19] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 20:41:19] [INFO ] Invariant cache hit.
[2024-06-01 20:41:20] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-06-01 20:41:20] [INFO ] Redundant transitions in 5 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-01 20:41:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 11668 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 32040ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 32045ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32357 ms. Remains : 155/155 places, 282/282 transitions.
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-05 finished in 68146 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 7 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 228 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 132 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 132 transition count 210
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 108 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 105 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 105 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 87 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 87 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 69 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 69 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 51 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 51 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 51 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 396 place count 51 transition count 42
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 408 place count 45 transition count 42
Applied a total of 408 rules in 26 ms. Remains 45 /228 variables (removed 183) and now considering 42/354 (removed 312) transitions.
// Phase 1: matrix 42 rows 45 cols
[2024-06-01 20:41:52] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 20:41:52] [INFO ] Implicit Places using invariants in 50 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/228 places, 42/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79 ms. Remains : 44/228 places, 42/354 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 182 ms.
Stack based approach found an accepted trace after 227 steps with 0 reset with depth 228 and stack size 227 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-06 finished in 315 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 6 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 5 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 156 cols
[2024-06-01 20:41:52] [INFO ] Computed 15 invariants in 5 ms
[2024-06-01 20:41:52] [INFO ] Implicit Places using invariants in 189 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 191 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 199 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 75 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-07 finished in 310 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 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 228 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 132 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 132 transition count 210
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 108 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 105 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 105 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 87 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 87 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 69 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 69 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 51 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 51 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 51 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 396 place count 51 transition count 42
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 408 place count 45 transition count 42
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 418 place count 40 transition count 37
Applied a total of 418 rules in 27 ms. Remains 40 /228 variables (removed 188) and now considering 37/354 (removed 317) transitions.
// Phase 1: matrix 37 rows 40 cols
[2024-06-01 20:41:52] [INFO ] Computed 15 invariants in 15 ms
[2024-06-01 20:41:52] [INFO ] Implicit Places using invariants in 65 ms returned [0, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/228 places, 37/354 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 38 transition count 31
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 32 transition count 31
Applied a total of 12 rules in 3 ms. Remains 32 /38 variables (removed 6) and now considering 31/37 (removed 6) transitions.
// Phase 1: matrix 31 rows 32 cols
[2024-06-01 20:41:52] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 20:41:52] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 20:41:52] [INFO ] Invariant cache hit.
[2024-06-01 20:41:52] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/228 places, 31/354 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 223 ms. Remains : 32/228 places, 31/354 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 260 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-09 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1||F(G(p2)))))))'
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 4 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 156 cols
[2024-06-01 20:41:53] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 20:41:53] [INFO ] Implicit Places using invariants in 160 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 161 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 322 ms.
Stack based approach found an accepted trace after 20849 steps with 0 reset with depth 20850 and stack size 20850 in 81 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-10 finished in 746 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' '!(((p0 U p1)&&G((p2||X(!p2)))))'
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 228 transition count 263
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 118 rules applied. Total rules applied 209 place count 137 transition count 236
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 214 place count 133 transition count 235
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 214 place count 133 transition count 211
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 262 place count 109 transition count 211
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 264 place count 107 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 266 place count 107 transition count 163
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 278 place count 95 transition count 151
Iterating global reduction 3 with 12 rules applied. Total rules applied 290 place count 95 transition count 151
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 302 place count 83 transition count 127
Iterating global reduction 3 with 12 rules applied. Total rules applied 314 place count 83 transition count 127
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 324 place count 73 transition count 107
Iterating global reduction 3 with 10 rules applied. Total rules applied 334 place count 73 transition count 107
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 344 place count 73 transition count 97
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 366 place count 62 transition count 86
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 368 place count 62 transition count 86
Applied a total of 368 rules in 22 ms. Remains 62 /228 variables (removed 166) and now considering 86/354 (removed 268) transitions.
// Phase 1: matrix 86 rows 62 cols
[2024-06-01 20:41:54] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 20:41:54] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 20:41:54] [INFO ] Invariant cache hit.
[2024-06-01 20:41:54] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-06-01 20:41:54] [INFO ] Redundant transitions in 0 ms returned []
Running 72 sub problems to find dead transitions.
[2024-06-01 20:41:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 6/62 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 86/148 variables, 62/77 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/148 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 77 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1526 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 6/62 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 86/148 variables, 62/77 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 72/149 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 149 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1875 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3436ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3436ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/228 places, 86/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3670 ms. Remains : 62/228 places, 86/354 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (OR (NOT p1) p2), false, p2, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 257 ms.
Product exploration explored 100000 steps with 0 reset in 292 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 p1) p0 p2), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p1) (NOT p0)) p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be false thanks to negative knowledge :(X (X p2))
Knowledge based reduction with 11 factoid took 263 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-11 finished in 4709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G(p1)))))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 4 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 156 cols
[2024-06-01 20:41:58] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 20:41:58] [INFO ] Implicit Places using invariants in 173 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 181 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 194 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-15 finished in 294 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&&F(((p1&&X(X(F(p0))))||G(F(p0))))))))'
Found a Shortening insensitive property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-03
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 228 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 228 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 132 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 132 transition count 210
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 108 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 105 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 105 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 87 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 87 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 69 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 69 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 51 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 51 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 51 transition count 48
Applied a total of 396 rules in 17 ms. Remains 51 /228 variables (removed 177) and now considering 48/354 (removed 306) transitions.
// Phase 1: matrix 48 rows 51 cols
[2024-06-01 20:41:59] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 20:41:59] [INFO ] Implicit Places using invariants in 61 ms returned [0, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 64 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 49/228 places, 48/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 85 ms. Remains : 49/228 places, 48/354 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-03
Product exploration explored 100000 steps with 3532 reset in 206 ms.
Product exploration explored 100000 steps with 3505 reset in 241 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 p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 130 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 109 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 9 factoid took 185 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 49 cols
[2024-06-01 20:42:00] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 20:42:01] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 20:42:01] [INFO ] Invariant cache hit.
[2024-06-01 20:42:01] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 42 sub problems to find dead transitions.
[2024-06-01 20:42:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 6/49 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 48/97 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/97 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 62 constraints, problems are : Problem set: 0 solved, 42 unsolved in 888 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 6/49 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 48/97 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 42/104 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/97 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 104 constraints, problems are : Problem set: 0 solved, 42 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1696ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1697ms
Finished structural reductions in LTL mode , in 1 iterations and 1848 ms. Remains : 49/49 places, 48/48 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 p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 110 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3524 reset in 205 ms.
Stack based approach found an accepted trace after 22309 steps with 785 reset with depth 28 and stack size 28 in 48 ms.
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-03 finished in 5320 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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((F(p0)&&(p1||F(p2))))))'
Found a Lengthening insensitive property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-05
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 59 out of 228 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 7 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 156 cols
[2024-06-01 20:42:04] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 20:42:04] [INFO ] Implicit Places using invariants in 123 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 124 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 137 ms. Remains : 155/228 places, 282/354 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-05
Product exploration explored 100000 steps with 3710 reset in 293 ms.
Product exploration explored 100000 steps with 3684 reset in 326 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 p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 178 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
RANDOM walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 304 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 59 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-06-01 20:42:06] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 20:42:06] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 20:42:06] [INFO ] Invariant cache hit.
[2024-06-01 20:42:06] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-06-01 20:42:06] [INFO ] Redundant transitions in 2 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-01 20:42:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 11671 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 20334 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 32353ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 32357ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32641 ms. Remains : 155/155 places, 282/282 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 p0 p2 p1), (X p0), (X p2), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
RANDOM walk for 78 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X p2), (X (X p0)), (X (X p2))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p2))), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 3694 reset in 297 ms.
Product exploration explored 100000 steps with 3685 reset in 313 ms.
Support contains 59 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-06-01 20:42:40] [INFO ] Invariant cache hit.
[2024-06-01 20:42:40] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 20:42:40] [INFO ] Invariant cache hit.
[2024-06-01 20:42:40] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-06-01 20:42:40] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-01 20:42:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10942 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 20301 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 31551ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 31555ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31859 ms. Remains : 155/155 places, 282/282 transitions.
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-05 finished in 67965 ms.
[2024-06-01 20:43:12] [INFO ] Flatten gal took : 29 ms
[2024-06-01 20:43:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 20:43:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 228 places, 354 transitions and 1062 arcs took 30 ms.
Total runtime 308305 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717274593155

--------------------
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-Z4T3N06-LTLCardinality-03
ltl formula formula --ltl=/tmp/1711/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 228 places, 354 transitions and 1062 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.050 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1711/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1711/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1711/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1711/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 230 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 229, there are 363 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~56!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 298
pnml2lts-mc( 0/ 4): unique states count: 464
pnml2lts-mc( 0/ 4): unique transitions count: 1554
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 102
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 467
pnml2lts-mc( 0/ 4): - cum. max stack depth: 169
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 467 states 1576 transitions, fanout: 3.375
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 23350, Transitions per second: 78800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 38.0 B/state, compr.: 4.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 357 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-PT-Z4T3N06-LTLCardinality-05
ltl formula formula --ltl=/tmp/1711/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 228 places, 354 transitions and 1062 arcs
Warning: program compiled against libxml 210 using older 209
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.050 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1711/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1711/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1711/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1711/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 230 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 229, there are 360 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~42 levels ~10000 states ~19796 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~33!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13322
pnml2lts-mc( 0/ 4): unique states count: 13445
pnml2lts-mc( 0/ 4): unique transitions count: 31244
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 16947
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 13448
pnml2lts-mc( 0/ 4): - cum. max stack depth: 152
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13448 states 31266 transitions, fanout: 2.325
pnml2lts-mc( 0/ 4): Total exploration time 0.200 sec (0.200 sec minimum, 0.200 sec on average)
pnml2lts-mc( 0/ 4): States per second: 67240, Transitions per second: 156330
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 17.5 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 357 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~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-Z4T3N06"
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-Z4T3N06, 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-171701111000219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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