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

About the Execution of LTSMin+red for UtilityControlRoom-PT-Z4T3N08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
981.880 461807.00 784304.00 1602.00 FFFFFF?TTFFTFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r544-smll-171701111000227.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-Z4T3N08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701111000227
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 35K Apr 13 05:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 166K Apr 13 05:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 104K Apr 13 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 385K Apr 13 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 76K Apr 13 06:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 368K Apr 13 06:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 142K Apr 13 06:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 541K Apr 13 06:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K 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 255K 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-Z4T3N08-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717274774049

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-Z4T3N08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:46:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:46:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:46:16] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2024-06-01 20:46:16] [INFO ] Transformed 302 places.
[2024-06-01 20:46:16] [INFO ] Transformed 600 transitions.
[2024-06-01 20:46:16] [INFO ] Parsed PT model containing 302 places and 600 transitions and 1928 arcs in 334 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 294 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 28 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2024-06-01 20:46:16] [INFO ] Computed 19 invariants in 50 ms
[2024-06-01 20:46:17] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-06-01 20:46:17] [INFO ] Invariant cache hit.
[2024-06-01 20:46:17] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 973 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2024-06-01 20:46:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/302 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/774 variables, 302/321 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/774 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 464 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 321 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/302 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/774 variables, 302/321 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 464/785 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/774 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 774/774 variables, and 785 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
After SMT, in 61163ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 61207ms
Finished structural reductions in LTL mode , in 1 iterations and 62250 ms. Remains : 302/302 places, 472/472 transitions.
Support contains 294 out of 302 places after structural reductions.
[2024-06-01 20:47:19] [INFO ] Flatten gal took : 128 ms
[2024-06-01 20:47:19] [INFO ] Flatten gal took : 51 ms
[2024-06-01 20:47:19] [INFO ] Input system was already deterministic with 472 transitions.
RANDOM walk for 40000 steps (8 resets) in 3403 ms. (11 steps per ms) remains 5/30 properties
BEST_FIRST walk for 40003 steps (8 resets) in 399 ms. (100 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
[2024-06-01 20:47:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 275/302 variables, 19/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 472/774 variables, 302/321 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 0/321 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/774 variables, 0/321 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 321 constraints, problems are : Problem set: 3 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 273/298 variables, 18/18 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/302 variables, 1/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 472/774 variables, 302/321 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/774 variables, 1/322 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/774 variables, 0/322 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/774 variables, 0/322 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 322 constraints, problems are : Problem set: 3 solved, 1 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 754ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 210 ms.
Support contains 25 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 472/472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 174 transition count 280
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 142 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 139 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 139 transition count 184
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 382 place count 115 transition count 160
Iterating global reduction 2 with 24 rules applied. Total rules applied 406 place count 115 transition count 160
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 91 transition count 112
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 91 transition count 112
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 478 place count 67 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 502 place count 67 transition count 88
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 526 place count 67 transition count 64
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 526 place count 67 transition count 56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 542 place count 59 transition count 56
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 550 place count 59 transition count 48
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 558 place count 51 transition count 48
Applied a total of 558 rules in 127 ms. Remains 51 /302 variables (removed 251) and now considering 48/472 (removed 424) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 51/302 places, 48/472 transitions.
RANDOM walk for 6464 steps (1 resets) in 73 ms. (87 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLCardinality-11 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((p0&&F(G(p0)))))'
Support contains 32 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 291 place count 171 transition count 216
Iterating global reduction 2 with 3 rules applied. Total rules applied 294 place count 171 transition count 216
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 318 place count 147 transition count 192
Iterating global reduction 2 with 24 rules applied. Total rules applied 342 place count 147 transition count 192
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 375 place count 130 transition count 176
Applied a total of 375 rules in 64 ms. Remains 130 /302 variables (removed 172) and now considering 176/472 (removed 296) transitions.
// Phase 1: matrix 176 rows 130 cols
[2024-06-01 20:47:22] [INFO ] Computed 18 invariants in 2 ms
[2024-06-01 20:47:22] [INFO ] Implicit Places using invariants in 113 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/302 places, 176/472 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 121 transition count 168
Applied a total of 16 rules in 12 ms. Remains 121 /129 variables (removed 8) and now considering 168/176 (removed 8) transitions.
// Phase 1: matrix 168 rows 121 cols
[2024-06-01 20:47:22] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 20:47:22] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 20:47:22] [INFO ] Invariant cache hit.
[2024-06-01 20:47:23] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/302 places, 168/472 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 444 ms. Remains : 121/302 places, 168/472 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 537 ms.
Stack based approach found an accepted trace after 128 steps with 0 reset with depth 129 and stack size 129 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLCardinality-00 finished in 1284 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 68 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 13 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2024-06-01 20:47:23] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 20:47:24] [INFO ] Implicit Places using invariants in 156 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 157 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 173 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 627 ms.
Entered a terminal (fully accepting) state of product in 16546 steps with 0 reset in 120 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLCardinality-01 finished in 1140 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((X(X((p0&&F(G(p1)))))||(p1 U (p2||G(p1)))))))'
Support contains 70 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 16 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-06-01 20:47:25] [INFO ] Invariant cache hit.
[2024-06-01 20:47:25] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 20:47:25] [INFO ] Invariant cache hit.
[2024-06-01 20:47:25] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-06-01 20:47:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/582 variables, 206/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/582 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 225 constraints, problems are : Problem set: 0 solved, 368 unsolved in 19515 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/582 variables, 206/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 368/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/582 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 593 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 50213ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 50220ms
Starting structural reductions in LTL mode, iteration 1 : 206/302 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50646 ms. Remains : 206/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 396 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLCardinality-02 finished in 51077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(F(p1)))))'
Support contains 172 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2024-06-01 20:48:16] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 20:48:16] [INFO ] Implicit Places using invariants in 198 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 200 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/302 places, 472/472 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 208 ms. Remains : 301/302 places, 472/472 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLCardinality-03 finished in 400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 48 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 291 place count 171 transition count 216
Iterating global reduction 2 with 3 rules applied. Total rules applied 294 place count 171 transition count 216
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 318 place count 147 transition count 192
Iterating global reduction 2 with 24 rules applied. Total rules applied 342 place count 147 transition count 192
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 358 place count 139 transition count 184
Applied a total of 358 rules in 25 ms. Remains 139 /302 variables (removed 163) and now considering 184/472 (removed 288) transitions.
// Phase 1: matrix 184 rows 139 cols
[2024-06-01 20:48:16] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 20:48:16] [INFO ] Implicit Places using invariants in 100 ms returned [0, 106]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 101 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/302 places, 184/472 transitions.
Applied a total of 0 rules in 7 ms. Remains 137 /137 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 137/302 places, 184/472 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLCardinality-04
Product exploration explored 100000 steps with 13 reset in 399 ms.
Product exploration explored 100000 steps with 5 reset in 547 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), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 26685 steps (6 resets) in 146 ms. (181 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 48 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 184/184 transitions.
Applied a total of 0 rules in 8 ms. Remains 137 /137 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 137 cols
[2024-06-01 20:48:18] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 20:48:18] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 20:48:18] [INFO ] Invariant cache hit.
[2024-06-01 20:48:18] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-06-01 20:48:18] [INFO ] Redundant transitions in 8 ms returned []
Running 152 sub problems to find dead transitions.
[2024-06-01 20:48:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 8/137 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 184/321 variables, 137/154 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/321 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 154 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5239 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 8/137 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 184/321 variables, 137/154 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 152/306 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 306 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5961 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 11258ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 11261ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11502 ms. Remains : 137/137 places, 184/184 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 26694 steps (6 resets) in 74 ms. (355 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 145 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 322 ms.
Product exploration explored 100000 steps with 14 reset in 427 ms.
Support contains 48 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 184/184 transitions.
Applied a total of 0 rules in 6 ms. Remains 137 /137 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2024-06-01 20:48:31] [INFO ] Invariant cache hit.
[2024-06-01 20:48:31] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 20:48:31] [INFO ] Invariant cache hit.
[2024-06-01 20:48:31] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-06-01 20:48:31] [INFO ] Redundant transitions in 10 ms returned []
Running 152 sub problems to find dead transitions.
[2024-06-01 20:48:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 8/137 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 184/321 variables, 137/154 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/321 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 154 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5594 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 8/137 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 184/321 variables, 137/154 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 152/306 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 306 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5693 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 11335ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 11338ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11615 ms. Remains : 137/137 places, 184/184 transitions.
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLCardinality-04 finished in 26754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0))||F(p1)) U (G((p1 U p2))||G(p1))))'
Support contains 49 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 4 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2024-06-01 20:48:43] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 20:48:43] [INFO ] Implicit Places using invariants in 170 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 172 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 178 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLCardinality-05
Product exploration explored 100000 steps with 19901 reset in 365 ms.
Product exploration explored 100000 steps with 19866 reset in 362 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) p2 p0), (X p2), (X (AND p2 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 12 factoid took 419 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 40000 steps (8 resets) in 397 ms. (100 steps per ms) remains 1/11 properties
BEST_FIRST walk for 549 steps (0 resets) in 7 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND p2 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p1) p2 p0))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 12 factoid took 1006 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 396 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 347 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 49 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 205 cols
[2024-06-01 20:48:47] [INFO ] Computed 18 invariants in 3 ms
[2024-06-01 20:48:47] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 20:48:47] [INFO ] Invariant cache hit.
[2024-06-01 20:48:47] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-06-01 20:48:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 19242 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 49820ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 49825ms
Finished structural reductions in LTL mode , in 1 iterations and 50295 ms. Remains : 205/205 places, 376/376 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) p2 p0), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 12 factoid took 426 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 33347 steps (7 resets) in 125 ms. (264 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p1) p2 p0))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 12 factoid took 1006 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 342 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 343 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 19890 reset in 358 ms.
Product exploration explored 100000 steps with 19827 reset in 381 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 49 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 205 transition count 400
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 40 rules in 24 ms. Remains 205 /205 variables (removed 0) and now considering 400/376 (removed -24) transitions.
[2024-06-01 20:49:41] [INFO ] Redundant transitions in 12 ms returned []
Running 368 sub problems to find dead transitions.
// Phase 1: matrix 400 rows 205 cols
[2024-06-01 20:49:41] [INFO ] Computed 18 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-01 20:49:47] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 8 ms to minimize.
[2024-06-01 20:49:47] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:49:47] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
[2024-06-01 20:49:47] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 2 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
[2024-06-01 20:49:47] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:49:48] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:49:48] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
[2024-06-01 20:49:48] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
[2024-06-01 20:49:48] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
[2024-06-01 20:49:48] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
[2024-06-01 20:49:48] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 11/29 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/29 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 5 (OVERLAPS) 400/605 variables, 205/234 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 0/234 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 0/605 variables, 0/234 constraints. Problems are: Problem set: 64 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 605/605 variables, and 234 constraints, problems are : Problem set: 64 solved, 304 unsolved in 19263 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 64 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 48/205 variables, 18/18 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 11/29 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/29 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 400/605 variables, 205/234 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/605 variables, 304/538 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 0/538 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 0/605 variables, 0/538 constraints. Problems are: Problem set: 64 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Int declared 605/605 variables, and 538 constraints, problems are : Problem set: 64 solved, 304 unsolved in 25484 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 304/368 constraints, Known Traps: 11/11 constraints]
After SMT, in 45415ms problems are : Problem set: 64 solved, 304 unsolved
Search for dead transitions found 64 dead transitions in 45420ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 205/205 places, 336/376 transitions.
Graph (complete) has 560 edges and 205 vertex of which 165 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Discarding 40 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 165 /205 variables (removed 40) and now considering 336/336 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 165/205 places, 336/376 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45490 ms. Remains : 165/205 places, 336/376 transitions.
Support contains 49 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 205 cols
[2024-06-01 20:50:27] [INFO ] Computed 18 invariants in 4 ms
[2024-06-01 20:50:27] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-01 20:50:27] [INFO ] Invariant cache hit.
[2024-06-01 20:50:27] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-06-01 20:50:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 19561 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 50180ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 50186ms
Finished structural reductions in LTL mode , in 1 iterations and 50679 ms. Remains : 205/205 places, 376/376 transitions.
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLCardinality-05 finished in 154790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 25 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 174 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 142 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 139 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 139 transition count 184
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 382 place count 115 transition count 160
Iterating global reduction 2 with 24 rules applied. Total rules applied 406 place count 115 transition count 160
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 91 transition count 112
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 91 transition count 112
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 478 place count 67 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 502 place count 67 transition count 88
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 526 place count 67 transition count 64
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 526 place count 67 transition count 56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 542 place count 59 transition count 56
Applied a total of 542 rules in 18 ms. Remains 59 /302 variables (removed 243) and now considering 56/472 (removed 416) transitions.
// Phase 1: matrix 56 rows 59 cols
[2024-06-01 20:51:18] [INFO ] Computed 19 invariants in 0 ms
[2024-06-01 20:51:18] [INFO ] Implicit Places using invariants in 59 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/302 places, 56/472 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 58/302 places, 56/472 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLCardinality-06
Product exploration explored 100000 steps with 3 reset in 238 ms.
Product exploration explored 100000 steps with 2 reset in 267 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 : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30173 steps (6 resets) in 94 ms. (317 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 25 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 58 cols
[2024-06-01 20:51:19] [INFO ] Computed 18 invariants in 0 ms
[2024-06-01 20:51:19] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 20:51:19] [INFO ] Invariant cache hit.
[2024-06-01 20:51:19] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-06-01 20:51:19] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-01 20:51:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/58 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/114 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 76 constraints, problems are : Problem set: 0 solved, 48 unsolved in 958 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/58 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/114 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 48/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 124 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1109 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 2079ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2080ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2226 ms. Remains : 58/58 places, 56/56 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 31301 steps (6 resets) in 79 ms. (391 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6 reset in 242 ms.
Product exploration explored 100000 steps with 3 reset in 262 ms.
Support contains 25 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-06-01 20:51:22] [INFO ] Invariant cache hit.
[2024-06-01 20:51:22] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 20:51:22] [INFO ] Invariant cache hit.
[2024-06-01 20:51:22] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-06-01 20:51:22] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-01 20:51:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/58 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/114 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 76 constraints, problems are : Problem set: 0 solved, 48 unsolved in 972 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/58 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/114 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 48/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 124 constraints, problems are : Problem set: 0 solved, 48 unsolved in 903 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1886ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1887ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2028 ms. Remains : 58/58 places, 56/56 transitions.
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLCardinality-06 finished in 6526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 174 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 142 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 139 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 139 transition count 184
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 382 place count 115 transition count 160
Iterating global reduction 2 with 24 rules applied. Total rules applied 406 place count 115 transition count 160
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 91 transition count 112
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 91 transition count 112
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 478 place count 67 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 502 place count 67 transition count 88
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 526 place count 67 transition count 64
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 526 place count 67 transition count 56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 542 place count 59 transition count 56
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 559 place count 50 transition count 48
Applied a total of 559 rules in 27 ms. Remains 50 /302 variables (removed 252) and now considering 48/472 (removed 424) transitions.
// Phase 1: matrix 48 rows 50 cols
[2024-06-01 20:51:24] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 20:51:24] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 20:51:24] [INFO ] Invariant cache hit.
[2024-06-01 20:51:24] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-06-01 20:51:24] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2024-06-01 20:51:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 8/50 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 48/98 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/98 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 68 constraints, problems are : Problem set: 0 solved, 40 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 8/50 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 48/98 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 40/108 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/98 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 108 constraints, problems are : Problem set: 0 solved, 40 unsolved in 749 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1413ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1413ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/302 places, 48/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1572 ms. Remains : 50/302 places, 48/472 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 169 ms.
Stack based approach found an accepted trace after 626 steps with 0 reset with depth 627 and stack size 627 in 2 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLCardinality-09 finished in 1829 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||X(X(F(p1)))))) U G(p2)))'
Support contains 5 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 302 transition count 385
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Iterating post reduction 1 with 146 rules applied. Total rules applied 233 place count 215 transition count 326
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 279 place count 178 transition count 317
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 279 place count 178 transition count 286
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 341 place count 147 transition count 286
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 344 place count 144 transition count 283
Iterating global reduction 3 with 3 rules applied. Total rules applied 347 place count 144 transition count 283
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 349 place count 142 transition count 219
Iterating global reduction 3 with 2 rules applied. Total rules applied 351 place count 142 transition count 219
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 366 place count 127 transition count 204
Iterating global reduction 3 with 15 rules applied. Total rules applied 381 place count 127 transition count 204
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 396 place count 112 transition count 174
Iterating global reduction 3 with 15 rules applied. Total rules applied 411 place count 112 transition count 174
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 424 place count 99 transition count 148
Iterating global reduction 3 with 13 rules applied. Total rules applied 437 place count 99 transition count 148
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 450 place count 99 transition count 135
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 478 place count 85 transition count 121
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 482 place count 83 transition count 119
Applied a total of 482 rules in 34 ms. Remains 83 /302 variables (removed 219) and now considering 119/472 (removed 353) transitions.
// Phase 1: matrix 119 rows 83 cols
[2024-06-01 20:51:26] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 20:51:26] [INFO ] Implicit Places using invariants in 80 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/302 places, 119/472 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 74 transition count 111
Applied a total of 16 rules in 5 ms. Remains 74 /82 variables (removed 8) and now considering 111/119 (removed 8) transitions.
// Phase 1: matrix 111 rows 74 cols
[2024-06-01 20:51:26] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 20:51:26] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 20:51:26] [INFO ] Invariant cache hit.
[2024-06-01 20:51:26] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/302 places, 111/472 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 287 ms. Remains : 74/302 places, 111/472 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLCardinality-10
Product exploration explored 100000 steps with 23803 reset in 258 ms.
Stack based approach found an accepted trace after 12964 steps with 2855 reset with depth 23 and stack size 23 in 38 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLCardinality-10 finished in 717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(G(p1))))))'
Support contains 4 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 6 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2024-06-01 20:51:27] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 20:51:27] [INFO ] Implicit Places using invariants in 208 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 210 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 220 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLCardinality-12 finished in 371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(F((p1||X(F(p2))))))))'
Support contains 4 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 95 place count 207 transition count 377
Iterating global reduction 0 with 95 rules applied. Total rules applied 190 place count 207 transition count 377
Applied a total of 190 rules in 6 ms. Remains 207 /302 variables (removed 95) and now considering 377/472 (removed 95) transitions.
// Phase 1: matrix 377 rows 207 cols
[2024-06-01 20:51:27] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 20:51:27] [INFO ] Implicit Places using invariants in 216 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 217 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 206/302 places, 377/472 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 377/377 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 226 ms. Remains : 206/302 places, 377/472 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLCardinality-13
Product exploration explored 100000 steps with 186 reset in 497 ms.
Product exploration explored 100000 steps with 178 reset in 518 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 9639 steps (1 resets) in 50 ms. (189 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F p0)]
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
// Phase 1: matrix 377 rows 206 cols
[2024-06-01 20:51:29] [INFO ] Computed 18 invariants in 2 ms
[2024-06-01 20:51:30] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned unsat
Proved EG (NOT p0)
[2024-06-01 20:51:30] [INFO ] Invariant cache hit.
[2024-06-01 20:51:30] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned unsat
Proved EG (AND (NOT p1) (NOT p2))
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F p0), (G (NOT p0)), (G (AND (NOT p1) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 234 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLCardinality-13 finished in 3226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 1 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 6 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2024-06-01 20:51:30] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 20:51:30] [INFO ] Implicit Places using invariants in 209 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 215 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 225 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 80 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLCardinality-14
Product exploration explored 100000 steps with 573 reset in 302 ms.
Product exploration explored 100000 steps with 558 reset in 312 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 : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
RANDOM walk for 1124 steps (0 resets) in 7 ms. (140 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
// Phase 1: matrix 376 rows 205 cols
[2024-06-01 20:51:32] [INFO ] Computed 18 invariants in 2 ms
[2024-06-01 20:51:32] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-06-01 20:51:32] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2024-06-01 20:51:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:51:32] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 20:51:33] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2024-06-01 20:51:33] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 34 ms.
[2024-06-01 20:51:34] [INFO ] Added : 236 causal constraints over 48 iterations in 1495 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 205 transition count 344
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 64 place count 173 transition count 344
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 208 place count 101 transition count 272
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 240 place count 101 transition count 240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 242 place count 99 transition count 176
Iterating global reduction 1 with 2 rules applied. Total rules applied 244 place count 99 transition count 176
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 260 place count 83 transition count 144
Iterating global reduction 1 with 16 rules applied. Total rules applied 276 place count 83 transition count 144
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 292 place count 67 transition count 112
Iterating global reduction 1 with 16 rules applied. Total rules applied 308 place count 67 transition count 112
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 324 place count 67 transition count 96
Applied a total of 324 rules in 20 ms. Remains 67 /205 variables (removed 138) and now considering 96/376 (removed 280) transitions.
// Phase 1: matrix 96 rows 67 cols
[2024-06-01 20:51:34] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 20:51:34] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 20:51:34] [INFO ] Invariant cache hit.
[2024-06-01 20:51:34] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-06-01 20:51:34] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-06-01 20:51:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 8/67 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 96/163 variables, 67/85 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/163 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 85 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1652 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 8/67 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 96/163 variables, 67/85 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 80/165 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 165 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2050 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 3773ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3775ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/205 places, 96/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3986 ms. Remains : 67/205 places, 96/376 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
RANDOM walk for 272 steps (0 resets) in 5 ms. (45 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
[2024-06-01 20:51:38] [INFO ] Invariant cache hit.
[2024-06-01 20:51:39] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 20:51:39] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-01 20:51:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:51:39] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-06-01 20:51:39] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-01 20:51:39] [INFO ] Computed and/alt/rep : 80/176/80 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 20:51:39] [INFO ] Added : 49 causal constraints over 10 iterations in 123 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Product exploration explored 100000 steps with 2156 reset in 268 ms.
Stack based approach found an accepted trace after 555 steps with 11 reset with depth 22 and stack size 22 in 4 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLCardinality-14 finished in 9033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(!p1))))'
Support contains 5 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 7 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2024-06-01 20:51:39] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 20:51:39] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-01 20:51:39] [INFO ] Invariant cache hit.
[2024-06-01 20:51:40] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-06-01 20:51:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/582 variables, 206/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/582 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 225 constraints, problems are : Problem set: 0 solved, 368 unsolved in 19192 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/582 variables, 206/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 368/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/582 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 593 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 49862ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 49867ms
Starting structural reductions in LTL mode, iteration 1 : 206/302 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50469 ms. Remains : 206/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 271 ms.
Product exploration explored 100000 steps with 33333 reset in 301 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 (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLCardinality-15 finished in 51264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0))||F(p1)) U (G((p1 U p2))||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 20:52:31] [INFO ] Flatten gal took : 51 ms
[2024-06-01 20:52:31] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 20:52:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 302 places, 472 transitions and 1416 arcs took 10 ms.
Total runtime 375513 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : UtilityControlRoom-PT-Z4T3N08-LTLCardinality-06

BK_STOP 1717275235856

--------------------
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-Z4T3N08-LTLCardinality-04
ltl formula formula --ltl=/tmp/1848/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 302 places, 472 transitions and 1416 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.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1848/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1848/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1848/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1848/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 303 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 303, there are 480 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 ~188!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 27
pnml2lts-mc( 0/ 4): unique states count: 695
pnml2lts-mc( 0/ 4): unique transitions count: 5051
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 110
pnml2lts-mc( 0/ 4): - claim success count: 699
pnml2lts-mc( 0/ 4): - cum. max stack depth: 672
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 699 states 5091 transitions, fanout: 7.283
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.070 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 9986, Transitions per second: 72729
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, 34.5 B/state, compr.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 480 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)
ltl formula name UtilityControlRoom-PT-Z4T3N08-LTLCardinality-05
ltl formula formula --ltl=/tmp/1848/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 302 places, 472 transitions and 1416 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.060 real 0.010 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1848/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1848/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1848/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1848/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4): There are 303 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 303, there are 503 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~23!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 174
pnml2lts-mc( 0/ 4): unique states count: 254
pnml2lts-mc( 0/ 4): unique transitions count: 901
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 259
pnml2lts-mc( 0/ 4): - cum. max stack depth: 85
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 259 states 977 transitions, fanout: 3.772
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 25900, Transitions per second: 97700
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 43.6 B/state, compr.: 3.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 480 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-PT-Z4T3N08-LTLCardinality-06
ltl formula formula --ltl=/tmp/1848/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 302 places, 472 transitions and 1416 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.030 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1848/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1848/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1848/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1848/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 304 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 303, there are 475 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~63448 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~122648 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~241280 transitions
pnml2lts-mc( 1/ 4): ~19996 levels ~80000 states ~485788 transitions
pnml2lts-mc( 0/ 4): ~39972 levels ~160000 states ~1136204 transitions
pnml2lts-mc( 0/ 4): ~79938 levels ~320000 states ~2312864 transitions
pnml2lts-mc( 1/ 4): ~159861 levels ~640000 states ~4034680 transitions
pnml2lts-mc( 1/ 4): ~319659 levels ~1280000 states ~8194576 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1372024
pnml2lts-mc( 0/ 4): unique transitions count: 10462392
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1778072
pnml2lts-mc( 0/ 4): - claim success count: 1372028
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1370600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1372028 states 10462427 transitions, fanout: 7.626
pnml2lts-mc( 0/ 4): Total exploration time 18.510 sec (18.410 sec minimum, 18.447 sec on average)
pnml2lts-mc( 0/ 4): States per second: 74124, Transitions per second: 565231
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 123.4MB, 16.6 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 23.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 480 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 123.4MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-PT-Z4T3N08"
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-Z4T3N08, 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-171701111000227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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