Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636280200238.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FMS-PT-50000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636280200238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 21:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 11 21:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 21:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 21:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16K May 18 16:42 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 FMS-PT-50000-LTLFireability-00
FORMULA_NAME FMS-PT-50000-LTLFireability-01
FORMULA_NAME FMS-PT-50000-LTLFireability-02
FORMULA_NAME FMS-PT-50000-LTLFireability-03
FORMULA_NAME FMS-PT-50000-LTLFireability-04
FORMULA_NAME FMS-PT-50000-LTLFireability-05
FORMULA_NAME FMS-PT-50000-LTLFireability-06
FORMULA_NAME FMS-PT-50000-LTLFireability-07
FORMULA_NAME FMS-PT-50000-LTLFireability-08
FORMULA_NAME FMS-PT-50000-LTLFireability-09
FORMULA_NAME FMS-PT-50000-LTLFireability-10
FORMULA_NAME FMS-PT-50000-LTLFireability-11
FORMULA_NAME FMS-PT-50000-LTLFireability-12
FORMULA_NAME FMS-PT-50000-LTLFireability-13
FORMULA_NAME FMS-PT-50000-LTLFireability-14
FORMULA_NAME FMS-PT-50000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716586542893

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FMS-PT-50000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 21:35:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 21:35:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 21:35:46] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2024-05-24 21:35:46] [INFO ] Transformed 22 places.
[2024-05-24 21:35:46] [INFO ] Transformed 20 transitions.
[2024-05-24 21:35:46] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA FMS-PT-50000-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-50000-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-50000-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-50000-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-50000-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 18 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-24 21:35:46] [INFO ] Computed 6 invariants in 6 ms
[2024-05-24 21:35:46] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-24 21:35:46] [INFO ] Invariant cache hit.
[2024-05-24 21:35:47] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-05-24 21:35:47] [INFO ] Invariant cache hit.
[2024-05-24 21:35:47] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 14 out of 22 places after structural reductions.
[2024-05-24 21:35:47] [INFO ] Flatten gal took : 31 ms
[2024-05-24 21:35:47] [INFO ] Flatten gal took : 10 ms
[2024-05-24 21:35:47] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 64 ms. (steps per millisecond=781 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 21:35:47] [INFO ] Invariant cache hit.
[2024-05-24 21:35:48] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-24 21:35:48] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 21:35:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-24 21:35:48] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 21:35:48] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-24 21:35:48] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 150000 steps, including 0 resets, run visited all 3 properties in 1658 ms. (steps per millisecond=90 )
Parikh walk visited 3 properties in 1660 ms.
FORMULA FMS-PT-50000-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F((p0||X(p0)))))))))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-24 21:35:50] [INFO ] Invariant cache hit.
[2024-05-24 21:35:50] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 21:35:50] [INFO ] Invariant cache hit.
[2024-05-24 21:35:50] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-24 21:35:50] [INFO ] Invariant cache hit.
[2024-05-24 21:35:50] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 22/22 places, 20/20 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 516 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-02 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}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(LT s19 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15891 reset in 488 ms.
Stack based approach found an accepted trace after 1675 steps with 258 reset with depth 9 and stack size 9 in 11 ms.
FORMULA FMS-PT-50000-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-50000-LTLFireability-02 finished in 1201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||(!p1 U (G(!p1)||(!p1&&G(!p0))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-24 21:35:51] [INFO ] Invariant cache hit.
[2024-05-24 21:35:51] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 21:35:51] [INFO ] Invariant cache hit.
[2024-05-24 21:35:51] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-24 21:35:51] [INFO ] Invariant cache hit.
[2024-05-24 21:35:51] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 314 ms :[false, (AND p1 (NOT p0)), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (GEQ s2 1) (GEQ s18 1)), p1:(AND (GEQ s10 1) (GEQ s17 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Product exploration explored 100000 steps with 50000 reset in 164 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 p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FMS-PT-50000-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-50000-LTLFireability-03 finished in 902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 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 22 transition count 17
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 9 edges and 18 vertex of which 6 / 18 are part of one of the 2 SCC in 3 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 13 place count 13 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 13 place count 13 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 15 place count 12 transition count 12
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 19 place count 10 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 10 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 10 transition count 8
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 22 place count 9 transition count 8
Applied a total of 22 rules in 23 ms. Remains 9 /22 variables (removed 13) and now considering 8/20 (removed 12) transitions.
// Phase 1: matrix 8 rows 9 cols
[2024-05-24 21:35:52] [INFO ] Computed 4 invariants in 0 ms
[2024-05-24 21:35:52] [INFO ] Implicit Places using invariants in 27 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 8/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54 ms. Remains : 8/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s2 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-04 finished in 104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p1&&X(G((p1||G(!p1)))))))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-24 21:35:52] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 21:35:52] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 21:35:52] [INFO ] Invariant cache hit.
[2024-05-24 21:35:52] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-24 21:35:52] [INFO ] Invariant cache hit.
[2024-05-24 21:35:52] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (AND (NOT p0) (NOT p1)), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-50000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LT s3 1), p1:(LT s20 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 123 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-05 finished in 340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F(p1))))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-24 21:35:52] [INFO ] Invariant cache hit.
[2024-05-24 21:35:52] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 21:35:52] [INFO ] Invariant cache hit.
[2024-05-24 21:35:52] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-24 21:35:52] [INFO ] Invariant cache hit.
[2024-05-24 21:35:52] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-50000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s6 1), p1:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 91 ms.
Product exploration explored 100000 steps with 33333 reset in 92 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 p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FMS-PT-50000-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-50000-LTLFireability-07 finished in 438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 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 22 transition count 17
Reduce places removed 4 places and 0 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 1 with 6 rules applied. Total rules applied 9 place count 18 transition count 15
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 16 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 15 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 13 place count 15 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 17 place count 13 transition count 12
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 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 22 place count 10 transition count 10
Applied a total of 22 rules in 6 ms. Remains 10 /22 variables (removed 12) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-24 21:35:53] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 21:35:53] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 21:35:53] [INFO ] Invariant cache hit.
[2024-05-24 21:35:53] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-24 21:35:53] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 21:35:53] [INFO ] Invariant cache hit.
[2024-05-24 21:35:53] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/22 places, 10/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 10/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s9 1), p1:(AND (GEQ s2 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FMS-PT-50000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-08 finished in 225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0) U G((F(G((p1||X(p0)))) U p2))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-24 21:35:53] [INFO ] Computed 6 invariants in 4 ms
[2024-05-24 21:35:53] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-24 21:35:53] [INFO ] Invariant cache hit.
[2024-05-24 21:35:53] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-24 21:35:53] [INFO ] Invariant cache hit.
[2024-05-24 21:35:53] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 418 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-50000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s4 1), p1:(AND (GEQ s10 1) (GEQ s17 1)), p0:(GEQ s6 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 283 ms.
Product exploration explored 100000 steps with 0 reset in 451 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 409 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=2272 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-24 21:35:55] [INFO ] Invariant cache hit.
[2024-05-24 21:35:55] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-24 21:35:55] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 21:35:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 21:35:56] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 21:35:56] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-24 21:35:56] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 50004 steps, including 0 resets, run visited all 4 properties in 933 ms. (steps per millisecond=53 )
Parikh walk visited 4 properties in 933 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 387 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 431 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 411 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-24 21:35:58] [INFO ] Invariant cache hit.
[2024-05-24 21:35:58] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-24 21:35:58] [INFO ] Invariant cache hit.
[2024-05-24 21:35:58] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-24 21:35:58] [INFO ] Invariant cache hit.
[2024-05-24 21:35:58] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 22/22 places, 20/20 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 p2 (NOT p0) (NOT p1)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 396 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=3333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-24 21:35:59] [INFO ] Invariant cache hit.
[2024-05-24 21:35:59] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-24 21:35:59] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 21:35:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-24 21:35:59] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 21:35:59] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-24 21:35:59] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 50004 steps, including 0 resets, run visited all 4 properties in 1120 ms. (steps per millisecond=44 )
Parikh walk visited 4 properties in 1120 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 512 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 471 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 397 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 349 ms.
Product exploration explored 100000 steps with 0 reset in 400 ms.
Applying partial POR strategy [false, false, false, false, false, false, true]
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 22 transition count 20
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 21 transition count 19
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 21 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 21 transition count 21
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 10 rules in 7 ms. Remains 21 /22 variables (removed 1) and now considering 21/20 (removed -1) transitions.
[2024-05-24 21:36:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2024-05-24 21:36:03] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 21:36:03] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/22 places, 21/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46 ms. Remains : 21/22 places, 21/20 transitions.
Built C files in :
/tmp/ltsmin2877259815422405798
[2024-05-24 21:36:03] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2877259815422405798
Running compilation step : cd /tmp/ltsmin2877259815422405798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 357 ms.
Running link step : cd /tmp/ltsmin2877259815422405798;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin2877259815422405798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8259516304718494693.hoa' '--buchi-type=spotba'
LTSmin run took 3642 ms.
FORMULA FMS-PT-50000-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-50000-LTLFireability-09 finished in 14562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-24 21:36:07] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 21:36:07] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 21:36:07] [INFO ] Invariant cache hit.
[2024-05-24 21:36:07] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-24 21:36:07] [INFO ] Invariant cache hit.
[2024-05-24 21:36:08] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-50000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s9 1) (GEQ s6 1)), p0:(GEQ s6 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 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-10 finished in 226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p1))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 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 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 7 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 13 place count 14 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 19 place count 11 transition count 10
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 21 place count 10 transition count 10
Applied a total of 21 rules in 6 ms. Remains 10 /22 variables (removed 12) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-24 21:36:08] [INFO ] Computed 4 invariants in 0 ms
[2024-05-24 21:36:08] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 21:36:08] [INFO ] Invariant cache hit.
[2024-05-24 21:36:08] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-24 21:36:08] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 21:36:08] [INFO ] Invariant cache hit.
[2024-05-24 21:36:08] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/22 places, 10/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 10/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : FMS-PT-50000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s9 1), p1:(LT s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FMS-PT-50000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-14 finished in 201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(!p1))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 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 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 12 transition count 15
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 19 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 9 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 20 place count 9 transition count 9
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 22 place count 8 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 4 with 2 rules applied. Total rules applied 24 place count 7 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 25 place count 7 transition count 6
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 27 place count 6 transition count 6
Applied a total of 27 rules in 15 ms. Remains 6 /22 variables (removed 16) and now considering 6/20 (removed 14) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-24 21:36:08] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 21:36:08] [INFO ] Implicit Places using invariants in 31 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/22 places, 6/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48 ms. Remains : 5/22 places, 6/20 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : FMS-PT-50000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LT s1 1), p0:(GEQ s3 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 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-15 finished in 123 ms.
All properties solved by simple procedures.
Total runtime 22344 ms.

BK_STOP 1716586569573

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FMS-PT-50000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is FMS-PT-50000, 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 r175-smll-171636280200238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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