Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 15:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 14:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 107K Mar 5 18:23 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-416-LTLFireability-00
FORMULA_NAME Parking-PT-416-LTLFireability-01
FORMULA_NAME Parking-PT-416-LTLFireability-02
FORMULA_NAME Parking-PT-416-LTLFireability-03
FORMULA_NAME Parking-PT-416-LTLFireability-04
FORMULA_NAME Parking-PT-416-LTLFireability-05
FORMULA_NAME Parking-PT-416-LTLFireability-06
FORMULA_NAME Parking-PT-416-LTLFireability-07
FORMULA_NAME Parking-PT-416-LTLFireability-08
FORMULA_NAME Parking-PT-416-LTLFireability-09
FORMULA_NAME Parking-PT-416-LTLFireability-10
FORMULA_NAME Parking-PT-416-LTLFireability-11
FORMULA_NAME Parking-PT-416-LTLFireability-12
FORMULA_NAME Parking-PT-416-LTLFireability-13
FORMULA_NAME Parking-PT-416-LTLFireability-14
FORMULA_NAME Parking-PT-416-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678786088460

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-416
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 09:28:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 09:28:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:28:11] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-14 09:28:11] [INFO ] Transformed 305 places.
[2023-03-14 09:28:11] [INFO ] Transformed 433 transitions.
[2023-03-14 09:28:11] [INFO ] Found NUPN structural information;
[2023-03-14 09:28:11] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
FORMULA Parking-PT-416-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 302 transition count 254
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 302 transition count 254
Applied a total of 6 rules in 66 ms. Remains 302 /305 variables (removed 3) and now considering 254/257 (removed 3) transitions.
// Phase 1: matrix 254 rows 302 cols
[2023-03-14 09:28:11] [INFO ] Computed 76 place invariants in 23 ms
[2023-03-14 09:28:12] [INFO ] Implicit Places using invariants in 580 ms returned [48, 56, 64, 72, 88, 90, 118, 126, 134, 158, 160, 187, 195, 203, 211, 227, 264, 272, 280, 296, 298]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 624 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 281/305 places, 254/257 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 269 transition count 242
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 269 transition count 242
Applied a total of 24 rules in 29 ms. Remains 269 /281 variables (removed 12) and now considering 242/254 (removed 12) transitions.
// Phase 1: matrix 242 rows 269 cols
[2023-03-14 09:28:12] [INFO ] Computed 55 place invariants in 8 ms
[2023-03-14 09:28:14] [INFO ] Implicit Places using invariants in 2058 ms returned []
[2023-03-14 09:28:14] [INFO ] Invariant cache hit.
[2023-03-14 09:28:14] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-14 09:28:14] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 2439 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 269/305 places, 242/257 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3159 ms. Remains : 269/305 places, 242/257 transitions.
Support contains 38 out of 269 places after structural reductions.
[2023-03-14 09:28:14] [INFO ] Flatten gal took : 66 ms
[2023-03-14 09:28:14] [INFO ] Flatten gal took : 30 ms
[2023-03-14 09:28:14] [INFO ] Input system was already deterministic with 242 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 669 ms. (steps per millisecond=14 ) properties (out of 28) seen :22
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-14 09:28:15] [INFO ] Invariant cache hit.
[2023-03-14 09:28:16] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned sat
[2023-03-14 09:28:16] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 09:28:16] [INFO ] [Nat]Absence check using 55 positive place invariants in 22 ms returned sat
[2023-03-14 09:28:16] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-14 09:28:16] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-14 09:28:16] [INFO ] After 133ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-14 09:28:16] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-14 09:28:16] [INFO ] After 831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 65 ms.
Support contains 11 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 242/242 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 269 transition count 235
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 262 transition count 235
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 262 transition count 228
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 28 place count 255 transition count 228
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 62 place count 238 transition count 211
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 237 transition count 230
Free-agglomeration rule applied 53 times.
Iterating global reduction 2 with 53 rules applied. Total rules applied 117 place count 237 transition count 177
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 2 with 53 rules applied. Total rules applied 170 place count 184 transition count 177
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 172 place count 184 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 174 place count 182 transition count 175
Applied a total of 174 rules in 139 ms. Remains 182 /269 variables (removed 87) and now considering 175/242 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 182/269 places, 175/242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 175 rows 182 cols
[2023-03-14 09:28:17] [INFO ] Computed 55 place invariants in 3 ms
[2023-03-14 09:28:17] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 09:28:17] [INFO ] [Nat]Absence check using 55 positive place invariants in 22 ms returned sat
[2023-03-14 09:28:17] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 09:28:17] [INFO ] State equation strengthened by 151 read => feed constraints.
[2023-03-14 09:28:17] [INFO ] After 40ms SMT Verify possible using 151 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 09:28:17] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-14 09:28:17] [INFO ] After 310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 1 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||F(p1))))'
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 27 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-14 09:28:18] [INFO ] Computed 55 place invariants in 3 ms
[2023-03-14 09:28:18] [INFO ] Implicit Places using invariants in 223 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 225 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 19 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-14 09:28:18] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-14 09:28:18] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-14 09:28:18] [INFO ] Invariant cache hit.
[2023-03-14 09:28:19] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-14 09:28:19] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 958 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-416-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (NEQ s149 1) (NEQ s171 1)), p0:(OR (EQ s104 0) (EQ s142 0))], 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 1469 ms.
Product exploration explored 100000 steps with 50000 reset in 872 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 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-416-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-416-LTLFireability-00 finished in 3824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 268 transition count 234
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 261 transition count 234
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 261 transition count 227
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 28 place count 254 transition count 227
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 251 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 251 transition count 224
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 68 place count 234 transition count 207
Applied a total of 68 rules in 48 ms. Remains 234 /269 variables (removed 35) and now considering 207/242 (removed 35) transitions.
// Phase 1: matrix 207 rows 234 cols
[2023-03-14 09:28:22] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-14 09:28:22] [INFO ] Implicit Places using invariants in 169 ms returned [109, 177, 201]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 172 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/269 places, 207/242 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 230 transition count 206
Applied a total of 2 rules in 18 ms. Remains 230 /231 variables (removed 1) and now considering 206/207 (removed 1) transitions.
// Phase 1: matrix 206 rows 230 cols
[2023-03-14 09:28:22] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-14 09:28:22] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-14 09:28:22] [INFO ] Invariant cache hit.
[2023-03-14 09:28:22] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/269 places, 206/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 731 ms. Remains : 230/269 places, 206/242 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s205 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-01 finished in 786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 242/242 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 0 with 8 rules applied. Total rules applied 8 place count 269 transition count 234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 261 transition count 234
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 261 transition count 226
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 32 place count 253 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 250 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 250 transition count 223
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 233 transition count 206
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 231 transition count 244
Applied a total of 76 rules in 80 ms. Remains 231 /269 variables (removed 38) and now considering 244/242 (removed -2) transitions.
// Phase 1: matrix 244 rows 231 cols
[2023-03-14 09:28:22] [INFO ] Computed 55 place invariants in 3 ms
[2023-03-14 09:28:23] [INFO ] Implicit Places using invariants in 234 ms returned [109, 176, 200]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 240 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 228/269 places, 244/242 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 227 transition count 259
Applied a total of 2 rules in 41 ms. Remains 227 /228 variables (removed 1) and now considering 259/244 (removed -15) transitions.
// Phase 1: matrix 259 rows 227 cols
[2023-03-14 09:28:23] [INFO ] Computed 52 place invariants in 4 ms
[2023-03-14 09:28:23] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-14 09:28:23] [INFO ] Invariant cache hit.
[2023-03-14 09:28:23] [INFO ] State equation strengthened by 124 read => feed constraints.
[2023-03-14 09:28:24] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 227/269 places, 259/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1236 ms. Remains : 227/269 places, 259/242 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s78 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-02 finished in 1329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p0 U p1) U p2))||G(p3)))'
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 12 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-14 09:28:24] [INFO ] Computed 55 place invariants in 3 ms
[2023-03-14 09:28:24] [INFO ] Implicit Places using invariants in 299 ms returned [126, 201]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 302 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/269 places, 239/242 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 263 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 238
Applied a total of 2 rules in 11 ms. Remains 263 /264 variables (removed 1) and now considering 238/239 (removed 1) transitions.
// Phase 1: matrix 238 rows 263 cols
[2023-03-14 09:28:24] [INFO ] Computed 53 place invariants in 2 ms
[2023-03-14 09:28:24] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-14 09:28:24] [INFO ] Invariant cache hit.
[2023-03-14 09:28:25] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-14 09:28:25] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/269 places, 238/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1178 ms. Remains : 263/269 places, 238/242 transitions.
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Parking-PT-416-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 4}], [{ cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p3 (NOT p2) p1) (AND p3 (NOT p2) p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s115 0), p2:(AND (EQ s225 1) (EQ s259 1)), p1:(OR (EQ s115 1) (AND (EQ s225 1) (EQ s259 1))), p0:(AND (EQ s18 1) (EQ s186 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1361 ms.
Product exploration explored 100000 steps with 50000 reset in 948 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 p3 (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND p3 (NOT p2) p1) (AND p3 (NOT p2) p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (NOT (AND p3 (NOT p1) p0)))), true, (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p3 (NOT p2) p1) (AND p3 (NOT p2) p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p3 (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))
Knowledge based reduction with 23 factoid took 602 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-416-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-416-LTLFireability-03 finished in 4520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 8 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-14 09:28:28] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-14 09:28:28] [INFO ] Implicit Places using invariants in 161 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 166 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 6 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-14 09:28:28] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-14 09:28:29] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-14 09:28:29] [INFO ] Invariant cache hit.
[2023-03-14 09:28:29] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-14 09:28:29] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 876 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-416-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s156 1) (EQ s97 1)), p0:(OR (EQ s3 0) (EQ s191 0))], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 544 steps with 6 reset in 4 ms.
FORMULA Parking-PT-416-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-04 finished in 1047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G((p1&&X(p2)))))&&p0)))'
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 30 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-14 09:28:29] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-14 09:28:29] [INFO ] Implicit Places using invariants in 216 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 218 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 10 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-14 09:28:30] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-14 09:28:30] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-14 09:28:30] [INFO ] Invariant cache hit.
[2023-03-14 09:28:30] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-14 09:28:30] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 941 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(AND (EQ s206 1) (EQ s254 1)), p1:(EQ s28 1), p2:(EQ s0 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-05 finished in 1176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G((p0 U p1)))))))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 267 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 267 transition count 240
Applied a total of 4 rules in 7 ms. Remains 267 /269 variables (removed 2) and now considering 240/242 (removed 2) transitions.
// Phase 1: matrix 240 rows 267 cols
[2023-03-14 09:28:30] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-14 09:28:31] [INFO ] Implicit Places using invariants in 294 ms returned [127, 202, 229]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 296 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/269 places, 240/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 262 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 262 transition count 238
Applied a total of 4 rules in 10 ms. Remains 262 /264 variables (removed 2) and now considering 238/240 (removed 2) transitions.
// Phase 1: matrix 238 rows 262 cols
[2023-03-14 09:28:31] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-14 09:28:31] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-14 09:28:31] [INFO ] Invariant cache hit.
[2023-03-14 09:28:31] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-14 09:28:31] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 262/269 places, 238/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1080 ms. Remains : 262/269 places, 238/242 transitions.
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s82 1), p1:(AND (EQ s234 1) (EQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-06 finished in 1366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Reduce places removed 1 places and 1 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 0 with 8 rules applied. Total rules applied 8 place count 268 transition count 233
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 260 transition count 233
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 260 transition count 225
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 32 place count 252 transition count 225
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 249 transition count 222
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 249 transition count 222
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
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 70 place count 233 transition count 206
Applied a total of 70 rules in 38 ms. Remains 233 /269 variables (removed 36) and now considering 206/242 (removed 36) transitions.
// Phase 1: matrix 206 rows 233 cols
[2023-03-14 09:28:32] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-14 09:28:32] [INFO ] Implicit Places using invariants in 284 ms returned [110, 178, 202]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 287 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/269 places, 206/242 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 229 transition count 205
Applied a total of 2 rules in 16 ms. Remains 229 /230 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 229 cols
[2023-03-14 09:28:32] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-14 09:28:32] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-14 09:28:32] [INFO ] Invariant cache hit.
[2023-03-14 09:28:33] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 229/269 places, 205/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 900 ms. Remains : 229/269 places, 205/242 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-07 automaton TGBA Formula[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:(EQ s98 0)], 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 1338 reset in 384 ms.
Product exploration explored 100000 steps with 1340 reset in 585 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 205/205 transitions.
Applied a total of 0 rules in 10 ms. Remains 229 /229 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2023-03-14 09:28:34] [INFO ] Invariant cache hit.
[2023-03-14 09:28:35] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-14 09:28:35] [INFO ] Invariant cache hit.
[2023-03-14 09:28:35] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2023-03-14 09:28:35] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-14 09:28:35] [INFO ] Invariant cache hit.
[2023-03-14 09:28:35] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1041 ms. Remains : 229/229 places, 205/205 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Finished random walk after 573 steps, including 7 resets, run visited all 1 properties in 9 ms. (steps per millisecond=63 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1335 reset in 512 ms.
Product exploration explored 100000 steps with 1344 reset in 564 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 205/205 transitions.
Applied a total of 0 rules in 9 ms. Remains 229 /229 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2023-03-14 09:28:37] [INFO ] Invariant cache hit.
[2023-03-14 09:28:38] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-14 09:28:38] [INFO ] Invariant cache hit.
[2023-03-14 09:28:38] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2023-03-14 09:28:38] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-14 09:28:38] [INFO ] Invariant cache hit.
[2023-03-14 09:28:38] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 941 ms. Remains : 229/229 places, 205/205 transitions.
Treatment of property Parking-PT-416-LTLFireability-07 finished in 6556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&F(p2)&&p0))))'
Support contains 6 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 10 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-14 09:28:38] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-14 09:28:39] [INFO ] Implicit Places using invariants in 178 ms returned [201, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 182 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/269 places, 239/242 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 263 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 238
Applied a total of 2 rules in 10 ms. Remains 263 /264 variables (removed 1) and now considering 238/239 (removed 1) transitions.
// Phase 1: matrix 238 rows 263 cols
[2023-03-14 09:28:39] [INFO ] Computed 53 place invariants in 1 ms
[2023-03-14 09:28:39] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-14 09:28:39] [INFO ] Invariant cache hit.
[2023-03-14 09:28:39] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-14 09:28:39] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/269 places, 238/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 761 ms. Remains : 263/269 places, 238/242 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Parking-PT-416-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s126 1) (EQ s141 1)), p1:(OR (EQ s28 0) (EQ s69 0)), p2:(OR (EQ s209 0) (EQ s227 0))], 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 7 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-08 finished in 1026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(!p0)||(!p0&&F(G(p1))))))))'
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 11 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-14 09:28:39] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-14 09:28:40] [INFO ] Implicit Places using invariants in 271 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 273 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 10 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-14 09:28:40] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-14 09:28:40] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-14 09:28:40] [INFO ] Invariant cache hit.
[2023-03-14 09:28:40] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-14 09:28:40] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 965 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 255 ms :[p0, (AND p0 (NOT p1)), p0, p0, p0]
Running random walk in product with property : Parking-PT-416-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s117 1) (EQ s142 1)), p1:(EQ s57 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 1278 reset in 598 ms.
Product exploration explored 100000 steps with 1284 reset in 690 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 p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 264 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 127 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 09:28:43] [INFO ] Invariant cache hit.
[2023-03-14 09:28:43] [INFO ] [Real]Absence check using 52 positive place invariants in 22 ms returned sat
[2023-03-14 09:28:43] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 09:28:43] [INFO ] [Nat]Absence check using 52 positive place invariants in 23 ms returned sat
[2023-03-14 09:28:43] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 09:28:43] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-14 09:28:43] [INFO ] After 37ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 09:28:43] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-14 09:28:43] [INFO ] After 421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (AND p1 p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 273 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) p0)]
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 237/237 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 261 transition count 230
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 254 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 253 transition count 229
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 253 transition count 222
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 246 transition count 222
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 60 place count 231 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 230 transition count 226
Applied a total of 62 rules in 44 ms. Remains 230 /261 variables (removed 31) and now considering 226/237 (removed 11) transitions.
// Phase 1: matrix 226 rows 230 cols
[2023-03-14 09:28:44] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-14 09:28:44] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-14 09:28:44] [INFO ] Invariant cache hit.
[2023-03-14 09:28:44] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-14 09:28:45] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
[2023-03-14 09:28:45] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-14 09:28:45] [INFO ] Invariant cache hit.
[2023-03-14 09:28:45] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/261 places, 226/237 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1131 ms. Remains : 230/261 places, 226/237 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 467 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 129 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 09:28:46] [INFO ] Invariant cache hit.
[2023-03-14 09:28:46] [INFO ] [Real]Absence check using 52 positive place invariants in 22 ms returned sat
[2023-03-14 09:28:46] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 09:28:46] [INFO ] [Nat]Absence check using 52 positive place invariants in 22 ms returned sat
[2023-03-14 09:28:46] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 09:28:46] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-14 09:28:46] [INFO ] After 51ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 09:28:46] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-14 09:28:46] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 226/226 transitions.
Free-agglomeration rule applied 62 times.
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 230 transition count 164
Reduce places removed 62 places and 0 transitions.
Graph (complete) has 379 edges and 168 vertex of which 92 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.2 ms
Discarding 76 places :
Also discarding 60 output transitions
Drop transitions removed 60 transitions
Iterating post reduction 0 with 63 rules applied. Total rules applied 125 place count 92 transition count 104
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 133 place count 92 transition count 96
Applied a total of 133 rules in 28 ms. Remains 92 /230 variables (removed 138) and now considering 96/226 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 92/230 places, 96/226 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished Best-First random walk after 47 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 589 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1322 reset in 607 ms.
Product exploration explored 100000 steps with 1326 reset in 629 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 226/226 transitions.
Applied a total of 0 rules in 25 ms. Remains 230 /230 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2023-03-14 09:28:48] [INFO ] Invariant cache hit.
[2023-03-14 09:28:49] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-14 09:28:49] [INFO ] Invariant cache hit.
[2023-03-14 09:28:49] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-14 09:28:49] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
[2023-03-14 09:28:49] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-14 09:28:49] [INFO ] Invariant cache hit.
[2023-03-14 09:28:50] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1223 ms. Remains : 230/230 places, 226/226 transitions.
Treatment of property Parking-PT-416-LTLFireability-09 finished in 10284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G((p1||X(p0)))))'
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 267 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 267 transition count 240
Applied a total of 4 rules in 10 ms. Remains 267 /269 variables (removed 2) and now considering 240/242 (removed 2) transitions.
// Phase 1: matrix 240 rows 267 cols
[2023-03-14 09:28:50] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-14 09:28:50] [INFO ] Implicit Places using invariants in 268 ms returned [126, 229]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 270 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 265/269 places, 240/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 263 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 263 transition count 238
Applied a total of 4 rules in 9 ms. Remains 263 /265 variables (removed 2) and now considering 238/240 (removed 2) transitions.
// Phase 1: matrix 238 rows 263 cols
[2023-03-14 09:28:50] [INFO ] Computed 53 place invariants in 1 ms
[2023-03-14 09:28:50] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-14 09:28:50] [INFO ] Invariant cache hit.
[2023-03-14 09:28:50] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-14 09:28:51] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/269 places, 238/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1044 ms. Remains : 263/269 places, 238/242 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-416-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s235 1), p0:(AND (EQ s178 1) (EQ s200 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-10 finished in 1217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Reduce places removed 1 places and 1 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 0 with 8 rules applied. Total rules applied 8 place count 268 transition count 233
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 260 transition count 233
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 260 transition count 225
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 32 place count 252 transition count 225
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 250 transition count 223
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 250 transition count 223
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 70 place count 233 transition count 206
Applied a total of 70 rules in 25 ms. Remains 233 /269 variables (removed 36) and now considering 206/242 (removed 36) transitions.
// Phase 1: matrix 206 rows 233 cols
[2023-03-14 09:28:51] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-14 09:28:51] [INFO ] Implicit Places using invariants in 249 ms returned [109, 202]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 262 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/269 places, 206/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 295 ms. Remains : 231/269 places, 206/242 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLFireability-12 automaton TGBA Formula[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}]], initial=1, aps=[p0:(AND (EQ s43 1) (EQ s73 1)), p1:(AND (EQ s161 1) (EQ s177 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-12 finished in 413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (p1&&X(G(p0))))))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 10 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-14 09:28:51] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-14 09:28:52] [INFO ] Implicit Places using invariants in 300 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 302 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 9 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-14 09:28:52] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-14 09:28:52] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-14 09:28:52] [INFO ] Invariant cache hit.
[2023-03-14 09:28:52] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-14 09:28:52] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1176 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : Parking-PT-416-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s62 1), p0:(EQ s95 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 332 steps with 93 reset in 3 ms.
FORMULA Parking-PT-416-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-13 finished in 1449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X((p0&&F(p1)))||G(p0)))||(!p0&&(X((p0&&F(p1)))||G(p0)))))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 9 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-14 09:28:53] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-14 09:28:53] [INFO ] Implicit Places using invariants in 261 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 267 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 13 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-14 09:28:53] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-14 09:28:53] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-14 09:28:53] [INFO ] Invariant cache hit.
[2023-03-14 09:28:54] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-14 09:28:54] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 964 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s205 1), p0:(EQ s56 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 1 ms.
FORMULA Parking-PT-416-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-14 finished in 1132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(!p0)||(!p0&&F(G(p1))))))))'
Found a Shortening insensitive property : Parking-PT-416-LTLFireability-09
Stuttering acceptance computed with spot in 259 ms :[p0, (AND p0 (NOT p1)), p0, p0, p0]
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 269 transition count 235
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 262 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 261 transition count 234
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 261 transition count 227
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 254 transition count 227
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 33 place count 251 transition count 224
Iterating global reduction 3 with 3 rules applied. Total rules applied 36 place count 251 transition count 224
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 68 place count 235 transition count 208
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
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 72 place count 233 transition count 246
Applied a total of 72 rules in 46 ms. Remains 233 /269 variables (removed 36) and now considering 246/242 (removed -4) transitions.
// Phase 1: matrix 246 rows 233 cols
[2023-03-14 09:28:55] [INFO ] Computed 55 place invariants in 3 ms
[2023-03-14 09:28:55] [INFO ] Implicit Places using invariants in 258 ms returned [110, 178, 202]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 270 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 230/269 places, 246/242 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 229 transition count 261
Applied a total of 2 rules in 15 ms. Remains 229 /230 variables (removed 1) and now considering 261/246 (removed -15) transitions.
// Phase 1: matrix 261 rows 229 cols
[2023-03-14 09:28:55] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-14 09:28:55] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-14 09:28:55] [INFO ] Invariant cache hit.
[2023-03-14 09:28:55] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-14 09:28:56] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 229/269 places, 261/242 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1122 ms. Remains : 229/269 places, 261/242 transitions.
Running random walk in product with property : Parking-PT-416-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s104 1) (EQ s127 1)), p1:(EQ s53 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1340 reset in 340 ms.
Product exploration explored 100000 steps with 1333 reset in 542 ms.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 134 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 09:28:57] [INFO ] Invariant cache hit.
[2023-03-14 09:28:57] [INFO ] [Real]Absence check using 52 positive place invariants in 16 ms returned sat
[2023-03-14 09:28:57] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 09:28:57] [INFO ] [Nat]Absence check using 52 positive place invariants in 20 ms returned sat
[2023-03-14 09:28:58] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 09:28:58] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-14 09:28:58] [INFO ] After 131ms SMT Verify possible using 118 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 09:28:58] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-14 09:28:58] [INFO ] After 552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 261/261 transitions.
Free-agglomeration rule applied 57 times.
Iterating global reduction 0 with 57 rules applied. Total rules applied 57 place count 229 transition count 204
Reduce places removed 57 places and 0 transitions.
Graph (complete) has 423 edges and 172 vertex of which 92 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.1 ms
Discarding 80 places :
Also discarding 76 output transitions
Drop transitions removed 76 transitions
Iterating post reduction 0 with 58 rules applied. Total rules applied 115 place count 92 transition count 128
Drop transitions removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 147 place count 92 transition count 96
Applied a total of 147 rules in 29 ms. Remains 92 /229 variables (removed 137) and now considering 96/261 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 92/229 places, 96/261 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished Best-First random walk after 162 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=81 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (AND p1 p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 382 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) p0)]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 261/261 transitions.
Applied a total of 0 rules in 14 ms. Remains 229 /229 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-14 09:28:58] [INFO ] Invariant cache hit.
[2023-03-14 09:28:59] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-14 09:28:59] [INFO ] Invariant cache hit.
[2023-03-14 09:28:59] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-14 09:28:59] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2023-03-14 09:28:59] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 09:28:59] [INFO ] Invariant cache hit.
[2023-03-14 09:28:59] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1029 ms. Remains : 229/229 places, 261/261 transitions.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 431 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 130 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 09:29:00] [INFO ] Invariant cache hit.
[2023-03-14 09:29:00] [INFO ] [Real]Absence check using 52 positive place invariants in 24 ms returned sat
[2023-03-14 09:29:00] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 09:29:00] [INFO ] [Nat]Absence check using 52 positive place invariants in 22 ms returned sat
[2023-03-14 09:29:01] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 09:29:01] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-14 09:29:01] [INFO ] After 130ms SMT Verify possible using 118 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 09:29:01] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-14 09:29:01] [INFO ] After 556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 261/261 transitions.
Free-agglomeration rule applied 57 times.
Iterating global reduction 0 with 57 rules applied. Total rules applied 57 place count 229 transition count 204
Reduce places removed 57 places and 0 transitions.
Graph (complete) has 423 edges and 172 vertex of which 92 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.0 ms
Discarding 80 places :
Also discarding 76 output transitions
Drop transitions removed 76 transitions
Iterating post reduction 0 with 58 rules applied. Total rules applied 115 place count 92 transition count 128
Drop transitions removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 147 place count 92 transition count 96
Applied a total of 147 rules in 30 ms. Remains 92 /229 variables (removed 137) and now considering 96/261 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 92/229 places, 96/261 transitions.
Finished random walk after 3338 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=370 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 512 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1334 reset in 345 ms.
Product exploration explored 100000 steps with 1340 reset in 392 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 261/261 transitions.
Applied a total of 0 rules in 20 ms. Remains 229 /229 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-14 09:29:02] [INFO ] Invariant cache hit.
[2023-03-14 09:29:03] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-14 09:29:03] [INFO ] Invariant cache hit.
[2023-03-14 09:29:03] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-14 09:29:03] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2023-03-14 09:29:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 09:29:03] [INFO ] Invariant cache hit.
[2023-03-14 09:29:03] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 971 ms. Remains : 229/229 places, 261/261 transitions.
Treatment of property Parking-PT-416-LTLFireability-09 finished in 9198 ms.
[2023-03-14 09:29:03] [INFO ] Flatten gal took : 20 ms
[2023-03-14 09:29:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-14 09:29:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 242 transitions and 805 arcs took 3 ms.
Total runtime 52894 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Parking-PT-416
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/365
LTLFireability

FORMULA Parking-PT-416-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678786230058

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/365/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/365/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/365/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 Parking-PT-416-LTLFireability-09
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 3/32 Parking-PT-416-LTLFireability-09 310370 m, 62074 m/sec, 2452143 t fired, .

Time elapsed: 5 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 5/32 Parking-PT-416-LTLFireability-09 599538 m, 57833 m/sec, 5004635 t fired, .

Time elapsed: 10 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 7/32 Parking-PT-416-LTLFireability-09 885662 m, 57224 m/sec, 7690358 t fired, .

Time elapsed: 15 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1800 9/32 Parking-PT-416-LTLFireability-09 1177473 m, 58362 m/sec, 10295982 t fired, .

Time elapsed: 20 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1800 11/32 Parking-PT-416-LTLFireability-09 1447267 m, 53958 m/sec, 12908762 t fired, .

Time elapsed: 25 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1800 13/32 Parking-PT-416-LTLFireability-09 1712655 m, 53077 m/sec, 15540159 t fired, .

Time elapsed: 30 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1800 14/32 Parking-PT-416-LTLFireability-09 1962804 m, 50029 m/sec, 18185257 t fired, .

Time elapsed: 35 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1800 16/32 Parking-PT-416-LTLFireability-09 2264485 m, 60336 m/sec, 20929332 t fired, .

Time elapsed: 40 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1800 18/32 Parking-PT-416-LTLFireability-09 2542657 m, 55634 m/sec, 23679897 t fired, .

Time elapsed: 45 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1800 20/32 Parking-PT-416-LTLFireability-09 2804825 m, 52433 m/sec, 26425469 t fired, .

Time elapsed: 50 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1800 22/32 Parking-PT-416-LTLFireability-09 3076867 m, 54408 m/sec, 29102474 t fired, .

Time elapsed: 55 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1800 24/32 Parking-PT-416-LTLFireability-09 3323022 m, 49231 m/sec, 31774639 t fired, .

Time elapsed: 60 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1800 26/32 Parking-PT-416-LTLFireability-09 3575250 m, 50445 m/sec, 34451981 t fired, .

Time elapsed: 65 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1800 27/32 Parking-PT-416-LTLFireability-09 3807937 m, 46537 m/sec, 37118983 t fired, .

Time elapsed: 70 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/1800 29/32 Parking-PT-416-LTLFireability-09 4074715 m, 53355 m/sec, 39701307 t fired, .

Time elapsed: 75 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/1800 31/32 Parking-PT-416-LTLFireability-09 4349956 m, 55048 m/sec, 42324009 t fired, .

Time elapsed: 80 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for Parking-PT-416-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-416-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Parking-PT-416-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 Parking-PT-416-LTLFireability-07
lola: time limit : 3515 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Parking-PT-416-LTLFireability-07
lola: result : false
lola: markings : 5771
lola: fired transitions : 6471
lola: time used : 1.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Parking-PT-416-LTLFireability-07: LTL false LTL model checker
Parking-PT-416-LTLFireability-09: LTL unknown AGGR


Time elapsed: 86 secs. Pages in use: 32

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-416"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is Parking-PT-416, 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 r263-smll-167863538200428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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