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.r265-smll-167863540000444.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 ltsminxred
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 r265-smll-167863540000444
=====================================================================

--------------------
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 1679015081325

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-832
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 01:04:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 01:04:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 01:04:45] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2023-03-17 01:04:45] [INFO ] Transformed 737 places.
[2023-03-17 01:04:45] [INFO ] Transformed 993 transitions.
[2023-03-17 01:04:45] [INFO ] Found NUPN structural information;
[2023-03-17 01:04:45] [INFO ] Parsed PT model containing 737 places and 993 transitions and 2993 arcs in 366 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 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 230 ms. Remains 732 /737 variables (removed 5) and now considering 604/609 (removed 5) transitions.
// Phase 1: matrix 604 rows 732 cols
[2023-03-17 01:04:45] [INFO ] Computed 184 place invariants in 42 ms
[2023-03-17 01:04:47] [INFO ] Implicit Places using invariants in 1220 ms returned []
[2023-03-17 01:04:47] [INFO ] Invariant cache hit.
[2023-03-17 01:04:47] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-17 01:04:49] [INFO ] Implicit Places using invariants and state equation in 2054 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 with State Equation took 3335 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 75 ms. Remains 654 /685 variables (removed 31) and now considering 573/604 (removed 31) transitions.
// Phase 1: matrix 573 rows 654 cols
[2023-03-17 01:04:49] [INFO ] Computed 137 place invariants in 10 ms
[2023-03-17 01:04:49] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-17 01:04:49] [INFO ] Invariant cache hit.
[2023-03-17 01:04:50] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-17 01:04:51] [INFO ] Implicit Places using invariants and state equation in 1711 ms returned []
Implicit Place search using SMT with State Equation took 2210 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 5851 ms. Remains : 654/737 places, 573/609 transitions.
Support contains 32 out of 654 places after structural reductions.
[2023-03-17 01:04:51] [INFO ] Flatten gal took : 169 ms
[2023-03-17 01:04:51] [INFO ] Flatten gal took : 89 ms
[2023-03-17 01:04:52] [INFO ] Input system was already deterministic with 573 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 809 ms. (steps per millisecond=12 ) properties (out of 24) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-17 01:04:53] [INFO ] Invariant cache hit.
[2023-03-17 01:04:53] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-17 01:04:54] [INFO ] [Nat]Absence check using 137 positive place invariants in 64 ms returned sat
[2023-03-17 01:04:55] [INFO ] After 679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-17 01:04:55] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-17 01:04:55] [INFO ] After 656ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-17 01:04:55] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 9 ms to minimize.
[2023-03-17 01:04:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2023-03-17 01:04:56] [INFO ] After 1689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 545 ms.
[2023-03-17 01:04:57] [INFO ] After 3581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 7 properties in 191 ms.
Support contains 4 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 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 2 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 2 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
Free-agglomeration rule applied 161 times.
Iterating global reduction 2 with 161 rules applied. Total rules applied 297 place count 586 transition count 348
Reduce places removed 161 places and 0 transitions.
Graph (complete) has 829 edges and 425 vertex of which 233 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.3 ms
Discarding 192 places :
Also discarding 136 output transitions
Drop transitions removed 136 transitions
Iterating post reduction 2 with 162 rules applied. Total rules applied 459 place count 233 transition count 212
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 491 place count 233 transition count 180
Applied a total of 491 rules in 383 ms. Remains 233 /654 variables (removed 421) and now considering 180/573 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 233/654 places, 180/573 transitions.
Finished random walk after 141 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=35 )
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 48 ms. Remains 650 /654 variables (removed 4) and now considering 569/573 (removed 4) transitions.
// Phase 1: matrix 569 rows 650 cols
[2023-03-17 01:04:58] [INFO ] Computed 137 place invariants in 6 ms
[2023-03-17 01:04:58] [INFO ] Implicit Places using invariants in 591 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 594 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 21 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 664 ms. Remains : 649/654 places, 569/573 transitions.
Stuttering acceptance computed with spot in 446 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 2432 ms.
Product exploration explored 100000 steps with 50000 reset in 2352 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 327 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 6331 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 38 ms. Remains 650 /654 variables (removed 4) and now considering 569/573 (removed 4) transitions.
[2023-03-17 01:05:04] [INFO ] Invariant cache hit.
[2023-03-17 01:05:05] [INFO ] Implicit Places using invariants in 693 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 696 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 757 ms. Remains : 649/654 places, 569/573 transitions.
Stuttering acceptance computed with spot in 316 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 159 steps with 0 reset in 4 ms.
FORMULA Parking-PT-832-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-03 finished in 1100 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 1 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 0 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 177 ms. Remains 586 /654 variables (removed 68) and now considering 509/573 (removed 64) transitions.
// Phase 1: matrix 509 rows 586 cols
[2023-03-17 01:05:05] [INFO ] Computed 137 place invariants in 6 ms
[2023-03-17 01:05:06] [INFO ] Implicit Places using invariants in 570 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 573 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 1 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 45 ms. Remains 584 /585 variables (removed 1) and now considering 524/509 (removed -15) transitions.
// Phase 1: matrix 524 rows 584 cols
[2023-03-17 01:05:06] [INFO ] Computed 136 place invariants in 8 ms
[2023-03-17 01:05:07] [INFO ] Implicit Places using invariants in 559 ms returned []
[2023-03-17 01:05:07] [INFO ] Invariant cache hit.
[2023-03-17 01:05:07] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-03-17 01:05:09] [INFO ] Implicit Places using invariants and state equation in 2017 ms returned []
Implicit Place search using SMT with State Equation took 2584 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 3379 ms. Remains : 584/654 places, 524/573 transitions.
Stuttering acceptance computed with spot in 101 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 165 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 3506 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 106 ms. Remains 586 /654 variables (removed 68) and now considering 505/573 (removed 68) transitions.
// Phase 1: matrix 505 rows 586 cols
[2023-03-17 01:05:09] [INFO ] Computed 137 place invariants in 3 ms
[2023-03-17 01:05:09] [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 : 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 34 ms. Remains 584 /585 variables (removed 1) and now considering 504/505 (removed 1) transitions.
// Phase 1: matrix 504 rows 584 cols
[2023-03-17 01:05:10] [INFO ] Computed 136 place invariants in 2 ms
[2023-03-17 01:05:10] [INFO ] Implicit Places using invariants in 579 ms returned []
[2023-03-17 01:05:10] [INFO ] Invariant cache hit.
[2023-03-17 01:05:11] [INFO ] Implicit Places using invariants and state equation in 1137 ms returned []
Implicit Place search using SMT with State Equation took 1719 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 2557 ms. Remains : 584/654 places, 504/573 transitions.
Stuttering acceptance computed with spot in 53 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 510 reset in 1059 ms.
Product exploration explored 100000 steps with 511 reset in 1005 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 115 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 37 ms :[(NOT p0)]
Finished random walk after 328 steps, including 1 resets, run visited all 1 properties in 6 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 135 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 33 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 21 ms. Remains 584 /584 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2023-03-17 01:05:14] [INFO ] Invariant cache hit.
[2023-03-17 01:05:15] [INFO ] Implicit Places using invariants in 723 ms returned []
[2023-03-17 01:05:15] [INFO ] Invariant cache hit.
[2023-03-17 01:05:16] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
[2023-03-17 01:05:16] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-17 01:05:16] [INFO ] Invariant cache hit.
[2023-03-17 01:05:16] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2385 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 158 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 50 ms :[(NOT p0)]
Finished random walk after 681 steps, including 3 resets, run visited all 1 properties in 12 ms. (steps per millisecond=56 )
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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 516 reset in 1278 ms.
Product exploration explored 100000 steps with 512 reset in 910 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 18 ms. Remains 584 /584 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2023-03-17 01:05:19] [INFO ] Invariant cache hit.
[2023-03-17 01:05:20] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-17 01:05:20] [INFO ] Invariant cache hit.
[2023-03-17 01:05:21] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1578 ms to find 0 implicit places.
[2023-03-17 01:05:21] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-17 01:05:21] [INFO ] Invariant cache hit.
[2023-03-17 01:05:21] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2314 ms. Remains : 584/584 places, 504/504 transitions.
Treatment of property Parking-PT-832-LTLFireability-05 finished in 12905 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 1 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 65 ms. Remains 587 /654 variables (removed 67) and now considering 506/573 (removed 67) transitions.
// Phase 1: matrix 506 rows 587 cols
[2023-03-17 01:05:22] [INFO ] Computed 137 place invariants in 2 ms
[2023-03-17 01:05:22] [INFO ] Implicit Places using invariants in 374 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 380 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 0 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 35 ms. Remains 585 /586 variables (removed 1) and now considering 505/506 (removed 1) transitions.
// Phase 1: matrix 505 rows 585 cols
[2023-03-17 01:05:22] [INFO ] Computed 136 place invariants in 2 ms
[2023-03-17 01:05:22] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-17 01:05:22] [INFO ] Invariant cache hit.
[2023-03-17 01:05:23] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1212 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 1693 ms. Remains : 585/654 places, 505/573 transitions.
Stuttering acceptance computed with spot in 34 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 179 steps with 0 reset in 2 ms.
FORMULA Parking-PT-832-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-06 finished in 1752 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 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 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 100 ms. Remains 588 /654 variables (removed 66) and now considering 511/573 (removed 62) transitions.
// Phase 1: matrix 511 rows 588 cols
[2023-03-17 01:05:23] [INFO ] Computed 137 place invariants in 4 ms
[2023-03-17 01:05:24] [INFO ] Implicit Places using invariants in 721 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 723 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 57 ms. Remains 586 /587 variables (removed 1) and now considering 526/511 (removed -15) transitions.
// Phase 1: matrix 526 rows 586 cols
[2023-03-17 01:05:24] [INFO ] Computed 136 place invariants in 3 ms
[2023-03-17 01:05:25] [INFO ] Implicit Places using invariants in 568 ms returned []
[2023-03-17 01:05:25] [INFO ] Invariant cache hit.
[2023-03-17 01:05:25] [INFO ] State equation strengthened by 218 read => feed constraints.
[2023-03-17 01:05:26] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 2139 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 3021 ms. Remains : 586/654 places, 526/573 transitions.
Stuttering acceptance computed with spot in 81 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 510 reset in 1079 ms.
Product exploration explored 100000 steps with 513 reset in 924 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 737 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 113 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 308 ms. (steps per millisecond=32 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 01:05:30] [INFO ] Invariant cache hit.
[2023-03-17 01:05:30] [INFO ] [Real]Absence check using 136 positive place invariants in 52 ms returned sat
[2023-03-17 01:05:31] [INFO ] After 778ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 01:05:31] [INFO ] [Nat]Absence check using 136 positive place invariants in 58 ms returned sat
[2023-03-17 01:05:31] [INFO ] After 588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 01:05:31] [INFO ] State equation strengthened by 218 read => feed constraints.
[2023-03-17 01:05:32] [INFO ] After 232ms SMT Verify possible using 218 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 01:05:32] [INFO ] After 465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 162 ms.
[2023-03-17 01:05:32] [INFO ] After 1508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 62 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 64 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 65 ms. Remains : 228/586 places, 172/526 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :2
Finished Best-First random walk after 569 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=189 )
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 1065 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 100 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 116 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 39 ms. Remains 586 /586 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2023-03-17 01:05:34] [INFO ] Invariant cache hit.
[2023-03-17 01:05:34] [INFO ] Implicit Places using invariants in 740 ms returned []
[2023-03-17 01:05:34] [INFO ] Invariant cache hit.
[2023-03-17 01:05:35] [INFO ] State equation strengthened by 218 read => feed constraints.
[2023-03-17 01:05:36] [INFO ] Implicit Places using invariants and state equation in 1460 ms returned []
Implicit Place search using SMT with State Equation took 2206 ms to find 0 implicit places.
[2023-03-17 01:05:36] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-17 01:05:36] [INFO ] Invariant cache hit.
[2023-03-17 01:05:36] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2691 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 761 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 78 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 51 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-17 01:05:38] [INFO ] Invariant cache hit.
[2023-03-17 01:05:38] [INFO ] [Real]Absence check using 136 positive place invariants in 62 ms returned sat
[2023-03-17 01:05:39] [INFO ] After 895ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 01:05:39] [INFO ] [Nat]Absence check using 136 positive place invariants in 61 ms returned sat
[2023-03-17 01:05:40] [INFO ] After 625ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-17 01:05:40] [INFO ] State equation strengthened by 218 read => feed constraints.
[2023-03-17 01:05:40] [INFO ] After 247ms SMT Verify possible using 218 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-17 01:05:40] [INFO ] After 558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-17 01:05:40] [INFO ] After 1732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 71 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.2 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 64 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 64 ms. Remains : 228/586 places, 172/526 transitions.
Finished random walk after 3320 steps, including 0 resets, run visited all 3 properties in 37 ms. (steps per millisecond=89 )
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 1115 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 120 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 513 reset in 1153 ms.
Product exploration explored 100000 steps with 518 reset in 1115 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 21 ms. Remains 586 /586 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2023-03-17 01:05:44] [INFO ] Invariant cache hit.
[2023-03-17 01:05:45] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-17 01:05:45] [INFO ] Invariant cache hit.
[2023-03-17 01:05:45] [INFO ] State equation strengthened by 218 read => feed constraints.
[2023-03-17 01:05:47] [INFO ] Implicit Places using invariants and state equation in 1758 ms returned []
Implicit Place search using SMT with State Equation took 2367 ms to find 0 implicit places.
[2023-03-17 01:05:47] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-17 01:05:47] [INFO ] Invariant cache hit.
[2023-03-17 01:05:47] [INFO ] Dead Transitions using invariants and state equation in 732 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3139 ms. Remains : 586/586 places, 526/526 transitions.
Treatment of property Parking-PT-832-LTLFireability-07 finished in 24162 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 95 ms. Remains 588 /654 variables (removed 66) and now considering 527/573 (removed 46) transitions.
// Phase 1: matrix 527 rows 588 cols
[2023-03-17 01:05:48] [INFO ] Computed 137 place invariants in 2 ms
[2023-03-17 01:05:48] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-17 01:05:48] [INFO ] Invariant cache hit.
[2023-03-17 01:05:49] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-03-17 01:05:50] [INFO ] Implicit Places using invariants and state equation in 1730 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2023-03-17 01:05:50] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-17 01:05:50] [INFO ] Invariant cache hit.
[2023-03-17 01:05:50] [INFO ] Dead Transitions using invariants and state equation in 593 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 2821 ms. Remains : 588/654 places, 527/573 transitions.
Stuttering acceptance computed with spot in 251 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]]
Stuttering criterion allowed to conclude after 402 steps with 1 reset in 5 ms.
FORMULA Parking-PT-832-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-08 finished in 3100 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 38 ms. Remains 650 /654 variables (removed 4) and now considering 569/573 (removed 4) transitions.
// Phase 1: matrix 569 rows 650 cols
[2023-03-17 01:05:51] [INFO ] Computed 137 place invariants in 3 ms
[2023-03-17 01:05:51] [INFO ] Implicit Places using invariants in 663 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 665 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 20 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 724 ms. Remains : 649/654 places, 569/573 transitions.
Stuttering acceptance computed with spot in 323 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 2533 ms.
Product exploration explored 100000 steps with 50000 reset in 2329 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 115 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 6053 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 25 ms. Remains 651 /654 variables (removed 3) and now considering 570/573 (removed 3) transitions.
// Phase 1: matrix 570 rows 651 cols
[2023-03-17 01:05:57] [INFO ] Computed 137 place invariants in 3 ms
[2023-03-17 01:05:57] [INFO ] Implicit Places using invariants in 647 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 649 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 21 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 696 ms. Remains : 650/654 places, 570/573 transitions.
Stuttering acceptance computed with spot in 276 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 1930 steps with 8 reset in 25 ms.
FORMULA Parking-PT-832-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-12 finished in 1015 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 95 ms. Remains 588 /654 variables (removed 66) and now considering 507/573 (removed 66) transitions.
// Phase 1: matrix 507 rows 588 cols
[2023-03-17 01:05:58] [INFO ] Computed 137 place invariants in 2 ms
[2023-03-17 01:05:58] [INFO ] Implicit Places using invariants in 665 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 666 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 27 ms. Remains 586 /587 variables (removed 1) and now considering 506/507 (removed 1) transitions.
// Phase 1: matrix 506 rows 586 cols
[2023-03-17 01:05:58] [INFO ] Computed 136 place invariants in 1 ms
[2023-03-17 01:05:59] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-03-17 01:05:59] [INFO ] Invariant cache hit.
[2023-03-17 01:06:00] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1481 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 2272 ms. Remains : 586/654 places, 506/573 transitions.
Stuttering acceptance computed with spot in 103 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 162 steps with 0 reset in 1 ms.
FORMULA Parking-PT-832-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-13 finished in 2398 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 25 ms. Remains 650 /654 variables (removed 4) and now considering 569/573 (removed 4) transitions.
// Phase 1: matrix 569 rows 650 cols
[2023-03-17 01:06:00] [INFO ] Computed 137 place invariants in 2 ms
[2023-03-17 01:06:01] [INFO ] Implicit Places using invariants in 593 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 595 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 644 ms. Remains : 649/654 places, 569/573 transitions.
Stuttering acceptance computed with spot in 257 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 192 steps with 0 reset in 3 ms.
FORMULA Parking-PT-832-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-14 finished in 922 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 44 ms. Remains 651 /654 variables (removed 3) and now considering 570/573 (removed 3) transitions.
// Phase 1: matrix 570 rows 651 cols
[2023-03-17 01:06:01] [INFO ] Computed 137 place invariants in 3 ms
[2023-03-17 01:06:02] [INFO ] Implicit Places using invariants in 748 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 750 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 20 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 816 ms. Remains : 650/654 places, 570/573 transitions.
Stuttering acceptance computed with spot in 112 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 52999 steps with 264 reset in 661 ms.
FORMULA Parking-PT-832-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-15 finished in 1610 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-17 01:06:03] [INFO ] Flatten gal took : 72 ms
[2023-03-17 01:06:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-17 01:06:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 654 places, 573 transitions and 1928 arcs took 10 ms.
Total runtime 78796 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1244/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1244/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Parking-PT-832-LTLFireability-05
Could not compute solution for formula : Parking-PT-832-LTLFireability-07

BK_STOP 1679015165897

--------------------
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
mcc2023
ltl formula name Parking-PT-832-LTLFireability-05
ltl formula formula --ltl=/tmp/1244/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 654 places, 573 transitions and 1928 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.030 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1244/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1244/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1244/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1244/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name Parking-PT-832-LTLFireability-07
ltl formula formula --ltl=/tmp/1244/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 654 places, 573 transitions and 1928 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.040 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1244/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1244/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1244/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1244/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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="ltsminxred"
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 ltsminxred"
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 r265-smll-167863540000444"
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 ;