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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 5.8K Feb 26 16:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 16:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 15:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Feb 26 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:07 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 427K 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-864-LTLFireability-00
FORMULA_NAME Parking-PT-864-LTLFireability-01
FORMULA_NAME Parking-PT-864-LTLFireability-02
FORMULA_NAME Parking-PT-864-LTLFireability-03
FORMULA_NAME Parking-PT-864-LTLFireability-04
FORMULA_NAME Parking-PT-864-LTLFireability-05
FORMULA_NAME Parking-PT-864-LTLFireability-06
FORMULA_NAME Parking-PT-864-LTLFireability-07
FORMULA_NAME Parking-PT-864-LTLFireability-08
FORMULA_NAME Parking-PT-864-LTLFireability-09
FORMULA_NAME Parking-PT-864-LTLFireability-10
FORMULA_NAME Parking-PT-864-LTLFireability-11
FORMULA_NAME Parking-PT-864-LTLFireability-12
FORMULA_NAME Parking-PT-864-LTLFireability-13
FORMULA_NAME Parking-PT-864-LTLFireability-14
FORMULA_NAME Parking-PT-864-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679022560183

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-864
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 03:09:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 03:09:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 03:09:23] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2023-03-17 03:09:23] [INFO ] Transformed 1185 places.
[2023-03-17 03:09:23] [INFO ] Transformed 1697 transitions.
[2023-03-17 03:09:23] [INFO ] Found NUPN structural information;
[2023-03-17 03:09:23] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
FORMULA Parking-PT-864-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1178 transition count 1002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1178 transition count 1002
Applied a total of 14 rules in 394 ms. Remains 1178 /1185 variables (removed 7) and now considering 1002/1009 (removed 7) transitions.
// Phase 1: matrix 1002 rows 1178 cols
[2023-03-17 03:09:24] [INFO ] Computed 280 place invariants in 104 ms
[2023-03-17 03:09:25] [INFO ] Implicit Places using invariants in 1593 ms returned [152, 160, 168, 176, 184, 192, 200, 208, 240, 242, 285, 293, 301, 309, 317, 325, 333, 341, 373, 375, 418, 426, 434, 442, 450, 458, 474, 506, 508, 551, 559, 567, 575, 583, 591, 599, 607, 639, 641, 684, 692, 700, 708, 716, 732, 740, 772, 817, 825, 833, 841, 849, 857, 865, 873, 905, 907, 950, 958, 966, 974, 982, 990, 998, 1006, 1038, 1040, 1084, 1092, 1100, 1108, 1116, 1124, 1132, 1140, 1172, 1174]
Discarding 77 places :
Implicit Place search using SMT only with invariants took 1650 ms to find 77 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1101/1185 places, 1002/1009 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 1040 transition count 941
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 1040 transition count 941
Applied a total of 122 rules in 174 ms. Remains 1040 /1101 variables (removed 61) and now considering 941/1002 (removed 61) transitions.
// Phase 1: matrix 941 rows 1040 cols
[2023-03-17 03:09:25] [INFO ] Computed 203 place invariants in 9 ms
[2023-03-17 03:09:26] [INFO ] Implicit Places using invariants in 690 ms returned []
[2023-03-17 03:09:26] [INFO ] Invariant cache hit.
[2023-03-17 03:09:27] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-17 03:09:29] [INFO ] Implicit Places using invariants and state equation in 2757 ms returned []
Implicit Place search using SMT with State Equation took 3451 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1040/1185 places, 941/1009 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5670 ms. Remains : 1040/1185 places, 941/1009 transitions.
Support contains 42 out of 1040 places after structural reductions.
[2023-03-17 03:09:29] [INFO ] Flatten gal took : 173 ms
[2023-03-17 03:09:29] [INFO ] Flatten gal took : 91 ms
[2023-03-17 03:09:30] [INFO ] Input system was already deterministic with 941 transitions.
Support contains 38 out of 1040 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 818 ms. (steps per millisecond=12 ) properties (out of 26) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-17 03:09:31] [INFO ] Invariant cache hit.
[2023-03-17 03:09:31] [INFO ] [Real]Absence check using 203 positive place invariants in 74 ms returned sat
[2023-03-17 03:09:31] [INFO ] After 508ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-17 03:09:32] [INFO ] [Nat]Absence check using 203 positive place invariants in 61 ms returned sat
[2023-03-17 03:09:33] [INFO ] After 967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-17 03:09:33] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-17 03:09:34] [INFO ] After 868ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-17 03:09:34] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 9 ms to minimize.
[2023-03-17 03:09:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-17 03:09:35] [INFO ] After 1826ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 481 ms.
[2023-03-17 03:09:35] [INFO ] After 3873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 4 properties in 246 ms.
Support contains 7 out of 1040 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1040 transition count 910
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1009 transition count 910
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1009 transition count 879
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 124 place count 978 transition count 879
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 976 transition count 877
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 976 transition count 877
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 220 place count 930 transition count 831
Free-agglomeration rule applied 252 times.
Iterating global reduction 2 with 252 rules applied. Total rules applied 472 place count 930 transition count 579
Reduce places removed 252 places and 0 transitions.
Graph (complete) has 1352 edges and 678 vertex of which 270 are kept as prefixes of interest. Removing 408 places using SCC suffix rule.2 ms
Discarding 408 places :
Also discarding 331 output transitions
Drop transitions removed 331 transitions
Iterating post reduction 2 with 253 rules applied. Total rules applied 725 place count 270 transition count 248
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 755 place count 270 transition count 218
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 756 place count 270 transition count 217
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 757 place count 270 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 758 place count 269 transition count 216
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 759 place count 269 transition count 216
Applied a total of 759 rules in 362 ms. Remains 269 /1040 variables (removed 771) and now considering 216/941 (removed 725) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 269/1040 places, 216/941 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :3
Finished Best-First random walk after 401 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=200 )
FORMULA Parking-PT-864-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((p1||G(p2))))&&p0)))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 56 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-17 03:09:36] [INFO ] Computed 203 place invariants in 6 ms
[2023-03-17 03:09:37] [INFO ] Implicit Places using invariants in 657 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 670 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 71 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-17 03:09:37] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-17 03:09:38] [INFO ] Implicit Places using invariants in 824 ms returned []
[2023-03-17 03:09:38] [INFO ] Invariant cache hit.
[2023-03-17 03:09:39] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-17 03:09:41] [INFO ] Implicit Places using invariants and state equation in 2581 ms returned []
Implicit Place search using SMT with State Equation took 3411 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4209 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s882 1) (EQ s917 1)), p2:(EQ s44 0), p1:(EQ s136 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Parking-PT-864-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-01 finished in 4698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 90 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-17 03:09:41] [INFO ] Computed 203 place invariants in 5 ms
[2023-03-17 03:09:42] [INFO ] Implicit Places using invariants in 911 ms returned [689]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 913 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1037/1040 places, 939/941 transitions.
Applied a total of 0 rules in 41 ms. Remains 1037 /1037 variables (removed 0) and now considering 939/939 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1045 ms. Remains : 1037/1040 places, 939/941 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-02 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=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s419 1) (EQ s456 1) (OR (NEQ s645 1) (NEQ s688 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Parking-PT-864-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-02 finished in 1227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1039 transition count 909
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1008 transition count 909
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1008 transition count 878
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 124 place count 977 transition count 878
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 975 transition count 876
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 975 transition count 876
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 224 place count 927 transition count 828
Applied a total of 224 rules in 172 ms. Remains 927 /1040 variables (removed 113) and now considering 828/941 (removed 113) transitions.
// Phase 1: matrix 828 rows 927 cols
[2023-03-17 03:09:42] [INFO ] Computed 203 place invariants in 4 ms
[2023-03-17 03:09:43] [INFO ] Implicit Places using invariants in 633 ms returned [380, 581, 621]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 637 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 924/1040 places, 828/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 923 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 923 transition count 827
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 4 place count 922 transition count 826
Applied a total of 4 rules in 109 ms. Remains 922 /924 variables (removed 2) and now considering 826/828 (removed 2) transitions.
// Phase 1: matrix 826 rows 922 cols
[2023-03-17 03:09:43] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-17 03:09:44] [INFO ] Implicit Places using invariants in 856 ms returned []
[2023-03-17 03:09:44] [INFO ] Invariant cache hit.
[2023-03-17 03:09:45] [INFO ] Implicit Places using invariants and state equation in 1398 ms returned []
Implicit Place search using SMT with State Equation took 2257 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 922/1040 places, 826/941 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3176 ms. Remains : 922/1040 places, 826/941 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s358 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 278 steps with 0 reset in 12 ms.
FORMULA Parking-PT-864-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-03 finished in 3241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1039 transition count 909
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1008 transition count 909
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1008 transition count 878
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 124 place count 977 transition count 878
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 975 transition count 876
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 975 transition count 876
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 224 place count 927 transition count 828
Applied a total of 224 rules in 150 ms. Remains 927 /1040 variables (removed 113) and now considering 828/941 (removed 113) transitions.
// Phase 1: matrix 828 rows 927 cols
[2023-03-17 03:09:46] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-17 03:09:46] [INFO ] Implicit Places using invariants in 859 ms returned [380, 581, 621]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 862 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 924/1040 places, 828/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 923 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 923 transition count 827
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 4 place count 922 transition count 826
Applied a total of 4 rules in 106 ms. Remains 922 /924 variables (removed 2) and now considering 826/828 (removed 2) transitions.
// Phase 1: matrix 826 rows 922 cols
[2023-03-17 03:09:47] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-17 03:09:47] [INFO ] Implicit Places using invariants in 842 ms returned []
[2023-03-17 03:09:47] [INFO ] Invariant cache hit.
[2023-03-17 03:09:49] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 2326 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 922/1040 places, 826/941 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3446 ms. Remains : 922/1040 places, 826/941 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s362 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 256 steps with 0 reset in 8 ms.
FORMULA Parking-PT-864-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-04 finished in 3677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1039 transition count 909
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1008 transition count 909
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1008 transition count 878
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 124 place count 977 transition count 878
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 975 transition count 876
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 975 transition count 876
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 224 place count 927 transition count 828
Applied a total of 224 rules in 197 ms. Remains 927 /1040 variables (removed 113) and now considering 828/941 (removed 113) transitions.
// Phase 1: matrix 828 rows 927 cols
[2023-03-17 03:09:49] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-17 03:09:50] [INFO ] Implicit Places using invariants in 638 ms returned [378, 581, 621]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 642 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 924/1040 places, 828/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 923 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 923 transition count 827
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 922 transition count 826
Applied a total of 4 rules in 92 ms. Remains 922 /924 variables (removed 2) and now considering 826/828 (removed 2) transitions.
// Phase 1: matrix 826 rows 922 cols
[2023-03-17 03:09:50] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-17 03:09:51] [INFO ] Implicit Places using invariants in 710 ms returned []
[2023-03-17 03:09:51] [INFO ] Invariant cache hit.
[2023-03-17 03:09:52] [INFO ] Implicit Places using invariants and state equation in 1562 ms returned []
Implicit Place search using SMT with State Equation took 2277 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 922/1040 places, 826/941 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3209 ms. Remains : 922/1040 places, 826/941 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s481 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 256 steps with 0 reset in 4 ms.
FORMULA Parking-PT-864-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-05 finished in 3276 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))))'
Support contains 1 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 71 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-17 03:09:52] [INFO ] Computed 203 place invariants in 4 ms
[2023-03-17 03:09:53] [INFO ] Implicit Places using invariants in 941 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 960 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 69 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-17 03:09:53] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-17 03:09:54] [INFO ] Implicit Places using invariants in 882 ms returned []
[2023-03-17 03:09:54] [INFO ] Invariant cache hit.
[2023-03-17 03:09:55] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-17 03:09:57] [INFO ] Implicit Places using invariants and state equation in 2548 ms returned []
Implicit Place search using SMT with State Equation took 3433 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4534 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-07 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=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s366 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-07 finished in 4678 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)||F(G(p1))))'
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1008 transition count 909
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1008 transition count 877
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 976 transition count 877
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 974 transition count 875
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 974 transition count 875
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 226 place count 927 transition count 828
Applied a total of 226 rules in 126 ms. Remains 927 /1040 variables (removed 113) and now considering 828/941 (removed 113) transitions.
// Phase 1: matrix 828 rows 927 cols
[2023-03-17 03:09:57] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-17 03:09:58] [INFO ] Implicit Places using invariants in 813 ms returned [380, 581, 621]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 814 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 924/1040 places, 828/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 923 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 923 transition count 827
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 4 place count 922 transition count 826
Applied a total of 4 rules in 93 ms. Remains 922 /924 variables (removed 2) and now considering 826/828 (removed 2) transitions.
// Phase 1: matrix 826 rows 922 cols
[2023-03-17 03:09:58] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-17 03:09:59] [INFO ] Implicit Places using invariants in 900 ms returned []
[2023-03-17 03:09:59] [INFO ] Invariant cache hit.
[2023-03-17 03:10:00] [INFO ] State equation strengthened by 332 read => feed constraints.
[2023-03-17 03:10:02] [INFO ] Implicit Places using invariants and state equation in 2692 ms returned []
Implicit Place search using SMT with State Equation took 3600 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 922/1040 places, 826/941 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4637 ms. Remains : 922/1040 places, 826/941 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Parking-PT-864-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s214 1), p1:(NEQ s745 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 395 reset in 1328 ms.
Product exploration explored 100000 steps with 391 reset in 1388 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 228 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 p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Support contains 1 out of 922 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 922/922 places, 826/826 transitions.
Applied a total of 0 rules in 37 ms. Remains 922 /922 variables (removed 0) and now considering 826/826 (removed 0) transitions.
[2023-03-17 03:10:05] [INFO ] Invariant cache hit.
[2023-03-17 03:10:06] [INFO ] Implicit Places using invariants in 713 ms returned []
[2023-03-17 03:10:06] [INFO ] Invariant cache hit.
[2023-03-17 03:10:07] [INFO ] State equation strengthened by 332 read => feed constraints.
[2023-03-17 03:10:09] [INFO ] Implicit Places using invariants and state equation in 2838 ms returned []
Implicit Place search using SMT with State Equation took 3557 ms to find 0 implicit places.
[2023-03-17 03:10:09] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-17 03:10:09] [INFO ] Invariant cache hit.
[2023-03-17 03:10:10] [INFO ] Dead Transitions using invariants and state equation in 967 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4632 ms. Remains : 922/922 places, 826/826 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p1, (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p1, (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Product exploration explored 100000 steps with 396 reset in 1244 ms.
Product exploration explored 100000 steps with 392 reset in 1339 ms.
Support contains 1 out of 922 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 922/922 places, 826/826 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 921 transition count 825
Applied a total of 2 rules in 63 ms. Remains 921 /922 variables (removed 1) and now considering 825/826 (removed 1) transitions.
// Phase 1: matrix 825 rows 921 cols
[2023-03-17 03:10:13] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-17 03:10:14] [INFO ] Implicit Places using invariants in 781 ms returned []
[2023-03-17 03:10:14] [INFO ] Invariant cache hit.
[2023-03-17 03:10:14] [INFO ] State equation strengthened by 344 read => feed constraints.
[2023-03-17 03:10:17] [INFO ] Implicit Places using invariants and state equation in 2786 ms returned []
Implicit Place search using SMT with State Equation took 3574 ms to find 0 implicit places.
[2023-03-17 03:10:17] [INFO ] Redundant transitions in 119 ms returned []
[2023-03-17 03:10:17] [INFO ] Invariant cache hit.
[2023-03-17 03:10:18] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/922 places, 825/826 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4738 ms. Remains : 921/922 places, 825/826 transitions.
Treatment of property Parking-PT-864-LTLFireability-08 finished in 20708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 97 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-17 03:10:18] [INFO ] Computed 203 place invariants in 10 ms
[2023-03-17 03:10:19] [INFO ] Implicit Places using invariants in 753 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 756 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 67 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-17 03:10:19] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-17 03:10:20] [INFO ] Implicit Places using invariants in 847 ms returned []
[2023-03-17 03:10:20] [INFO ] Invariant cache hit.
[2023-03-17 03:10:20] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-17 03:10:22] [INFO ] Implicit Places using invariants and state equation in 2663 ms returned []
Implicit Place search using SMT with State Equation took 3512 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4434 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Parking-PT-864-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s650 0) (EQ s414 0)), p1:(EQ s463 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 884 reset in 1667 ms.
Entered a terminal (fully accepting) state of product in 70816 steps with 648 reset in 1255 ms.
FORMULA Parking-PT-864-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-09 finished in 7522 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(F(p1))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 65 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-17 03:10:25] [INFO ] Computed 203 place invariants in 4 ms
[2023-03-17 03:10:26] [INFO ] Implicit Places using invariants in 864 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 865 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 68 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-17 03:10:26] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-17 03:10:27] [INFO ] Implicit Places using invariants in 1030 ms returned []
[2023-03-17 03:10:27] [INFO ] Invariant cache hit.
[2023-03-17 03:10:28] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-17 03:10:30] [INFO ] Implicit Places using invariants and state equation in 2780 ms returned []
Implicit Place search using SMT with State Equation took 3812 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4812 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-864-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s824 0) (EQ s867 0)), p0:(EQ s275 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4454 ms.
Product exploration explored 100000 steps with 50000 reset in 4436 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 130 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-864-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLFireability-10 finished in 13994 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((X((p1 U (p2||G(p1))))||p0))))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 67 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2023-03-17 03:10:39] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-17 03:10:40] [INFO ] Implicit Places using invariants in 734 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 737 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1034 transition count 938
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1034 transition count 938
Applied a total of 4 rules in 67 ms. Remains 1034 /1036 variables (removed 2) and now considering 938/940 (removed 2) transitions.
// Phase 1: matrix 938 rows 1034 cols
[2023-03-17 03:10:40] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-17 03:10:41] [INFO ] Implicit Places using invariants in 872 ms returned []
[2023-03-17 03:10:41] [INFO ] Invariant cache hit.
[2023-03-17 03:10:42] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-17 03:10:44] [INFO ] Implicit Places using invariants and state equation in 2693 ms returned []
Implicit Place search using SMT with State Equation took 3567 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1034/1040 places, 938/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4441 ms. Remains : 1034/1040 places, 938/941 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(AND (NOT (OR (NEQ s916 1) (AND (EQ s640 1) (EQ s686 1)))) (NEQ s397 1)), p1:(NEQ s397 1), p0:(OR (EQ s640 0) (EQ s686 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 386 reset in 1248 ms.
Entered a terminal (fully accepting) state of product in 90772 steps with 350 reset in 1267 ms.
FORMULA Parking-PT-864-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-11 finished in 7120 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 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 69 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-17 03:10:46] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-17 03:10:47] [INFO ] Implicit Places using invariants in 865 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 867 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 69 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-17 03:10:47] [INFO ] Computed 200 place invariants in 10 ms
[2023-03-17 03:10:48] [INFO ] Implicit Places using invariants in 867 ms returned []
[2023-03-17 03:10:48] [INFO ] Invariant cache hit.
[2023-03-17 03:10:49] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-17 03:10:51] [INFO ] Implicit Places using invariants and state equation in 2649 ms returned []
Implicit Place search using SMT with State Equation took 3517 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4522 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s269 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-12 finished in 4627 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(F((X(p0)&&G((p1&&X((p1 U (X(p2)||G(p1))))))))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 68 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-17 03:10:51] [INFO ] Computed 203 place invariants in 8 ms
[2023-03-17 03:10:52] [INFO ] Implicit Places using invariants in 912 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 915 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 66 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-17 03:10:52] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-17 03:10:53] [INFO ] Implicit Places using invariants in 737 ms returned []
[2023-03-17 03:10:53] [INFO ] Invariant cache hit.
[2023-03-17 03:10:54] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-17 03:10:56] [INFO ] Implicit Places using invariants and state equation in 2694 ms returned []
Implicit Place search using SMT with State Equation took 3434 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4485 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Parking-PT-864-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 2}, { cond=p1, acceptance={0, 1} source=1 dest: 3}, { cond=p1, acceptance={1} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 5}, { cond=p1, acceptance={0} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 1}, { cond=p1, acceptance={0, 1} source=4 dest: 3}, { cond=p1, acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s881 1), p0:(EQ s378 0), p2:(NEQ s251 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1304 reset in 1643 ms.
Product exploration explored 100000 steps with 1330 reset in 1739 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 520 ms. (steps per millisecond=19 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 03:11:01] [INFO ] Invariant cache hit.
[2023-03-17 03:11:01] [INFO ] [Real]Absence check using 200 positive place invariants in 59 ms returned sat
[2023-03-17 03:11:01] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 03:11:01] [INFO ] [Nat]Absence check using 200 positive place invariants in 64 ms returned sat
[2023-03-17 03:11:02] [INFO ] After 690ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 03:11:02] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-17 03:11:02] [INFO ] After 356ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 03:11:03] [INFO ] After 618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-17 03:11:03] [INFO ] After 1823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 205 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=22 )
Parikh walk visited 3 properties in 10 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 397 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 35 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2023-03-17 03:11:04] [INFO ] Invariant cache hit.
[2023-03-17 03:11:05] [INFO ] Implicit Places using invariants in 875 ms returned []
[2023-03-17 03:11:05] [INFO ] Invariant cache hit.
[2023-03-17 03:11:05] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-17 03:11:07] [INFO ] Implicit Places using invariants and state equation in 2744 ms returned []
Implicit Place search using SMT with State Equation took 3623 ms to find 0 implicit places.
[2023-03-17 03:11:07] [INFO ] Invariant cache hit.
[2023-03-17 03:11:09] [INFO ] Dead Transitions using invariants and state equation in 1084 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4751 ms. Remains : 1033/1033 places, 937/937 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 269 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 03:11:10] [INFO ] Invariant cache hit.
[2023-03-17 03:11:10] [INFO ] [Real]Absence check using 200 positive place invariants in 64 ms returned sat
[2023-03-17 03:11:10] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 03:11:10] [INFO ] [Nat]Absence check using 200 positive place invariants in 63 ms returned sat
[2023-03-17 03:11:11] [INFO ] After 702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 03:11:11] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-17 03:11:12] [INFO ] After 354ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 03:11:12] [INFO ] After 622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-17 03:11:12] [INFO ] After 1857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 202 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=33 )
Parikh walk visited 3 properties in 7 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 390 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1306 reset in 1609 ms.
Product exploration explored 100000 steps with 1391 reset in 1765 ms.
Support contains 3 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 32 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2023-03-17 03:11:17] [INFO ] Invariant cache hit.
[2023-03-17 03:11:18] [INFO ] Implicit Places using invariants in 943 ms returned []
[2023-03-17 03:11:18] [INFO ] Invariant cache hit.
[2023-03-17 03:11:19] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-17 03:11:21] [INFO ] Implicit Places using invariants and state equation in 2754 ms returned []
Implicit Place search using SMT with State Equation took 3699 ms to find 0 implicit places.
[2023-03-17 03:11:21] [INFO ] Invariant cache hit.
[2023-03-17 03:11:22] [INFO ] Dead Transitions using invariants and state equation in 1167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4901 ms. Remains : 1033/1033 places, 937/937 transitions.
Treatment of property Parking-PT-864-LTLFireability-14 finished in 30942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U p1))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1008 transition count 909
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1008 transition count 877
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 976 transition count 877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 975 transition count 876
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 975 transition count 876
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 226 place count 927 transition count 828
Applied a total of 226 rules in 181 ms. Remains 927 /1040 variables (removed 113) and now considering 828/941 (removed 113) transitions.
// Phase 1: matrix 828 rows 927 cols
[2023-03-17 03:11:22] [INFO ] Computed 203 place invariants in 4 ms
[2023-03-17 03:11:23] [INFO ] Implicit Places using invariants in 922 ms returned [379, 580]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 925 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 925/1040 places, 828/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 924 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 924 transition count 827
Applied a total of 2 rules in 61 ms. Remains 924 /925 variables (removed 1) and now considering 827/828 (removed 1) transitions.
// Phase 1: matrix 827 rows 924 cols
[2023-03-17 03:11:23] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-17 03:11:24] [INFO ] Implicit Places using invariants in 895 ms returned []
[2023-03-17 03:11:24] [INFO ] Invariant cache hit.
[2023-03-17 03:11:25] [INFO ] State equation strengthened by 344 read => feed constraints.
[2023-03-17 03:11:27] [INFO ] Implicit Places using invariants and state equation in 2838 ms returned []
Implicit Place search using SMT with State Equation took 3735 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 924/1040 places, 827/941 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4904 ms. Remains : 924/1040 places, 827/941 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), true, p0]
Running random walk in product with property : Parking-PT-864-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s648 1) (EQ s702 1)), p0:(AND (EQ s582 1) (EQ s618 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 390 reset in 1244 ms.
Product exploration explored 100000 steps with 397 reset in 1358 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 326 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 179470 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179470 steps, saw 86060 distinct states, run finished after 3004 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 03:11:33] [INFO ] Invariant cache hit.
[2023-03-17 03:11:34] [INFO ] [Real]Absence check using 201 positive place invariants in 59 ms returned sat
[2023-03-17 03:11:34] [INFO ] After 323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 03:11:34] [INFO ] [Nat]Absence check using 201 positive place invariants in 59 ms returned sat
[2023-03-17 03:11:35] [INFO ] After 628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 03:11:35] [INFO ] State equation strengthened by 344 read => feed constraints.
[2023-03-17 03:11:35] [INFO ] After 251ms SMT Verify possible using 344 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 03:11:35] [INFO ] After 565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 271 ms.
[2023-03-17 03:11:35] [INFO ] After 1786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 4 out of 924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 924/924 places, 827/827 transitions.
Free-agglomeration rule applied 254 times.
Iterating global reduction 0 with 254 rules applied. Total rules applied 254 place count 924 transition count 573
Reduce places removed 254 places and 0 transitions.
Graph (complete) has 1336 edges and 670 vertex of which 190 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.1 ms
Discarding 480 places :
Also discarding 396 output transitions
Drop transitions removed 396 transitions
Iterating post reduction 0 with 255 rules applied. Total rules applied 509 place count 190 transition count 177
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 533 place count 190 transition count 153
Applied a total of 533 rules in 94 ms. Remains 190 /924 variables (removed 734) and now considering 153/827 (removed 674) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 190/924 places, 153/827 transitions.
Finished random walk after 166 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 405 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), true, p0]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), true, p0]
[2023-03-17 03:11:36] [INFO ] Invariant cache hit.
[2023-03-17 03:11:37] [INFO ] [Real]Absence check using 201 positive place invariants in 68 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND p0 (NOT p1))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 8 factoid took 201 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-864-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLFireability-15 finished in 15274 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)||F(G(p1))))'
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((X(p0)&&G((p1&&X((p1 U (X(p2)||G(p1))))))))))'
Found a Shortening insensitive property : Parking-PT-864-LTLFireability-14
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1040 transition count 910
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 1009 transition count 909
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1008 transition count 909
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 64 place count 1008 transition count 878
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 126 place count 977 transition count 878
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 975 transition count 876
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 975 transition count 876
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 224 place count 928 transition count 829
Applied a total of 224 rules in 142 ms. Remains 928 /1040 variables (removed 112) and now considering 829/941 (removed 112) transitions.
// Phase 1: matrix 829 rows 928 cols
[2023-03-17 03:11:38] [INFO ] Computed 203 place invariants in 2 ms
[2023-03-17 03:11:39] [INFO ] Implicit Places using invariants in 945 ms returned [380, 581, 621]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 948 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 925/1040 places, 829/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 924 transition count 828
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 924 transition count 828
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 4 place count 923 transition count 827
Applied a total of 4 rules in 133 ms. Remains 923 /925 variables (removed 2) and now considering 827/829 (removed 2) transitions.
// Phase 1: matrix 827 rows 923 cols
[2023-03-17 03:11:39] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-17 03:11:40] [INFO ] Implicit Places using invariants in 1022 ms returned []
[2023-03-17 03:11:40] [INFO ] Invariant cache hit.
[2023-03-17 03:11:41] [INFO ] State equation strengthened by 343 read => feed constraints.
[2023-03-17 03:11:43] [INFO ] Implicit Places using invariants and state equation in 2962 ms returned []
Implicit Place search using SMT with State Equation took 3986 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 923/1040 places, 827/941 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 5212 ms. Remains : 923/1040 places, 827/941 transitions.
Running random walk in product with property : Parking-PT-864-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 2}, { cond=p1, acceptance={0, 1} source=1 dest: 3}, { cond=p1, acceptance={1} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 5}, { cond=p1, acceptance={0} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 1}, { cond=p1, acceptance={0, 1} source=4 dest: 3}, { cond=p1, acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s786 1), p0:(EQ s349 0), p2:(NEQ s237 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1415 reset in 1618 ms.
Product exploration explored 100000 steps with 1332 reset in 1749 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 258 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 03:11:47] [INFO ] Invariant cache hit.
[2023-03-17 03:11:47] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 03:11:48] [INFO ] [Nat]Absence check using 200 positive place invariants in 61 ms returned sat
[2023-03-17 03:11:48] [INFO ] After 589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 03:11:48] [INFO ] State equation strengthened by 343 read => feed constraints.
[2023-03-17 03:11:48] [INFO ] After 213ms SMT Verify possible using 343 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 03:11:49] [INFO ] After 430ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-17 03:11:49] [INFO ] After 1393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 414 steps, including 1 resets, run visited all 2 properties in 11 ms. (steps per millisecond=37 )
Parikh walk visited 2 properties in 26 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 378 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 923/923 places, 827/827 transitions.
Applied a total of 0 rules in 25 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
[2023-03-17 03:11:50] [INFO ] Invariant cache hit.
[2023-03-17 03:11:51] [INFO ] Implicit Places using invariants in 906 ms returned []
[2023-03-17 03:11:51] [INFO ] Invariant cache hit.
[2023-03-17 03:11:52] [INFO ] State equation strengthened by 343 read => feed constraints.
[2023-03-17 03:11:54] [INFO ] Implicit Places using invariants and state equation in 3007 ms returned []
Implicit Place search using SMT with State Equation took 3916 ms to find 0 implicit places.
[2023-03-17 03:11:54] [INFO ] Invariant cache hit.
[2023-03-17 03:11:55] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4864 ms. Remains : 923/923 places, 827/827 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 352 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 03:11:56] [INFO ] Invariant cache hit.
[2023-03-17 03:11:56] [INFO ] [Real]Absence check using 200 positive place invariants in 61 ms returned sat
[2023-03-17 03:11:56] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 03:11:56] [INFO ] [Nat]Absence check using 200 positive place invariants in 63 ms returned sat
[2023-03-17 03:11:57] [INFO ] After 596ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 03:11:57] [INFO ] State equation strengthened by 343 read => feed constraints.
[2023-03-17 03:11:57] [INFO ] After 480ms SMT Verify possible using 343 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 03:11:58] [INFO ] After 749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-17 03:11:58] [INFO ] After 1828ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 18 ms.
Support contains 2 out of 923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 923/923 places, 827/827 transitions.
Free-agglomeration rule applied 264 times.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 923 transition count 563
Reduce places removed 264 places and 0 transitions.
Graph (complete) has 1321 edges and 659 vertex of which 179 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.1 ms
Discarding 480 places :
Also discarding 396 output transitions
Drop transitions removed 396 transitions
Iterating post reduction 0 with 265 rules applied. Total rules applied 529 place count 179 transition count 167
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 553 place count 179 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 554 place count 178 transition count 142
Reduce places removed 60 places and 0 transitions.
Graph (trivial) has 137 edges and 118 vertex of which 109 / 118 are part of one of the 2 SCC in 5 ms
Free SCC test removed 107 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 63 rules applied. Total rules applied 617 place count 11 transition count 140
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 134 rules applied. Total rules applied 751 place count 9 transition count 8
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 755 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 756 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 756 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 760 place count 4 transition count 4
Applied a total of 760 rules in 67 ms. Remains 4 /923 variables (removed 919) and now considering 4/827 (removed 823) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 4/923 places, 4/827 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 405 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1329 reset in 1620 ms.
Product exploration explored 100000 steps with 1347 reset in 1752 ms.
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 923/923 places, 827/827 transitions.
Applied a total of 0 rules in 25 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
[2023-03-17 03:12:03] [INFO ] Invariant cache hit.
[2023-03-17 03:12:04] [INFO ] Implicit Places using invariants in 881 ms returned []
[2023-03-17 03:12:04] [INFO ] Invariant cache hit.
[2023-03-17 03:12:04] [INFO ] State equation strengthened by 343 read => feed constraints.
[2023-03-17 03:12:07] [INFO ] Implicit Places using invariants and state equation in 3094 ms returned []
Implicit Place search using SMT with State Equation took 3977 ms to find 0 implicit places.
[2023-03-17 03:12:07] [INFO ] Invariant cache hit.
[2023-03-17 03:12:08] [INFO ] Dead Transitions using invariants and state equation in 1088 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5091 ms. Remains : 923/923 places, 827/827 transitions.
Treatment of property Parking-PT-864-LTLFireability-14 finished in 30557 ms.
[2023-03-17 03:12:08] [INFO ] Flatten gal took : 64 ms
[2023-03-17 03:12:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-17 03:12:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1040 places, 941 transitions and 3155 arcs took 10 ms.
Total runtime 165380 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1764/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1764/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Parking-PT-864-LTLFireability-08
Could not compute solution for formula : Parking-PT-864-LTLFireability-14

BK_STOP 1679022730661

--------------------
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-864-LTLFireability-08
ltl formula formula --ltl=/tmp/1764/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 1040 places, 941 transitions and 3155 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.100 real 0.020 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1764/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1764/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1764/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1764/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name Parking-PT-864-LTLFireability-14
ltl formula formula --ltl=/tmp/1764/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 1040 places, 941 transitions and 3155 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.110 real 0.030 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1764/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1764/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1764/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1764/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-864"
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-864, 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-167863540100452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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