About the Execution of LTSMin+red for PermAdmissibility-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1236.283 | 105157.00 | 155106.00 | 469.10 | FTFTFTFFFFTFFFFF | 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.r512-smll-171654407100171.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 PermAdmissibility-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407100171
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 11K Apr 12 09:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 09:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 12 09:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 296K Apr 12 09:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 09:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 09:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 12 09:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 590K Apr 12 09:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 336K 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 PermAdmissibility-PT-05-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717255130530
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:18:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:18:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:18:53] [INFO ] Load time of PNML (sax parser for PT used): 347 ms
[2024-06-01 15:18:53] [INFO ] Transformed 168 places.
[2024-06-01 15:18:53] [INFO ] Transformed 592 transitions.
[2024-06-01 15:18:53] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 591 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 4 formulas.
FORMULA PermAdmissibility-PT-05-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 88 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 132 transition count 592
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 126 transition count 496
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 126 transition count 496
Applied a total of 48 rules in 103 ms. Remains 126 /168 variables (removed 42) and now considering 496/592 (removed 96) transitions.
// Phase 1: matrix 496 rows 126 cols
[2024-06-01 15:18:53] [INFO ] Computed 19 invariants in 68 ms
[2024-06-01 15:18:54] [INFO ] Implicit Places using invariants in 658 ms returned []
[2024-06-01 15:18:54] [INFO ] Invariant cache hit.
[2024-06-01 15:18:55] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
Running 492 sub problems to find dead transitions.
[2024-06-01 15:18:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 2 (OVERLAPS) 17/114 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 4 (OVERLAPS) 8/122 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 6 (OVERLAPS) 496/618 variables, 122/141 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 8 (OVERLAPS) 4/622 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/622 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 492 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/622 variables, and 145 constraints, problems are : Problem set: 0 solved, 492 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 492/492 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 492 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 2 (OVERLAPS) 17/114 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-06-01 15:19:31] [INFO ] Deduced a trap composed of 38 places in 281 ms of which 29 ms to minimize.
[2024-06-01 15:19:31] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:19:32] [INFO ] Deduced a trap composed of 21 places in 289 ms of which 3 ms to minimize.
[2024-06-01 15:19:32] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 2 ms to minimize.
[2024-06-01 15:19:32] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 1 ms to minimize.
[2024-06-01 15:19:32] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:19:33] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 2 ms to minimize.
[2024-06-01 15:19:33] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:19:33] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:19:33] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 1 ms to minimize.
[2024-06-01 15:19:33] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:19:34] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:19:34] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:19:35] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-06-01 15:19:37] [INFO ] Deduced a trap composed of 21 places in 279 ms of which 2 ms to minimize.
[2024-06-01 15:19:38] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 4 ms to minimize.
[2024-06-01 15:19:38] [INFO ] Deduced a trap composed of 21 places in 294 ms of which 3 ms to minimize.
[2024-06-01 15:19:38] [INFO ] Deduced a trap composed of 30 places in 289 ms of which 2 ms to minimize.
[2024-06-01 15:19:38] [INFO ] Deduced a trap composed of 21 places in 305 ms of which 2 ms to minimize.
[2024-06-01 15:19:39] [INFO ] Deduced a trap composed of 29 places in 277 ms of which 2 ms to minimize.
[2024-06-01 15:19:39] [INFO ] Deduced a trap composed of 27 places in 257 ms of which 2 ms to minimize.
[2024-06-01 15:19:39] [INFO ] Deduced a trap composed of 34 places in 269 ms of which 3 ms to minimize.
[2024-06-01 15:19:40] [INFO ] Deduced a trap composed of 29 places in 271 ms of which 2 ms to minimize.
[2024-06-01 15:19:40] [INFO ] Deduced a trap composed of 30 places in 272 ms of which 3 ms to minimize.
[2024-06-01 15:19:40] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 6 (OVERLAPS) 8/122 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-06-01 15:19:47] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:19:47] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:19:48] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:19:48] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-06-01 15:19:51] [INFO ] Deduced a trap composed of 38 places in 301 ms of which 3 ms to minimize.
[2024-06-01 15:19:51] [INFO ] Deduced a trap composed of 34 places in 293 ms of which 3 ms to minimize.
[2024-06-01 15:19:51] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 2 ms to minimize.
[2024-06-01 15:19:51] [INFO ] Deduced a trap composed of 28 places in 277 ms of which 2 ms to minimize.
[2024-06-01 15:19:52] [INFO ] Deduced a trap composed of 35 places in 277 ms of which 3 ms to minimize.
[2024-06-01 15:19:52] [INFO ] Deduced a trap composed of 27 places in 289 ms of which 5 ms to minimize.
[2024-06-01 15:19:52] [INFO ] Deduced a trap composed of 41 places in 246 ms of which 3 ms to minimize.
[2024-06-01 15:19:52] [INFO ] Deduced a trap composed of 26 places in 270 ms of which 2 ms to minimize.
[2024-06-01 15:19:53] [INFO ] Deduced a trap composed of 41 places in 273 ms of which 3 ms to minimize.
[2024-06-01 15:19:53] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 3 ms to minimize.
[2024-06-01 15:19:53] [INFO ] Deduced a trap composed of 31 places in 272 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-06-01 15:19:57] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 2 ms to minimize.
[2024-06-01 15:19:57] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 3 ms to minimize.
SMT process timed out in 62240ms, After SMT, problems are : Problem set: 0 solved, 492 unsolved
Search for dead transitions found 0 dead transitions in 62296ms
Starting structural reductions in LTL mode, iteration 1 : 126/168 places, 496/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63951 ms. Remains : 126/168 places, 496/592 transitions.
Support contains 88 out of 126 places after structural reductions.
[2024-06-01 15:19:58] [INFO ] Flatten gal took : 189 ms
[2024-06-01 15:19:58] [INFO ] Flatten gal took : 105 ms
[2024-06-01 15:19:58] [INFO ] Input system was already deterministic with 496 transitions.
Support contains 74 out of 126 places (down from 88) after GAL structural reductions.
RANDOM walk for 7104 steps (70 resets) in 591 ms. (12 steps per ms) remains 0/26 properties
FORMULA PermAdmissibility-PT-05-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 126 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 126 transition count 496
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X((p1||X(F((p1&&F((p2&&F(p3))))))))))))'
Support contains 11 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 98 transition count 496
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 48 place count 78 transition count 344
Iterating global reduction 1 with 20 rules applied. Total rules applied 68 place count 78 transition count 344
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 85 place count 61 transition count 122
Iterating global reduction 1 with 17 rules applied. Total rules applied 102 place count 61 transition count 122
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 59 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 59 transition count 106
Applied a total of 106 rules in 19 ms. Remains 59 /126 variables (removed 67) and now considering 106/496 (removed 390) transitions.
// Phase 1: matrix 106 rows 59 cols
[2024-06-01 15:19:59] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 15:19:59] [INFO ] Implicit Places using invariants in 144 ms returned [0, 5, 33]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 149 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/126 places, 106/496 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 56/126 places, 106/496 transitions.
Stuttering acceptance computed with spot in 594 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p3), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-00
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 3 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-00 finished in 848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 98 transition count 496
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 48 place count 78 transition count 344
Iterating global reduction 1 with 20 rules applied. Total rules applied 68 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 92 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 116 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 51 transition count 84
Applied a total of 122 rules in 21 ms. Remains 51 /126 variables (removed 75) and now considering 84/496 (removed 412) transitions.
// Phase 1: matrix 84 rows 51 cols
[2024-06-01 15:20:00] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 15:20:00] [INFO ] Implicit Places using invariants in 101 ms returned [0, 5, 18, 25]
[2024-06-01 15:20:00] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 103 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/126 places, 84/496 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 48/126 places, 84/496 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 406 ms.
Product exploration explored 100000 steps with 50000 reset in 272 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-05-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-05-LTLCardinality-01 finished in 1011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 98 transition count 496
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 48 place count 78 transition count 344
Iterating global reduction 1 with 20 rules applied. Total rules applied 68 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 92 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 116 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 51 transition count 84
Applied a total of 122 rules in 8 ms. Remains 51 /126 variables (removed 75) and now considering 84/496 (removed 412) transitions.
[2024-06-01 15:20:01] [INFO ] Invariant cache hit.
[2024-06-01 15:20:01] [INFO ] Implicit Places using invariants in 114 ms returned [0, 5, 18, 25]
[2024-06-01 15:20:01] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 123 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/126 places, 84/496 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132 ms. Remains : 48/126 places, 84/496 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-02 finished in 283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Graph (complete) has 1129 edges and 126 vertex of which 22 are kept as prefixes of interest. Removing 104 places using SCC suffix rule.4 ms
Discarding 104 places :
Also discarding 448 output transitions
Drop transitions (Output transitions of discarded places.) removed 448 transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 20 transition count 32
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 20 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 18 transition count 26
Ensure Unique test removed 1 places
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 17 transition count 26
Applied a total of 10 rules in 20 ms. Remains 17 /126 variables (removed 109) and now considering 26/496 (removed 470) transitions.
// Phase 1: matrix 26 rows 17 cols
[2024-06-01 15:20:01] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 15:20:01] [INFO ] Implicit Places using invariants in 35 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/126 places, 26/496 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 16 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 14 transition count 24
Applied a total of 4 rules in 6 ms. Remains 14 /16 variables (removed 2) and now considering 24/26 (removed 2) transitions.
// Phase 1: matrix 24 rows 14 cols
[2024-06-01 15:20:01] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 15:20:01] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 15:20:01] [INFO ] Invariant cache hit.
[2024-06-01 15:20:01] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/126 places, 24/496 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 138 ms. Remains : 14/126 places, 24/496 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 303 ms.
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Computed a total of 14 stabilizing places and 24 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 24
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-05-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-05-LTLCardinality-03 finished in 658 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(!(((G(p0) U p1) U p2) U (p1 U p3)))))'
Support contains 36 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Graph (complete) has 1129 edges and 126 vertex of which 106 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Discarding 20 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 105 transition count 480
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 480
Applied a total of 3 rules in 41 ms. Remains 105 /126 variables (removed 21) and now considering 480/496 (removed 16) transitions.
// Phase 1: matrix 480 rows 105 cols
[2024-06-01 15:20:02] [INFO ] Computed 17 invariants in 12 ms
[2024-06-01 15:20:02] [INFO ] Implicit Places using invariants in 171 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 173 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/126 places, 480/496 transitions.
Applied a total of 0 rules in 25 ms. Remains 104 /104 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 240 ms. Remains : 104/126 places, 480/496 transitions.
Stuttering acceptance computed with spot in 637 ms :[p3, p3, (AND p2 p3), p3, (AND p2 p3 p1 p0), (AND p0 p1 p3), (AND p0 p2 p3), (AND p0 p3), (AND p0 p3)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-04
Stuttering criterion allowed to conclude after 2909 steps with 79 reset in 81 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-04 finished in 989 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 5 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Graph (complete) has 1129 edges and 126 vertex of which 32 are kept as prefixes of interest. Removing 94 places using SCC suffix rule.4 ms
Discarding 94 places :
Also discarding 416 output transitions
Drop transitions (Output transitions of discarded places.) removed 416 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 26 transition count 44
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 26 transition count 44
Applied a total of 13 rules in 10 ms. Remains 26 /126 variables (removed 100) and now considering 44/496 (removed 452) transitions.
// Phase 1: matrix 44 rows 26 cols
[2024-06-01 15:20:02] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 15:20:03] [INFO ] Implicit Places using invariants in 639 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 644 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/126 places, 44/496 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 656 ms. Remains : 25/126 places, 44/496 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-06
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-06 finished in 783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F((G(p1)||(p1&&F(p2))))))))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 100 transition count 496
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 45 place count 81 transition count 346
Iterating global reduction 1 with 19 rules applied. Total rules applied 64 place count 81 transition count 346
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 86 place count 59 transition count 124
Iterating global reduction 1 with 22 rules applied. Total rules applied 108 place count 59 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 57 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 57 transition count 108
Applied a total of 112 rules in 13 ms. Remains 57 /126 variables (removed 69) and now considering 108/496 (removed 388) transitions.
// Phase 1: matrix 108 rows 57 cols
[2024-06-01 15:20:03] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 15:20:04] [INFO ] Implicit Places using invariants in 389 ms returned [0, 5, 21, 29]
[2024-06-01 15:20:04] [INFO ] Actually due to overlaps returned [5, 0, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 394 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/126 places, 108/496 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 410 ms. Remains : 54/126 places, 108/496 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-08
Stuttering criterion allowed to conclude after 2348 steps with 28 reset in 22 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-08 finished in 760 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&&G(F(p1))))))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 98 transition count 496
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 48 place count 78 transition count 344
Iterating global reduction 1 with 20 rules applied. Total rules applied 68 place count 78 transition count 344
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 91 place count 55 transition count 114
Iterating global reduction 1 with 23 rules applied. Total rules applied 114 place count 55 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 54 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 54 transition count 106
Applied a total of 116 rules in 10 ms. Remains 54 /126 variables (removed 72) and now considering 106/496 (removed 390) transitions.
// Phase 1: matrix 106 rows 54 cols
[2024-06-01 15:20:04] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 15:20:04] [INFO ] Implicit Places using invariants in 154 ms returned [0, 5, 19, 26]
[2024-06-01 15:20:04] [INFO ] Actually due to overlaps returned [0, 5, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 156 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/126 places, 106/496 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 51/126 places, 106/496 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-09
Stuttering criterion allowed to conclude after 28897 steps with 998 reset in 229 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-09 finished in 682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Graph (complete) has 1129 edges and 126 vertex of which 81 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.4 ms
Discarding 45 places :
Also discarding 128 output transitions
Drop transitions (Output transitions of discarded places.) removed 128 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 63 transition count 224
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 63 transition count 224
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 49 place count 51 transition count 104
Iterating global reduction 0 with 12 rules applied. Total rules applied 61 place count 51 transition count 104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 63 place count 49 transition count 88
Iterating global reduction 0 with 2 rules applied. Total rules applied 65 place count 49 transition count 88
Applied a total of 65 rules in 23 ms. Remains 49 /126 variables (removed 77) and now considering 88/496 (removed 408) transitions.
// Phase 1: matrix 88 rows 49 cols
[2024-06-01 15:20:05] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 15:20:05] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 15:20:05] [INFO ] Invariant cache hit.
[2024-06-01 15:20:05] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-06-01 15:20:05] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2024-06-01 15:20:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 88/136 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/137 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 63 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2316 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 88/136 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 76/138 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 1/137 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 8/147 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 147 constraints, problems are : Problem set: 0 solved, 84 unsolved in 6685 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
After SMT, in 9133ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 9136ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/126 places, 88/496 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9441 ms. Remains : 49/126 places, 88/496 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-10
Product exploration explored 100000 steps with 16049 reset in 268 ms.
Product exploration explored 100000 steps with 16012 reset in 312 ms.
Computed a total of 49 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 255 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 3744 steps (40 resets) in 39 ms. (93 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 11 factoid took 547 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 88/88 transitions.
Applied a total of 0 rules in 6 ms. Remains 49 /49 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 15:20:16] [INFO ] Invariant cache hit.
[2024-06-01 15:20:16] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 15:20:16] [INFO ] Invariant cache hit.
[2024-06-01 15:20:16] [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 15:20:16] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2024-06-01 15:20:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 88/136 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/137 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 63 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1991 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 88/136 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 76/138 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 1/137 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 8/147 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 147 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5137 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
After SMT, in 7219ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 7221ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7485 ms. Remains : 49/49 places, 88/88 transitions.
Computed a total of 49 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 271 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 2547 steps (26 resets) in 25 ms. (97 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 11 factoid took 613 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 15969 reset in 419 ms.
Product exploration explored 100000 steps with 16076 reset in 415 ms.
Support contains 2 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 88/88 transitions.
Applied a total of 0 rules in 5 ms. Remains 49 /49 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 15:20:25] [INFO ] Invariant cache hit.
[2024-06-01 15:20:25] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 15:20:25] [INFO ] Invariant cache hit.
[2024-06-01 15:20:26] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-06-01 15:20:26] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2024-06-01 15:20:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 88/136 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/137 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 63 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2255 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 88/136 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 76/138 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 1/137 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 8/147 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 147 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5327 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
After SMT, in 7654ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 7657ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7951 ms. Remains : 49/49 places, 88/88 transitions.
Treatment of property PermAdmissibility-PT-05-LTLCardinality-10 finished in 28685 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 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 99 transition count 496
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 46 place count 80 transition count 348
Iterating global reduction 1 with 19 rules applied. Total rules applied 65 place count 80 transition count 348
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 86 place count 59 transition count 122
Iterating global reduction 1 with 21 rules applied. Total rules applied 107 place count 59 transition count 122
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 57 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 57 transition count 106
Applied a total of 111 rules in 12 ms. Remains 57 /126 variables (removed 69) and now considering 106/496 (removed 390) transitions.
// Phase 1: matrix 106 rows 57 cols
[2024-06-01 15:20:33] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 15:20:34] [INFO ] Implicit Places using invariants in 131 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/126 places, 106/496 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 56/126 places, 106/496 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-11 finished in 354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Graph (complete) has 1129 edges and 126 vertex of which 99 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.3 ms
Discarding 27 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 80 transition count 348
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 80 transition count 348
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 60 place count 59 transition count 124
Iterating global reduction 0 with 21 rules applied. Total rules applied 81 place count 59 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 82 place count 58 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 83 place count 58 transition count 116
Applied a total of 83 rules in 26 ms. Remains 58 /126 variables (removed 68) and now considering 116/496 (removed 380) transitions.
// Phase 1: matrix 116 rows 58 cols
[2024-06-01 15:20:34] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 15:20:34] [INFO ] Implicit Places using invariants in 79 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/126 places, 116/496 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 111 ms. Remains : 57/126 places, 116/496 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-14
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-14 finished in 215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
[2024-06-01 15:20:34] [INFO ] Flatten gal took : 50 ms
[2024-06-01 15:20:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 15:20:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 496 transitions and 2730 arcs took 9 ms.
Total runtime 102060 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA PermAdmissibility-PT-05-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717255235687
--------------------
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 PermAdmissibility-PT-05-LTLCardinality-10
ltl formula formula --ltl=/tmp/1053/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 126 places, 496 transitions and 2730 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.070 real 0.040 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 99 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 127, there are 500 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): ~12 levels ~10000 states ~15940 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8566
pnml2lts-mc( 0/ 4): unique states count: 8566
pnml2lts-mc( 0/ 4): unique transitions count: 13892
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 5645
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8716
pnml2lts-mc( 0/ 4): - cum. max stack depth: 48
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8716 states 14806 transitions, fanout: 1.699
pnml2lts-mc( 0/ 4): Total exploration time 0.160 sec (0.160 sec minimum, 0.160 sec on average)
pnml2lts-mc( 0/ 4): States per second: 54475, Transitions per second: 92538
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, 23.2 B/state, compr.: 4.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 508 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-PT-05"
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 PermAdmissibility-PT-05, 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 r512-smll-171654407100171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-05.tgz
mv PermAdmissibility-PT-05 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 '
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 ;