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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 7.9K Feb 26 15:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:17 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.7K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 16:26 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 251K 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-832-LTLFireability-00
FORMULA_NAME Parking-PT-832-LTLFireability-01
FORMULA_NAME Parking-PT-832-LTLFireability-02
FORMULA_NAME Parking-PT-832-LTLFireability-03
FORMULA_NAME Parking-PT-832-LTLFireability-04
FORMULA_NAME Parking-PT-832-LTLFireability-05
FORMULA_NAME Parking-PT-832-LTLFireability-06
FORMULA_NAME Parking-PT-832-LTLFireability-07
FORMULA_NAME Parking-PT-832-LTLFireability-08
FORMULA_NAME Parking-PT-832-LTLFireability-09
FORMULA_NAME Parking-PT-832-LTLFireability-10
FORMULA_NAME Parking-PT-832-LTLFireability-11
FORMULA_NAME Parking-PT-832-LTLFireability-12
FORMULA_NAME Parking-PT-832-LTLFireability-13
FORMULA_NAME Parking-PT-832-LTLFireability-14
FORMULA_NAME Parking-PT-832-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678792439142

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-832
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 11:14:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 11:14:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 11:14:02] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2023-03-14 11:14:02] [INFO ] Transformed 737 places.
[2023-03-14 11:14:02] [INFO ] Transformed 993 transitions.
[2023-03-14 11:14:02] [INFO ] Found NUPN structural information;
[2023-03-14 11:14:02] [INFO ] Parsed PT model containing 737 places and 993 transitions and 2993 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
FORMULA Parking-PT-832-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 609/609 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 732 transition count 604
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 732 transition count 604
Applied a total of 10 rules in 249 ms. Remains 732 /737 variables (removed 5) and now considering 604/609 (removed 5) transitions.
// Phase 1: matrix 604 rows 732 cols
[2023-03-14 11:14:03] [INFO ] Computed 184 place invariants in 55 ms
[2023-03-14 11:14:04] [INFO ] Implicit Places using invariants in 1256 ms returned [136, 144, 152, 160, 184, 214, 222, 230, 238, 262, 264, 291, 299, 307, 315, 339, 341, 369, 377, 385, 393, 417, 419, 446, 454, 462, 470, 494, 496, 523, 531, 539, 547, 571, 573, 600, 608, 616, 624, 648, 650, 678, 686, 694, 702, 726, 728]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 1318 ms to find 47 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 685/737 places, 604/609 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 654 transition count 573
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 654 transition count 573
Applied a total of 62 rules in 64 ms. Remains 654 /685 variables (removed 31) and now considering 573/604 (removed 31) transitions.
// Phase 1: matrix 573 rows 654 cols
[2023-03-14 11:14:04] [INFO ] Computed 137 place invariants in 13 ms
[2023-03-14 11:14:05] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-14 11:14:05] [INFO ] Invariant cache hit.
[2023-03-14 11:14:05] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-14 11:14:06] [INFO ] Implicit Places using invariants and state equation in 1302 ms returned []
Implicit Place search using SMT with State Equation took 1763 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 654/737 places, 573/609 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3396 ms. Remains : 654/737 places, 573/609 transitions.
Support contains 32 out of 654 places after structural reductions.
[2023-03-14 11:14:07] [INFO ] Flatten gal took : 173 ms
[2023-03-14 11:14:07] [INFO ] Flatten gal took : 86 ms
[2023-03-14 11:14:07] [INFO ] Input system was already deterministic with 573 transitions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 769 ms. (steps per millisecond=13 ) properties (out of 24) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-14 11:14:08] [INFO ] Invariant cache hit.
[2023-03-14 11:14:08] [INFO ] [Real]Absence check using 137 positive place invariants in 51 ms returned sat
[2023-03-14 11:14:08] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 11:14:09] [INFO ] [Nat]Absence check using 137 positive place invariants in 59 ms returned sat
[2023-03-14 11:14:09] [INFO ] After 724ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-14 11:14:09] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-14 11:14:10] [INFO ] After 468ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-14 11:14:11] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 7 ms to minimize.
[2023-03-14 11:14:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-14 11:14:11] [INFO ] After 1288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 390 ms.
[2023-03-14 11:14:11] [INFO ] After 2852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 1 properties in 214 ms.
Support contains 9 out of 654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 654/654 places, 573/573 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 654 transition count 557
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 638 transition count 557
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 638 transition count 541
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 622 transition count 541
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 618 transition count 537
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 618 transition count 537
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 132 place count 588 transition count 507
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 587 transition count 510
Free-agglomeration rule applied 159 times.
Iterating global reduction 2 with 159 rules applied. Total rules applied 293 place count 587 transition count 351
Reduce places removed 159 places and 0 transitions.
Graph (complete) has 836 edges and 428 vertex of which 287 are kept as prefixes of interest. Removing 141 places using SCC suffix rule.3 ms
Discarding 141 places :
Also discarding 96 output transitions
Drop transitions removed 96 transitions
Iterating post reduction 2 with 160 rules applied. Total rules applied 453 place count 287 transition count 255
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 483 place count 287 transition count 225
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 484 place count 287 transition count 224
Applied a total of 484 rules in 344 ms. Remains 287 /654 variables (removed 367) and now considering 224/573 (removed 349) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 345 ms. Remains : 287/654 places, 224/573 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :3
Finished Best-First random walk after 6818 steps, including 2 resets, run visited all 1 properties in 15 ms. (steps per millisecond=454 )
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((F(p0)&&F(p1))))'
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 650 transition count 569
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 650 transition count 569
Applied a total of 8 rules in 79 ms. Remains 650 /654 variables (removed 4) and now considering 569/573 (removed 4) transitions.
// Phase 1: matrix 569 rows 650 cols
[2023-03-14 11:14:12] [INFO ] Computed 137 place invariants in 7 ms
[2023-03-14 11:14:13] [INFO ] Implicit Places using invariants in 623 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 635 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 649/654 places, 569/573 transitions.
Applied a total of 0 rules in 24 ms. Remains 649 /649 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 739 ms. Remains : 649/654 places, 569/573 transitions.
Stuttering acceptance computed with spot in 465 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s463 1), p0:(EQ s479 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2852 ms.
Product exploration explored 100000 steps with 50000 reset in 2693 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 7 factoid took 306 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-832-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-832-LTLFireability-02 finished in 7190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(p2))))'
Support contains 3 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 650 transition count 569
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 650 transition count 569
Applied a total of 8 rules in 28 ms. Remains 650 /654 variables (removed 4) and now considering 569/573 (removed 4) transitions.
[2023-03-14 11:14:20] [INFO ] Invariant cache hit.
[2023-03-14 11:14:20] [INFO ] Implicit Places using invariants in 559 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 562 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 649/654 places, 569/573 transitions.
Applied a total of 0 rules in 23 ms. Remains 649 /649 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 615 ms. Remains : 649/654 places, 569/573 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : Parking-PT-832-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p2:(AND (EQ s260 1) (EQ s282 1)), p1:(AND (EQ s18 1) (EQ s260 1) (EQ s282 1)), p0:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29 steps with 0 reset in 1 ms.
FORMULA Parking-PT-832-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-03 finished in 909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 573/573 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 654 transition count 557
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 638 transition count 557
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 638 transition count 541
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 622 transition count 541
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 618 transition count 537
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 618 transition count 537
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 134 place count 587 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 586 transition count 509
Applied a total of 136 rules in 179 ms. Remains 586 /654 variables (removed 68) and now considering 509/573 (removed 64) transitions.
// Phase 1: matrix 509 rows 586 cols
[2023-03-14 11:14:21] [INFO ] Computed 137 place invariants in 5 ms
[2023-03-14 11:14:21] [INFO ] Implicit Places using invariants in 751 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 754 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 585/654 places, 509/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 584 transition count 524
Applied a total of 2 rules in 70 ms. Remains 584 /585 variables (removed 1) and now considering 524/509 (removed -15) transitions.
// Phase 1: matrix 524 rows 584 cols
[2023-03-14 11:14:21] [INFO ] Computed 136 place invariants in 5 ms
[2023-03-14 11:14:22] [INFO ] Implicit Places using invariants in 566 ms returned []
[2023-03-14 11:14:22] [INFO ] Invariant cache hit.
[2023-03-14 11:14:23] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-03-14 11:14:24] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 2519 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 584/654 places, 524/573 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3525 ms. Remains : 584/654 places, 524/573 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s420 1) (EQ s437 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 216 steps with 0 reset in 3 ms.
FORMULA Parking-PT-832-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-04 finished in 3623 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(G(p0)))'
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 573/573 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 653 transition count 556
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 637 transition count 556
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 637 transition count 540
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 621 transition count 540
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 617 transition count 536
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 617 transition count 536
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 134 place count 586 transition count 505
Applied a total of 134 rules in 72 ms. Remains 586 /654 variables (removed 68) and now considering 505/573 (removed 68) transitions.
// Phase 1: matrix 505 rows 586 cols
[2023-03-14 11:14:24] [INFO ] Computed 137 place invariants in 3 ms
[2023-03-14 11:14:25] [INFO ] Implicit Places using invariants in 588 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 590 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 585/654 places, 505/573 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 584 transition count 504
Applied a total of 2 rules in 33 ms. Remains 584 /585 variables (removed 1) and now considering 504/505 (removed 1) transitions.
// Phase 1: matrix 504 rows 584 cols
[2023-03-14 11:14:25] [INFO ] Computed 136 place invariants in 4 ms
[2023-03-14 11:14:25] [INFO ] Implicit Places using invariants in 619 ms returned []
[2023-03-14 11:14:25] [INFO ] Invariant cache hit.
[2023-03-14 11:14:26] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1421 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 584/654 places, 504/573 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2118 ms. Remains : 584/654 places, 504/573 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s352 1) (NEQ s401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 513 reset in 989 ms.
Product exploration explored 100000 steps with 513 reset in 1253 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 162 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=54 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Support contains 2 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 504/504 transitions.
Applied a total of 0 rules in 31 ms. Remains 584 /584 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2023-03-14 11:14:29] [INFO ] Invariant cache hit.
[2023-03-14 11:14:30] [INFO ] Implicit Places using invariants in 683 ms returned []
[2023-03-14 11:14:30] [INFO ] Invariant cache hit.
[2023-03-14 11:14:31] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
[2023-03-14 11:14:31] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-14 11:14:31] [INFO ] Invariant cache hit.
[2023-03-14 11:14:31] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2477 ms. Remains : 584/584 places, 504/504 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 273 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 3227 steps, including 16 resets, run visited all 1 properties in 49 ms. (steps per millisecond=65 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 519 reset in 987 ms.
Product exploration explored 100000 steps with 521 reset in 943 ms.
Support contains 2 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 504/504 transitions.
Applied a total of 0 rules in 19 ms. Remains 584 /584 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2023-03-14 11:14:34] [INFO ] Invariant cache hit.
[2023-03-14 11:14:35] [INFO ] Implicit Places using invariants in 632 ms returned []
[2023-03-14 11:14:35] [INFO ] Invariant cache hit.
[2023-03-14 11:14:36] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1568 ms to find 0 implicit places.
[2023-03-14 11:14:36] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-14 11:14:36] [INFO ] Invariant cache hit.
[2023-03-14 11:14:36] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2225 ms. Remains : 584/584 places, 504/504 transitions.
Treatment of property Parking-PT-832-LTLFireability-05 finished in 12513 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(G(p0)))'
Support contains 1 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 573/573 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 653 transition count 556
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 637 transition count 556
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 637 transition count 540
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 621 transition count 540
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 618 transition count 537
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 618 transition count 537
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 132 place count 587 transition count 506
Applied a total of 132 rules in 105 ms. Remains 587 /654 variables (removed 67) and now considering 506/573 (removed 67) transitions.
// Phase 1: matrix 506 rows 587 cols
[2023-03-14 11:14:37] [INFO ] Computed 137 place invariants in 2 ms
[2023-03-14 11:14:37] [INFO ] Implicit Places using invariants in 488 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 491 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/654 places, 506/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 585 transition count 505
Applied a total of 2 rules in 50 ms. Remains 585 /586 variables (removed 1) and now considering 505/506 (removed 1) transitions.
// Phase 1: matrix 505 rows 585 cols
[2023-03-14 11:14:37] [INFO ] Computed 136 place invariants in 3 ms
[2023-03-14 11:14:38] [INFO ] Implicit Places using invariants in 571 ms returned []
[2023-03-14 11:14:38] [INFO ] Invariant cache hit.
[2023-03-14 11:14:39] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 585/654 places, 505/573 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2113 ms. Remains : 585/654 places, 505/573 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s287 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 167 steps with 0 reset in 3 ms.
FORMULA Parking-PT-832-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-06 finished in 2183 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((G((F(p1)&&p0))||G(p2))))'
Support contains 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 573/573 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 654 transition count 557
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 638 transition count 557
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 638 transition count 541
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 622 transition count 541
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 618 transition count 537
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 618 transition count 537
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 130 place count 589 transition count 508
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 588 transition count 511
Applied a total of 132 rules in 127 ms. Remains 588 /654 variables (removed 66) and now considering 511/573 (removed 62) transitions.
// Phase 1: matrix 511 rows 588 cols
[2023-03-14 11:14:39] [INFO ] Computed 137 place invariants in 3 ms
[2023-03-14 11:14:40] [INFO ] Implicit Places using invariants in 693 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 695 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/654 places, 511/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 586 transition count 526
Applied a total of 2 rules in 55 ms. Remains 586 /587 variables (removed 1) and now considering 526/511 (removed -15) transitions.
// Phase 1: matrix 526 rows 586 cols
[2023-03-14 11:14:40] [INFO ] Computed 136 place invariants in 4 ms
[2023-03-14 11:14:40] [INFO ] Implicit Places using invariants in 679 ms returned []
[2023-03-14 11:14:40] [INFO ] Invariant cache hit.
[2023-03-14 11:14:41] [INFO ] State equation strengthened by 218 read => feed constraints.
[2023-03-14 11:14:42] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 2272 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 586/654 places, 526/573 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3152 ms. Remains : 586/654 places, 526/573 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s70 1) (EQ s389 1)), p2:(NEQ s248 1), p1:(NEQ s485 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 512 reset in 1266 ms.
Product exploration explored 100000 steps with 513 reset in 947 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 674 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 52 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-14 11:14:46] [INFO ] Invariant cache hit.
[2023-03-14 11:14:46] [INFO ] [Real]Absence check using 136 positive place invariants in 55 ms returned sat
[2023-03-14 11:14:47] [INFO ] After 900ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 11:14:47] [INFO ] [Nat]Absence check using 136 positive place invariants in 54 ms returned sat
[2023-03-14 11:14:47] [INFO ] After 558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 11:14:47] [INFO ] State equation strengthened by 218 read => feed constraints.
[2023-03-14 11:14:48] [INFO ] After 236ms SMT Verify possible using 218 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 11:14:48] [INFO ] After 563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 215 ms.
[2023-03-14 11:14:48] [INFO ] After 1643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 107 ms.
Support contains 4 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 526/526 transitions.
Free-agglomeration rule applied 162 times.
Iterating global reduction 0 with 162 rules applied. Total rules applied 162 place count 586 transition count 364
Reduce places removed 162 places and 0 transitions.
Graph (complete) has 855 edges and 424 vertex of which 228 are kept as prefixes of interest. Removing 196 places using SCC suffix rule.1 ms
Discarding 196 places :
Also discarding 156 output transitions
Drop transitions removed 156 transitions
Iterating post reduction 0 with 163 rules applied. Total rules applied 325 place count 228 transition count 208
Drop transitions removed 32 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 361 place count 228 transition count 172
Applied a total of 361 rules in 67 ms. Remains 228 /586 variables (removed 358) and now considering 172/526 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 228/586 places, 172/526 transitions.
Finished random walk after 8506 steps, including 2 resets, run visited all 3 properties in 51 ms. (steps per millisecond=166 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2)), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 15 factoid took 1279 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 526/526 transitions.
Applied a total of 0 rules in 33 ms. Remains 586 /586 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2023-03-14 11:14:50] [INFO ] Invariant cache hit.
[2023-03-14 11:14:51] [INFO ] Implicit Places using invariants in 718 ms returned []
[2023-03-14 11:14:51] [INFO ] Invariant cache hit.
[2023-03-14 11:14:51] [INFO ] State equation strengthened by 218 read => feed constraints.
[2023-03-14 11:14:52] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
[2023-03-14 11:14:52] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-14 11:14:52] [INFO ] Invariant cache hit.
[2023-03-14 11:14:53] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2816 ms. Remains : 586/586 places, 526/526 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 804 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-14 11:14:54] [INFO ] Invariant cache hit.
[2023-03-14 11:14:55] [INFO ] [Real]Absence check using 136 positive place invariants in 55 ms returned sat
[2023-03-14 11:14:55] [INFO ] After 887ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 11:14:56] [INFO ] [Nat]Absence check using 136 positive place invariants in 44 ms returned sat
[2023-03-14 11:14:56] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 11:14:56] [INFO ] State equation strengthened by 218 read => feed constraints.
[2023-03-14 11:14:56] [INFO ] After 258ms SMT Verify possible using 218 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 11:14:57] [INFO ] After 588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 212 ms.
[2023-03-14 11:14:57] [INFO ] After 1567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 82 ms.
Support contains 4 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 526/526 transitions.
Free-agglomeration rule applied 162 times.
Iterating global reduction 0 with 162 rules applied. Total rules applied 162 place count 586 transition count 364
Reduce places removed 162 places and 0 transitions.
Graph (complete) has 855 edges and 424 vertex of which 228 are kept as prefixes of interest. Removing 196 places using SCC suffix rule.1 ms
Discarding 196 places :
Also discarding 156 output transitions
Drop transitions removed 156 transitions
Iterating post reduction 0 with 163 rules applied. Total rules applied 325 place count 228 transition count 208
Drop transitions removed 32 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 361 place count 228 transition count 172
Applied a total of 361 rules in 61 ms. Remains 228 /586 variables (removed 358) and now considering 172/526 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 228/586 places, 172/526 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :2
Finished Best-First random walk after 704 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=234 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2)), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 15 factoid took 975 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 512 reset in 1405 ms.
Product exploration explored 100000 steps with 510 reset in 1285 ms.
Support contains 4 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 526/526 transitions.
Applied a total of 0 rules in 22 ms. Remains 586 /586 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2023-03-14 11:15:01] [INFO ] Invariant cache hit.
[2023-03-14 11:15:02] [INFO ] Implicit Places using invariants in 625 ms returned []
[2023-03-14 11:15:02] [INFO ] Invariant cache hit.
[2023-03-14 11:15:02] [INFO ] State equation strengthened by 218 read => feed constraints.
[2023-03-14 11:15:03] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 2078 ms to find 0 implicit places.
[2023-03-14 11:15:03] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-14 11:15:03] [INFO ] Invariant cache hit.
[2023-03-14 11:15:04] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2771 ms. Remains : 586/586 places, 526/526 transitions.
Treatment of property Parking-PT-832-LTLFireability-07 finished in 25286 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(G(p0))&&(G(p0)||G(p1))))'
Support contains 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 573/573 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 654 transition count 557
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 638 transition count 557
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 638 transition count 541
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 622 transition count 541
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 619 transition count 538
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 619 transition count 538
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 589 transition count 508
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 588 transition count 527
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 588 transition count 527
Applied a total of 133 rules in 148 ms. Remains 588 /654 variables (removed 66) and now considering 527/573 (removed 46) transitions.
// Phase 1: matrix 527 rows 588 cols
[2023-03-14 11:15:04] [INFO ] Computed 137 place invariants in 3 ms
[2023-03-14 11:15:05] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-14 11:15:05] [INFO ] Invariant cache hit.
[2023-03-14 11:15:05] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-03-14 11:15:06] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 1920 ms to find 0 implicit places.
[2023-03-14 11:15:06] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-14 11:15:06] [INFO ] Invariant cache hit.
[2023-03-14 11:15:07] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 588/654 places, 527/573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2653 ms. Remains : 588/654 places, 527/573 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s135 1) (EQ s172 1)), p1:(OR (EQ s238 0) (EQ s254 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 160 steps with 0 reset in 3 ms.
FORMULA Parking-PT-832-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-08 finished in 2913 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)||X((p1||X(X(F(p2)))))))'
Support contains 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 650 transition count 569
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 650 transition count 569
Applied a total of 8 rules in 52 ms. Remains 650 /654 variables (removed 4) and now considering 569/573 (removed 4) transitions.
// Phase 1: matrix 569 rows 650 cols
[2023-03-14 11:15:07] [INFO ] Computed 137 place invariants in 4 ms
[2023-03-14 11:15:08] [INFO ] Implicit Places using invariants in 571 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 573 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 649/654 places, 569/573 transitions.
Applied a total of 0 rules in 24 ms. Remains 649 /649 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 650 ms. Remains : 649/654 places, 569/573 transitions.
Stuttering acceptance computed with spot in 344 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Parking-PT-832-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(EQ s351 0), p2:(EQ s419 0), p0:(OR (EQ s43 0) (EQ s167 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2671 ms.
Product exploration explored 100000 steps with 50000 reset in 2396 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 p2 p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 116 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-832-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-832-LTLFireability-10 finished in 6211 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))||(p1&&G(p2)))))'
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 573/573 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 651 transition count 570
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 651 transition count 570
Applied a total of 6 rules in 30 ms. Remains 651 /654 variables (removed 3) and now considering 570/573 (removed 3) transitions.
// Phase 1: matrix 570 rows 651 cols
[2023-03-14 11:15:13] [INFO ] Computed 137 place invariants in 3 ms
[2023-03-14 11:15:14] [INFO ] Implicit Places using invariants in 508 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 510 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/654 places, 570/573 transitions.
Applied a total of 0 rules in 23 ms. Remains 650 /650 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 565 ms. Remains : 650/654 places, 570/573 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Parking-PT-832-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p2), acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(EQ s548 1), p2:(EQ s177 0), p1:(EQ s548 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 344 steps with 1 reset in 6 ms.
FORMULA Parking-PT-832-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-12 finished in 865 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 3 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 573/573 transitions.
Reduce places removed 1 places and 1 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 653 transition count 557
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 638 transition count 557
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 638 transition count 542
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 623 transition count 542
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 619 transition count 538
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 619 transition count 538
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 130 place count 588 transition count 507
Applied a total of 130 rules in 98 ms. Remains 588 /654 variables (removed 66) and now considering 507/573 (removed 66) transitions.
// Phase 1: matrix 507 rows 588 cols
[2023-03-14 11:15:14] [INFO ] Computed 137 place invariants in 3 ms
[2023-03-14 11:15:15] [INFO ] Implicit Places using invariants in 524 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 526 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/654 places, 507/573 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 586 transition count 506
Applied a total of 2 rules in 47 ms. Remains 586 /587 variables (removed 1) and now considering 506/507 (removed 1) transitions.
// Phase 1: matrix 506 rows 586 cols
[2023-03-14 11:15:15] [INFO ] Computed 136 place invariants in 1 ms
[2023-03-14 11:15:15] [INFO ] Implicit Places using invariants in 651 ms returned []
[2023-03-14 11:15:15] [INFO ] Invariant cache hit.
[2023-03-14 11:15:16] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1600 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 586/654 places, 506/573 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2273 ms. Remains : 586/654 places, 506/573 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-832-LTLFireability-13 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 s144 1), p1:(AND (EQ s183 1) (EQ s202 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 171 steps with 0 reset in 2 ms.
FORMULA Parking-PT-832-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-13 finished in 2403 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((X(p1)&&p0))))'
Support contains 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 650 transition count 569
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 650 transition count 569
Applied a total of 8 rules in 28 ms. Remains 650 /654 variables (removed 4) and now considering 569/573 (removed 4) transitions.
// Phase 1: matrix 569 rows 650 cols
[2023-03-14 11:15:16] [INFO ] Computed 137 place invariants in 2 ms
[2023-03-14 11:15:17] [INFO ] Implicit Places using invariants in 530 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 532 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 649/654 places, 569/573 transitions.
Applied a total of 0 rules in 22 ms. Remains 649 /649 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 582 ms. Remains : 649/654 places, 569/573 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Parking-PT-832-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s401 1) (EQ s447 1)), p1:(OR (NEQ s16 1) (NEQ s221 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 346 steps with 1 reset in 5 ms.
FORMULA Parking-PT-832-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-14 finished in 756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 573/573 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 651 transition count 570
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 651 transition count 570
Applied a total of 6 rules in 45 ms. Remains 651 /654 variables (removed 3) and now considering 570/573 (removed 3) transitions.
// Phase 1: matrix 570 rows 651 cols
[2023-03-14 11:15:17] [INFO ] Computed 137 place invariants in 4 ms
[2023-03-14 11:15:18] [INFO ] Implicit Places using invariants in 654 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 661 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/654 places, 570/573 transitions.
Applied a total of 0 rules in 12 ms. Remains 650 /650 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 718 ms. Remains : 650/654 places, 570/573 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s580 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4832 steps with 23 reset in 37 ms.
FORMULA Parking-PT-832-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-15 finished in 857 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(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' '!(F((G((F(p1)&&p0))||G(p2))))'
[2023-03-14 11:15:18] [INFO ] Flatten gal took : 74 ms
[2023-03-14 11:15:18] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-14 11:15:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 654 places, 573 transitions and 1928 arcs took 11 ms.
Total runtime 76508 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Parking-PT-832
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

BK_STOP 1678792620401

--------------------
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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Parking-PT-832-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-832-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
Parking-PT-832-LTLFireability-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 4/32 Parking-PT-832-LTLFireability-05 420156 m, 84031 m/sec, 807171 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# 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-832-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
Parking-PT-832-LTLFireability-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 7/32 Parking-PT-832-LTLFireability-05 824060 m, 80780 m/sec, 1818539 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1800 10/32 Parking-PT-832-LTLFireability-05 1229000 m, 80988 m/sec, 2786360 t fired, .

Time elapsed: 15 secs. Pages in use: 10
# 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-832-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
Parking-PT-832-LTLFireability-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1800 13/32 Parking-PT-832-LTLFireability-05 1592032 m, 72606 m/sec, 3875398 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1800 16/32 Parking-PT-832-LTLFireability-05 2028649 m, 87323 m/sec, 4843022 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1800 19/32 Parking-PT-832-LTLFireability-05 2482804 m, 90831 m/sec, 5709995 t fired, .

Time elapsed: 30 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-832-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
Parking-PT-832-LTLFireability-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1800 22/32 Parking-PT-832-LTLFireability-05 2878369 m, 79113 m/sec, 6719558 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1800 24/32 Parking-PT-832-LTLFireability-05 3207062 m, 65738 m/sec, 7780077 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/1800 28/32 Parking-PT-832-LTLFireability-05 3692951 m, 97177 m/sec, 8647337 t fired, .

Time elapsed: 45 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-832-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
Parking-PT-832-LTLFireability-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/1800 31/32 Parking-PT-832-LTLFireability-05 4142015 m, 89812 m/sec, 9481448 t fired, .

Time elapsed: 50 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for Parking-PT-832-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-832-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-832-LTLFireability-07: LTL 0 1 0 0 1 0 0 0

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3545 4/32 Parking-PT-832-LTLFireability-07 487606 m, 97521 m/sec, 760603 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-832-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-832-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3545 7/32 Parking-PT-832-LTLFireability-07 1020033 m, 106485 m/sec, 1591630 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-832-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-832-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3545 11/32 Parking-PT-832-LTLFireability-07 1623011 m, 120595 m/sec, 2413159 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-832-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-832-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3545 15/32 Parking-PT-832-LTLFireability-07 2208528 m, 117103 m/sec, 3218624 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-832-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-832-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3545 19/32 Parking-PT-832-LTLFireability-07 2781259 m, 114546 m/sec, 4026504 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-832-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-832-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3545 22/32 Parking-PT-832-LTLFireability-07 3298191 m, 103386 m/sec, 4833404 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-832-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-832-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3545 26/32 Parking-PT-832-LTLFireability-07 3819754 m, 104312 m/sec, 5637028 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-832-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
Parking-PT-832-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3545 29/32 Parking-PT-832-LTLFireability-07 4378894 m, 111828 m/sec, 6457474 t fired, .

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

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

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

Time elapsed: 100 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-832-LTLFireability-05: LTL unknown AGGR
Parking-PT-832-LTLFireability-07: LTL unknown AGGR


Time elapsed: 100 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-832"
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-832, 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-167863538300444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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