Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998700324.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Parking-PT-432, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998700324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 5.6K Apr 30 06:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 06:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 06:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 30 06:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 192K May 10 09:34 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-432-LTLFireability-00
FORMULA_NAME Parking-PT-432-LTLFireability-01
FORMULA_NAME Parking-PT-432-LTLFireability-02
FORMULA_NAME Parking-PT-432-LTLFireability-03
FORMULA_NAME Parking-PT-432-LTLFireability-04
FORMULA_NAME Parking-PT-432-LTLFireability-05
FORMULA_NAME Parking-PT-432-LTLFireability-06
FORMULA_NAME Parking-PT-432-LTLFireability-07
FORMULA_NAME Parking-PT-432-LTLFireability-08
FORMULA_NAME Parking-PT-432-LTLFireability-09
FORMULA_NAME Parking-PT-432-LTLFireability-10
FORMULA_NAME Parking-PT-432-LTLFireability-11
FORMULA_NAME Parking-PT-432-LTLFireability-12
FORMULA_NAME Parking-PT-432-LTLFireability-13
FORMULA_NAME Parking-PT-432-LTLFireability-14
FORMULA_NAME Parking-PT-432-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653058062530

Running Version 202205111006
[2022-05-20 14:47:44] [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]
[2022-05-20 14:47:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 14:47:44] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2022-05-20 14:47:44] [INFO ] Transformed 529 places.
[2022-05-20 14:47:44] [INFO ] Transformed 785 transitions.
[2022-05-20 14:47:44] [INFO ] Found NUPN structural information;
[2022-05-20 14:47:44] [INFO ] Parsed PT model containing 529 places and 785 transitions in 423 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
FORMULA Parking-PT-432-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 457/457 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 525 transition count 453
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 525 transition count 453
Applied a total of 8 rules in 127 ms. Remains 525 /529 variables (removed 4) and now considering 453/457 (removed 4) transitions.
// Phase 1: matrix 453 rows 525 cols
[2022-05-20 14:47:45] [INFO ] Computed 124 place invariants in 38 ms
[2022-05-20 14:47:46] [INFO ] Implicit Places using invariants in 828 ms returned [64, 72, 80, 88, 96, 104, 112, 120, 144, 146, 189, 197, 205, 213, 221, 229, 237, 245, 269, 314, 322, 330, 338, 346, 354, 362, 370, 394, 396, 439, 447, 455, 463, 471, 479, 487, 495, 519, 521]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 877 ms to find 39 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 486/529 places, 453/457 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 455 transition count 422
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 455 transition count 422
Applied a total of 62 rules in 42 ms. Remains 455 /486 variables (removed 31) and now considering 422/453 (removed 31) transitions.
// Phase 1: matrix 422 rows 455 cols
[2022-05-20 14:47:46] [INFO ] Computed 85 place invariants in 4 ms
[2022-05-20 14:47:46] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 422 rows 455 cols
[2022-05-20 14:47:46] [INFO ] Computed 85 place invariants in 4 ms
[2022-05-20 14:47:46] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-05-20 14:47:47] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 455/529 places, 422/457 transitions.
Finished structural reductions, in 2 iterations. Remains : 455/529 places, 422/457 transitions.
Support contains 44 out of 455 places after structural reductions.
[2022-05-20 14:47:47] [INFO ] Flatten gal took : 101 ms
[2022-05-20 14:47:47] [INFO ] Flatten gal took : 52 ms
[2022-05-20 14:47:47] [INFO ] Input system was already deterministic with 422 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 1048 ms. (steps per millisecond=9 ) properties (out of 31) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 422 rows 455 cols
[2022-05-20 14:47:49] [INFO ] Computed 85 place invariants in 3 ms
[2022-05-20 14:47:49] [INFO ] [Real]Absence check using 85 positive place invariants in 30 ms returned sat
[2022-05-20 14:47:49] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-20 14:47:49] [INFO ] [Nat]Absence check using 85 positive place invariants in 33 ms returned sat
[2022-05-20 14:47:50] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-20 14:47:50] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-05-20 14:47:50] [INFO ] After 345ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-20 14:47:51] [INFO ] After 940ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 363 ms.
[2022-05-20 14:47:51] [INFO ] After 2249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 5 properties in 214 ms.
Support contains 8 out of 455 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 455/455 places, 422/422 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 455 transition count 406
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 439 transition count 406
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 439 transition count 390
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 423 transition count 390
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 110 place count 400 transition count 367
Free-agglomeration rule applied 104 times.
Iterating global reduction 2 with 104 rules applied. Total rules applied 214 place count 400 transition count 263
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 2 with 104 rules applied. Total rules applied 318 place count 296 transition count 263
Applied a total of 318 rules in 96 ms. Remains 296 /455 variables (removed 159) and now considering 263/422 (removed 159) transitions.
Finished structural reductions, in 1 iterations. Remains : 296/455 places, 263/422 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 263 rows 296 cols
[2022-05-20 14:47:52] [INFO ] Computed 85 place invariants in 2 ms
[2022-05-20 14:47:52] [INFO ] [Real]Absence check using 85 positive place invariants in 37 ms returned sat
[2022-05-20 14:47:52] [INFO ] After 179ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 14:47:52] [INFO ] State equation strengthened by 245 read => feed constraints.
[2022-05-20 14:47:52] [INFO ] After 47ms SMT Verify possible using 245 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 14:47:52] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 14:47:52] [INFO ] [Nat]Absence check using 85 positive place invariants in 21 ms returned sat
[2022-05-20 14:47:53] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 14:47:53] [INFO ] After 52ms SMT Verify possible using 245 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 14:47:53] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-20 14:47:53] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 296 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 296/296 places, 263/263 transitions.
Graph (complete) has 602 edges and 296 vertex of which 87 are kept as prefixes of interest. Removing 209 places using SCC suffix rule.8 ms
Discarding 209 places :
Also discarding 182 output transitions
Drop transitions removed 182 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 87 transition count 75
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 87 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 86 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 85 transition count 73
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 2 with 63 rules applied. Total rules applied 73 place count 62 transition count 33
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 52 rules applied. Total rules applied 125 place count 22 transition count 21
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 133 place count 14 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 133 place count 14 transition count 19
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 137 place count 12 transition count 19
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 144 place count 5 transition count 12
Iterating global reduction 5 with 7 rules applied. Total rules applied 151 place count 5 transition count 12
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 158 place count 5 transition count 5
Applied a total of 158 rules in 26 ms. Remains 5 /296 variables (removed 291) and now considering 5/263 (removed 258) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/296 places, 5/263 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA Parking-PT-432-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(((G(p0) U G(!p1))&&X(p1))))))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 454 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 421
Applied a total of 2 rules in 35 ms. Remains 454 /455 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 454 cols
[2022-05-20 14:47:53] [INFO ] Computed 85 place invariants in 3 ms
[2022-05-20 14:47:54] [INFO ] Implicit Places using invariants in 422 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 424 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/455 places, 421/422 transitions.
Applied a total of 0 rules in 16 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 557 ms :[true, true, p1, (NOT p1), (AND p1 (NOT p0)), p1, (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 2}, { cond=(OR (NOT p1) p0), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 5}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 5}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1} source=3 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=7 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=7 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s33 1) (EQ s122 1)), p0:(EQ s393 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 909 reset in 970 ms.
Product exploration explored 100000 steps with 915 reset in 1172 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (OR (NOT p1) p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 956 ms. Reduced automaton from 8 states, 33 edges and 2 AP to 8 states, 33 edges and 2 AP.
Stuttering acceptance computed with spot in 357 ms :[true, true, p1, (NOT p1), (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 91 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 421 rows 453 cols
[2022-05-20 14:47:58] [INFO ] Computed 84 place invariants in 4 ms
[2022-05-20 14:47:59] [INFO ] [Real]Absence check using 84 positive place invariants in 263 ms returned sat
[2022-05-20 14:47:59] [INFO ] After 224ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 14:47:59] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-05-20 14:47:59] [INFO ] After 41ms SMT Verify possible using 108 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-20 14:47:59] [INFO ] After 92ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 14:47:59] [INFO ] After 971ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 14:47:59] [INFO ] [Nat]Absence check using 84 positive place invariants in 23 ms returned sat
[2022-05-20 14:47:59] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 14:47:59] [INFO ] After 72ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 14:48:00] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-20 14:48:00] [INFO ] After 549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (OR (NOT p1) p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p0 (NOT p1))), (F p1), (F (AND (NOT p0) p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 12 factoid took 997 ms. Reduced automaton from 8 states, 33 edges and 2 AP to 8 states, 33 edges and 2 AP.
Stuttering acceptance computed with spot in 379 ms :[true, true, p1, (NOT p1), (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 543 ms :[true, true, p1, (NOT p1), (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 421 rows 453 cols
[2022-05-20 14:48:02] [INFO ] Computed 84 place invariants in 3 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (OR (NOT p1) p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p0 (NOT p1))), (F p1), (F (AND (NOT p0) p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), true]
Knowledge based reduction with 12 factoid took 927 ms. Reduced automaton from 8 states, 33 edges and 2 AP to 8 states, 33 edges and 2 AP.
Stuttering acceptance computed with spot in 330 ms :[true, true, p1, (NOT p1), (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 16 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 453 cols
[2022-05-20 14:48:03] [INFO ] Computed 84 place invariants in 3 ms
[2022-05-20 14:48:04] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 421 rows 453 cols
[2022-05-20 14:48:04] [INFO ] Computed 84 place invariants in 3 ms
[2022-05-20 14:48:04] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-05-20 14:48:04] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
// Phase 1: matrix 421 rows 453 cols
[2022-05-20 14:48:04] [INFO ] Computed 84 place invariants in 3 ms
[2022-05-20 14:48:05] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 453/453 places, 421/421 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR p0 (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 676 ms. Reduced automaton from 8 states, 33 edges and 2 AP to 8 states, 33 edges and 2 AP.
Stuttering acceptance computed with spot in 412 ms :[true, true, p1, (NOT p1), (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 91 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 421 rows 453 cols
[2022-05-20 14:48:06] [INFO ] Computed 84 place invariants in 3 ms
[2022-05-20 14:48:06] [INFO ] [Real]Absence check using 84 positive place invariants in 24 ms returned sat
[2022-05-20 14:48:07] [INFO ] After 219ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 14:48:07] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-05-20 14:48:07] [INFO ] After 39ms SMT Verify possible using 108 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-20 14:48:07] [INFO ] After 85ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 14:48:07] [INFO ] After 428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 14:48:07] [INFO ] [Nat]Absence check using 84 positive place invariants in 34 ms returned sat
[2022-05-20 14:48:07] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 14:48:07] [INFO ] After 77ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 14:48:07] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-05-20 14:48:07] [INFO ] After 627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR p0 (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p0 (NOT p1))), (F p1), (F (AND (NOT p0) p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 12 factoid took 1069 ms. Reduced automaton from 8 states, 33 edges and 2 AP to 8 states, 33 edges and 2 AP.
Stuttering acceptance computed with spot in 367 ms :[true, true, p1, (NOT p1), (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 405 ms :[true, true, p1, (NOT p1), (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 421 rows 453 cols
[2022-05-20 14:48:09] [INFO ] Computed 84 place invariants in 3 ms
Proved EG true
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR p0 (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p0 (NOT p1))), (F p1), (F (AND (NOT p0) p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), true]
Knowledge based reduction with 12 factoid took 1108 ms. Reduced automaton from 8 states, 33 edges and 2 AP to 8 states, 33 edges and 2 AP.
Stuttering acceptance computed with spot in 592 ms :[true, true, p1, (NOT p1), (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 439 ms :[true, true, p1, (NOT p1), (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 909 reset in 841 ms.
Product exploration explored 100000 steps with 915 reset in 830 ms.
Built C files in :
/tmp/ltsmin15339412799011974319
[2022-05-20 14:48:14] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15339412799011974319
Running compilation step : cd /tmp/ltsmin15339412799011974319;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1681 ms.
Running link step : cd /tmp/ltsmin15339412799011974319;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15339412799011974319;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8791823439288183520.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 19 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 453 cols
[2022-05-20 14:48:29] [INFO ] Computed 84 place invariants in 2 ms
[2022-05-20 14:48:29] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 421 rows 453 cols
[2022-05-20 14:48:29] [INFO ] Computed 84 place invariants in 4 ms
[2022-05-20 14:48:30] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-05-20 14:48:30] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1043 ms to find 0 implicit places.
// Phase 1: matrix 421 rows 453 cols
[2022-05-20 14:48:30] [INFO ] Computed 84 place invariants in 3 ms
[2022-05-20 14:48:30] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 453/453 places, 421/421 transitions.
Built C files in :
/tmp/ltsmin11433981923768741248
[2022-05-20 14:48:31] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11433981923768741248
Running compilation step : cd /tmp/ltsmin11433981923768741248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1012 ms.
Running link step : cd /tmp/ltsmin11433981923768741248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11433981923768741248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15771262692555557787.hoa' '--buchi-type=spotba'
LTSmin run took 614 ms.
FORMULA Parking-PT-432-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-432-LTLFireability-00 finished in 39031 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(F((!(p0 U X(p1))||(p2 U !p0)))) U p3))'
Support contains 6 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 455 transition count 407
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 440 transition count 407
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 440 transition count 392
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 425 transition count 392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 424 transition count 391
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 424 transition count 391
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 106 place count 402 transition count 369
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 108 place count 401 transition count 376
Applied a total of 108 rules in 81 ms. Remains 401 /455 variables (removed 54) and now considering 376/422 (removed 46) transitions.
// Phase 1: matrix 376 rows 401 cols
[2022-05-20 14:48:32] [INFO ] Computed 85 place invariants in 2 ms
[2022-05-20 14:48:33] [INFO ] Implicit Places using invariants in 336 ms returned [210]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 338 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/455 places, 376/422 transitions.
Applied a total of 0 rules in 25 ms. Remains 400 /400 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 400/455 places, 376/422 transitions.
Stuttering acceptance computed with spot in 291 ms :[p3, true, (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=p3, acceptance={} source=2 dest: 3}, { cond=(AND p0 p3), acceptance={} source=2 dest: 4}, { cond=(AND p2 p0 p3), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}, { cond=p0, acceptance={0, 1} source=3 dest: 4}, { cond=(AND p2 p0), acceptance={1} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p2 p0), acceptance={1} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=6 dest: 5}]], initial=0, aps=[p3:(EQ s367 1), p0:(AND (EQ s35 1) (EQ s70 1)), p2:(AND (EQ s91 1) (EQ s118 1)), p1:(EQ s28 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 6787 steps with 60 reset in 55 ms.
FORMULA Parking-PT-432-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-01 finished in 823 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(G((X(p2)&&p1))))&&p0))))'
Support contains 2 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 455 transition count 406
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 439 transition count 406
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 439 transition count 390
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 423 transition count 390
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 422 transition count 389
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 422 transition count 389
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 112 place count 399 transition count 366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 398 transition count 373
Applied a total of 114 rules in 70 ms. Remains 398 /455 variables (removed 57) and now considering 373/422 (removed 49) transitions.
// Phase 1: matrix 373 rows 398 cols
[2022-05-20 14:48:33] [INFO ] Computed 85 place invariants in 5 ms
[2022-05-20 14:48:33] [INFO ] Implicit Places using invariants in 395 ms returned [209]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 397 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 397/455 places, 373/422 transitions.
Applied a total of 0 rules in 28 ms. Remains 397 /397 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 397/455 places, 373/422 transitions.
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s6 1) (EQ s95 1)), p2:(AND (EQ s6 1) (EQ s95 1)), p0:(AND (EQ s6 1) (EQ s95 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 101 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-02 finished in 571 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(p0)))||G(p1)))'
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 454 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 421
Applied a total of 2 rules in 17 ms. Remains 454 /455 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 454 cols
[2022-05-20 14:48:34] [INFO ] Computed 85 place invariants in 3 ms
[2022-05-20 14:48:34] [INFO ] Implicit Places using invariants in 486 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 488 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/455 places, 421/422 transitions.
Applied a total of 0 rules in 14 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (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-432-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s373 0) (EQ s436 0)), p1:(AND (EQ s412 1) (EQ s452 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2135 ms.
Product exploration explored 100000 steps with 33333 reset in 1741 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Parking-PT-432-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-432-LTLFireability-04 finished in 4755 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 454 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 421
Applied a total of 2 rules in 13 ms. Remains 454 /455 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 454 cols
[2022-05-20 14:48:38] [INFO ] Computed 85 place invariants in 2 ms
[2022-05-20 14:48:39] [INFO ] Implicit Places using invariants in 314 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 316 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/455 places, 421/422 transitions.
Applied a total of 0 rules in 10 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (NEQ s291 1) (NEQ s345 1)), p0:(AND (EQ s256 1) (EQ s296 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1456 ms.
Product exploration explored 100000 steps with 33333 reset in 1507 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Parking-PT-432-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-432-LTLFireability-05 finished in 3600 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 454 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 421
Applied a total of 2 rules in 16 ms. Remains 454 /455 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 454 cols
[2022-05-20 14:48:42] [INFO ] Computed 85 place invariants in 1 ms
[2022-05-20 14:48:42] [INFO ] Implicit Places using invariants in 352 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 357 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/455 places, 421/422 transitions.
Applied a total of 0 rules in 8 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-06 automaton TGBA Formula[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:(EQ s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-06 finished in 478 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(G(F(p0))))||p1)))'
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 6 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2022-05-20 14:48:42] [INFO ] Computed 85 place invariants in 2 ms
[2022-05-20 14:48:43] [INFO ] Implicit Places using invariants in 315 ms returned []
// Phase 1: matrix 422 rows 455 cols
[2022-05-20 14:48:43] [INFO ] Computed 85 place invariants in 10 ms
[2022-05-20 14:48:43] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-05-20 14:48:44] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 455 cols
[2022-05-20 14:48:44] [INFO ] Computed 85 place invariants in 9 ms
[2022-05-20 14:48:44] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 455/455 places, 422/422 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s213 1) (EQ s237 1)), p0:(AND (EQ s169 1) (EQ s239 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-07 finished in 1703 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 454 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 421
Applied a total of 2 rules in 12 ms. Remains 454 /455 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 454 cols
[2022-05-20 14:48:44] [INFO ] Computed 85 place invariants in 2 ms
[2022-05-20 14:48:44] [INFO ] Implicit Places using invariants in 337 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 342 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/455 places, 421/422 transitions.
Applied a total of 0 rules in 6 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-08 automaton TGBA Formula[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:(AND (EQ s155 1) (EQ s221 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-08 finished in 453 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p1)||p2))&&p0)))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 454 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 421
Applied a total of 2 rules in 11 ms. Remains 454 /455 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 454 cols
[2022-05-20 14:48:45] [INFO ] Computed 85 place invariants in 2 ms
[2022-05-20 14:48:45] [INFO ] Implicit Places using invariants in 386 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 387 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/455 places, 421/422 transitions.
Applied a total of 0 rules in 7 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : Parking-PT-432-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s399 1), p2:(AND (EQ s168 1) (EQ s238 1)), p0:(AND (EQ s168 1) (EQ s238 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-10 finished in 572 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U F((G((G(p1) U p2))||X(p3)||p0)))))'
Support contains 6 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 454 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 421
Applied a total of 2 rules in 14 ms. Remains 454 /455 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 454 cols
[2022-05-20 14:48:45] [INFO ] Computed 85 place invariants in 2 ms
[2022-05-20 14:48:45] [INFO ] Implicit Places using invariants in 322 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 327 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/455 places, 421/422 transitions.
Applied a total of 0 rules in 7 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : Parking-PT-432-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p3) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) p1), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) p1), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) p1), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) p1), acceptance={0, 1} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(EQ s48 1), p2:(AND (EQ s11 1) (EQ s439 1)), p1:(AND (EQ s161 1) (EQ s207 1)), p3:(EQ s173 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1753 ms.
Product exploration explored 100000 steps with 50000 reset in 1787 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p3) p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 169 ms. Reduced automaton from 5 states, 15 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA Parking-PT-432-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-432-LTLFireability-11 finished in 4316 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X((X(p1)||p0)))&&p2)))'
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 454 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 421
Applied a total of 2 rules in 12 ms. Remains 454 /455 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 454 cols
[2022-05-20 14:48:49] [INFO ] Computed 85 place invariants in 2 ms
[2022-05-20 14:48:50] [INFO ] Implicit Places using invariants in 392 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 397 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/455 places, 421/422 transitions.
Applied a total of 0 rules in 8 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-432-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s250 0) (EQ s325 0)), p0:(OR (AND (EQ s255 1) (EQ s338 1)) (EQ s147 1)), p1:(AND (EQ s255 1) (EQ s338 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2004 ms.
Product exploration explored 100000 steps with 50000 reset in 1718 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p0), (X p2), (X (X p2))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Parking-PT-432-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-432-LTLFireability-13 finished in 4480 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&p1)))'
Support contains 2 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 454 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 421
Applied a total of 2 rules in 13 ms. Remains 454 /455 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 454 cols
[2022-05-20 14:48:54] [INFO ] Computed 85 place invariants in 3 ms
[2022-05-20 14:48:54] [INFO ] Implicit Places using invariants in 449 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 453 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/455 places, 421/422 transitions.
Applied a total of 0 rules in 16 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s423 1), p0:(EQ s355 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-15 finished in 697 ms.
All properties solved by simple procedures.
Total runtime 70683 ms.

BK_STOP 1653058135275

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-432"
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-432, 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 r150-smll-165276998700324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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