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-167863538200436.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-432, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538200436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 15:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 15:04 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.3K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:34 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 192K 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-432-LTLFireability-00
FORMULA_NAME Parking-PT-432-LTLFireability-01
FORMULA_NAME Parking-PT-432-LTLFireability-02
FORMULA_NAME Parking-PT-432-LTLFireability-03
FORMULA_NAME Parking-PT-432-LTLFireability-04
FORMULA_NAME Parking-PT-432-LTLFireability-05
FORMULA_NAME Parking-PT-432-LTLFireability-06
FORMULA_NAME Parking-PT-432-LTLFireability-07
FORMULA_NAME Parking-PT-432-LTLFireability-08
FORMULA_NAME Parking-PT-432-LTLFireability-09
FORMULA_NAME Parking-PT-432-LTLFireability-10
FORMULA_NAME Parking-PT-432-LTLFireability-11
FORMULA_NAME Parking-PT-432-LTLFireability-12
FORMULA_NAME Parking-PT-432-LTLFireability-13
FORMULA_NAME Parking-PT-432-LTLFireability-14
FORMULA_NAME Parking-PT-432-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678790106573

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-432
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 10:35:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 10:35:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:35:10] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2023-03-14 10:35:10] [INFO ] Transformed 529 places.
[2023-03-14 10:35:10] [INFO ] Transformed 785 transitions.
[2023-03-14 10:35:10] [INFO ] Found NUPN structural information;
[2023-03-14 10:35:10] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 353 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
FORMULA Parking-PT-432-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 457/457 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 525 transition count 453
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 525 transition count 453
Applied a total of 8 rules in 164 ms. Remains 525 /529 variables (removed 4) and now considering 453/457 (removed 4) transitions.
// Phase 1: matrix 453 rows 525 cols
[2023-03-14 10:35:11] [INFO ] Computed 124 place invariants in 51 ms
[2023-03-14 10:35:12] [INFO ] Implicit Places using invariants in 1028 ms returned []
[2023-03-14 10:35:12] [INFO ] Invariant cache hit.
[2023-03-14 10:35:12] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-14 10:35:13] [INFO ] Implicit Places using invariants and state equation in 1635 ms returned [64, 72, 80, 88, 96, 104, 112, 120, 144, 146, 189, 197, 205, 213, 221, 229, 237, 245, 269, 314, 322, 330, 338, 346, 354, 362, 370, 394, 396, 439, 447, 455, 463, 471, 479, 487, 495, 519]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 2731 ms to find 38 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 487/529 places, 453/457 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 457 transition count 423
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 457 transition count 423
Applied a total of 60 rules in 138 ms. Remains 457 /487 variables (removed 30) and now considering 423/453 (removed 30) transitions.
// Phase 1: matrix 423 rows 457 cols
[2023-03-14 10:35:14] [INFO ] Computed 86 place invariants in 8 ms
[2023-03-14 10:35:14] [INFO ] Implicit Places using invariants in 558 ms returned []
[2023-03-14 10:35:14] [INFO ] Invariant cache hit.
[2023-03-14 10:35:15] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-14 10:35:15] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 457/529 places, 423/457 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4702 ms. Remains : 457/529 places, 423/457 transitions.
Support contains 36 out of 457 places after structural reductions.
[2023-03-14 10:35:16] [INFO ] Flatten gal took : 137 ms
[2023-03-14 10:35:16] [INFO ] Flatten gal took : 66 ms
[2023-03-14 10:35:16] [INFO ] Input system was already deterministic with 423 transitions.
Support contains 35 out of 457 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 942 ms. (steps per millisecond=10 ) properties (out of 23) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-14 10:35:17] [INFO ] Invariant cache hit.
[2023-03-14 10:35:18] [INFO ] [Real]Absence check using 86 positive place invariants in 31 ms returned sat
[2023-03-14 10:35:18] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-14 10:35:18] [INFO ] [Nat]Absence check using 86 positive place invariants in 41 ms returned sat
[2023-03-14 10:35:19] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-14 10:35:19] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-14 10:35:19] [INFO ] After 549ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-14 10:35:20] [INFO ] After 1311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 483 ms.
[2023-03-14 10:35:20] [INFO ] After 2761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 7 properties in 202 ms.
Support contains 4 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 423/423 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 457 transition count 409
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 443 transition count 408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 442 transition count 408
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 30 place count 442 transition count 394
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 58 place count 428 transition count 394
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 426 transition count 392
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 426 transition count 392
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 104 place count 405 transition count 371
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 404 transition count 378
Free-agglomeration rule applied 98 times.
Iterating global reduction 3 with 98 rules applied. Total rules applied 204 place count 404 transition count 280
Reduce places removed 98 places and 0 transitions.
Graph (complete) has 623 edges and 306 vertex of which 78 are kept as prefixes of interest. Removing 228 places using SCC suffix rule.3 ms
Discarding 228 places :
Also discarding 199 output transitions
Drop transitions removed 199 transitions
Iterating post reduction 3 with 99 rules applied. Total rules applied 303 place count 78 transition count 81
Drop transitions removed 6 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 317 place count 78 transition count 67
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 78 transition count 66
Applied a total of 318 rules in 281 ms. Remains 78 /457 variables (removed 379) and now considering 66/423 (removed 357) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 78/457 places, 66/423 transitions.
Finished random walk after 2168 steps, including 41 resets, run visited all 3 properties in 18 ms. (steps per millisecond=120 )
FORMULA Parking-PT-432-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(((G(p0) U p1)&&X(G(p2)))))))'
Support contains 5 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 455 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 455 transition count 421
Applied a total of 4 rules in 14 ms. Remains 455 /457 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 455 cols
[2023-03-14 10:35:21] [INFO ] Computed 86 place invariants in 4 ms
[2023-03-14 10:35:22] [INFO ] Implicit Places using invariants in 322 ms returned [236, 451]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 323 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/457 places, 421/423 transitions.
Applied a total of 0 rules in 8 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 345 ms. Remains : 453/457 places, 421/423 transitions.
Stuttering acceptance computed with spot in 706 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Parking-PT-432-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 4}, { cond=(OR p1 p0), acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p1 p0), acceptance={1} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=5 dest: 4}, { cond=p2, acceptance={0} source=5 dest: 5}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s268 1) (EQ s314 1)), p0:(AND (EQ s355 1) (EQ s391 1)), p2:(EQ s185 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 10 ms.
FORMULA Parking-PT-432-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-00 finished in 1145 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))||G(p1)) U p2))'
Support contains 5 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 455 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 455 transition count 421
Applied a total of 4 rules in 22 ms. Remains 455 /457 variables (removed 2) and now considering 421/423 (removed 2) transitions.
[2023-03-14 10:35:23] [INFO ] Invariant cache hit.
[2023-03-14 10:35:23] [INFO ] Implicit Places using invariants in 428 ms returned [236, 451]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 431 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/457 places, 421/423 transitions.
Applied a total of 0 rules in 10 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 467 ms. Remains : 453/457 places, 421/423 transitions.
Stuttering acceptance computed with spot in 347 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s270 1) (EQ s312 1) (EQ s345 1)), p1:(EQ s102 1), p0:(AND (EQ s377 1) (EQ s270 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]]
Entered a terminal (fully accepting) state of product in 64 steps with 14 reset in 4 ms.
FORMULA Parking-PT-432-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-02 finished in 850 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(p0) U p1)||X(G(p0))))'
Support contains 4 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 455 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 455 transition count 421
Applied a total of 4 rules in 21 ms. Remains 455 /457 variables (removed 2) and now considering 421/423 (removed 2) transitions.
[2023-03-14 10:35:23] [INFO ] Invariant cache hit.
[2023-03-14 10:35:24] [INFO ] Implicit Places using invariants in 538 ms returned [236, 451]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 543 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/457 places, 421/423 transitions.
Applied a total of 0 rules in 14 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 580 ms. Remains : 453/457 places, 421/423 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s288 1) (EQ s345 1)), p0:(AND (EQ s367 1) (EQ s410 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-03 finished in 721 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 U (p1||G(!p0))))))'
Support contains 3 out of 457 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 456 transition count 406
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 440 transition count 406
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 440 transition count 390
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 424 transition count 390
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 422 transition count 388
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 422 transition count 388
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 110 place count 401 transition count 367
Applied a total of 110 rules in 83 ms. Remains 401 /457 variables (removed 56) and now considering 367/423 (removed 56) transitions.
// Phase 1: matrix 367 rows 401 cols
[2023-03-14 10:35:24] [INFO ] Computed 86 place invariants in 4 ms
[2023-03-14 10:35:25] [INFO ] Implicit Places using invariants in 358 ms returned [209, 398]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 361 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/457 places, 367/423 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 397 transition count 365
Applied a total of 4 rules in 39 ms. Remains 397 /399 variables (removed 2) and now considering 365/367 (removed 2) transitions.
// Phase 1: matrix 365 rows 397 cols
[2023-03-14 10:35:25] [INFO ] Computed 84 place invariants in 3 ms
[2023-03-14 10:35:25] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-14 10:35:25] [INFO ] Invariant cache hit.
[2023-03-14 10:35:26] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 397/457 places, 365/423 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1611 ms. Remains : 397/457 places, 365/423 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s50 1) (EQ s87 1))) (NEQ s342 1)), p0:(AND (EQ s50 1) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 965 reset in 885 ms.
Product exploration explored 100000 steps with 967 reset in 732 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 : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 2932 steps, including 27 resets, run visited all 2 properties in 27 ms. (steps per millisecond=108 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 311 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 365/365 transitions.
Applied a total of 0 rules in 23 ms. Remains 397 /397 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2023-03-14 10:35:28] [INFO ] Invariant cache hit.
[2023-03-14 10:35:29] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-14 10:35:29] [INFO ] Invariant cache hit.
[2023-03-14 10:35:30] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
[2023-03-14 10:35:30] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-14 10:35:30] [INFO ] Invariant cache hit.
[2023-03-14 10:35:30] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1893 ms. Remains : 397/397 places, 365/365 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 : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 289 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 1612 steps, including 14 resets, run visited all 2 properties in 27 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 346 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 963 reset in 783 ms.
Product exploration explored 100000 steps with 963 reset in 642 ms.
Support contains 3 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 365/365 transitions.
Applied a total of 0 rules in 13 ms. Remains 397 /397 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2023-03-14 10:35:33] [INFO ] Invariant cache hit.
[2023-03-14 10:35:33] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-14 10:35:33] [INFO ] Invariant cache hit.
[2023-03-14 10:35:34] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
[2023-03-14 10:35:34] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-14 10:35:34] [INFO ] Invariant cache hit.
[2023-03-14 10:35:34] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1519 ms. Remains : 397/397 places, 365/365 transitions.
Treatment of property Parking-PT-432-LTLFireability-05 finished in 10409 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 457 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 457 transition count 408
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 442 transition count 408
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 30 place count 442 transition count 392
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 62 place count 426 transition count 392
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 424 transition count 390
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 424 transition count 390
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 108 place count 403 transition count 369
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 402 transition count 376
Applied a total of 110 rules in 90 ms. Remains 402 /457 variables (removed 55) and now considering 376/423 (removed 47) transitions.
// Phase 1: matrix 376 rows 402 cols
[2023-03-14 10:35:35] [INFO ] Computed 86 place invariants in 4 ms
[2023-03-14 10:35:35] [INFO ] Implicit Places using invariants in 390 ms returned [209, 398]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 393 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/457 places, 376/423 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 399 transition count 375
Applied a total of 2 rules in 45 ms. Remains 399 /400 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 399 cols
[2023-03-14 10:35:35] [INFO ] Computed 84 place invariants in 4 ms
[2023-03-14 10:35:35] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-14 10:35:35] [INFO ] Invariant cache hit.
[2023-03-14 10:35:36] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-03-14 10:35:36] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 399/457 places, 375/423 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1920 ms. Remains : 399/457 places, 375/423 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s347 1) (EQ s398 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 101 steps with 0 reset in 5 ms.
FORMULA Parking-PT-432-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-06 finished in 1983 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(G((p0||(G(p1)&&(p2||X((p1 U p2)))))))))'
Support contains 5 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 455 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 455 transition count 421
Applied a total of 4 rules in 12 ms. Remains 455 /457 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 455 cols
[2023-03-14 10:35:36] [INFO ] Computed 86 place invariants in 3 ms
[2023-03-14 10:35:37] [INFO ] Implicit Places using invariants in 379 ms returned [236, 451]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 381 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/457 places, 421/423 transitions.
Applied a total of 0 rules in 9 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 404 ms. Remains : 453/457 places, 421/423 transitions.
Stuttering acceptance computed with spot in 328 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (AND p0 (NOT p1)), (NOT p2)]
Running random walk in product with property : Parking-PT-432-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s46 1) (EQ s88 1)), p1:(AND (EQ s198 1) (EQ s238 1)), p2:(EQ s97 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-09 finished in 757 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)&&F(G(p1)))))'
Support contains 2 out of 457 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 457 transition count 408
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 442 transition count 408
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 442 transition count 393
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 427 transition count 393
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 425 transition count 391
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 425 transition count 391
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 108 place count 403 transition count 369
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 402 transition count 376
Applied a total of 110 rules in 84 ms. Remains 402 /457 variables (removed 55) and now considering 376/423 (removed 47) transitions.
// Phase 1: matrix 376 rows 402 cols
[2023-03-14 10:35:37] [INFO ] Computed 86 place invariants in 4 ms
[2023-03-14 10:35:38] [INFO ] Implicit Places using invariants in 394 ms returned [209, 399]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 397 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/457 places, 376/423 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 399 transition count 375
Applied a total of 2 rules in 34 ms. Remains 399 /400 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 399 cols
[2023-03-14 10:35:38] [INFO ] Computed 84 place invariants in 4 ms
[2023-03-14 10:35:38] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-14 10:35:38] [INFO ] Invariant cache hit.
[2023-03-14 10:35:39] [INFO ] State equation strengthened by 156 read => feed constraints.
[2023-03-14 10:35:39] [INFO ] Implicit Places using invariants and state equation in 1218 ms returned []
Implicit Place search using SMT with State Equation took 1724 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 399/457 places, 375/423 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2240 ms. Remains : 399/457 places, 375/423 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s333 1), p1:(EQ s277 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 106 steps with 2 reset in 2 ms.
FORMULA Parking-PT-432-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-10 finished in 2414 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(p0))))'
Support contains 2 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 456 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 456 transition count 422
Applied a total of 2 rules in 20 ms. Remains 456 /457 variables (removed 1) and now considering 422/423 (removed 1) transitions.
// Phase 1: matrix 422 rows 456 cols
[2023-03-14 10:35:40] [INFO ] Computed 86 place invariants in 4 ms
[2023-03-14 10:35:40] [INFO ] Implicit Places using invariants in 518 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 519 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 455/457 places, 422/423 transitions.
Applied a total of 0 rules in 9 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 549 ms. Remains : 455/457 places, 422/423 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s378 1) (EQ s451 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-12 finished in 719 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 U G(p1)))))'
Support contains 2 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 455 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 455 transition count 421
Applied a total of 4 rules in 21 ms. Remains 455 /457 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 455 cols
[2023-03-14 10:35:40] [INFO ] Computed 86 place invariants in 3 ms
[2023-03-14 10:35:41] [INFO ] Implicit Places using invariants in 531 ms returned [236, 451]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 533 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/457 places, 421/423 transitions.
Applied a total of 0 rules in 9 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 564 ms. Remains : 453/457 places, 421/423 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s393 1), p0:(NEQ s286 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 907 reset in 847 ms.
Product exploration explored 100000 steps with 910 reset in 630 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 (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 91 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 421 rows 453 cols
[2023-03-14 10:35:43] [INFO ] Computed 84 place invariants in 3 ms
[2023-03-14 10:35:43] [INFO ] [Real]Absence check using 84 positive place invariants in 36 ms returned sat
[2023-03-14 10:35:44] [INFO ] After 340ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-14 10:35:44] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-14 10:35:44] [INFO ] After 74ms SMT Verify possible using 108 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-14 10:35:44] [INFO ] After 134ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-14 10:35:44] [INFO ] After 705ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 10:35:44] [INFO ] [Nat]Absence check using 84 positive place invariants in 38 ms returned sat
[2023-03-14 10:35:45] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 10:35:45] [INFO ] After 137ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 10:35:45] [INFO ] After 279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-14 10:35:45] [INFO ] After 947ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 421/421 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 453 transition count 407
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 439 transition count 407
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 28 place count 439 transition count 393
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 56 place count 425 transition count 393
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 104 place count 401 transition count 369
Free-agglomeration rule applied 116 times.
Iterating global reduction 2 with 116 rules applied. Total rules applied 220 place count 401 transition count 253
Reduce places removed 116 places and 0 transitions.
Graph (complete) has 584 edges and 285 vertex of which 149 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.1 ms
Discarding 136 places :
Also discarding 116 output transitions
Drop transitions removed 116 transitions
Iterating post reduction 2 with 117 rules applied. Total rules applied 337 place count 149 transition count 137
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 345 place count 149 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 346 place count 148 transition count 128
Reduce places removed 44 places and 0 transitions.
Graph (trivial) has 124 edges and 104 vertex of which 94 / 104 are part of one of the 2 SCC in 5 ms
Free SCC test removed 92 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 49 rules applied. Total rules applied 395 place count 12 transition count 124
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 122 rules applied. Total rules applied 517 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 519 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 519 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 523 place count 4 transition count 4
Applied a total of 523 rules in 98 ms. Remains 4 /453 variables (removed 449) and now considering 4/421 (removed 417) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 4/453 places, 4/421 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p1 p0), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 449 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 28 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2023-03-14 10:35:46] [INFO ] Invariant cache hit.
[2023-03-14 10:35:46] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-14 10:35:46] [INFO ] Invariant cache hit.
[2023-03-14 10:35:47] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-14 10:35:47] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
[2023-03-14 10:35:47] [INFO ] Invariant cache hit.
[2023-03-14 10:35:47] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1446 ms. Remains : 453/453 places, 421/421 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 10:35:48] [INFO ] Invariant cache hit.
[2023-03-14 10:35:48] [INFO ] [Real]Absence check using 84 positive place invariants in 39 ms returned sat
[2023-03-14 10:35:48] [INFO ] After 276ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 10:35:48] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-14 10:35:49] [INFO ] After 48ms SMT Verify possible using 108 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 10:35:49] [INFO ] After 85ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-14 10:35:49] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:35:49] [INFO ] [Nat]Absence check using 84 positive place invariants in 25 ms returned sat
[2023-03-14 10:35:49] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:35:49] [INFO ] After 82ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 10:35:49] [INFO ] After 140ms 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 10:35:49] [INFO ] After 562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 421/421 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 453 transition count 407
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 439 transition count 407
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 28 place count 439 transition count 393
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 56 place count 425 transition count 393
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 104 place count 401 transition count 369
Free-agglomeration rule applied 116 times.
Iterating global reduction 2 with 116 rules applied. Total rules applied 220 place count 401 transition count 253
Reduce places removed 116 places and 0 transitions.
Graph (complete) has 584 edges and 285 vertex of which 149 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.1 ms
Discarding 136 places :
Also discarding 116 output transitions
Drop transitions removed 116 transitions
Iterating post reduction 2 with 117 rules applied. Total rules applied 337 place count 149 transition count 137
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 345 place count 149 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 346 place count 148 transition count 128
Reduce places removed 44 places and 0 transitions.
Graph (trivial) has 124 edges and 104 vertex of which 94 / 104 are part of one of the 2 SCC in 0 ms
Free SCC test removed 92 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 49 rules applied. Total rules applied 395 place count 12 transition count 124
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 122 rules applied. Total rules applied 517 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 519 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 519 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 523 place count 4 transition count 4
Applied a total of 523 rules in 118 ms. Remains 4 /453 variables (removed 449) and now considering 4/421 (removed 417) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 4/453 places, 4/421 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 460 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 911 reset in 580 ms.
Product exploration explored 100000 steps with 909 reset in 609 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 453 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 453 transition count 421
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 14 place count 453 transition count 421
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 28 place count 453 transition count 421
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 42 place count 439 transition count 407
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 56 place count 439 transition count 407
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 38 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 80 place count 439 transition count 423
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 80 rules in 349 ms. Remains 439 /453 variables (removed 14) and now considering 423/421 (removed -2) transitions.
[2023-03-14 10:35:52] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 423 rows 439 cols
[2023-03-14 10:35:52] [INFO ] Computed 84 place invariants in 3 ms
[2023-03-14 10:35:53] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 439/453 places, 423/421 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 819 ms. Remains : 439/453 places, 423/421 transitions.
Support contains 2 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 9 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 453 cols
[2023-03-14 10:35:53] [INFO ] Computed 84 place invariants in 3 ms
[2023-03-14 10:35:53] [INFO ] Implicit Places using invariants in 498 ms returned []
[2023-03-14 10:35:53] [INFO ] Invariant cache hit.
[2023-03-14 10:35:54] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-14 10:35:54] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1446 ms to find 0 implicit places.
[2023-03-14 10:35:54] [INFO ] Invariant cache hit.
[2023-03-14 10:35:55] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1911 ms. Remains : 453/453 places, 421/421 transitions.
Treatment of property Parking-PT-432-LTLFireability-14 finished in 14235 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||G(p1))))'
Support contains 3 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 455 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 455 transition count 421
Applied a total of 4 rules in 14 ms. Remains 455 /457 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 455 cols
[2023-03-14 10:35:55] [INFO ] Computed 86 place invariants in 2 ms
[2023-03-14 10:35:55] [INFO ] Implicit Places using invariants in 380 ms returned [236, 451]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 382 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/457 places, 421/423 transitions.
Applied a total of 0 rules in 9 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 405 ms. Remains : 453/457 places, 421/423 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-15 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}]], initial=1, aps=[p1:(OR (NEQ s281 1) (NEQ s345 1)), p0:(EQ s262 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 322 steps with 2 reset in 3 ms.
FORMULA Parking-PT-432-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-15 finished in 589 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 U (p1||G(!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((p0 U G(p1)))))'
Found a Lengthening insensitive property : Parking-PT-432-LTLFireability-14
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 457 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 457/457 places, 423/423 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 456 transition count 408
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 442 transition count 408
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 28 place count 442 transition count 394
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 56 place count 428 transition count 394
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 426 transition count 392
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 426 transition count 392
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 104 place count 404 transition count 370
Applied a total of 104 rules in 30 ms. Remains 404 /457 variables (removed 53) and now considering 370/423 (removed 53) transitions.
// Phase 1: matrix 370 rows 404 cols
[2023-03-14 10:35:56] [INFO ] Computed 86 place invariants in 2 ms
[2023-03-14 10:35:56] [INFO ] Implicit Places using invariants in 333 ms returned [209, 401]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 334 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 402/457 places, 370/423 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 400 transition count 368
Applied a total of 4 rules in 12 ms. Remains 400 /402 variables (removed 2) and now considering 368/370 (removed 2) transitions.
// Phase 1: matrix 368 rows 400 cols
[2023-03-14 10:35:56] [INFO ] Computed 84 place invariants in 2 ms
[2023-03-14 10:35:56] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-14 10:35:56] [INFO ] Invariant cache hit.
[2023-03-14 10:35:57] [INFO ] Implicit Places using invariants and state equation in 527 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 : 400/457 places, 368/423 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1168 ms. Remains : 400/457 places, 368/423 transitions.
Running random walk in product with property : Parking-PT-432-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s349 1), p0:(NEQ s254 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 934 reset in 560 ms.
Product exploration explored 100000 steps with 929 reset in 627 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 : [(AND p1 p0), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 92 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 10:35:59] [INFO ] Invariant cache hit.
[2023-03-14 10:35:59] [INFO ] [Real]Absence check using 84 positive place invariants in 22 ms returned sat
[2023-03-14 10:35:59] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:35:59] [INFO ] [Nat]Absence check using 84 positive place invariants in 23 ms returned sat
[2023-03-14 10:35:59] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:35:59] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-14 10:35:59] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 368/368 transitions.
Free-agglomeration rule applied 116 times.
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 400 transition count 252
Reduce places removed 196 places and 0 transitions.
Graph (complete) has 252 edges and 204 vertex of which 104 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.1 ms
Discarding 100 places :
Also discarding 124 output transitions
Drop transitions removed 124 transitions
Graph (trivial) has 124 edges and 104 vertex of which 94 / 104 are part of one of the 2 SCC in 1 ms
Free SCC test removed 92 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 202 rules applied. Total rules applied 318 place count 12 transition count 124
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 122 rules applied. Total rules applied 440 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 442 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 442 place count 6 transition count 4
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 446 place count 4 transition count 4
Applied a total of 446 rules in 20 ms. Remains 4 /400 variables (removed 396) and now considering 4/368 (removed 364) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 4/400 places, 4/368 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 p0), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 484 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 368/368 transitions.
Applied a total of 0 rules in 7 ms. Remains 400 /400 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2023-03-14 10:36:00] [INFO ] Invariant cache hit.
[2023-03-14 10:36:01] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-14 10:36:01] [INFO ] Invariant cache hit.
[2023-03-14 10:36:01] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
[2023-03-14 10:36:01] [INFO ] Invariant cache hit.
[2023-03-14 10:36:02] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1748 ms. Remains : 400/400 places, 368/368 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 : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 93 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 5) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 10:36:03] [INFO ] Invariant cache hit.
[2023-03-14 10:36:03] [INFO ] [Real]Absence check using 84 positive place invariants in 33 ms returned sat
[2023-03-14 10:36:03] [INFO ] After 359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 10:36:03] [INFO ] [Nat]Absence check using 84 positive place invariants in 21 ms returned sat
[2023-03-14 10:36:03] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 10:36:03] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-14 10:36:03] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 368/368 transitions.
Free-agglomeration rule applied 116 times.
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 400 transition count 252
Reduce places removed 196 places and 0 transitions.
Graph (complete) has 252 edges and 204 vertex of which 104 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.0 ms
Discarding 100 places :
Also discarding 124 output transitions
Drop transitions removed 124 transitions
Graph (trivial) has 124 edges and 104 vertex of which 94 / 104 are part of one of the 2 SCC in 1 ms
Free SCC test removed 92 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 202 rules applied. Total rules applied 318 place count 12 transition count 124
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 122 rules applied. Total rules applied 440 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 442 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 442 place count 6 transition count 4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 446 place count 4 transition count 4
Applied a total of 446 rules in 26 ms. Remains 4 /400 variables (removed 396) and now considering 4/368 (removed 364) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 4/400 places, 4/368 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 453 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 926 reset in 853 ms.
Entered a terminal (fully accepting) state of product in 26605 steps with 248 reset in 260 ms.
Treatment of property Parking-PT-432-LTLFireability-14 finished in 10343 ms.
FORMULA Parking-PT-432-LTLFireability-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-14 10:36:06] [INFO ] Flatten gal took : 64 ms
[2023-03-14 10:36:06] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-14 10:36:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 457 places, 423 transitions and 1415 arcs took 12 ms.
Total runtime 55843 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Parking-PT-432
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1678790367746

--------------------
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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:433
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 # 1 (type EXCL) for 0 Parking-PT-432-LTLFireability-05
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-432-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
Parking-PT-432-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 5/32 Parking-PT-432-LTLFireability-05 527639 m, 105527 m/sec, 751908 t fired, .

Time elapsed: 5 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-432-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
Parking-PT-432-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 9/32 Parking-PT-432-LTLFireability-05 1104862 m, 115444 m/sec, 1593915 t fired, .

Time elapsed: 10 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-432-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
Parking-PT-432-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1800 14/32 Parking-PT-432-LTLFireability-05 1684862 m, 116000 m/sec, 2442008 t fired, .

Time elapsed: 15 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-432-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
Parking-PT-432-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1800 19/32 Parking-PT-432-LTLFireability-05 2258786 m, 114784 m/sec, 3291840 t fired, .

Time elapsed: 20 secs. Pages in use: 19
# 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-432-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
Parking-PT-432-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1800 23/32 Parking-PT-432-LTLFireability-05 2835207 m, 115284 m/sec, 4143661 t fired, .

Time elapsed: 25 secs. Pages in use: 23
# 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-432-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
Parking-PT-432-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1800 28/32 Parking-PT-432-LTLFireability-05 3394805 m, 111919 m/sec, 4968346 t fired, .

Time elapsed: 30 secs. Pages in use: 28
# 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-432-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
Parking-PT-432-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1800 32/32 Parking-PT-432-LTLFireability-05 3949132 m, 110865 m/sec, 5794986 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 Parking-PT-432-LTLFireability-14
lola: time limit : 3560 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3560 2/32 Parking-PT-432-LTLFireability-14 189805 m, 37961 m/sec, 1474146 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3560 3/32 Parking-PT-432-LTLFireability-14 368778 m, 35794 m/sec, 2955174 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3560 4/32 Parking-PT-432-LTLFireability-14 539909 m, 34226 m/sec, 4490148 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3560 5/32 Parking-PT-432-LTLFireability-14 703141 m, 32646 m/sec, 5977203 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3560 6/32 Parking-PT-432-LTLFireability-14 867100 m, 32791 m/sec, 7438294 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3560 7/32 Parking-PT-432-LTLFireability-14 1024676 m, 31515 m/sec, 8999657 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3560 8/32 Parking-PT-432-LTLFireability-14 1185141 m, 32093 m/sec, 10417440 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3560 9/32 Parking-PT-432-LTLFireability-14 1342275 m, 31426 m/sec, 11879606 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/3560 10/32 Parking-PT-432-LTLFireability-14 1495820 m, 30709 m/sec, 13360887 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/3560 11/32 Parking-PT-432-LTLFireability-14 1645144 m, 29864 m/sec, 14826621 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/3560 12/32 Parking-PT-432-LTLFireability-14 1792061 m, 29383 m/sec, 16319519 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/3560 13/32 Parking-PT-432-LTLFireability-14 1943480 m, 30283 m/sec, 17728959 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/3560 15/32 Parking-PT-432-LTLFireability-14 2117332 m, 34770 m/sec, 19375269 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/3560 15/32 Parking-PT-432-LTLFireability-14 2259973 m, 28528 m/sec, 20866091 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/3560 16/32 Parking-PT-432-LTLFireability-14 2387452 m, 25495 m/sec, 22338935 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/3560 17/32 Parking-PT-432-LTLFireability-14 2555493 m, 33608 m/sec, 23703828 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/3560 19/32 Parking-PT-432-LTLFireability-14 2718832 m, 32667 m/sec, 25205841 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 90/3560 20/32 Parking-PT-432-LTLFireability-14 2875367 m, 31307 m/sec, 26716427 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 95/3560 21/32 Parking-PT-432-LTLFireability-14 3025131 m, 29952 m/sec, 28190399 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 100/3560 22/32 Parking-PT-432-LTLFireability-14 3171232 m, 29220 m/sec, 29677074 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 105/3560 23/32 Parking-PT-432-LTLFireability-14 3316071 m, 28967 m/sec, 31122427 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 110/3560 23/32 Parking-PT-432-LTLFireability-14 3466156 m, 30017 m/sec, 32727777 t fired, .

Time elapsed: 150 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 115/3560 24/32 Parking-PT-432-LTLFireability-14 3613929 m, 29554 m/sec, 34214713 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 120/3560 25/32 Parking-PT-432-LTLFireability-14 3762892 m, 29792 m/sec, 35723934 t fired, .

Time elapsed: 160 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 125/3560 26/32 Parking-PT-432-LTLFireability-14 3907186 m, 28858 m/sec, 37223410 t fired, .

Time elapsed: 165 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 130/3560 27/32 Parking-PT-432-LTLFireability-14 4045404 m, 27643 m/sec, 38735452 t fired, .

Time elapsed: 170 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 135/3560 28/32 Parking-PT-432-LTLFireability-14 4181007 m, 27120 m/sec, 40253754 t fired, .

Time elapsed: 175 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 140/3560 29/32 Parking-PT-432-LTLFireability-14 4310154 m, 25829 m/sec, 41738654 t fired, .

Time elapsed: 180 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 145/3560 30/32 Parking-PT-432-LTLFireability-14 4471221 m, 32213 m/sec, 43113011 t fired, .

Time elapsed: 185 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 150/3560 31/32 Parking-PT-432-LTLFireability-14 4626683 m, 31092 m/sec, 44581870 t fired, .

Time elapsed: 190 secs. Pages in use: 32
# 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-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 155/3560 32/32 Parking-PT-432-LTLFireability-14 4803385 m, 35340 m/sec, 46361927 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-432-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-432-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 200 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Parking-PT-432-LTLFireability-05: LTL unknown AGGR
Parking-PT-432-LTLFireability-14: LTL unknown AGGR


Time elapsed: 200 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-432"
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-432, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863538200436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-432.tgz
mv Parking-PT-432 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;