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

About the Execution of LTSMin+red for JoinFreeModules-PT-0050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
466.688 22556.00 33804.00 327.90 TTFTFTFFFTFFFFTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856418500180.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is JoinFreeModules-PT-0050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418500180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.4K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 13K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K 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.8K 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 152K 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-0050-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679458523912

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 04:15:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 04:15:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:15:25] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-22 04:15:25] [INFO ] Transformed 251 places.
[2023-03-22 04:15:25] [INFO ] Transformed 401 transitions.
[2023-03-22 04:15:25] [INFO ] Parsed PT model containing 251 places and 401 transitions and 1152 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0050-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 25 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2023-03-22 04:15:25] [INFO ] Computed 50 place invariants in 19 ms
[2023-03-22 04:15:26] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
[2023-03-22 04:15:26] [INFO ] Invariant cache hit.
[2023-03-22 04:15:26] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-22 04:15:26] [INFO ] Invariant cache hit.
[2023-03-22 04:15:26] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:26] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-22 04:15:26] [INFO ] Invariant cache hit.
[2023-03-22 04:15:26] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1000 ms. Remains : 250/250 places, 401/401 transitions.
Support contains 25 out of 250 places after structural reductions.
[2023-03-22 04:15:26] [INFO ] Flatten gal took : 51 ms
[2023-03-22 04:15:26] [INFO ] Flatten gal took : 21 ms
[2023-03-22 04:15:26] [INFO ] Input system was already deterministic with 401 transitions.
Incomplete random walk after 10023 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=72 ) properties (out of 27) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:15:27] [INFO ] Invariant cache hit.
[2023-03-22 04:15:27] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-22 04:15:27] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:15:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 15 ms returned sat
[2023-03-22 04:15:27] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:15:27] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:27] [INFO ] After 38ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 04:15:27] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-22 04:15:27] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 265 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=44 )
Parikh walk visited 1 properties in 10 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA JoinFreeModules-PT-0050-LTLFireability-10 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' '!(G(F(p0)))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 32 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:28] [INFO ] Invariant cache hit.
[2023-03-22 04:15:28] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
[2023-03-22 04:15:28] [INFO ] Invariant cache hit.
[2023-03-22 04:15:28] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-22 04:15:28] [INFO ] Invariant cache hit.
[2023-03-22 04:15:28] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:28] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-22 04:15:28] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-22 04:15:28] [INFO ] Invariant cache hit.
[2023-03-22 04:15:28] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 572 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-02 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:(GEQ s175 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-02 finished in 779 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)&&X(G(p1))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:28] [INFO ] Invariant cache hit.
[2023-03-22 04:15:28] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
[2023-03-22 04:15:28] [INFO ] Invariant cache hit.
[2023-03-22 04:15:28] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-22 04:15:28] [INFO ] Invariant cache hit.
[2023-03-22 04:15:29] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:29] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-22 04:15:29] [INFO ] Invariant cache hit.
[2023-03-22 04:15:29] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 495 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (GEQ s222 1) (GEQ s236 2)), p0:(LT s222 1)], 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-04 finished in 619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:29] [INFO ] Invariant cache hit.
[2023-03-22 04:15:29] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
[2023-03-22 04:15:29] [INFO ] Invariant cache hit.
[2023-03-22 04:15:29] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-22 04:15:29] [INFO ] Invariant cache hit.
[2023-03-22 04:15:29] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:29] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-22 04:15:29] [INFO ] Invariant cache hit.
[2023-03-22 04:15:29] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 485 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s195 5)], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 788 ms.
Product exploration explored 100000 steps with 50000 reset in 707 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0050-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0050-LTLFireability-05 finished in 2174 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) U p1)&&(p2 U p0))))'
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 16 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:31] [INFO ] Invariant cache hit.
[2023-03-22 04:15:31] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
[2023-03-22 04:15:31] [INFO ] Invariant cache hit.
[2023-03-22 04:15:31] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-22 04:15:31] [INFO ] Invariant cache hit.
[2023-03-22 04:15:31] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:31] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-22 04:15:31] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-22 04:15:31] [INFO ] Invariant cache hit.
[2023-03-22 04:15:32] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 567 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p1) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s123 3), p2:(OR (GEQ s120 5) (GEQ s123 3)), p1:(GEQ s49 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-06 finished in 673 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&&X(p0))) U X((!p0&&X(p1)&&G(p2)))))'
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:32] [INFO ] Invariant cache hit.
[2023-03-22 04:15:32] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
[2023-03-22 04:15:32] [INFO ] Invariant cache hit.
[2023-03-22 04:15:32] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-22 04:15:32] [INFO ] Invariant cache hit.
[2023-03-22 04:15:32] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:32] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-22 04:15:32] [INFO ] Invariant cache hit.
[2023-03-22 04:15:32] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 492 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 534 ms :[(OR (NOT p2) (NOT p1) p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1) p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 8}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=8 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(NOT p2), acceptance={0} source=9 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 6}, { cond=p2, acceptance={} source=9 dest: 9}, { cond=(AND p0 p2), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 4}]], initial=0, aps=[p0:(GEQ s52 1), p2:(LT s236 2), p1:(LT s140 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-07 finished in 1051 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||X(p1))))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:33] [INFO ] Invariant cache hit.
[2023-03-22 04:15:33] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
[2023-03-22 04:15:33] [INFO ] Invariant cache hit.
[2023-03-22 04:15:33] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-22 04:15:33] [INFO ] Invariant cache hit.
[2023-03-22 04:15:33] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:33] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-22 04:15:33] [INFO ] Invariant cache hit.
[2023-03-22 04:15:33] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 541 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(GEQ s72 1), p1:(GEQ s82 2)], 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 33333 reset in 679 ms.
Product exploration explored 100000 steps with 33333 reset in 705 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 p0 p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 48 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0050-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0050-LTLFireability-09 finished in 2157 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(p1)&&p0)))'
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 17 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:35] [INFO ] Invariant cache hit.
[2023-03-22 04:15:35] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
[2023-03-22 04:15:35] [INFO ] Invariant cache hit.
[2023-03-22 04:15:35] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-22 04:15:35] [INFO ] Invariant cache hit.
[2023-03-22 04:15:35] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:35] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-22 04:15:35] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 04:15:35] [INFO ] Invariant cache hit.
[2023-03-22 04:15:35] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 497 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s129 5) (LT s2 1)), p1:(AND (LT s2 1) (LT s48 4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-11 finished in 580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:36] [INFO ] Invariant cache hit.
[2023-03-22 04:15:36] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
[2023-03-22 04:15:36] [INFO ] Invariant cache hit.
[2023-03-22 04:15:36] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-22 04:15:36] [INFO ] Invariant cache hit.
[2023-03-22 04:15:36] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:36] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-22 04:15:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 04:15:36] [INFO ] Invariant cache hit.
[2023-03-22 04:15:36] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 477 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s2 1), p1:(LT s52 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-12 finished in 599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(p0)||(p1&&X(G(p2))))))))'
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:36] [INFO ] Invariant cache hit.
[2023-03-22 04:15:36] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
[2023-03-22 04:15:36] [INFO ] Invariant cache hit.
[2023-03-22 04:15:36] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-22 04:15:36] [INFO ] Invariant cache hit.
[2023-03-22 04:15:36] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:36] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-22 04:15:36] [INFO ] Invariant cache hit.
[2023-03-22 04:15:37] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 456 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s162 2), p1:(GEQ s234 5), p2:(GEQ s243 3)], 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]]
Product exploration explored 100000 steps with 10 reset in 1890 ms.
Stack based approach found an accepted trace after 80233 steps with 6 reset with depth 18687 and stack size 4005 in 1688 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-13 finished in 4252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((p1&&X((X(F(p0))||G(p1)))))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:40] [INFO ] Invariant cache hit.
[2023-03-22 04:15:41] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
[2023-03-22 04:15:41] [INFO ] Invariant cache hit.
[2023-03-22 04:15:41] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-22 04:15:41] [INFO ] Invariant cache hit.
[2023-03-22 04:15:41] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:41] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-22 04:15:41] [INFO ] Invariant cache hit.
[2023-03-22 04:15:41] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LT s150 5), p0:(LT s143 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 611 ms.
Product exploration explored 100000 steps with 50000 reset in 672 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 6 factoid took 233 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0050-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0050-LTLFireability-14 finished in 2242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G(F(p2)))))'
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 18 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:43] [INFO ] Invariant cache hit.
[2023-03-22 04:15:43] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
[2023-03-22 04:15:43] [INFO ] Invariant cache hit.
[2023-03-22 04:15:43] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-22 04:15:43] [INFO ] Invariant cache hit.
[2023-03-22 04:15:43] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:43] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-22 04:15:43] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 04:15:43] [INFO ] Invariant cache hit.
[2023-03-22 04:15:43] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 489 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(LT s170 3), p2:(LT s126 2), p1:(LT s247 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 1741 ms.
Stack based approach found an accepted trace after 239 steps with 0 reset with depth 240 and stack size 240 in 3 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-15 finished in 2323 ms.
All properties solved by simple procedures.
Total runtime 20112 ms.
ITS solved all properties within timeout

BK_STOP 1679458546468

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-0050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is JoinFreeModules-PT-0050, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856418500180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0050.tgz
mv JoinFreeModules-PT-0050 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;