Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128000516.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PermAdmissibility-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128000516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 31K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 229K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 190K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 959K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 27 06:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 27 06:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 28K Mar 25 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Mar 25 08:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 481K May 5 16:51 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-02-00
FORMULA_NAME PermAdmissibility-PT-02-01
FORMULA_NAME PermAdmissibility-PT-02-02
FORMULA_NAME PermAdmissibility-PT-02-03
FORMULA_NAME PermAdmissibility-PT-02-04
FORMULA_NAME PermAdmissibility-PT-02-05
FORMULA_NAME PermAdmissibility-PT-02-06
FORMULA_NAME PermAdmissibility-PT-02-07
FORMULA_NAME PermAdmissibility-PT-02-08
FORMULA_NAME PermAdmissibility-PT-02-09
FORMULA_NAME PermAdmissibility-PT-02-10
FORMULA_NAME PermAdmissibility-PT-02-11
FORMULA_NAME PermAdmissibility-PT-02-12
FORMULA_NAME PermAdmissibility-PT-02-13
FORMULA_NAME PermAdmissibility-PT-02-14
FORMULA_NAME PermAdmissibility-PT-02-15

=== Now, execution of the tool begins

BK_START 1620996340234

Running Version 0
[2021-05-14 12:45:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 12:45:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 12:45:52] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2021-05-14 12:45:52] [INFO ] Transformed 168 places.
[2021-05-14 12:45:52] [INFO ] Transformed 592 transitions.
[2021-05-14 12:45:52] [INFO ] Parsed PT model containing 168 places and 592 transitions in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 12:45:53] [INFO ] Initial state test concluded for 3 properties.
FORMULA PermAdmissibility-PT-02-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 115 transition count 592
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 63 place count 105 transition count 432
Iterating global reduction 1 with 10 rules applied. Total rules applied 73 place count 105 transition count 432
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 79 place count 99 transition count 354
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 99 transition count 354
Applied a total of 85 rules in 39 ms. Remains 99 /168 variables (removed 69) and now considering 354/592 (removed 238) transitions.
// Phase 1: matrix 354 rows 99 cols
[2021-05-14 12:45:53] [INFO ] Computed 17 place invariants in 17 ms
[2021-05-14 12:45:53] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 354 rows 99 cols
[2021-05-14 12:45:53] [INFO ] Computed 17 place invariants in 7 ms
[2021-05-14 12:45:53] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
// Phase 1: matrix 354 rows 99 cols
[2021-05-14 12:45:53] [INFO ] Computed 17 place invariants in 5 ms
[2021-05-14 12:45:53] [INFO ] Dead Transitions using invariants and state equation in 165 ms returned []
Finished structural reductions, in 1 iterations. Remains : 99/168 places, 354/592 transitions.
[2021-05-14 12:45:54] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-14 12:45:54] [INFO ] Flatten gal took : 72 ms
FORMULA PermAdmissibility-PT-02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 12:45:54] [INFO ] Flatten gal took : 38 ms
[2021-05-14 12:45:54] [INFO ] Input system was already deterministic with 354 transitions.
Incomplete random walk after 100000 steps, including 2137 resets, run finished after 437 ms. (steps per millisecond=228 ) properties (out of 16) seen :14
Running SMT prover for 2 properties.
// Phase 1: matrix 354 rows 99 cols
[2021-05-14 12:45:54] [INFO ] Computed 17 place invariants in 8 ms
[2021-05-14 12:45:54] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 3 ms returned unsat
[2021-05-14 12:45:54] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA PermAdmissibility-PT-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 12 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 354/354 transitions.
Graph (complete) has 779 edges and 99 vertex of which 96 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 87 transition count 294
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 87 transition count 294
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 23 place count 83 transition count 262
Iterating global reduction 0 with 4 rules applied. Total rules applied 27 place count 83 transition count 262
Applied a total of 27 rules in 31 ms. Remains 83 /99 variables (removed 16) and now considering 262/354 (removed 92) transitions.
// Phase 1: matrix 262 rows 83 cols
[2021-05-14 12:45:54] [INFO ] Computed 17 place invariants in 4 ms
[2021-05-14 12:45:54] [INFO ] Implicit Places using invariants in 71 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
[2021-05-14 12:45:54] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 262 rows 82 cols
[2021-05-14 12:45:54] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-14 12:45:54] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Starting structural reductions, iteration 1 : 82/99 places, 262/354 transitions.
Applied a total of 0 rules in 12 ms. Remains 82 /82 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2021-05-14 12:45:55] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 262 rows 82 cols
[2021-05-14 12:45:55] [INFO ] Computed 16 place invariants in 22 ms
[2021-05-14 12:45:55] [INFO ] Dead Transitions using invariants and state equation in 142 ms returned []
Finished structural reductions, in 2 iterations. Remains : 82/99 places, 262/354 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ (ADD s45 s46 s58 s59) (ADD s11 s12 s13 s14 s15 s16 s17 s18))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-05 finished in 564 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0 U X(!p0)))&&(!p0 U X(G((!p0||X(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 354/354 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 88 transition count 354
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 27 place count 72 transition count 266
Iterating global reduction 1 with 16 rules applied. Total rules applied 43 place count 72 transition count 266
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 60 place count 55 transition count 110
Iterating global reduction 1 with 17 rules applied. Total rules applied 77 place count 55 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 52 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 52 transition count 86
Applied a total of 83 rules in 8 ms. Remains 52 /99 variables (removed 47) and now considering 86/354 (removed 268) transitions.
// Phase 1: matrix 86 rows 52 cols
[2021-05-14 12:45:55] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-14 12:45:55] [INFO ] Implicit Places using invariants in 45 ms returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
// Phase 1: matrix 86 rows 49 cols
[2021-05-14 12:45:55] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-14 12:45:55] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 49/99 places, 86/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 86/86 (removed 0) transitions.
// Phase 1: matrix 86 rows 49 cols
[2021-05-14 12:45:55] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-14 12:45:55] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/99 places, 86/354 transitions.
Stuttering acceptance computed with spot in 199 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, p0, true, (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-02-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}]], initial=0, aps=[p0:(GT 1 s10), p1:(LEQ 1 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-09 finished in 362 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X(F(p0))&&(p1||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 354/354 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 89 transition count 354
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 25 place count 74 transition count 268
Iterating global reduction 1 with 15 rules applied. Total rules applied 40 place count 74 transition count 268
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 56 place count 58 transition count 124
Iterating global reduction 1 with 16 rules applied. Total rules applied 72 place count 58 transition count 124
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 55 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 55 transition count 100
Applied a total of 78 rules in 6 ms. Remains 55 /99 variables (removed 44) and now considering 100/354 (removed 254) transitions.
// Phase 1: matrix 100 rows 55 cols
[2021-05-14 12:45:55] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 12:45:55] [INFO ] Implicit Places using invariants in 55 ms returned [0, 7, 20, 28]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 ms to find 4 implicit places.
// Phase 1: matrix 100 rows 51 cols
[2021-05-14 12:45:55] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-14 12:45:55] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 51/99 places, 100/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 51 cols
[2021-05-14 12:45:55] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 12:45:55] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 51/99 places, 100/354 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-02-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s4 s37), p2:(AND (GT s25 s41) (GT s29 s40)), p0:(GT s29 s40)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-10 finished in 302 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 354/354 transitions.
Graph (complete) has 779 edges and 99 vertex of which 88 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 72 transition count 266
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 72 transition count 266
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 51 place count 54 transition count 108
Iterating global reduction 0 with 18 rules applied. Total rules applied 69 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 72 place count 51 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 75 place count 51 transition count 84
Applied a total of 75 rules in 13 ms. Remains 51 /99 variables (removed 48) and now considering 84/354 (removed 270) transitions.
// Phase 1: matrix 84 rows 51 cols
[2021-05-14 12:45:55] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 12:45:56] [INFO ] Implicit Places using invariants in 42 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
[2021-05-14 12:45:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 84 rows 47 cols
[2021-05-14 12:45:56] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 12:45:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 47/99 places, 84/354 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 83
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 46 transition count 82
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 45 transition count 82
Applied a total of 4 rules in 7 ms. Remains 45 /47 variables (removed 2) and now considering 82/84 (removed 2) transitions.
// Phase 1: matrix 82 rows 45 cols
[2021-05-14 12:45:56] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 12:45:56] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 82 rows 45 cols
[2021-05-14 12:45:56] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 12:45:56] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 45/99 places, 82/354 transitions.
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-02-12 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ s15 s40) (LEQ s9 s19)), p1:(LEQ s15 s40)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1822 steps with 94 reset in 16 ms.
FORMULA PermAdmissibility-PT-02-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-12 finished in 289 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 354/354 transitions.
Graph (complete) has 779 edges and 99 vertex of which 88 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 72 transition count 266
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 72 transition count 266
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 51 place count 54 transition count 108
Iterating global reduction 0 with 18 rules applied. Total rules applied 69 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 72 place count 51 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 75 place count 51 transition count 84
Applied a total of 75 rules in 12 ms. Remains 51 /99 variables (removed 48) and now considering 84/354 (removed 270) transitions.
// Phase 1: matrix 84 rows 51 cols
[2021-05-14 12:45:56] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 12:45:56] [INFO ] Implicit Places using invariants in 41 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 48 ms to find 4 implicit places.
[2021-05-14 12:45:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 84 rows 47 cols
[2021-05-14 12:45:56] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 12:45:56] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 47/99 places, 84/354 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 83
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 46 transition count 82
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 45 transition count 82
Applied a total of 4 rules in 5 ms. Remains 45 /47 variables (removed 2) and now considering 82/84 (removed 2) transitions.
// Phase 1: matrix 82 rows 45 cols
[2021-05-14 12:45:56] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 12:45:56] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 82 rows 45 cols
[2021-05-14 12:45:56] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 12:45:56] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 45/99 places, 82/354 transitions.
Stuttering acceptance computed with spot in 462 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-13 finished in 692 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&(G(p1) U p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 354/354 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 90 transition count 354
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 24 place count 75 transition count 270
Iterating global reduction 1 with 15 rules applied. Total rules applied 39 place count 75 transition count 270
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 55 place count 59 transition count 118
Iterating global reduction 1 with 16 rules applied. Total rules applied 71 place count 59 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 57 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 57 transition count 102
Applied a total of 75 rules in 5 ms. Remains 57 /99 variables (removed 42) and now considering 102/354 (removed 252) transitions.
// Phase 1: matrix 102 rows 57 cols
[2021-05-14 12:45:56] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 12:45:56] [INFO ] Implicit Places using invariants in 40 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
// Phase 1: matrix 102 rows 56 cols
[2021-05-14 12:45:56] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 12:45:57] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 56/99 places, 102/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 56 cols
[2021-05-14 12:45:57] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 12:45:57] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 2 iterations. Remains : 56/99 places, 102/354 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p0) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-02-14 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(LEQ s5 s7), p0:(LEQ 2 s52), p2:(LEQ 1 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-14 finished in 302 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620996369934

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-PT-02, 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 r140-tall-162089128000516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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