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.r267-smll-171654405800171.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PermAdmissibility-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405800171
=====================================================================

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

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 03:17:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 03:17:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:17:54] [INFO ] Load time of PNML (sax parser for PT used): 361 ms
[2024-05-26 03:17:54] [INFO ] Transformed 168 places.
[2024-05-26 03:17:54] [INFO ] Transformed 592 transitions.
[2024-05-26 03:17:54] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 587 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 99 ms. Remains 126 /168 variables (removed 42) and now considering 496/592 (removed 96) transitions.
// Phase 1: matrix 496 rows 126 cols
[2024-05-26 03:17:55] [INFO ] Computed 19 invariants in 38 ms
[2024-05-26 03:17:55] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-26 03:17:55] [INFO ] Invariant cache hit.
[2024-05-26 03:17:56] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
Running 492 sub problems to find dead transitions.
[2024-05-26 03:17:56] [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 30045 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-05-26 03:18:32] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 22 ms to minimize.
[2024-05-26 03:18:32] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 3 ms to minimize.
[2024-05-26 03:18:32] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 2 ms to minimize.
[2024-05-26 03:18:32] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 2 ms to minimize.
[2024-05-26 03:18:32] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 2 ms to minimize.
[2024-05-26 03:18:33] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 2 ms to minimize.
[2024-05-26 03:18:33] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 2 ms to minimize.
[2024-05-26 03:18:33] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 2 ms to minimize.
[2024-05-26 03:18:33] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 2 ms to minimize.
[2024-05-26 03:18:33] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 2 ms to minimize.
[2024-05-26 03:18:34] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 5 ms to minimize.
[2024-05-26 03:18:34] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 1 ms to minimize.
[2024-05-26 03:18:34] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2024-05-26 03:18:34] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-05-26 03:18:36] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 1 ms to minimize.
[2024-05-26 03:18:36] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 2 ms to minimize.
[2024-05-26 03:18:37] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 2 ms to minimize.
[2024-05-26 03:18:37] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 1 ms to minimize.
[2024-05-26 03:18:37] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 2 ms to minimize.
[2024-05-26 03:18:37] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 2 ms to minimize.
[2024-05-26 03:18:37] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 1 ms to minimize.
[2024-05-26 03:18:37] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 2 ms to minimize.
[2024-05-26 03:18:38] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 2 ms to minimize.
[2024-05-26 03:18:38] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 2 ms to minimize.
[2024-05-26 03:18:38] [INFO ] Deduced a trap composed of 32 places in 191 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-05-26 03:18:43] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-26 03:18:43] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 2 ms to minimize.
[2024-05-26 03:18:43] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2024-05-26 03:18:43] [INFO ] Deduced a trap composed of 26 places in 135 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-05-26 03:18:45] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 2 ms to minimize.
[2024-05-26 03:18:45] [INFO ] Deduced a trap composed of 34 places in 236 ms of which 2 ms to minimize.
[2024-05-26 03:18:46] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 2 ms to minimize.
[2024-05-26 03:18:46] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 1 ms to minimize.
[2024-05-26 03:18:46] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 2 ms to minimize.
[2024-05-26 03:18:46] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 5 ms to minimize.
[2024-05-26 03:18:46] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 2 ms to minimize.
[2024-05-26 03:18:46] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 1 ms to minimize.
[2024-05-26 03:18:47] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 1 ms to minimize.
[2024-05-26 03:18:47] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 2 ms to minimize.
[2024-05-26 03:18:47] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-05-26 03:18:49] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 1 ms to minimize.
[2024-05-26 03:18:50] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 3 ms to minimize.
[2024-05-26 03:18:50] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 2 ms to minimize.
[2024-05-26 03:18:50] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-05-26 03:18:50] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
[2024-05-26 03:18:50] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 4 ms to minimize.
[2024-05-26 03:18:50] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 1 ms to minimize.
[2024-05-26 03:18:51] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-05-26 03:18:53] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 2 ms to minimize.
[2024-05-26 03:18:53] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 2 ms to minimize.
[2024-05-26 03:18:53] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 2 ms to minimize.
[2024-05-26 03:18:53] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 1 ms to minimize.
[2024-05-26 03:18:54] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 2 ms to minimize.
[2024-05-26 03:18:54] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-05-26 03:18:56] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 2 ms to minimize.
[2024-05-26 03:18:56] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 1 ms to minimize.
[2024-05-26 03:18:57] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 10 ms to minimize.
[2024-05-26 03:18:57] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 2 ms to minimize.
[2024-05-26 03:18:57] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 1 ms to minimize.
[2024-05-26 03:18:57] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 1 ms to minimize.
[2024-05-26 03:18:57] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 2 ms to minimize.
[2024-05-26 03:18:58] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 2 ms to minimize.
[2024-05-26 03:18:58] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 122/622 variables, and 82 constraints, problems are : Problem set: 0 solved, 492 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/126 constraints, PredecessorRefiner: 0/492 constraints, Known Traps: 63/63 constraints]
After SMT, in 61831ms problems are : Problem set: 0 solved, 492 unsolved
Search for dead transitions found 0 dead transitions in 61877ms
Starting structural reductions in LTL mode, iteration 1 : 126/168 places, 496/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63292 ms. Remains : 126/168 places, 496/592 transitions.
Support contains 88 out of 126 places after structural reductions.
[2024-05-26 03:18:58] [INFO ] Flatten gal took : 130 ms
[2024-05-26 03:18:59] [INFO ] Flatten gal took : 76 ms
[2024-05-26 03:18:59] [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 8646 steps (87 resets) in 503 ms. (17 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 22 ms. Remains 59 /126 variables (removed 67) and now considering 106/496 (removed 390) transitions.
// Phase 1: matrix 106 rows 59 cols
[2024-05-26 03:18:59] [INFO ] Computed 16 invariants in 3 ms
[2024-05-26 03:19:00] [INFO ] Implicit Places using invariants in 103 ms returned [0, 5, 33]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 106 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 2 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 130 ms. Remains : 56/126 places, 106/496 transitions.
Stuttering acceptance computed with spot in 512 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 7 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-00 finished in 746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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 19 ms. Remains 51 /126 variables (removed 75) and now considering 84/496 (removed 412) transitions.
// Phase 1: matrix 84 rows 51 cols
[2024-05-26 03:19:00] [INFO ] Computed 16 invariants in 3 ms
[2024-05-26 03:19:00] [INFO ] Implicit Places using invariants in 115 ms returned [0, 5, 18, 25]
[2024-05-26 03:19:00] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 117 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 137 ms. Remains : 48/126 places, 84/496 transitions.
Stuttering acceptance computed with spot in 80 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 297 ms.
Product exploration explored 100000 steps with 50000 reset in 228 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 23 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 849 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 10 ms. Remains 51 /126 variables (removed 75) and now considering 84/496 (removed 412) transitions.
[2024-05-26 03:19:01] [INFO ] Invariant cache hit.
[2024-05-26 03:19:01] [INFO ] Implicit Places using invariants in 87 ms returned [0, 5, 18, 25]
[2024-05-26 03:19:01] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 89 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 100 ms. Remains : 48/126 places, 84/496 transitions.
Stuttering acceptance computed with spot in 130 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 11 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-02 finished in 247 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.5 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-05-26 03:19:01] [INFO ] Computed 5 invariants in 0 ms
[2024-05-26 03:19:01] [INFO ] Implicit Places using invariants in 36 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 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 7 ms. Remains 14 /16 variables (removed 2) and now considering 24/26 (removed 2) transitions.
// Phase 1: matrix 24 rows 14 cols
[2024-05-26 03:19:01] [INFO ] Computed 4 invariants in 0 ms
[2024-05-26 03:19:01] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-26 03:19:01] [INFO ] Invariant cache hit.
[2024-05-26 03:19:01] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 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 133 ms. Remains : 14/126 places, 24/496 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 206 ms.
Product exploration explored 100000 steps with 50000 reset in 100 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 18 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 614 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.3 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 37 ms. Remains 105 /126 variables (removed 21) and now considering 480/496 (removed 16) transitions.
// Phase 1: matrix 480 rows 105 cols
[2024-05-26 03:19:02] [INFO ] Computed 17 invariants in 12 ms
[2024-05-26 03:19:02] [INFO ] Implicit Places using invariants in 169 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 171 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 23 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 232 ms. Remains : 104/126 places, 480/496 transitions.
Stuttering acceptance computed with spot in 591 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 3442 steps with 88 reset in 47 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-04 finished in 899 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.3 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 8 ms. Remains 26 /126 variables (removed 100) and now considering 44/496 (removed 452) transitions.
// Phase 1: matrix 44 rows 26 cols
[2024-05-26 03:19:03] [INFO ] Computed 8 invariants in 2 ms
[2024-05-26 03:19:03] [INFO ] Implicit Places using invariants in 45 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 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 57 ms. Remains : 25/126 places, 44/496 transitions.
Stuttering acceptance computed with spot in 78 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 1 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-06 finished in 151 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 9 ms. Remains 57 /126 variables (removed 69) and now considering 108/496 (removed 388) transitions.
// Phase 1: matrix 108 rows 57 cols
[2024-05-26 03:19:03] [INFO ] Computed 16 invariants in 1 ms
[2024-05-26 03:19:03] [INFO ] Implicit Places using invariants in 91 ms returned [0, 5, 21, 29]
[2024-05-26 03:19:03] [INFO ] Actually due to overlaps returned [5, 0, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 93 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 0 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 103 ms. Remains : 54/126 places, 108/496 transitions.
Stuttering acceptance computed with spot in 226 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 1295 steps with 15 reset in 17 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-08 finished in 370 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 35 ms. Remains 54 /126 variables (removed 72) and now considering 106/496 (removed 390) transitions.
// Phase 1: matrix 106 rows 54 cols
[2024-05-26 03:19:03] [INFO ] Computed 16 invariants in 1 ms
[2024-05-26 03:19:03] [INFO ] Implicit Places using invariants in 97 ms returned [0, 5, 19, 26]
[2024-05-26 03:19:03] [INFO ] Actually due to overlaps returned [0, 5, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 98 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 134 ms. Remains : 51/126 places, 106/496 transitions.
Stuttering acceptance computed with spot in 204 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 3348 steps with 124 reset in 17 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-09 finished in 374 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.3 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 15 ms. Remains 49 /126 variables (removed 77) and now considering 88/496 (removed 408) transitions.
// Phase 1: matrix 88 rows 49 cols
[2024-05-26 03:19:04] [INFO ] Computed 14 invariants in 1 ms
[2024-05-26 03:19:04] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-26 03:19:04] [INFO ] Invariant cache hit.
[2024-05-26 03:19:04] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-26 03:19:04] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2024-05-26 03:19:04] [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 1830 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 5136 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 7046ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 7048ms
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 7287 ms. Remains : 49/126 places, 88/496 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-10
Product exploration explored 100000 steps with 16015 reset in 232 ms.
Product exploration explored 100000 steps with 15985 reset in 266 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 280 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 38 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 2102 steps (21 resets) in 15 ms. (131 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 715 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 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 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 5 ms. Remains 49 /49 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-26 03:19:13] [INFO ] Invariant cache hit.
[2024-05-26 03:19:13] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-26 03:19:13] [INFO ] Invariant cache hit.
[2024-05-26 03:19:13] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-26 03:19:13] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2024-05-26 03:19:13] [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 1821 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 5001 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 6899ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 6901ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7202 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 283 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 38 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 4587 steps (50 resets) in 44 ms. (101 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 589 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 38 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 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16067 reset in 242 ms.
Product exploration explored 100000 steps with 16069 reset in 269 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 3 ms. Remains 49 /49 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-26 03:19:22] [INFO ] Invariant cache hit.
[2024-05-26 03:19:22] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-26 03:19:22] [INFO ] Invariant cache hit.
[2024-05-26 03:19:22] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-26 03:19:22] [INFO ] Redundant transitions in 1 ms returned []
Running 84 sub problems to find dead transitions.
[2024-05-26 03:19:22] [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 1871 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 5080 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 7005ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 7007ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7250 ms. Remains : 49/49 places, 88/88 transitions.
Treatment of property PermAdmissibility-PT-05-LTLCardinality-10 finished in 25293 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 7 ms. Remains 57 /126 variables (removed 69) and now considering 106/496 (removed 390) transitions.
// Phase 1: matrix 106 rows 57 cols
[2024-05-26 03:19:29] [INFO ] Computed 16 invariants in 2 ms
[2024-05-26 03:19:29] [INFO ] Implicit Places using invariants in 94 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 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 107 ms. Remains : 56/126 places, 106/496 transitions.
Stuttering acceptance computed with spot in 142 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 269 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.2 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 18 ms. Remains 58 /126 variables (removed 68) and now considering 116/496 (removed 380) transitions.
// Phase 1: matrix 116 rows 58 cols
[2024-05-26 03:19:29] [INFO ] Computed 16 invariants in 1 ms
[2024-05-26 03:19:29] [INFO ] Implicit Places using invariants in 91 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 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 3 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 118 ms. Remains : 57/126 places, 116/496 transitions.
Stuttering acceptance computed with spot in 89 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 223 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-05-26 03:19:30] [INFO ] Flatten gal took : 54 ms
[2024-05-26 03:19:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-26 03:19:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 496 transitions and 2730 arcs took 13 ms.
Total runtime 96015 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PermAdmissibility-PT-05

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 126
TRANSITIONS: 496
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.020s, Sys 0.000s]


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


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

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

Process ID: 1142
MODEL NAME: /home/mcc/execution/409/model
126 places, 496 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 16777216 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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