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-167856418500179.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418500179
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0050-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0050-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0050-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0050-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0050-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0050-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0050-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0050-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0050-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0050-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0050-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0050-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0050-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0050-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679458490005

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=LTLCardinality
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:14:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 04:14:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:14:51] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-22 04:14:51] [INFO ] Transformed 251 places.
[2023-03-22 04:14:51] [INFO ] Transformed 401 transitions.
[2023-03-22 04:14:51] [INFO ] Parsed PT model containing 251 places and 401 transitions and 1152 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0050-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 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 20 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:14:52] [INFO ] Computed 50 place invariants in 14 ms
[2023-03-22 04:14:52] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
[2023-03-22 04:14:52] [INFO ] Invariant cache hit.
[2023-03-22 04:14:52] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-22 04:14:52] [INFO ] Invariant cache hit.
[2023-03-22 04:14:52] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:14:52] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-22 04:14:52] [INFO ] Invariant cache hit.
[2023-03-22 04:14:52] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 974 ms. Remains : 250/250 places, 401/401 transitions.
Support contains 37 out of 250 places after structural reductions.
[2023-03-22 04:14:52] [INFO ] Flatten gal took : 49 ms
[2023-03-22 04:14:52] [INFO ] Flatten gal took : 20 ms
[2023-03-22 04:14:52] [INFO ] Input system was already deterministic with 401 transitions.
Incomplete random walk after 10035 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 23) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-22 04:14:53] [INFO ] Invariant cache hit.
[2023-03-22 04:14:53] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 04:14:53] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2023-03-22 04:14:53] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 04:14:53] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:14:53] [INFO ] After 50ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 04:14:53] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-22 04:14:54] [INFO ] After 653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1201 steps, including 0 resets, run visited all 2 properties in 19 ms. (steps per millisecond=63 )
Parikh walk visited 2 properties in 20 ms.
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' '!(X(X(F(p0))))'
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 13 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:14:54] [INFO ] Invariant cache hit.
[2023-03-22 04:14:54] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
[2023-03-22 04:14:54] [INFO ] Invariant cache hit.
[2023-03-22 04:14:54] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-22 04:14:54] [INFO ] Invariant cache hit.
[2023-03-22 04:14:54] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:14:54] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-22 04:14:54] [INFO ] Invariant cache hit.
[2023-03-22 04:14:55] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 634 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s211 s151)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 65761 steps with 11425 reset in 834 ms.
FORMULA JoinFreeModules-PT-0050-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLCardinality-00 finished in 1723 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((X((G(p0)&&F(p0)))||p0)) U X((X(p1) U p2))))'
Support contains 4 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 7 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:14:56] [INFO ] Invariant cache hit.
[2023-03-22 04:14:56] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
[2023-03-22 04:14:56] [INFO ] Invariant cache hit.
[2023-03-22 04:14:56] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-22 04:14:56] [INFO ] Invariant cache hit.
[2023-03-22 04:14:56] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:14:56] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-22 04:14:56] [INFO ] Invariant cache hit.
[2023-03-22 04:14:56] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 531 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 419 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 9}], [{ cond=(NOT p0), acceptance={} source=8 dest: 6}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(LEQ s93 s42), p2:(LEQ 3 s102), p1:(LEQ 3 s48)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 692 ms.
Product exploration explored 100000 steps with 50000 reset in 758 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 p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p2))))
Knowledge based reduction with 13 factoid took 302 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0050-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0050-LTLCardinality-02 finished in 2796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 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 6 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:14:58] [INFO ] Invariant cache hit.
[2023-03-22 04:14:59] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
[2023-03-22 04:14:59] [INFO ] Invariant cache hit.
[2023-03-22 04:14:59] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-22 04:14:59] [INFO ] Invariant cache hit.
[2023-03-22 04:14:59] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:14:59] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-22 04:14:59] [INFO ] Invariant cache hit.
[2023-03-22 04:14:59] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s23)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLCardinality-03 finished in 690 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((!p1&&F(p2))))))'
Support contains 5 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 7 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:14:59] [INFO ] Invariant cache hit.
[2023-03-22 04:14:59] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
[2023-03-22 04:14:59] [INFO ] Invariant cache hit.
[2023-03-22 04:14:59] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-22 04:14:59] [INFO ] Invariant cache hit.
[2023-03-22 04:14:59] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:14:59] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-22 04:14:59] [INFO ] Invariant cache hit.
[2023-03-22 04:15:00] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, (NOT p2), (OR (NOT p2) p1)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LEQ s66 s152) (LEQ 1 s155)), p0:(LEQ 1 s22), p2:(LEQ 3 s233)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLCardinality-04 finished in 721 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))&&((X(p2)&&F(p0))||X(G(p2))))))'
Support contains 7 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 8 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:00] [INFO ] Invariant cache hit.
[2023-03-22 04:15:00] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
[2023-03-22 04:15:00] [INFO ] Invariant cache hit.
[2023-03-22 04:15:00] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-22 04:15:00] [INFO ] Invariant cache hit.
[2023-03-22 04:15:00] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:00] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-22 04:15:00] [INFO ] Invariant cache hit.
[2023-03-22 04:15:00] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 512 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 352 ms :[true, (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 7}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=4 dest: 8}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=2, aps=[p1:(AND (GT s29 s62) (GT s246 s225)), p0:(GT s174 s172), p2:(GT 1 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][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-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLCardinality-05 finished in 892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 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 26 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:01] [INFO ] Invariant cache hit.
[2023-03-22 04:15:01] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
[2023-03-22 04:15:01] [INFO ] Invariant cache hit.
[2023-03-22 04:15:01] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-22 04:15:01] [INFO ] Invariant cache hit.
[2023-03-22 04:15:01] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:01] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-22 04:15:01] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-22 04:15:01] [INFO ] Invariant cache hit.
[2023-03-22 04:15:01] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 522 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLCardinality-08 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:(GT 3 s50)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 216 reset in 1326 ms.
Stack based approach found an accepted trace after 2846 steps with 9 reset with depth 524 and stack size 522 in 40 ms.
FORMULA JoinFreeModules-PT-0050-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0050-LTLCardinality-08 finished in 1993 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)))'
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 16 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:03] [INFO ] Invariant cache hit.
[2023-03-22 04:15:03] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
[2023-03-22 04:15:03] [INFO ] Invariant cache hit.
[2023-03-22 04:15:03] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-22 04:15:03] [INFO ] Invariant cache hit.
[2023-03-22 04:15:03] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:03] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-22 04:15:03] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-22 04:15:03] [INFO ] Invariant cache hit.
[2023-03-22 04:15:03] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 514 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1693 ms.
Stack based approach found an accepted trace after 565 steps with 0 reset with depth 566 and stack size 565 in 9 ms.
FORMULA JoinFreeModules-PT-0050-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0050-LTLCardinality-09 finished in 2352 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 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 6 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:05] [INFO ] Invariant cache hit.
[2023-03-22 04:15:05] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
[2023-03-22 04:15:05] [INFO ] Invariant cache hit.
[2023-03-22 04:15:05] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-22 04:15:05] [INFO ] Invariant cache hit.
[2023-03-22 04:15:05] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:05] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-22 04:15:05] [INFO ] Invariant cache hit.
[2023-03-22 04:15:06] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 502 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLCardinality-11 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:(LEQ 1 s207)], 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 5470 steps with 0 reset in 105 ms.
FORMULA JoinFreeModules-PT-0050-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLCardinality-11 finished in 745 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(G(p0))&&F((p1||(p2&&X(p1)))))))'
Support contains 4 out of 250 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 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 24 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:06] [INFO ] Invariant cache hit.
[2023-03-22 04:15:06] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
[2023-03-22 04:15:06] [INFO ] Invariant cache hit.
[2023-03-22 04:15:06] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-22 04:15:06] [INFO ] Invariant cache hit.
[2023-03-22 04:15:06] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:06] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-22 04:15:06] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-22 04:15:06] [INFO ] Invariant cache hit.
[2023-03-22 04:15:06] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 530 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLCardinality-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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s41 s3), p1:(GT s8 s233)], 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 0 ms.
FORMULA JoinFreeModules-PT-0050-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLCardinality-12 finished in 676 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 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 11 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:06] [INFO ] Invariant cache hit.
[2023-03-22 04:15:07] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
[2023-03-22 04:15:07] [INFO ] Invariant cache hit.
[2023-03-22 04:15:07] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-22 04:15:07] [INFO ] Invariant cache hit.
[2023-03-22 04:15:07] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:07] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-22 04:15:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 04:15:07] [INFO ] Invariant cache hit.
[2023-03-22 04:15:07] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 512 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLCardinality-13 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:(LEQ s147 s146)], 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 0 ms.
FORMULA JoinFreeModules-PT-0050-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLCardinality-13 finished in 595 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)))'
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 16 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:15:07] [INFO ] Invariant cache hit.
[2023-03-22 04:15:07] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
[2023-03-22 04:15:07] [INFO ] Invariant cache hit.
[2023-03-22 04:15:07] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-22 04:15:07] [INFO ] Invariant cache hit.
[2023-03-22 04:15:07] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:07] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-22 04:15:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 04:15:07] [INFO ] Invariant cache hit.
[2023-03-22 04:15:08] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 529 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s39 s40)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1674 ms.
Stack based approach found an accepted trace after 3378 steps with 0 reset with depth 3379 and stack size 3378 in 65 ms.
FORMULA JoinFreeModules-PT-0050-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0050-LTLCardinality-14 finished in 2314 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||X(p0)))||X((p1&&(p2 U (p3||G(p2)))))))))'
Support contains 6 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:09] [INFO ] Invariant cache hit.
[2023-03-22 04:15:10] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
[2023-03-22 04:15:10] [INFO ] Invariant cache hit.
[2023-03-22 04:15:10] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-22 04:15:10] [INFO ] Invariant cache hit.
[2023-03-22 04:15:10] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:15:10] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-22 04:15:10] [INFO ] Invariant cache hit.
[2023-03-22 04:15:10] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 471 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 395 ms :[true, (AND (NOT p0) (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=2 dest: 5}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=2 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=3 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=3 dest: 10}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=5 dest: 10}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 3}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=true, acceptance={} source=8 dest: 9}], [{ cond=true, acceptance={} source=9 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=10 dest: 10}]], initial=8, aps=[p0:(GT 2 s53), p3:(AND (GT s133 s21) (GT s15 s125)), p2:(GT s15 s125), p1:(GT 1 s159)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 160 steps with 0 reset in 4 ms.
FORMULA JoinFreeModules-PT-0050-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLCardinality-15 finished in 900 ms.
All properties solved by simple procedures.
Total runtime 19292 ms.
ITS solved all properties within timeout

BK_STOP 1679458511688

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0050"
export BK_EXAMINATION="LTLCardinality"
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 LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856418500179"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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