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.r073-smll-167814399200204.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 ClientsAndServers-PT-N0001P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399200204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.5K Feb 26 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 26 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 26 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K 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 ClientsAndServers-PT-N0001P0-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678312232778

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=ClientsAndServers-PT-N0001P0
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 21:50:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 21:50:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 21:50:35] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-08 21:50:35] [INFO ] Transformed 25 places.
[2023-03-08 21:50:35] [INFO ] Transformed 18 transitions.
[2023-03-08 21:50:35] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ClientsAndServers-PT-N0001P0-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0001P0-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0001P0-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0001P0-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 16 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 21:50:35] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-08 21:50:35] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-08 21:50:35] [INFO ] Invariant cache hit.
[2023-03-08 21:50:35] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-08 21:50:35] [INFO ] Invariant cache hit.
[2023-03-08 21:50:35] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 23/25 places, 18/18 transitions.
Support contains 19 out of 23 places after structural reductions.
[2023-03-08 21:50:36] [INFO ] Flatten gal took : 22 ms
[2023-03-08 21:50:36] [INFO ] Flatten gal took : 8 ms
[2023-03-08 21:50:36] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 3372 steps, including 15 resets, run visited all 21 properties in 131 ms. (steps per millisecond=25 )
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&&(p0 U p1))||((p0 U p1)&&F(G(p2)))))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 19 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 18 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 17 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 16 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 15 transition count 11
Applied a total of 15 rules in 17 ms. Remains 15 /23 variables (removed 8) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-08 21:50:37] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 21:50:37] [INFO ] Implicit Places using invariants in 46 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/23 places, 11/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 12 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 11 transition count 8
Applied a total of 6 rules in 2 ms. Remains 11 /14 variables (removed 3) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 21:50:37] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 21:50:37] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 21:50:37] [INFO ] Invariant cache hit.
[2023-03-08 21:50:37] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/23 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 142 ms. Remains : 11/23 places, 8/18 transitions.
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0001P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s10 1), p1:(GEQ s8 1), p2:(OR (LT s4 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 475 steps with 25 reset in 10 ms.
FORMULA ClientsAndServers-PT-N0001P0-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0001P0-LTLFireability-01 finished in 638 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) U (X(p2)&&p1)))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 21:50:37] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 21:50:37] [INFO ] Implicit Places using invariants in 43 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0001P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s17 1) (LT s16 1)), p0:(LT s10 1), p2:(LT s16 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 277 steps with 5 reset in 3 ms.
FORMULA ClientsAndServers-PT-N0001P0-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0001P0-LTLFireability-02 finished in 250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((G(!p0)||G(p1)))))||G(p2)))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 21:50:37] [INFO ] Invariant cache hit.
[2023-03-08 21:50:37] [INFO ] Implicit Places using invariants in 43 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 22/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 507 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0001P0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p2 p0 p1), acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p2 p0), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p2 p1), acceptance={} source=7 dest: 7}], [{ cond=true, acceptance={} source=8 dest: 2}], [{ cond=(NOT p2), acceptance={} source=9 dest: 2}, { cond=p2, acceptance={} source=9 dest: 4}], [{ cond=(NOT p2), acceptance={} source=10 dest: 11}, { cond=p2, acceptance={} source=10 dest: 12}], [{ cond=true, acceptance={} source=11 dest: 8}], [{ cond=(NOT p2), acceptance={} source=12 dest: 8}, { cond=p2, acceptance={} source=12 dest: 9}]], initial=10, aps=[p1:(OR (LT s2 1) (LT s14 1)), p0:(LT s10 1), p2:(AND (GEQ s4 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 40 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0001P0-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0001P0-LTLFireability-03 finished in 575 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 U (G(!p0)||(!p0&&(!p1||F(!p2)))))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 21:50:38] [INFO ] Invariant cache hit.
[2023-03-08 21:50:38] [INFO ] Implicit Places using invariants in 54 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, p2, p0, p0, (AND p0 p2)]
Running random walk in product with property : ClientsAndServers-PT-N0001P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(GEQ s17 1), p0:(LT s16 1), p1:(AND (GEQ s8 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0001P0-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0001P0-LTLFireability-04 finished in 268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0&&X(G(p1))) U (X(G(p3))&&p2))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 21:50:38] [INFO ] Invariant cache hit.
[2023-03-08 21:50:38] [INFO ] Implicit Places using invariants in 55 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 57 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3), (OR (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : ClientsAndServers-PT-N0001P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 4}, { cond=(AND p2 p0), acceptance={} source=0 dest: 5}, { cond=(AND p2 p0), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p0), acceptance={} source=4 dest: 5}, { cond=(AND p2 p0), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={} source=5 dest: 3}, { cond=(AND p1 p3), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=6 dest: 4}, { cond=(OR (AND p2 p0) (AND p0 p3)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p3), acceptance={} source=6 dest: 6}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s5 1) (GEQ s14 1)), p0:(GEQ s19 1), p1:(AND (GEQ s5 1) (GEQ s14 1) (GEQ s12 1)), p3:(LT s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0001P0-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0001P0-LTLFireability-05 finished in 395 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||X(X(F(p1)))) U p2)))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 21:50:39] [INFO ] Invariant cache hit.
[2023-03-08 21:50:39] [INFO ] Implicit Places using invariants in 39 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0001P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s4 1) (GEQ s18 1)), p0:(GEQ s20 1), p1:(OR (AND (GEQ s4 1) (GEQ s18 1)) (GEQ s15 1))], nbAcceptance=0, 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]]
Stuttering criterion allowed to conclude after 90540 steps with 13102 reset in 353 ms.
FORMULA ClientsAndServers-PT-N0001P0-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0001P0-LTLFireability-06 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U (!p1||G(p2)))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 21:50:39] [INFO ] Invariant cache hit.
[2023-03-08 21:50:39] [INFO ] Implicit Places using invariants in 42 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0001P0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s17 1), p2:(LT s10 1), p0:(AND (GEQ s4 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Product exploration explored 100000 steps with 50000 reset in 229 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 (NOT p1) p2 (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p2 (NOT p0))
Knowledge based reduction with 7 factoid took 234 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0001P0-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0001P0-LTLFireability-09 finished in 858 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)||(p1 U (G(!p2)||F(p3)))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 23 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 20 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 18 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 16 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 15 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 17 place count 14 transition count 10
Applied a total of 17 rules in 8 ms. Remains 14 /23 variables (removed 9) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-08 21:50:40] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 21:50:40] [INFO ] Implicit Places using invariants in 36 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/23 places, 10/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 9
Applied a total of 2 rules in 7 ms. Remains 12 /13 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-08 21:50:40] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 21:50:40] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 21:50:40] [INFO ] Invariant cache hit.
[2023-03-08 21:50:40] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/23 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 116 ms. Remains : 12/23 places, 9/18 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND p0 p2 (NOT p3)), (AND p0 (NOT p3) p2), (AND p0 (NOT p3))]
Running random walk in product with property : ClientsAndServers-PT-N0001P0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) (NOT p3) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p2 (NOT p3) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s10 1)), p2:(LT s9 1), p3:(OR (AND (GEQ s0 1) (GEQ s7 1)) (AND (GEQ s3 1) (GEQ s10 1))), p1:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 15815 reset in 122 ms.
Product exploration explored 100000 steps with 15770 reset in 198 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 p2 (NOT p3) (NOT p1)), (X (AND p0 p2 (NOT p3) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p3) p1))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (AND p0 (NOT p3))), (X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND p0 p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 700 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3))]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 p2 (NOT p3) (NOT p1)), (X (AND p0 p2 (NOT p3) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p3) p1))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (AND p0 (NOT p3))), (X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND p0 p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3))))]
Knowledge based reduction with 15 factoid took 569 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND p0 (NOT p3))]
Stuttering acceptance computed with spot in 36 ms :[(AND p0 (NOT p3))]
[2023-03-08 21:50:42] [INFO ] Invariant cache hit.
[2023-03-08 21:50:42] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 21:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:42] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-08 21:50:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:50:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 21:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:42] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-08 21:50:42] [INFO ] Computed and/alt/rep : 8/9/8 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 21:50:42] [INFO ] Added : 6 causal constraints over 2 iterations in 22 ms. Result :sat
Could not prove EG (AND p0 (NOT p3))
Support contains 4 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-08 21:50:42] [INFO ] Invariant cache hit.
[2023-03-08 21:50:42] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 21:50:42] [INFO ] Invariant cache hit.
[2023-03-08 21:50:42] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-08 21:50:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:50:42] [INFO ] Invariant cache hit.
[2023-03-08 21:50:42] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 12/12 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3)), (X (AND p0 (NOT p3))), (X (X (AND p0 (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND p0 (NOT p3))]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 (NOT p3)), (X (AND p0 (NOT p3))), (X (X (AND p0 (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3))))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND p0 (NOT p3))]
Stuttering acceptance computed with spot in 34 ms :[(AND p0 (NOT p3))]
[2023-03-08 21:50:43] [INFO ] Invariant cache hit.
[2023-03-08 21:50:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 21:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:43] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-08 21:50:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:50:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 21:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:43] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-08 21:50:43] [INFO ] Computed and/alt/rep : 8/9/8 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 21:50:43] [INFO ] Added : 6 causal constraints over 2 iterations in 28 ms. Result :sat
Could not prove EG (AND p0 (NOT p3))
Stuttering acceptance computed with spot in 38 ms :[(AND p0 (NOT p3))]
Product exploration explored 100000 steps with 15782 reset in 103 ms.
Product exploration explored 100000 steps with 15791 reset in 252 ms.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 11 transition count 8
Applied a total of 2 rules in 7 ms. Remains 11 /12 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 21:50:43] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 21:50:43] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 21:50:43] [INFO ] Invariant cache hit.
[2023-03-08 21:50:43] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-08 21:50:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:50:43] [INFO ] Invariant cache hit.
[2023-03-08 21:50:43] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/12 places, 8/9 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 ms. Remains : 11/12 places, 8/9 transitions.
Treatment of property ClientsAndServers-PT-N0001P0-LTLFireability-11 finished in 3316 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||X(!p1)||((!p1 U G(p2)) U X(p3)))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 21:50:43] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 21:50:43] [INFO ] Implicit Places using invariants in 50 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) p1 (NOT p3)), true, (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0001P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p3), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 1}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=2, aps=[p0:(GEQ s19 1), p2:(AND (GEQ s0 1) (GEQ s13 1)), p1:(LT s16 1), p3:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 75 ms.
Product exploration explored 100000 steps with 50000 reset in 80 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 (NOT p2) p1 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3)))))]
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0001P0-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0001P0-LTLFireability-12 finished in 660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 21:50:44] [INFO ] Invariant cache hit.
[2023-03-08 21:50:44] [INFO ] Implicit Places using invariants in 47 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0001P0-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0001P0-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0001P0-LTLFireability-13 finished in 194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1)) U !(!p0 U (G(p3)||p2))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 22 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 21 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4 place count 21 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 10 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 17 transition count 12
Applied a total of 12 rules in 8 ms. Remains 17 /23 variables (removed 6) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 17 cols
[2023-03-08 21:50:44] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-08 21:50:44] [INFO ] Implicit Places using invariants in 34 ms returned [12, 15, 16]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 50 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/23 places, 12/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
Applied a total of 8 rules in 5 ms. Remains 10 /14 variables (removed 4) and now considering 8/12 (removed 4) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-08 21:50:44] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 21:50:44] [INFO ] Implicit Places using invariants in 26 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/23 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 96 ms. Remains : 9/23 places, 8/18 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR p3 p2), true, p3, (OR p3 p2), (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0001P0-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(OR p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s8 1), p2:(OR (AND (GEQ s2 1) (GEQ s7 1)) (GEQ s8 1)), p1:(AND (GEQ s2 1) (GEQ s7 1)), p3:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0001P0-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0001P0-LTLFireability-14 finished in 347 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||G(p1))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 23 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 20 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 18 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 18 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 17 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 16 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 15 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 17 place count 14 transition count 10
Applied a total of 17 rules in 5 ms. Remains 14 /23 variables (removed 9) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-08 21:50:45] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 21:50:45] [INFO ] Implicit Places using invariants in 39 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/23 places, 10/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 9
Applied a total of 2 rules in 4 ms. Remains 12 /13 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-08 21:50:45] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 21:50:45] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-08 21:50:45] [INFO ] Invariant cache hit.
[2023-03-08 21:50:45] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/23 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 12/23 places, 9/18 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0001P0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s8 1) (GEQ s3 1) (GEQ s10 1)), p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0001P0-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0001P0-LTLFireability-15 finished in 158 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)||(p1 U (G(!p2)||F(p3)))))'
[2023-03-08 21:50:45] [INFO ] Flatten gal took : 4 ms
[2023-03-08 21:50:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 21:50:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 23 places, 18 transitions and 50 arcs took 1 ms.
Total runtime 10171 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1041/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ClientsAndServers-PT-N0001P0-LTLFireability-11

BK_STOP 1678312246682

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ClientsAndServers-PT-N0001P0-LTLFireability-11
ltl formula formula --ltl=/tmp/1041/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 23 places, 18 transitions and 50 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1041/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1041/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1041/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1041/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N0001P0"
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 ClientsAndServers-PT-N0001P0, 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 r073-smll-167814399200204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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