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.r292-tall-162124155800005.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 CANConstruction-PT-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124155800005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 20K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 12 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 12 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.0K May 11 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 11 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 167K May 12 08:13 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 CANConstruction-PT-005-00
FORMULA_NAME CANConstruction-PT-005-01
FORMULA_NAME CANConstruction-PT-005-02
FORMULA_NAME CANConstruction-PT-005-03
FORMULA_NAME CANConstruction-PT-005-04
FORMULA_NAME CANConstruction-PT-005-05
FORMULA_NAME CANConstruction-PT-005-06
FORMULA_NAME CANConstruction-PT-005-07
FORMULA_NAME CANConstruction-PT-005-08
FORMULA_NAME CANConstruction-PT-005-09
FORMULA_NAME CANConstruction-PT-005-10
FORMULA_NAME CANConstruction-PT-005-11
FORMULA_NAME CANConstruction-PT-005-12
FORMULA_NAME CANConstruction-PT-005-13
FORMULA_NAME CANConstruction-PT-005-14
FORMULA_NAME CANConstruction-PT-005-15

=== Now, execution of the tool begins

BK_START 1621242820237

Running Version 0
[2021-05-17 09:13:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-17 09:13:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 09:13:42] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-17 09:13:42] [INFO ] Transformed 112 places.
[2021-05-17 09:13:42] [INFO ] Transformed 140 transitions.
[2021-05-17 09:13:42] [INFO ] Parsed PT model containing 112 places and 140 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 09:13:42] [INFO ] Initial state test concluded for 1 properties.
Support contains 37 out of 112 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 112/112 places, 140/140 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 104 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 104 transition count 124
Applied a total of 16 rules in 18 ms. Remains 104 /112 variables (removed 8) and now considering 124/140 (removed 16) transitions.
// Phase 1: matrix 124 rows 104 cols
[2021-05-17 09:13:42] [INFO ] Computed 11 place invariants in 16 ms
[2021-05-17 09:13:42] [INFO ] Implicit Places using invariants in 123 ms returned [12, 26, 40]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 151 ms to find 3 implicit places.
// Phase 1: matrix 124 rows 101 cols
[2021-05-17 09:13:42] [INFO ] Computed 8 place invariants in 9 ms
[2021-05-17 09:13:42] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Starting structural reductions, iteration 1 : 101/112 places, 124/140 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 99 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 99 transition count 122
Applied a total of 4 rules in 10 ms. Remains 99 /101 variables (removed 2) and now considering 122/124 (removed 2) transitions.
// Phase 1: matrix 122 rows 99 cols
[2021-05-17 09:13:42] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-17 09:13:42] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 122 rows 99 cols
[2021-05-17 09:13:42] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-17 09:13:42] [INFO ] State equation strengthened by 45 read => feed constraints.
[2021-05-17 09:13:42] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 99/112 places, 122/140 transitions.
[2021-05-17 09:13:42] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 09:13:42] [INFO ] Flatten gal took : 38 ms
FORMULA CANConstruction-PT-005-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 09:13:42] [INFO ] Flatten gal took : 11 ms
[2021-05-17 09:13:42] [INFO ] Input system was already deterministic with 122 transitions.
Finished random walk after 3123 steps, including 41 resets, run visited all 29 properties in 18 ms. (steps per millisecond=173 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 122/122 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 91 transition count 107
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 91 transition count 107
Applied a total of 16 rules in 7 ms. Remains 91 /99 variables (removed 8) and now considering 107/122 (removed 15) transitions.
// Phase 1: matrix 107 rows 91 cols
[2021-05-17 09:13:43] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-17 09:13:43] [INFO ] Implicit Places using invariants in 49 ms returned [48, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
// Phase 1: matrix 107 rows 89 cols
[2021-05-17 09:13:43] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:43] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 89/99 places, 107/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 87 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 105
Applied a total of 4 rules in 7 ms. Remains 87 /89 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 87 cols
[2021-05-17 09:13:43] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:43] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 105 rows 87 cols
[2021-05-17 09:13:43] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:43] [INFO ] State equation strengthened by 45 read => feed constraints.
[2021-05-17 09:13:43] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 87/99 places, 105/122 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CANConstruction-PT-005-00 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (LT s6 1) (LT s83 1)), p0:(LT s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 523 steps with 7 reset in 7 ms.
FORMULA CANConstruction-PT-005-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-00 finished in 497 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (G(p0)||(p0&&G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 122/122 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 99 transition count 91
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 68 transition count 91
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 62 place count 68 transition count 87
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 70 place count 64 transition count 87
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 76 place count 58 transition count 75
Iterating global reduction 2 with 6 rules applied. Total rules applied 82 place count 58 transition count 75
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 85 place count 58 transition count 72
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 55 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 96 place count 51 transition count 68
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 106 place count 46 transition count 77
Applied a total of 106 rules in 32 ms. Remains 46 /99 variables (removed 53) and now considering 77/122 (removed 45) transitions.
// Phase 1: matrix 77 rows 46 cols
[2021-05-17 09:13:43] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 09:13:43] [INFO ] Implicit Places using invariants in 31 ms returned [14, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
[2021-05-17 09:13:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 77 rows 44 cols
[2021-05-17 09:13:43] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-17 09:13:43] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Starting structural reductions, iteration 1 : 44/99 places, 77/122 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 40 transition count 73
Applied a total of 8 rules in 5 ms. Remains 40 /44 variables (removed 4) and now considering 73/77 (removed 4) transitions.
// Phase 1: matrix 73 rows 40 cols
[2021-05-17 09:13:43] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:43] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 73 rows 40 cols
[2021-05-17 09:13:43] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-17 09:13:43] [INFO ] State equation strengthened by 64 read => feed constraints.
[2021-05-17 09:13:43] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 40/99 places, 73/122 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-005-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s34 1), p0:(OR (LT s34 1) (LT s17 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3939 reset in 262 ms.
Stack based approach found an accepted trace after 852 steps with 33 reset with depth 27 and stack size 24 in 2 ms.
FORMULA CANConstruction-PT-005-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-01 finished in 593 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(F(p0)))&&(p1 U (G(p1)||(p1&&((p2&&F(p3))||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 122/122 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 92 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 92 transition count 109
Applied a total of 14 rules in 5 ms. Remains 92 /99 variables (removed 7) and now considering 109/122 (removed 13) transitions.
// Phase 1: matrix 109 rows 92 cols
[2021-05-17 09:13:44] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 09:13:44] [INFO ] Implicit Places using invariants in 30 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
// Phase 1: matrix 109 rows 91 cols
[2021-05-17 09:13:44] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 09:13:44] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 91/99 places, 109/122 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 108
Applied a total of 2 rules in 4 ms. Remains 90 /91 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 90 cols
[2021-05-17 09:13:44] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 09:13:44] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 108 rows 90 cols
[2021-05-17 09:13:44] [INFO ] Computed 7 place invariants in 8 ms
[2021-05-17 09:13:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2021-05-17 09:13:44] [INFO ] Implicit Places using invariants and state equation in 75 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 : 90/99 places, 108/122 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (AND (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-005-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p3) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=4 dest: 7}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND p2 (NOT p3) p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (LT s35 1) (LT s42 1)), p2:(LT s21 1), p3:(LT s77 1), p0:(OR (LT s60 1) (LT s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 183 ms.
Product exploration explored 100000 steps with 33333 reset in 163 ms.
Knowledge obtained : [p1, p2, p3, p0]
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (AND (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 33333 reset in 123 ms.
Product exploration explored 100000 steps with 33333 reset in 133 ms.
Applying partial POR strategy [false, true, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (AND (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p2))]
Support contains 6 out of 90 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 90/90 places, 108/108 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 90 transition count 108
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 18 place count 90 transition count 108
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 90 transition count 108
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 82 transition count 100
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 82 transition count 100
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 55 place count 82 transition count 100
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 72 place count 65 transition count 83
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 89 place count 65 transition count 83
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 65 transition count 99
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 93 rules in 17 ms. Remains 65 /90 variables (removed 25) and now considering 99/108 (removed 9) transitions.
[2021-05-17 09:13:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 99 rows 65 cols
[2021-05-17 09:13:45] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 09:13:45] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 65/90 places, 99/108 transitions.
Product exploration explored 100000 steps with 33333 reset in 321 ms.
Product exploration explored 100000 steps with 33333 reset in 315 ms.
[2021-05-17 09:13:46] [INFO ] Flatten gal took : 7 ms
[2021-05-17 09:13:46] [INFO ] Flatten gal took : 7 ms
[2021-05-17 09:13:46] [INFO ] Time to serialize gal into /tmp/LTL12442483626422136036.gal : 16 ms
[2021-05-17 09:13:46] [INFO ] Time to serialize properties into /tmp/LTL18124278260910134409.ltl : 14 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12442483626422136036.gal, -t, CGAL, -LTL, /tmp/LTL18124278260910134409.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12442483626422136036.gal -t CGAL -LTL /tmp/LTL18124278260910134409.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((Node4WaitAnswer<1)||(Node4OKshare<1))"))))&&(("((Node2Request<1)||(Node3IsInserted<1))")U((G("((Node2Request<1)||(Node3IsInserted<1))"))||(("((Node2Request<1)||(Node3IsInserted<1))")&&((("(Node1Bootstrap<1)")&&(F("(Node1GiveAnswer4<1)")))||(G("(Node1Bootstrap<1)"))))))))
Formula 0 simplified : !(XXF"((Node4WaitAnswer<1)||(Node4OKshare<1))" & ("((Node2Request<1)||(Node3IsInserted<1))" U (G"((Node2Request<1)||(Node3IsInserted<1))" | ("((Node2Request<1)||(Node3IsInserted<1))" & (("(Node1Bootstrap<1)" & F"(Node1GiveAnswer4<1)") | G"(Node1Bootstrap<1)")))))
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t15, t16, t26, t27, t37, t38, t50, t55, t60, t64, t68, t72, t73, t76, t86, t87, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/90/18/108
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
54 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.579939,39000,1,0,179,81409,258,108,2575,90147,240
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CANConstruction-PT-005-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CANConstruction-PT-005-02 finished in 3263 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 122/122 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 99 transition count 93
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 70 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 69 transition count 92
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 60 place count 69 transition count 89
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 66 place count 66 transition count 89
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 74 place count 58 transition count 74
Iterating global reduction 3 with 8 rules applied. Total rules applied 82 place count 58 transition count 74
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 58 transition count 71
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 88 place count 55 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 92 place count 53 transition count 69
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 102 place count 48 transition count 79
Applied a total of 102 rules in 13 ms. Remains 48 /99 variables (removed 51) and now considering 79/122 (removed 43) transitions.
// Phase 1: matrix 79 rows 48 cols
[2021-05-17 09:13:47] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 09:13:47] [INFO ] Implicit Places using invariants in 48 ms returned [18, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
[2021-05-17 09:13:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 79 rows 46 cols
[2021-05-17 09:13:47] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:47] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 46/99 places, 79/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 44 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 75
Applied a total of 8 rules in 11 ms. Remains 42 /46 variables (removed 4) and now considering 75/79 (removed 4) transitions.
// Phase 1: matrix 75 rows 42 cols
[2021-05-17 09:13:47] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:47] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 75 rows 42 cols
[2021-05-17 09:13:47] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:47] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-17 09:13:47] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 42/99 places, 75/122 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 38 steps with 2 reset in 0 ms.
FORMULA CANConstruction-PT-005-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-03 finished in 282 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(G(p0))||G(p1)) U X(!p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 122/122 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 91 transition count 107
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 91 transition count 107
Applied a total of 16 rules in 4 ms. Remains 91 /99 variables (removed 8) and now considering 107/122 (removed 15) transitions.
// Phase 1: matrix 107 rows 91 cols
[2021-05-17 09:13:47] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 09:13:47] [INFO ] Implicit Places using invariants in 34 ms returned [48, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
// Phase 1: matrix 107 rows 89 cols
[2021-05-17 09:13:47] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:47] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 89/99 places, 107/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 87 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 105
Applied a total of 4 rules in 2 ms. Remains 87 /89 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 87 cols
[2021-05-17 09:13:47] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:47] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 105 rows 87 cols
[2021-05-17 09:13:47] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-17 09:13:47] [INFO ] State equation strengthened by 45 read => feed constraints.
[2021-05-17 09:13:47] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 87/99 places, 105/122 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p1) p0), p0, p0, p0, true]
Running random walk in product with property : CANConstruction-PT-005-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=2, aps=[p1:(AND (GEQ s47 1) (GEQ s54 1)), p0:(OR (LT s30 1) (LT s72 1))], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-04 finished in 368 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 122/122 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 99 transition count 92
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 69 transition count 92
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 60 place count 69 transition count 88
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 68 place count 65 transition count 88
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 74 place count 59 transition count 76
Iterating global reduction 2 with 6 rules applied. Total rules applied 80 place count 59 transition count 76
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 84 place count 59 transition count 72
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 88 place count 55 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 92 place count 53 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 102 place count 48 transition count 79
Applied a total of 102 rules in 10 ms. Remains 48 /99 variables (removed 51) and now considering 79/122 (removed 43) transitions.
// Phase 1: matrix 79 rows 48 cols
[2021-05-17 09:13:48] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 09:13:48] [INFO ] Implicit Places using invariants in 37 ms returned [18, 24]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
[2021-05-17 09:13:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 79 rows 46 cols
[2021-05-17 09:13:48] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:48] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 46/99 places, 79/122 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 42 transition count 75
Applied a total of 8 rules in 4 ms. Remains 42 /46 variables (removed 4) and now considering 75/79 (removed 4) transitions.
// Phase 1: matrix 75 rows 42 cols
[2021-05-17 09:13:48] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:48] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 75 rows 42 cols
[2021-05-17 09:13:48] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:48] [INFO ] State equation strengthened by 64 read => feed constraints.
[2021-05-17 09:13:48] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 42/99 places, 75/122 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-005-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(AND (OR (LT s7 1) (LT s17 1)) (LT s15 1)), p0:(LT s33 1), p1:(OR (LT s7 1) (LT s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3547 reset in 144 ms.
Product exploration explored 100000 steps with 3559 reset in 143 ms.
Knowledge obtained : [p2, p0, p1]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3575 reset in 125 ms.
Product exploration explored 100000 steps with 3572 reset in 144 ms.
[2021-05-17 09:13:48] [INFO ] Flatten gal took : 5 ms
[2021-05-17 09:13:48] [INFO ] Flatten gal took : 4 ms
[2021-05-17 09:13:48] [INFO ] Time to serialize gal into /tmp/LTL5761823454495434012.gal : 2 ms
[2021-05-17 09:13:48] [INFO ] Time to serialize properties into /tmp/LTL10277825719348596390.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5761823454495434012.gal, -t, CGAL, -LTL, /tmp/LTL10277825719348596390.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5761823454495434012.gal -t CGAL -LTL /tmp/LTL10277825719348596390.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(Node2GiveAnswer4<1)")||(("((Node1IsInserted<1)||(Node3Request<1))")U(("(((Node1IsInserted<1)||(Node3Request<1))&&(Node3Bootstrap<1))")||(G("((Node1IsInserted<1)||(Node3Request<1))"))))))))
Formula 0 simplified : !GF("(Node2GiveAnswer4<1)" | ("((Node1IsInserted<1)||(Node3Request<1))" U ("(((Node1IsInserted<1)||(Node3Request<1))&&(Node3Bootstrap<1))" | G"((Node1IsInserted<1)||(Node3Request<1))")))
Reverse transition relation is NOT exact ! Due to transitions t0.t2.t3.t4, t12.t14.t15, t16, t34.t36.t37.t38, t46.t48.t49.t50, t23.t25.t26.t27, t63.t64.t27, t79.t64.t27, t107.t64.t27, t119.t64.t27, t75.t76.t9, t89.t76.t9, t101.t76.t9, t113.t76.t9, t67.t68.t43, t83.t68.t43, t95.t68.t43, t121.t68.t43, t98.t55, t71.t72.t55, t85.t72.t55, t111.t72.t55, t99.t56.t57.t51.t52.t53.t54, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/52/23/75
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
23 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.244688,25876,1,0,149,38762,196,86,1619,35861,213
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CANConstruction-PT-005-05 finished in 1223 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0 U p1)||(!p2&&G(!p3)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 99 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 99/99 places, 122/122 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 99 transition count 89
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 66 transition count 89
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 66 place count 66 transition count 86
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 63 transition count 86
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 59 transition count 78
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 59 transition count 78
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 59 transition count 75
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 86 place count 56 transition count 75
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 96 place count 51 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 106 place count 46 transition count 77
Applied a total of 106 rules in 10 ms. Remains 46 /99 variables (removed 53) and now considering 77/122 (removed 45) transitions.
// Phase 1: matrix 77 rows 46 cols
[2021-05-17 09:13:49] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 09:13:49] [INFO ] Implicit Places using invariants in 28 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
[2021-05-17 09:13:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 77 rows 44 cols
[2021-05-17 09:13:49] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:49] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 44/99 places, 77/122 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 40 transition count 73
Applied a total of 8 rules in 3 ms. Remains 40 /44 variables (removed 4) and now considering 73/77 (removed 4) transitions.
// Phase 1: matrix 73 rows 40 cols
[2021-05-17 09:13:49] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:49] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 73 rows 40 cols
[2021-05-17 09:13:49] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:49] [INFO ] State equation strengthened by 62 read => feed constraints.
[2021-05-17 09:13:49] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 40/99 places, 73/122 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (AND (NOT p1) p3)]
Running random walk in product with property : CANConstruction-PT-005-07 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p3), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s28 1), p2:(LT s31 1), p3:(LT s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 44 steps with 1 reset in 0 ms.
FORMULA CANConstruction-PT-005-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-07 finished in 254 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 122/122 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 91 transition count 107
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 91 transition count 107
Applied a total of 16 rules in 2 ms. Remains 91 /99 variables (removed 8) and now considering 107/122 (removed 15) transitions.
// Phase 1: matrix 107 rows 91 cols
[2021-05-17 09:13:49] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 09:13:49] [INFO ] Implicit Places using invariants in 31 ms returned [48, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
// Phase 1: matrix 107 rows 89 cols
[2021-05-17 09:13:49] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:49] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 89/99 places, 107/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 87 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 105
Applied a total of 4 rules in 1 ms. Remains 87 /89 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 87 cols
[2021-05-17 09:13:49] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:49] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 105 rows 87 cols
[2021-05-17 09:13:49] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2021-05-17 09:13:49] [INFO ] Implicit Places using invariants and state equation in 68 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 : 87/99 places, 105/122 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-005-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-08 finished in 247 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||(!p1&&X(F(p2))&&(!p0 U (p3||G(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 99 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 99/99 places, 122/122 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 92 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 92 transition count 109
Applied a total of 14 rules in 1 ms. Remains 92 /99 variables (removed 7) and now considering 109/122 (removed 13) transitions.
// Phase 1: matrix 109 rows 92 cols
[2021-05-17 09:13:49] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 09:13:49] [INFO ] Implicit Places using invariants in 29 ms returned [48, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
// Phase 1: matrix 109 rows 90 cols
[2021-05-17 09:13:49] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:49] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 90/99 places, 109/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 88 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 88 transition count 107
Applied a total of 4 rules in 1 ms. Remains 88 /90 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 88 cols
[2021-05-17 09:13:49] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:49] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 107 rows 88 cols
[2021-05-17 09:13:49] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2021-05-17 09:13:49] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 88/99 places, 107/122 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s49 1), p2:(GEQ s80 1), p1:(AND (GEQ s0 1) (GEQ s26 1))], 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 120 steps with 2 reset in 0 ms.
FORMULA CANConstruction-PT-005-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-09 finished in 281 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((G(p1)&&p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 122/122 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 92 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 92 transition count 109
Applied a total of 14 rules in 3 ms. Remains 92 /99 variables (removed 7) and now considering 109/122 (removed 13) transitions.
// Phase 1: matrix 109 rows 92 cols
[2021-05-17 09:13:49] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 09:13:50] [INFO ] Implicit Places using invariants in 31 ms returned [48, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
// Phase 1: matrix 109 rows 90 cols
[2021-05-17 09:13:50] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:50] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Starting structural reductions, iteration 1 : 90/99 places, 109/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 88 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 88 transition count 107
Applied a total of 4 rules in 1 ms. Remains 88 /90 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 88 cols
[2021-05-17 09:13:50] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:50] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 107 rows 88 cols
[2021-05-17 09:13:50] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:50] [INFO ] State equation strengthened by 45 read => feed constraints.
[2021-05-17 09:13:50] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 88/99 places, 107/122 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-005-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s54 1) (GEQ s68 1)), p1:(GEQ s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-10 finished in 297 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(!p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 122/122 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 99 transition count 89
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 66 transition count 89
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 66 place count 66 transition count 86
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 63 transition count 86
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 57 transition count 74
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 57 transition count 74
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 88 place count 57 transition count 70
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 92 place count 53 transition count 70
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 100 place count 49 transition count 66
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 110 place count 44 transition count 75
Applied a total of 110 rules in 9 ms. Remains 44 /99 variables (removed 55) and now considering 75/122 (removed 47) transitions.
// Phase 1: matrix 75 rows 44 cols
[2021-05-17 09:13:50] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 09:13:50] [INFO ] Implicit Places using invariants in 26 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
[2021-05-17 09:13:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 75 rows 42 cols
[2021-05-17 09:13:50] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:50] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 42/99 places, 75/122 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 38 transition count 71
Applied a total of 8 rules in 2 ms. Remains 38 /42 variables (removed 4) and now considering 71/75 (removed 4) transitions.
// Phase 1: matrix 71 rows 38 cols
[2021-05-17 09:13:50] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:50] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 71 rows 38 cols
[2021-05-17 09:13:50] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:50] [INFO ] State equation strengthened by 64 read => feed constraints.
[2021-05-17 09:13:50] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 38/99 places, 71/122 transitions.
Stuttering acceptance computed with spot in 24 ms :[p0]
Running random walk in product with property : CANConstruction-PT-005-11 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-11 finished in 181 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||X(F((p1&&F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 122/122 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 91 transition count 107
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 91 transition count 107
Applied a total of 16 rules in 1 ms. Remains 91 /99 variables (removed 8) and now considering 107/122 (removed 15) transitions.
// Phase 1: matrix 107 rows 91 cols
[2021-05-17 09:13:50] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 09:13:50] [INFO ] Implicit Places using invariants in 31 ms returned [48, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
// Phase 1: matrix 107 rows 89 cols
[2021-05-17 09:13:50] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:50] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 89/99 places, 107/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 87 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 105
Applied a total of 4 rules in 1 ms. Remains 87 /89 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 87 cols
[2021-05-17 09:13:50] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:50] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 105 rows 87 cols
[2021-05-17 09:13:50] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-17 09:13:50] [INFO ] State equation strengthened by 45 read => feed constraints.
[2021-05-17 09:13:50] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 87/99 places, 105/122 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-005-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s49 1), p1:(OR (LT s18 1) (LT s80 1)), p2:(OR (LT s6 1) (LT s23 1))], 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 119 ms.
Product exploration explored 100000 steps with 33333 reset in 110 ms.
Knowledge obtained : [(NOT p0), p1, p2]
Stuttering acceptance computed with spot in 96 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33333 reset in 106 ms.
Product exploration explored 100000 steps with 33333 reset in 112 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 100 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 87 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 87/87 places, 105/105 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 87 transition count 105
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 18 place count 87 transition count 105
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 87 transition count 105
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 77 transition count 95
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 77 transition count 95
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 60 place count 77 transition count 95
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 79 place count 58 transition count 76
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 98 place count 58 transition count 76
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 103 place count 58 transition count 96
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 103 rules in 7 ms. Remains 58 /87 variables (removed 29) and now considering 96/105 (removed 9) transitions.
[2021-05-17 09:13:51] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 96 rows 58 cols
[2021-05-17 09:13:51] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:51] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/87 places, 96/105 transitions.
Product exploration explored 100000 steps with 33333 reset in 284 ms.
Product exploration explored 100000 steps with 33333 reset in 285 ms.
[2021-05-17 09:13:52] [INFO ] Flatten gal took : 5 ms
[2021-05-17 09:13:52] [INFO ] Flatten gal took : 6 ms
[2021-05-17 09:13:52] [INFO ] Time to serialize gal into /tmp/LTL9117019761790282023.gal : 1 ms
[2021-05-17 09:13:52] [INFO ] Time to serialize properties into /tmp/LTL14307595280459530299.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9117019761790282023.gal, -t, CGAL, -LTL, /tmp/LTL14307595280459530299.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9117019761790282023.gal -t CGAL -LTL /tmp/LTL14307595280459530299.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(Node3IsNonInsertedNode>=1)"))||(X(F(("((Node1IsInserted<1)||(Node3requestsent1<1))")&&(F("((Node0IsInserted<1)||(Node1Request<1))"))))))))
Formula 0 simplified : !X(F"(Node3IsNonInsertedNode>=1)" | XF("((Node1IsInserted<1)||(Node3requestsent1<1))" & F"((Node0IsInserted<1)||(Node1Request<1))"))
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t15, t16, t26, t27, t37, t38, t49, t50, t60, t64, t68, t72, t76, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/90/15/105
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
45 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.461683,33744,1,0,174,67871,242,107,2488,75727,228
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CANConstruction-PT-005-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CANConstruction-PT-005-12 finished in 2219 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0&&X(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 122/122 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 92 transition count 108
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 92 transition count 108
Applied a total of 14 rules in 1 ms. Remains 92 /99 variables (removed 7) and now considering 108/122 (removed 14) transitions.
// Phase 1: matrix 108 rows 92 cols
[2021-05-17 09:13:52] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 09:13:52] [INFO ] Implicit Places using invariants in 37 ms returned [49, 63]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
// Phase 1: matrix 108 rows 90 cols
[2021-05-17 09:13:52] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-17 09:13:52] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 90/99 places, 108/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 88 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 88 transition count 106
Applied a total of 4 rules in 1 ms. Remains 88 /90 variables (removed 2) and now considering 106/108 (removed 2) transitions.
// Phase 1: matrix 106 rows 88 cols
[2021-05-17 09:13:52] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:52] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 106 rows 88 cols
[2021-05-17 09:13:52] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:52] [INFO ] State equation strengthened by 45 read => feed constraints.
[2021-05-17 09:13:52] [INFO ] Implicit Places using invariants and state equation in 75 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 : 88/99 places, 106/122 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CANConstruction-PT-005-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(LT s5 1), p1:(OR (LT s36 1) (LT s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 80 steps with 1 reset in 0 ms.
FORMULA CANConstruction-PT-005-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-13 finished in 307 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 122/122 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 99 transition count 97
Reduce places removed 25 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 30 rules applied. Total rules applied 55 place count 74 transition count 92
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 69 transition count 92
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 60 place count 69 transition count 89
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 66 place count 66 transition count 89
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 74 place count 58 transition count 74
Iterating global reduction 3 with 8 rules applied. Total rules applied 82 place count 58 transition count 74
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 58 transition count 71
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 88 place count 55 transition count 71
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 96 place count 51 transition count 67
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 106 place count 46 transition count 77
Applied a total of 106 rules in 10 ms. Remains 46 /99 variables (removed 53) and now considering 77/122 (removed 45) transitions.
// Phase 1: matrix 77 rows 46 cols
[2021-05-17 09:13:53] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 09:13:53] [INFO ] Implicit Places using invariants in 30 ms returned [17, 23]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
[2021-05-17 09:13:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 77 rows 44 cols
[2021-05-17 09:13:53] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:53] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 44/99 places, 77/122 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 40 transition count 73
Applied a total of 8 rules in 2 ms. Remains 40 /44 variables (removed 4) and now considering 73/77 (removed 4) transitions.
// Phase 1: matrix 73 rows 40 cols
[2021-05-17 09:13:53] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:53] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 73 rows 40 cols
[2021-05-17 09:13:53] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:53] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-17 09:13:53] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 40/99 places, 73/122 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-005-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s32 1)), p0:(AND (GEQ s1 1) (GEQ s17 1) (LT s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-14 finished in 231 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 122/122 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 99 transition count 91
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 68 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 67 transition count 90
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 64 place count 67 transition count 86
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 72 place count 63 transition count 86
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 79 place count 56 transition count 72
Iterating global reduction 3 with 7 rules applied. Total rules applied 86 place count 56 transition count 72
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 90 place count 56 transition count 68
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 94 place count 52 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 98 place count 50 transition count 66
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 106 place count 46 transition count 74
Applied a total of 106 rules in 6 ms. Remains 46 /99 variables (removed 53) and now considering 74/122 (removed 48) transitions.
// Phase 1: matrix 74 rows 46 cols
[2021-05-17 09:13:53] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 09:13:53] [INFO ] Implicit Places using invariants in 24 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
[2021-05-17 09:13:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 74 rows 45 cols
[2021-05-17 09:13:53] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 09:13:53] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 45/99 places, 74/122 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 43 transition count 72
Applied a total of 4 rules in 3 ms. Remains 43 /45 variables (removed 2) and now considering 72/74 (removed 2) transitions.
// Phase 1: matrix 72 rows 43 cols
[2021-05-17 09:13:53] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 09:13:53] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 72 rows 43 cols
[2021-05-17 09:13:53] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 09:13:53] [INFO ] State equation strengthened by 61 read => feed constraints.
[2021-05-17 09:13:53] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 43/99 places, 72/122 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s10 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-15 finished in 210 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621242834658

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="CANConstruction-PT-005"
export BK_EXAMINATION="LTLFireability"
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 CANConstruction-PT-005, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124155800005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-005.tgz
mv CANConstruction-PT-005 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;