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-162089127800421.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 Parking-PT-208, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127800421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 25 07:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 25 07:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 49K 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 Parking-PT-208-00
FORMULA_NAME Parking-PT-208-01
FORMULA_NAME Parking-PT-208-02
FORMULA_NAME Parking-PT-208-03
FORMULA_NAME Parking-PT-208-04
FORMULA_NAME Parking-PT-208-05
FORMULA_NAME Parking-PT-208-06
FORMULA_NAME Parking-PT-208-07
FORMULA_NAME Parking-PT-208-08
FORMULA_NAME Parking-PT-208-09
FORMULA_NAME Parking-PT-208-10
FORMULA_NAME Parking-PT-208-11
FORMULA_NAME Parking-PT-208-12
FORMULA_NAME Parking-PT-208-13
FORMULA_NAME Parking-PT-208-14
FORMULA_NAME Parking-PT-208-15

=== Now, execution of the tool begins

BK_START 1620980407548

Running Version 0
[2021-05-14 08:20:09] [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-14 08:20:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:20:09] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2021-05-14 08:20:09] [INFO ] Transformed 137 places.
[2021-05-14 08:20:09] [INFO ] Transformed 201 transitions.
[2021-05-14 08:20:09] [INFO ] Found NUPN structural information;
[2021-05-14 08:20:09] [INFO ] Parsed PT model containing 137 places and 201 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 08:20:09] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
Support contains 32 out of 137 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 137/137 places, 117/117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 135 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 135 transition count 115
Applied a total of 4 rules in 22 ms. Remains 135 /137 variables (removed 2) and now considering 115/117 (removed 2) transitions.
// Phase 1: matrix 115 rows 135 cols
[2021-05-14 08:20:09] [INFO ] Computed 34 place invariants in 16 ms
[2021-05-14 08:20:09] [INFO ] Implicit Places using invariants in 178 ms returned [28, 36, 52, 64, 66, 93, 101, 109, 117, 129]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 205 ms to find 10 implicit places.
// Phase 1: matrix 115 rows 125 cols
[2021-05-14 08:20:09] [INFO ] Computed 24 place invariants in 2 ms
[2021-05-14 08:20:09] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Starting structural reductions, iteration 1 : 125/137 places, 115/117 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 119 transition count 109
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 119 transition count 109
Applied a total of 12 rules in 9 ms. Remains 119 /125 variables (removed 6) and now considering 109/115 (removed 6) transitions.
// Phase 1: matrix 109 rows 119 cols
[2021-05-14 08:20:09] [INFO ] Computed 24 place invariants in 5 ms
[2021-05-14 08:20:09] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 109 rows 119 cols
[2021-05-14 08:20:09] [INFO ] Computed 24 place invariants in 3 ms
[2021-05-14 08:20:09] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:20:09] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 119/137 places, 109/117 transitions.
[2021-05-14 08:20:10] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-14 08:20:10] [INFO ] Flatten gal took : 35 ms
FORMULA Parking-PT-208-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 08:20:10] [INFO ] Flatten gal took : 18 ms
[2021-05-14 08:20:10] [INFO ] Input system was already deterministic with 109 transitions.
Incomplete random walk after 100000 steps, including 2906 resets, run finished after 368 ms. (steps per millisecond=271 ) properties (out of 24) seen :23
Running SMT prover for 1 properties.
// Phase 1: matrix 109 rows 119 cols
[2021-05-14 08:20:10] [INFO ] Computed 24 place invariants in 4 ms
[2021-05-14 08:20:10] [INFO ] [Real]Absence check using 24 positive place invariants in 2 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(F(p0))) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 109/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 108
Applied a total of 2 rules in 10 ms. Remains 118 /119 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 118 cols
[2021-05-14 08:20:10] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-14 08:20:10] [INFO ] Implicit Places using invariants in 76 ms returned [41, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
// Phase 1: matrix 108 rows 116 cols
[2021-05-14 08:20:10] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-14 08:20:10] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 116/119 places, 108/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 107
Applied a total of 2 rules in 7 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:10] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:10] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:10] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-14 08:20:10] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:20:10] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 115/119 places, 107/109 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Parking-PT-208-00 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s85 1), p0:(NEQ s42 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 2 ms.
FORMULA Parking-PT-208-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-00 finished in 559 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 109/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 108
Applied a total of 2 rules in 4 ms. Remains 118 /119 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 118 cols
[2021-05-14 08:20:11] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-14 08:20:11] [INFO ] Implicit Places using invariants in 58 ms returned [41, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
// Phase 1: matrix 108 rows 116 cols
[2021-05-14 08:20:11] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-14 08:20:11] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Starting structural reductions, iteration 1 : 116/119 places, 108/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 107
Applied a total of 2 rules in 5 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:11] [INFO ] Computed 22 place invariants in 7 ms
[2021-05-14 08:20:11] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:11] [INFO ] Computed 22 place invariants in 6 ms
[2021-05-14 08:20:11] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:20:11] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 115/119 places, 107/109 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-208-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s30 1), p1:(NEQ s114 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 35 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-01 finished in 399 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 109/109 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 118 transition count 105
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 115 transition count 105
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 115 transition count 102
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 12 place count 112 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 111 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 111 transition count 101
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 30 place count 103 transition count 93
Applied a total of 30 rules in 22 ms. Remains 103 /119 variables (removed 16) and now considering 93/109 (removed 16) transitions.
// Phase 1: matrix 93 rows 103 cols
[2021-05-14 08:20:11] [INFO ] Computed 24 place invariants in 0 ms
[2021-05-14 08:20:11] [INFO ] Implicit Places using invariants in 45 ms returned [34, 100]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
[2021-05-14 08:20:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 93 rows 101 cols
[2021-05-14 08:20:11] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:20:11] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 101/119 places, 93/109 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 100 transition count 92
Applied a total of 2 rules in 9 ms. Remains 100 /101 variables (removed 1) and now considering 92/93 (removed 1) transitions.
// Phase 1: matrix 92 rows 100 cols
[2021-05-14 08:20:11] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:11] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 92 rows 100 cols
[2021-05-14 08:20:11] [INFO ] Computed 22 place invariants in 5 ms
[2021-05-14 08:20:11] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 100/119 places, 92/109 transitions.
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Running random walk in product with property : Parking-PT-208-02 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:(NEQ s83 1)], 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 346 steps with 10 reset in 12 ms.
FORMULA Parking-PT-208-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-02 finished in 333 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G((p1&&X(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 109/109 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 119 transition count 105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 115 transition count 105
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 115 transition count 101
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 16 place count 111 transition count 101
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 30 place count 104 transition count 94
Applied a total of 30 rules in 17 ms. Remains 104 /119 variables (removed 15) and now considering 94/109 (removed 15) transitions.
// Phase 1: matrix 94 rows 104 cols
[2021-05-14 08:20:11] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-14 08:20:11] [INFO ] Implicit Places using invariants in 43 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
[2021-05-14 08:20:11] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 94 rows 103 cols
[2021-05-14 08:20:11] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-14 08:20:11] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 103/119 places, 94/109 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 113
Applied a total of 2 rules in 8 ms. Remains 102 /103 variables (removed 1) and now considering 113/94 (removed -19) transitions.
// Phase 1: matrix 113 rows 102 cols
[2021-05-14 08:20:12] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-14 08:20:12] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 113 rows 102 cols
[2021-05-14 08:20:12] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-14 08:20:12] [INFO ] State equation strengthened by 52 read => feed constraints.
[2021-05-14 08:20:12] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 102/119 places, 113/109 transitions.
Stuttering acceptance computed with spot in 65 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Parking-PT-208-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s76 0) (EQ s101 0)), p0:(AND (EQ s73 1) (EQ s98 1)), p2:(AND (EQ s70 1) (EQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-03 finished in 373 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 109/109 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 119 transition count 105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 115 transition count 105
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 115 transition count 101
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 111 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 110 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 110 transition count 100
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 102 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 36 place count 101 transition count 95
Applied a total of 36 rules in 13 ms. Remains 101 /119 variables (removed 18) and now considering 95/109 (removed 14) transitions.
// Phase 1: matrix 95 rows 101 cols
[2021-05-14 08:20:12] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-14 08:20:12] [INFO ] Implicit Places using invariants in 53 ms returned [35, 98]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
[2021-05-14 08:20:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 95 rows 99 cols
[2021-05-14 08:20:12] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:20:12] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 99/119 places, 95/109 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 98 transition count 110
Applied a total of 2 rules in 6 ms. Remains 98 /99 variables (removed 1) and now considering 110/95 (removed -15) transitions.
// Phase 1: matrix 110 rows 98 cols
[2021-05-14 08:20:12] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:12] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 110 rows 98 cols
[2021-05-14 08:20:12] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:12] [INFO ] State equation strengthened by 58 read => feed constraints.
[2021-05-14 08:20:12] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 98/119 places, 110/109 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-208-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s57 1), p0:(AND (EQ s18 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-04 finished in 348 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 109/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 108
Applied a total of 2 rules in 2 ms. Remains 118 /119 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 118 cols
[2021-05-14 08:20:12] [INFO ] Computed 24 place invariants in 0 ms
[2021-05-14 08:20:12] [INFO ] Implicit Places using invariants in 41 ms returned [41, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
// Phase 1: matrix 108 rows 116 cols
[2021-05-14 08:20:12] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-14 08:20:12] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Starting structural reductions, iteration 1 : 116/119 places, 108/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 107
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:12] [INFO ] Computed 22 place invariants in 6 ms
[2021-05-14 08:20:12] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:12] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:12] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:20:12] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 115/119 places, 107/109 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s97 0)], 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 386 ms.
Product exploration explored 100000 steps with 33333 reset in 319 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 245 ms.
Product exploration explored 100000 steps with 33333 reset in 256 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 115 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 115/115 places, 107/107 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 115 transition count 107
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 115 transition count 107
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 115 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 112 transition count 104
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 112 transition count 104
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 112 transition count 108
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 20 rules in 12 ms. Remains 112 /115 variables (removed 3) and now considering 108/107 (removed -1) transitions.
[2021-05-14 08:20:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 108 rows 112 cols
[2021-05-14 08:20:14] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:14] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 112/115 places, 108/107 transitions.
Product exploration explored 100000 steps with 33333 reset in 554 ms.
Product exploration explored 100000 steps with 33333 reset in 519 ms.
[2021-05-14 08:20:15] [INFO ] Flatten gal took : 8 ms
[2021-05-14 08:20:15] [INFO ] Flatten gal took : 8 ms
[2021-05-14 08:20:15] [INFO ] Time to serialize gal into /tmp/LTL9034921626695948359.gal : 14 ms
[2021-05-14 08:20:15] [INFO ] Time to serialize properties into /tmp/LTL8773853258999322010.ltl : 1 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/LTL9034921626695948359.gal, -t, CGAL, -LTL, /tmp/LTL8773853258999322010.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/LTL9034921626695948359.gal -t CGAL -LTL /tmp/LTL8773853258999322010.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p114==0)")))))
Formula 0 simplified : !XXF"(p114==0)"
Reverse transition relation is NOT exact ! Due to transitions t2, t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/105/2/107
Computing Next relation with stutter on 289 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
37 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.387254,30704,1,0,202,92729,240,101,3367,50296,230
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Parking-PT-208-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Parking-PT-208-05 finished in 3529 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 109/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 108
Applied a total of 2 rules in 20 ms. Remains 118 /119 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 118 cols
[2021-05-14 08:20:16] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-14 08:20:16] [INFO ] Implicit Places using invariants in 49 ms returned [41, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
// Phase 1: matrix 108 rows 116 cols
[2021-05-14 08:20:16] [INFO ] Computed 22 place invariants in 6 ms
[2021-05-14 08:20:16] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 116/119 places, 108/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 107
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:16] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:20:16] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:16] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:16] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:20:16] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 115/119 places, 107/109 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s87 1) (EQ s113 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][false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-06 finished in 347 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 109/109 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 119 transition count 105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 115 transition count 105
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 115 transition count 101
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 16 place count 111 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 110 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 110 transition count 100
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 102 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 36 place count 101 transition count 95
Applied a total of 36 rules in 13 ms. Remains 101 /119 variables (removed 18) and now considering 95/109 (removed 14) transitions.
// Phase 1: matrix 95 rows 101 cols
[2021-05-14 08:20:16] [INFO ] Computed 24 place invariants in 0 ms
[2021-05-14 08:20:16] [INFO ] Implicit Places using invariants in 41 ms returned [35, 98]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
[2021-05-14 08:20:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 95 rows 99 cols
[2021-05-14 08:20:16] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:16] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 99/119 places, 95/109 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 98 transition count 110
Applied a total of 2 rules in 6 ms. Remains 98 /99 variables (removed 1) and now considering 110/95 (removed -15) transitions.
// Phase 1: matrix 110 rows 98 cols
[2021-05-14 08:20:16] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:16] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 110 rows 98 cols
[2021-05-14 08:20:16] [INFO ] Computed 22 place invariants in 6 ms
[2021-05-14 08:20:16] [INFO ] State equation strengthened by 58 read => feed constraints.
[2021-05-14 08:20:16] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 98/119 places, 110/109 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-07 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:(NEQ s65 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]]
Product exploration explored 100000 steps with 6516 reset in 231 ms.
Stack based approach found an accepted trace after 96993 steps with 6332 reset with depth 32 and stack size 32 in 277 ms.
FORMULA Parking-PT-208-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-07 finished in 875 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||(X(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 109/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 108
Applied a total of 2 rules in 2 ms. Remains 118 /119 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 118 cols
[2021-05-14 08:20:17] [INFO ] Computed 24 place invariants in 0 ms
[2021-05-14 08:20:17] [INFO ] Implicit Places using invariants in 40 ms returned [41, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
// Phase 1: matrix 108 rows 116 cols
[2021-05-14 08:20:17] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:20:17] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 116/119 places, 108/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 107
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:17] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:17] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:17] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:17] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:20:17] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 115/119 places, 107/109 transitions.
Stuttering acceptance computed with spot in 63 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Parking-PT-208-09 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s8 1), p1:(AND (EQ s15 1) (EQ s39 1)), p2:(EQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 284 ms.
Product exploration explored 100000 steps with 50000 reset in 405 ms.
Knowledge obtained : [(NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 56 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 278 ms.
Product exploration explored 100000 steps with 50000 reset in 299 ms.
[2021-05-14 08:20:19] [INFO ] Flatten gal took : 7 ms
[2021-05-14 08:20:19] [INFO ] Flatten gal took : 6 ms
[2021-05-14 08:20:19] [INFO ] Time to serialize gal into /tmp/LTL9301856351303945483.gal : 2 ms
[2021-05-14 08:20:19] [INFO ] Time to serialize properties into /tmp/LTL9821702907259668231.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/LTL9301856351303945483.gal, -t, CGAL, -LTL, /tmp/LTL9821702907259668231.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/LTL9301856351303945483.gal -t CGAL -LTL /tmp/LTL9821702907259668231.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(p8==1)")||(("((p15==1)&&(p43==1))")&&(X("(p76==1)"))))))
Formula 0 simplified : !F("(p8==1)" | ("((p15==1)&&(p43==1))" & X"(p76==1)"))
Reverse transition relation is NOT exact ! Due to transitions t2, t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/105/2/107
Computing Next relation with stutter on 289 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
37 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.376732,30916,1,0,201,92363,243,100,3378,50202,232
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Parking-PT-208-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Parking-PT-208-09 finished in 2209 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 109/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 108
Applied a total of 2 rules in 3 ms. Remains 118 /119 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 118 cols
[2021-05-14 08:20:19] [INFO ] Computed 24 place invariants in 0 ms
[2021-05-14 08:20:19] [INFO ] Implicit Places using invariants in 40 ms returned [114]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
// Phase 1: matrix 108 rows 117 cols
[2021-05-14 08:20:19] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-14 08:20:19] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 117/119 places, 108/109 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 117 cols
[2021-05-14 08:20:19] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-14 08:20:19] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 117/119 places, 108/109 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-208-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s54 1)), p1:(AND (EQ s41 1) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-10 finished in 229 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 109/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 108
Applied a total of 2 rules in 3 ms. Remains 118 /119 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 118 cols
[2021-05-14 08:20:19] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-14 08:20:19] [INFO ] Implicit Places using invariants in 49 ms returned [41, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
// Phase 1: matrix 108 rows 116 cols
[2021-05-14 08:20:19] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:19] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Starting structural reductions, iteration 1 : 116/119 places, 108/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 107
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:19] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:20:19] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:19] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:19] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:20:20] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 115/119 places, 107/109 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, p0, p0, p0]
Running random walk in product with property : Parking-PT-208-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s85 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 440 steps with 12 reset in 1 ms.
FORMULA Parking-PT-208-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-12 finished in 343 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(F(!p0)))&&(G(p1)||F(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 109/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 108
Applied a total of 2 rules in 2 ms. Remains 118 /119 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 118 cols
[2021-05-14 08:20:20] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-14 08:20:20] [INFO ] Implicit Places using invariants in 42 ms returned [41, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
// Phase 1: matrix 108 rows 116 cols
[2021-05-14 08:20:20] [INFO ] Computed 22 place invariants in 6 ms
[2021-05-14 08:20:20] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 116/119 places, 108/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 107
Applied a total of 2 rules in 1 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:20] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:20:20] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:20] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:20:20] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:20:20] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 115/119 places, 107/109 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (NOT p2), (AND (NOT p2) (NOT p1)), p0]
Running random walk in product with property : Parking-PT-208-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (NEQ s70 1) (NEQ s94 1)), p2:(NEQ s16 1), p0:(NEQ s97 1)], nbAcceptance=1, 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 Parking-PT-208-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-13 finished in 371 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 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 109/109 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 118 transition count 105
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 115 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 114 transition count 104
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 114 transition count 101
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 14 place count 111 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 110 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 110 transition count 100
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 32 place count 102 transition count 92
Applied a total of 32 rules in 8 ms. Remains 102 /119 variables (removed 17) and now considering 92/109 (removed 17) transitions.
// Phase 1: matrix 92 rows 102 cols
[2021-05-14 08:20:20] [INFO ] Computed 24 place invariants in 0 ms
[2021-05-14 08:20:20] [INFO ] Implicit Places using invariants in 48 ms returned [35, 99]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
[2021-05-14 08:20:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 92 rows 100 cols
[2021-05-14 08:20:20] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:20] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 100/119 places, 92/109 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 99 transition count 91
Applied a total of 2 rules in 3 ms. Remains 99 /100 variables (removed 1) and now considering 91/92 (removed 1) transitions.
// Phase 1: matrix 91 rows 99 cols
[2021-05-14 08:20:20] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:20:20] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 91 rows 99 cols
[2021-05-14 08:20:20] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-14 08:20:20] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 99/119 places, 91/109 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s32 1)], 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 30 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-14 finished in 249 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G((F(p1)&&F(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 109/109 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 118 transition count 106
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 116 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 115 transition count 105
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 115 transition count 103
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 113 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 11 place count 112 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 112 transition count 102
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 28 place count 104 transition count 94
Applied a total of 28 rules in 8 ms. Remains 104 /119 variables (removed 15) and now considering 94/109 (removed 15) transitions.
// Phase 1: matrix 94 rows 104 cols
[2021-05-14 08:20:20] [INFO ] Computed 24 place invariants in 4 ms
[2021-05-14 08:20:20] [INFO ] Implicit Places using invariants in 55 ms returned [36, 101]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
[2021-05-14 08:20:20] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 94 rows 102 cols
[2021-05-14 08:20:20] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:20:20] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 102/119 places, 94/109 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 101 transition count 93
Applied a total of 2 rules in 3 ms. Remains 101 /102 variables (removed 1) and now considering 93/94 (removed 1) transitions.
// Phase 1: matrix 93 rows 101 cols
[2021-05-14 08:20:20] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:20] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 93 rows 101 cols
[2021-05-14 08:20:20] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:20:20] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 101/119 places, 93/109 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Parking-PT-208-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s38 1), p2:(EQ s32 1), p0:(NEQ s38 0)], nbAcceptance=2, 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 37 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-15 finished in 329 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620980422136

--------------------
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="Parking-PT-208"
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 Parking-PT-208, 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 r140-tall-162089127800421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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