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.r231-tall-167856415700171.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 JoinFreeModules-PT-0020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856415700171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.5K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 61K Mar 5 18:22 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 JoinFreeModules-PT-0020-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0020-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0020-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0020-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0020-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0020-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0020-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0020-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0020-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0020-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0020-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0020-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0020-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0020-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0020-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679435470031

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=JoinFreeModules-PT-0020
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 21:51:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 21:51:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:51:11] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-21 21:51:11] [INFO ] Transformed 101 places.
[2023-03-21 21:51:11] [INFO ] Transformed 161 transitions.
[2023-03-21 21:51:11] [INFO ] Parsed PT model containing 101 places and 161 transitions and 462 arcs in 103 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 6 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0020-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0020-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0020-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0020-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0020-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0020-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 11 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 100 cols
[2023-03-21 21:51:11] [INFO ] Computed 20 place invariants in 14 ms
[2023-03-21 21:51:12] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
[2023-03-21 21:51:12] [INFO ] Invariant cache hit.
[2023-03-21 21:51:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-21 21:51:12] [INFO ] Invariant cache hit.
[2023-03-21 21:51:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-21 21:51:12] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-21 21:51:12] [INFO ] Invariant cache hit.
[2023-03-21 21:51:12] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 100/100 places, 161/161 transitions.
Support contains 37 out of 100 places after structural reductions.
[2023-03-21 21:51:12] [INFO ] Flatten gal took : 32 ms
[2023-03-21 21:51:12] [INFO ] Flatten gal took : 12 ms
[2023-03-21 21:51:12] [INFO ] Input system was already deterministic with 161 transitions.
Support contains 30 out of 100 places (down from 37) after GAL structural reductions.
Finished random walk after 1791 steps, including 0 resets, run visited all 25 properties in 76 ms. (steps per millisecond=23 )
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' '!(((G(p0) U p1)&&X(p2)))'
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2023-03-21 21:51:13] [INFO ] Invariant cache hit.
[2023-03-21 21:51:13] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
[2023-03-21 21:51:13] [INFO ] Invariant cache hit.
[2023-03-21 21:51:13] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-21 21:51:13] [INFO ] Invariant cache hit.
[2023-03-21 21:51:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-21 21:51:13] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-21 21:51:13] [INFO ] Invariant cache hit.
[2023-03-21 21:51:13] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 434 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}]], initial=0, aps=[p1:(OR (LEQ 2 s45) (LEQ 1 s77)), p0:(LEQ s43 s45), p2:(LEQ s96 s66)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 31 steps with 15 reset in 4 ms.
FORMULA JoinFreeModules-PT-0020-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLCardinality-02 finished in 754 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 G(p1))||F(p2))))'
Support contains 6 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 12 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2023-03-21 21:51:13] [INFO ] Invariant cache hit.
[2023-03-21 21:51:13] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
[2023-03-21 21:51:13] [INFO ] Invariant cache hit.
[2023-03-21 21:51:13] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-21 21:51:13] [INFO ] Invariant cache hit.
[2023-03-21 21:51:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-21 21:51:13] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-21 21:51:13] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 21:51:13] [INFO ] Invariant cache hit.
[2023-03-21 21:51:13] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 ms. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 s82), p0:(LEQ 3 s85), p2:(AND (GT s28 s49) (GT s29 s63))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 531 reset in 677 ms.
Stack based approach found an accepted trace after 10212 steps with 57 reset with depth 325 and stack size 324 in 75 ms.
FORMULA JoinFreeModules-PT-0020-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0020-LTLCardinality-03 finished in 1175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0||F(p1))&&(F(p1)||(p0 U p2))))))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2023-03-21 21:51:14] [INFO ] Invariant cache hit.
[2023-03-21 21:51:14] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
[2023-03-21 21:51:14] [INFO ] Invariant cache hit.
[2023-03-21 21:51:15] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-21 21:51:15] [INFO ] Invariant cache hit.
[2023-03-21 21:51:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-21 21:51:15] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-21 21:51:15] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 21:51:15] [INFO ] Invariant cache hit.
[2023-03-21 21:51:15] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 260 ms. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s4), p1:(LEQ s38 s24), p2:(LEQ 3 s43)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 580 reset in 508 ms.
Stack based approach found an accepted trace after 357 steps with 3 reset with depth 76 and stack size 76 in 2 ms.
FORMULA JoinFreeModules-PT-0020-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0020-LTLCardinality-04 finished in 888 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' '!((p0 U X(X(X((p1&&F((p2&&G(p1)))))))))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2023-03-21 21:51:15] [INFO ] Invariant cache hit.
[2023-03-21 21:51:15] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
[2023-03-21 21:51:15] [INFO ] Invariant cache hit.
[2023-03-21 21:51:15] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-21 21:51:15] [INFO ] Invariant cache hit.
[2023-03-21 21:51:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-21 21:51:15] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-21 21:51:15] [INFO ] Invariant cache hit.
[2023-03-21 21:51:16] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 619 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 8}, { cond=p0, acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p1 p2), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 p2), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=true, acceptance={} source=8 dest: 10}], [{ cond=(NOT p0), acceptance={} source=9 dest: 11}, { cond=p0, acceptance={} source=9 dest: 12}], [{ cond=(NOT p1), acceptance={} source=10 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 6}, { cond=(AND p1 p2), acceptance={} source=10 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=11 dest: 6}, { cond=(AND p1 p2), acceptance={} source=11 dest: 7}, { cond=(NOT p1), acceptance={} source=11 dest: 10}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={0} source=12 dest: 12}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=12 dest: 13}, { cond=(AND p0 p1 p2), acceptance={} source=12 dest: 14}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=13 dest: 7}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=13 dest: 13}, { cond=(AND p0 p1 p2), acceptance={} source=13 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=14 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=14 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=14 dest: 13}, { cond=(AND p0 p1), acceptance={} source=14 dest: 14}]], initial=0, aps=[p0:(LEQ s72 s31), p1:(GT 3 s56), p2:(GT 3 s48)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 569 ms.
Stack based approach found an accepted trace after 1316 steps with 0 reset with depth 1317 and stack size 868 in 17 ms.
FORMULA JoinFreeModules-PT-0020-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0020-LTLCardinality-06 finished in 1482 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))||G(p1))))'
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2023-03-21 21:51:17] [INFO ] Invariant cache hit.
[2023-03-21 21:51:17] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
[2023-03-21 21:51:17] [INFO ] Invariant cache hit.
[2023-03-21 21:51:17] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-21 21:51:17] [INFO ] Invariant cache hit.
[2023-03-21 21:51:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-21 21:51:17] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-21 21:51:17] [INFO ] Invariant cache hit.
[2023-03-21 21:51:17] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLCardinality-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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(LEQ 2 s60), p1:(LEQ s45 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 549 steps with 0 reset in 3 ms.
FORMULA JoinFreeModules-PT-0020-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLCardinality-07 finished in 450 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||(p1&&X(G(!p1))))))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2023-03-21 21:51:17] [INFO ] Invariant cache hit.
[2023-03-21 21:51:17] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
[2023-03-21 21:51:17] [INFO ] Invariant cache hit.
[2023-03-21 21:51:17] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-21 21:51:17] [INFO ] Invariant cache hit.
[2023-03-21 21:51:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-21 21:51:17] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-21 21:51:17] [INFO ] Invariant cache hit.
[2023-03-21 21:51:17] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (OR (NOT p0) p1)]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 3 s63), p1:(LEQ 3 s24)], 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 144 steps with 0 reset in 3 ms.
FORMULA JoinFreeModules-PT-0020-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLCardinality-08 finished in 331 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(p0)&&F(p1)) U p2)))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2023-03-21 21:51:18] [INFO ] Invariant cache hit.
[2023-03-21 21:51:18] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
[2023-03-21 21:51:18] [INFO ] Invariant cache hit.
[2023-03-21 21:51:18] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-21 21:51:18] [INFO ] Invariant cache hit.
[2023-03-21 21:51:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-21 21:51:18] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-21 21:51:18] [INFO ] Invariant cache hit.
[2023-03-21 21:51:18] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p1), true]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s6 s7), p1:(LEQ 2 s69), p0:(AND (LEQ 2 s14) (LEQ 2 s69))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Product exploration explored 100000 steps with 50000 reset in 293 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 (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 6 factoid took 147 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0020-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0020-LTLCardinality-10 finished in 1110 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 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 15 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2023-03-21 21:51:19] [INFO ] Invariant cache hit.
[2023-03-21 21:51:19] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
[2023-03-21 21:51:19] [INFO ] Invariant cache hit.
[2023-03-21 21:51:19] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-21 21:51:19] [INFO ] Invariant cache hit.
[2023-03-21 21:51:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-21 21:51:19] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-21 21:51:19] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-21 21:51:19] [INFO ] Invariant cache hit.
[2023-03-21 21:51:19] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 288 ms. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s58)], 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 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0020-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLCardinality-11 finished in 325 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 U p1))))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2023-03-21 21:51:19] [INFO ] Invariant cache hit.
[2023-03-21 21:51:19] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
[2023-03-21 21:51:19] [INFO ] Invariant cache hit.
[2023-03-21 21:51:19] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-21 21:51:19] [INFO ] Invariant cache hit.
[2023-03-21 21:51:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-21 21:51:19] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-21 21:51:19] [INFO ] Invariant cache hit.
[2023-03-21 21:51:19] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s43 s28), p0:(LEQ s47 s35)], 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]]
Entered a terminal (fully accepting) state of product in 114 steps with 0 reset in 2 ms.
FORMULA JoinFreeModules-PT-0020-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLCardinality-12 finished in 370 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))&&(X(p1) U ((!p2&&X(p1))||X(G(p1))))))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2023-03-21 21:51:19] [INFO ] Invariant cache hit.
[2023-03-21 21:51:19] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
[2023-03-21 21:51:19] [INFO ] Invariant cache hit.
[2023-03-21 21:51:19] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-21 21:51:19] [INFO ] Invariant cache hit.
[2023-03-21 21:51:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-21 21:51:20] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-21 21:51:20] [INFO ] Invariant cache hit.
[2023-03-21 21:51:20] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0 p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(OR (LEQ 2 s95) (LEQ 3 s58)), p0:(LEQ s57 s25), p1:(GT 3 s58)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0020-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLCardinality-13 finished in 413 ms.
All properties solved by simple procedures.
Total runtime 8777 ms.
ITS solved all properties within timeout

BK_STOP 1679435481170

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="JoinFreeModules-PT-0020"
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 JoinFreeModules-PT-0020, 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 r231-tall-167856415700171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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