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.r325-tall-167889197100379.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 itstools
Input is Railroad-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889197100379
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 8.7K Feb 25 22:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 22:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 22:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 22:28 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.3K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 22:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 25 22:30 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 255K 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-020-LTLCardinality-00
FORMULA_NAME Railroad-PT-020-LTLCardinality-01
FORMULA_NAME Railroad-PT-020-LTLCardinality-02
FORMULA_NAME Railroad-PT-020-LTLCardinality-03
FORMULA_NAME Railroad-PT-020-LTLCardinality-04
FORMULA_NAME Railroad-PT-020-LTLCardinality-05
FORMULA_NAME Railroad-PT-020-LTLCardinality-06
FORMULA_NAME Railroad-PT-020-LTLCardinality-07
FORMULA_NAME Railroad-PT-020-LTLCardinality-08
FORMULA_NAME Railroad-PT-020-LTLCardinality-09
FORMULA_NAME Railroad-PT-020-LTLCardinality-10
FORMULA_NAME Railroad-PT-020-LTLCardinality-11
FORMULA_NAME Railroad-PT-020-LTLCardinality-12
FORMULA_NAME Railroad-PT-020-LTLCardinality-13
FORMULA_NAME Railroad-PT-020-LTLCardinality-14
FORMULA_NAME Railroad-PT-020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679006885901

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Railroad-PT-020
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-16 22:48:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 22:48:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 22:48:07] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-16 22:48:07] [INFO ] Transformed 218 places.
[2023-03-16 22:48:07] [INFO ] Transformed 506 transitions.
[2023-03-16 22:48:07] [INFO ] Found NUPN structural information;
[2023-03-16 22:48:07] [INFO ] Parsed PT model containing 218 places and 506 transitions and 2968 arcs in 138 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 2 formulas.
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 20 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Railroad-PT-020-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA Railroad-PT-020-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 486/486 transitions.
Ensure Unique test removed 22 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 135 transition count 486
Applied a total of 22 rules in 28 ms. Remains 135 /157 variables (removed 22) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 135 cols
[2023-03-16 22:48:07] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-16 22:48:07] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 486 rows 135 cols
[2023-03-16 22:48:07] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-16 22:48:08] [INFO ] Implicit Places using invariants and state equation in 408 ms returned [0, 1, 8, 14, 16, 59, 61, 62, 65, 73, 78, 79, 80, 105, 110, 120, 124, 128, 131, 133]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 719 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/157 places, 486/486 transitions.
Applied a total of 0 rules in 6 ms. Remains 115 /115 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 753 ms. Remains : 115/157 places, 486/486 transitions.
Support contains 17 out of 115 places after structural reductions.
[2023-03-16 22:48:08] [INFO ] Flatten gal took : 70 ms
[2023-03-16 22:48:08] [INFO ] Flatten gal took : 42 ms
[2023-03-16 22:48:08] [INFO ] Input system was already deterministic with 486 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 9) seen :7
Finished Best-First random walk after 8626 steps, including 2 resets, run visited all 2 properties in 19 ms. (steps per millisecond=454 )
FORMULA Railroad-PT-020-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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((G(p0)||G(p1))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 115 transition count 482
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 111 transition count 482
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 8 place count 111 transition count 468
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 36 place count 97 transition count 468
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 51 place count 89 transition count 461
Applied a total of 51 rules in 43 ms. Remains 89 /115 variables (removed 26) and now considering 461/486 (removed 25) transitions.
// Phase 1: matrix 461 rows 89 cols
[2023-03-16 22:48:09] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-16 22:48:09] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 461 rows 89 cols
[2023-03-16 22:48:09] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:48:09] [INFO ] Implicit Places using invariants and state equation in 233 ms returned [3, 6, 32, 45, 76]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 324 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/115 places, 461/486 transitions.
Applied a total of 0 rules in 14 ms. Remains 84 /84 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 381 ms. Remains : 84/115 places, 461/486 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-020-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s24 0) (NEQ s20 1)), p1:(EQ s34 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 518 ms.
Stack based approach found an accepted trace after 9949 steps with 0 reset with depth 9950 and stack size 9934 in 45 ms.
FORMULA Railroad-PT-020-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLCardinality-01 finished in 1182 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(F(p0)))))'
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Applied a total of 0 rules in 10 ms. Remains 115 /115 variables (removed 0) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 115 cols
[2023-03-16 22:48:10] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-16 22:48:10] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 486 rows 115 cols
[2023-03-16 22:48:10] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-16 22:48:11] [INFO ] Implicit Places using invariants and state equation in 497 ms returned [3, 33, 64, 99]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 601 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 486/486 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 615 ms. Remains : 111/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s83 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19539 reset in 329 ms.
Product exploration explored 100000 steps with 19233 reset in 288 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 763 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 126 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=42 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 486/486 transitions.
Applied a total of 0 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 111 cols
[2023-03-16 22:48:13] [INFO ] Computed 25 place invariants in 5 ms
[2023-03-16 22:48:13] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-16 22:48:13] [INFO ] Invariant cache hit.
[2023-03-16 22:48:13] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-16 22:48:13] [INFO ] Invariant cache hit.
[2023-03-16 22:48:13] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 683 ms. Remains : 111/111 places, 486/486 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 162 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=32 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19025 reset in 238 ms.
Product exploration explored 100000 steps with 19234 reset in 257 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 486/486 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 486
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 111 transition count 486
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 111 transition count 486
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 109 transition count 484
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 109 transition count 484
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 29 place count 109 transition count 484
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 107 transition count 482
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 107 transition count 482
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 33 rules in 63 ms. Remains 107 /111 variables (removed 4) and now considering 482/486 (removed 4) transitions.
[2023-03-16 22:48:15] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 482 rows 107 cols
[2023-03-16 22:48:15] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-16 22:48:15] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/111 places, 482/486 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 107/111 places, 482/486 transitions.
Built C files in :
/tmp/ltsmin9892195359251105628
[2023-03-16 22:48:15] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9892195359251105628
Running compilation step : cd /tmp/ltsmin9892195359251105628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 835 ms.
Running link step : cd /tmp/ltsmin9892195359251105628;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9892195359251105628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11156047738983069655.hoa' '--buchi-type=spotba'
LTSmin run took 4091 ms.
FORMULA Railroad-PT-020-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Railroad-PT-020-LTLCardinality-03 finished in 10473 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 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 115 transition count 482
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 111 transition count 482
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 8 place count 111 transition count 468
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 36 place count 97 transition count 468
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 47 place count 91 transition count 463
Applied a total of 47 rules in 24 ms. Remains 91 /115 variables (removed 24) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 91 cols
[2023-03-16 22:48:20] [INFO ] Computed 28 place invariants in 13 ms
[2023-03-16 22:48:21] [INFO ] Implicit Places using invariants in 102 ms returned [3, 6, 32]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 103 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/115 places, 463/486 transitions.
Applied a total of 0 rules in 7 ms. Remains 88 /88 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 135 ms. Remains : 88/115 places, 463/486 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s42 1) (OR (EQ s74 1) (EQ s53 0) (EQ s75 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1626 reset in 355 ms.
Stack based approach found an accepted trace after 332 steps with 4 reset with depth 20 and stack size 20 in 4 ms.
FORMULA Railroad-PT-020-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLCardinality-06 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 115 cols
[2023-03-16 22:48:21] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-16 22:48:21] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 486 rows 115 cols
[2023-03-16 22:48:21] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:48:22] [INFO ] Implicit Places using invariants and state equation in 466 ms returned [7, 33, 64, 99]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 573 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 486/486 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 580 ms. Remains : 111/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s3 0) (EQ s62 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 2939 reset in 336 ms.
Stack based approach found an accepted trace after 2678 steps with 88 reset with depth 14 and stack size 14 in 10 ms.
FORMULA Railroad-PT-020-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLCardinality-08 finished in 1077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 115 transition count 482
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 111 transition count 482
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 8 place count 111 transition count 468
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 36 place count 97 transition count 468
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 49 place count 90 transition count 462
Applied a total of 49 rules in 23 ms. Remains 90 /115 variables (removed 25) and now considering 462/486 (removed 24) transitions.
// Phase 1: matrix 462 rows 90 cols
[2023-03-16 22:48:22] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-16 22:48:22] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 462 rows 90 cols
[2023-03-16 22:48:22] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:48:22] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [3, 7, 46, 77]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 289 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/115 places, 462/486 transitions.
Applied a total of 0 rules in 7 ms. Remains 86 /86 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 319 ms. Remains : 86/115 places, 462/486 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s31 0) (EQ s76 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 3660 reset in 340 ms.
Stack based approach found an accepted trace after 1267 steps with 41 reset with depth 6 and stack size 6 in 5 ms.
FORMULA Railroad-PT-020-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLCardinality-09 finished in 725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 115 transition count 482
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 111 transition count 482
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 8 place count 111 transition count 467
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 38 place count 96 transition count 467
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 51 place count 89 transition count 461
Applied a total of 51 rules in 21 ms. Remains 89 /115 variables (removed 26) and now considering 461/486 (removed 25) transitions.
// Phase 1: matrix 461 rows 89 cols
[2023-03-16 22:48:23] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-16 22:48:23] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 461 rows 89 cols
[2023-03-16 22:48:23] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:48:23] [INFO ] Implicit Places using invariants and state equation in 291 ms returned [3, 7, 33, 45, 76]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 375 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/115 places, 461/486 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 403 ms. Remains : 84/115 places, 461/486 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLCardinality-12 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:(OR (EQ s78 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1571 reset in 353 ms.
Stack based approach found an accepted trace after 1606 steps with 26 reset with depth 62 and stack size 62 in 6 ms.
FORMULA Railroad-PT-020-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLCardinality-12 finished in 849 ms.
All properties solved by simple procedures.
Total runtime 16824 ms.

BK_STOP 1679006905061

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Railroad-PT-020, 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 r325-tall-167889197100379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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