fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r327-tall-167889199500371
Last Updated
May 14, 2023

About the Execution of LoLa+red for Railroad-PT-010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
356.184 8662.00 16057.00 210.50 TFFFFFFTTFTTTFTF normal

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.r327-tall-167889199500371.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Railroad-PT-010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199500371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 9.0K Feb 25 22:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 22:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 22:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 22:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 22:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 22:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 22:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:41 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 82K 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 Railroad-PT-010-LTLCardinality-00
FORMULA_NAME Railroad-PT-010-LTLCardinality-01
FORMULA_NAME Railroad-PT-010-LTLCardinality-02
FORMULA_NAME Railroad-PT-010-LTLCardinality-03
FORMULA_NAME Railroad-PT-010-LTLCardinality-04
FORMULA_NAME Railroad-PT-010-LTLCardinality-05
FORMULA_NAME Railroad-PT-010-LTLCardinality-06
FORMULA_NAME Railroad-PT-010-LTLCardinality-07
FORMULA_NAME Railroad-PT-010-LTLCardinality-08
FORMULA_NAME Railroad-PT-010-LTLCardinality-09
FORMULA_NAME Railroad-PT-010-LTLCardinality-10
FORMULA_NAME Railroad-PT-010-LTLCardinality-11
FORMULA_NAME Railroad-PT-010-LTLCardinality-12
FORMULA_NAME Railroad-PT-010-LTLCardinality-13
FORMULA_NAME Railroad-PT-010-LTLCardinality-14
FORMULA_NAME Railroad-PT-010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679044690989

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Railroad-PT-010
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 09:18:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 09:18:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 09:18:12] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-17 09:18:12] [INFO ] Transformed 118 places.
[2023-03-17 09:18:12] [INFO ] Transformed 156 transitions.
[2023-03-17 09:18:12] [INFO ] Found NUPN structural information;
[2023-03-17 09:18:12] [INFO ] Parsed PT model containing 118 places and 156 transitions and 898 arcs in 106 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 10 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Railroad-PT-010-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 146/146 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 76 transition count 146
Applied a total of 11 rules in 12 ms. Remains 76 /87 variables (removed 11) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 76 cols
[2023-03-17 09:18:12] [INFO ] Computed 30 place invariants in 26 ms
[2023-03-17 09:18:12] [INFO ] Implicit Places using invariants in 217 ms returned [34, 35, 36, 43, 45, 54, 58, 65, 68, 73]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 240 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/87 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 254 ms. Remains : 66/87 places, 146/146 transitions.
Support contains 18 out of 66 places after structural reductions.
[2023-03-17 09:18:13] [INFO ] Flatten gal took : 36 ms
[2023-03-17 09:18:13] [INFO ] Flatten gal took : 16 ms
[2023-03-17 09:18:13] [INFO ] Input system was already deterministic with 146 transitions.
Finished random walk after 46 steps, including 0 resets, run visited all 15 properties in 13 ms. (steps per millisecond=3 )
Computed a total of 0 stabilizing places and 0 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' '!(F(p0))'
Support contains 1 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 146/146 transitions.
Ensure Unique test removed 1 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 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 63 transition count 144
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 4 place count 63 transition count 136
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 20 place count 55 transition count 136
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 52 transition count 133
Applied a total of 26 rules in 24 ms. Remains 52 /66 variables (removed 14) and now considering 133/146 (removed 13) transitions.
// Phase 1: matrix 133 rows 52 cols
[2023-03-17 09:18:13] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-17 09:18:13] [INFO ] Implicit Places using invariants in 69 ms returned [1, 25, 26, 30, 42]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 70 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/66 places, 133/146 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 132
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7 place count 43 transition count 130
Applied a total of 7 rules in 8 ms. Remains 43 /47 variables (removed 4) and now considering 130/133 (removed 3) transitions.
// Phase 1: matrix 130 rows 43 cols
[2023-03-17 09:18:13] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-17 09:18:13] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-17 09:18:13] [INFO ] Invariant cache hit.
[2023-03-17 09:18:13] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/66 places, 130/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 244 ms. Remains : 43/66 places, 130/146 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s39 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]]
Product exploration explored 100000 steps with 50000 reset in 248 ms.
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-010-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-010-LTLCardinality-00 finished in 923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 146/146 transitions.
Ensure Unique test removed 1 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 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 63 transition count 144
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 4 place count 63 transition count 136
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 20 place count 55 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 53 transition count 134
Applied a total of 24 rules in 22 ms. Remains 53 /66 variables (removed 13) and now considering 134/146 (removed 12) transitions.
// Phase 1: matrix 134 rows 53 cols
[2023-03-17 09:18:14] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-17 09:18:14] [INFO ] Implicit Places using invariants in 75 ms returned [1, 25, 30, 42]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 76 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/66 places, 134/146 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 49 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 48 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7 place count 45 transition count 131
Applied a total of 7 rules in 7 ms. Remains 45 /49 variables (removed 4) and now considering 131/134 (removed 3) transitions.
// Phase 1: matrix 131 rows 45 cols
[2023-03-17 09:18:14] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 09:18:14] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-17 09:18:14] [INFO ] Invariant cache hit.
[2023-03-17 09:18:14] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/66 places, 131/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 229 ms. Remains : 45/66 places, 131/146 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s24 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4780 reset in 343 ms.
Stack based approach found an accepted trace after 230 steps with 9 reset with depth 21 and stack size 21 in 1 ms.
FORMULA Railroad-PT-010-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLCardinality-03 finished in 736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 146/146 transitions.
Ensure Unique test removed 1 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 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 63 transition count 144
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 63 transition count 137
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 56 transition count 137
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 53 transition count 134
Applied a total of 24 rules in 15 ms. Remains 53 /66 variables (removed 13) and now considering 134/146 (removed 12) transitions.
// Phase 1: matrix 134 rows 53 cols
[2023-03-17 09:18:15] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-17 09:18:15] [INFO ] Implicit Places using invariants in 73 ms returned [1, 27, 28, 32, 44]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 74 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/66 places, 134/146 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 48 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 47 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7 place count 44 transition count 131
Applied a total of 7 rules in 7 ms. Remains 44 /48 variables (removed 4) and now considering 131/134 (removed 3) transitions.
// Phase 1: matrix 131 rows 44 cols
[2023-03-17 09:18:15] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-17 09:18:15] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-17 09:18:15] [INFO ] Invariant cache hit.
[2023-03-17 09:18:15] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/66 places, 131/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 217 ms. Remains : 44/66 places, 131/146 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2078 reset in 209 ms.
Stack based approach found an accepted trace after 2446 steps with 49 reset with depth 48 and stack size 48 in 10 ms.
FORMULA Railroad-PT-010-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLCardinality-04 finished in 541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U (p1||X(p2))))&&F(G(p2))))'
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 146
Applied a total of 1 rules in 4 ms. Remains 65 /66 variables (removed 1) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 65 cols
[2023-03-17 09:18:15] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-17 09:18:15] [INFO ] Implicit Places using invariants in 56 ms returned [35, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/66 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 63/66 places, 146/146 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : Railroad-PT-010-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s58 1), p0:(OR (EQ s55 0) (EQ s1 1)), p2:(OR (EQ s33 0) (EQ s38 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]]
Product exploration explored 100000 steps with 12 reset in 214 ms.
Entered a terminal (fully accepting) state of product in 39 steps with 9 reset in 0 ms.
FORMULA Railroad-PT-010-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLCardinality-05 finished in 499 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(X((F(G(p0))||(F(p2)&&p1)))))))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 146
Applied a total of 1 rules in 2 ms. Remains 65 /66 variables (removed 1) and now considering 146/146 (removed 0) transitions.
[2023-03-17 09:18:16] [INFO ] Invariant cache hit.
[2023-03-17 09:18:16] [INFO ] Implicit Places using invariants in 65 ms returned [1, 33, 35, 39, 53]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 66 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/66 places, 146/146 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 60/66 places, 146/146 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Railroad-PT-010-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(AND (EQ s45 0) (EQ s31 1)), p2:(OR (EQ s13 0) (EQ s4 1)), p0:(AND (EQ s45 0) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16 reset in 230 ms.
Stack based approach found an accepted trace after 382 steps with 19 reset with depth 288 and stack size 288 in 1 ms.
FORMULA Railroad-PT-010-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLCardinality-06 finished in 586 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)))||G(p2))))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 146
Applied a total of 1 rules in 4 ms. Remains 65 /66 variables (removed 1) and now considering 146/146 (removed 0) transitions.
[2023-03-17 09:18:16] [INFO ] Invariant cache hit.
[2023-03-17 09:18:16] [INFO ] Implicit Places using invariants in 59 ms returned [1, 33, 35, 39, 53]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 60 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/66 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 60/66 places, 146/146 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Railroad-PT-010-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s57 0) (EQ s28 1)), p1:(OR (EQ s28 0) (EQ s5 1)), p0:(AND (EQ s28 0) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1533 reset in 216 ms.
Product exploration explored 100000 steps with 1583 reset in 241 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 224 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 60 cols
[2023-03-17 09:18:17] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-17 09:18:18] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p2))), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 5 factoid took 305 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-010-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-010-LTLCardinality-08 finished in 1565 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((F(p0)&&X(X((!p1 U (p2||G(!p1))))))))))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 146
Applied a total of 1 rules in 7 ms. Remains 65 /66 variables (removed 1) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 65 cols
[2023-03-17 09:18:18] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-17 09:18:18] [INFO ] Implicit Places using invariants in 67 ms returned [1, 33, 35, 39]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 68 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/66 places, 146/146 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 61/66 places, 146/146 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), (AND (NOT p2) p1), true]
Running random walk in product with property : Railroad-PT-010-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s25 0), p2:(AND (NEQ s25 1) (NOT (OR (EQ s49 0) (EQ s47 1)))), p1:(OR (EQ s49 0) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 123 steps with 12 reset in 1 ms.
FORMULA Railroad-PT-010-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLCardinality-15 finished in 361 ms.
All properties solved by simple procedures.
Total runtime 6335 ms.
ITS solved all properties within timeout

BK_STOP 1679044699651

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

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="Railroad-PT-010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Railroad-PT-010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r327-tall-167889199500371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Railroad-PT-010.tgz
mv Railroad-PT-010 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;